{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":106,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":106,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"166d19718669","filters":{"venue":"Journal of Computational Geometry (Carleton University)"}},"results":[{"id":"W2256871140","doi":"10.20382/jocg.v7i2a4","title":"Approximability of the discrete Fréchet distance","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Eidgenössische Technische Hochschule Zürich; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Measure (data warehouse); Approximation algorithm; Binary logarithm; Discrete mathematics; Simple (philosophy); Mathematical analysis","authors":[{"name":"Karl Bringmann","is_ca":false},{"name":"Wolfgang Mulzer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01683478104820771,"gpt":0.2177033301373702,"spread":0.2008685490891625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002679452,0.001457614,0.001679919,0.0014488,0.0009807238,0.002969817,0.002758102,0.002084494,0.005011925],"category_scores_gemma":[0.02655626,0.0006592727,0.001831764,0.001283419,0.002740185,0.007246641,0.00319713,0.005221624,0.001447168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003658125,"about_ca_system_score_gemma":0.00168659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004097385,"about_ca_topic_score_gemma":0.002750288,"domain_scores_codex":[0.9964641,0.0006628743,0.000206574,0.001043186,0.001165444,0.000457726],"domain_scores_gemma":[0.9871615,0.009166335,0.0006109619,0.001845513,0.0008447247,0.0003709646],"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.001357979,0.0002103916,0.006439144,0.00064696,0.0001294893,0.0002733996,0.0007909251,0.4127326,0.01133057,0.457841,0.008343277,0.09990428],"study_design_scores_gemma":[0.00002897669,0.00009586846,0.0006443002,0.00004874473,0.00002371354,0.0001387604,0.00005908854,0.8127986,0.002458046,0.1809425,0.002733867,0.00002757217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1151777,0.00127045,0.8690884,0.001584139,0.0001636671,0.00007588155,0.0003780083,0.001262846,0.01099884],"genre_scores_gemma":[0.7302208,0.0008935719,0.2557303,0.0006598709,0.0002718455,0.0002636053,0.001033937,0.0004667165,0.0104594],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005011925,"threshold_uncertainty_score":0.02654171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570381751","doi":"10.20382/jocg.v7i1a15","title":"Consistent labeling of rotating maps","year":2014,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science","authors":[{"name":"Andreas Gemsa","is_ca":false},{"name":"Martin Nöllenburg","is_ca":false},{"name":"Ignaz Rutter","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01034578340480175,"gpt":0.2017083876078475,"spread":0.1913626042030457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001583592,0.001274848,0.001597072,0.000850907,0.001489777,0.002297635,0.002503863,0.001718917,0.00783741],"category_scores_gemma":[0.01087518,0.0008865923,0.001228357,0.002450782,0.001496154,0.004900567,0.002724689,0.001739312,0.001690899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001465085,"about_ca_system_score_gemma":0.001657422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002341607,"about_ca_topic_score_gemma":0.002580761,"domain_scores_codex":[0.9972169,0.000798254,0.000159617,0.000835964,0.0005423306,0.0004468135],"domain_scores_gemma":[0.9941576,0.002490939,0.0006314625,0.001723132,0.0006582096,0.0003386683],"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.001143896,0.0003359119,0.003503205,0.0006533978,0.000104988,0.0004720429,0.001100092,0.4706439,0.02097104,0.2083199,0.019836,0.2729156],"study_design_scores_gemma":[0.0001220674,0.0002393916,0.0006280988,0.0000453487,0.00006231137,0.0002568736,0.0005168504,0.7561496,0.01366011,0.2137334,0.0145377,0.00004810101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07696765,0.0002129712,0.913063,0.000651725,0.00006728979,0.0002032592,0.0008744409,0.001735176,0.006224479],"genre_scores_gemma":[0.38647,0.000258245,0.6028828,0.0002589326,0.00006712551,0.0004044827,0.002432175,0.0006495857,0.006576714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00783741,"threshold_uncertainty_score":0.02621877,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1922419250","doi":"10.20382/jocg.v6i1a5","title":"On characterizing terrain visibility graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Terrain; Visibility graph; Visibility; Vertex (graph theory); Combinatorics; Graph; Mathematics; Monotone polygon; Geometry; Geography; Regular polygon; Cartography","authors":[{"name":"William Evans","is_ca":true},{"name":"Noushin Saeedi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009044944806347294,"gpt":0.2073174917531666,"spread":0.1982725469468193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417744,0.001066392,0.0007205493,0.002484639,0.002120692,0.003079119,0.001534146,0.001752378,0.004336199],"category_scores_gemma":[0.008870034,0.0007848761,0.001325422,0.004401943,0.003657602,0.007576166,0.002593276,0.002191055,0.000850894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001618552,"about_ca_system_score_gemma":0.0008360652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004793813,"about_ca_topic_score_gemma":0.004312951,"domain_scores_codex":[0.9980823,0.0003965822,0.0001358913,0.000540599,0.0005322464,0.000312518],"domain_scores_gemma":[0.9936689,0.002665961,0.001139051,0.001182144,0.0009905148,0.0003534965],"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.00006998379,0.00008781919,0.005161647,0.0003131563,0.00004024123,0.0006131461,0.001440068,0.0399795,0.009579943,0.901157,0.003079799,0.03847774],"study_design_scores_gemma":[0.00002151172,0.00007441823,0.002066538,0.0001049447,0.00004561511,0.0008437891,0.0009258157,0.05558443,0.005098196,0.9100175,0.02517493,0.00004237369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1190754,0.0008615629,0.853443,0.000949065,0.00008712753,0.0002661009,0.0009538055,0.0003736191,0.02399036],"genre_scores_gemma":[0.650826,0.002088196,0.3327371,0.0006112617,0.0003726095,0.0004257007,0.003752826,0.0005046751,0.008681614],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004793813,"threshold_uncertainty_score":0.01450604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963964459","doi":"10.20382/jocg.v7i2a3","title":"Shortest path in a polygon using sublinear space","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Science Foundation","keywords":"Sublinear function; Mathematics; Polygon (computer graphics); Simple polygon; Shortest path problem; Combinatorics; Path (computing); Space (punctuation); Constant (computer programming); K shortest path routing; Time complexity; Discrete mathematics; Algorithm; Monotone polygon; Computer science; Graph; Geometry","authors":[{"name":"Sariel Har-Peled","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03357880101853126,"gpt":0.2418161223360534,"spread":0.2082373213175222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006449755,0.0007426091,0.0008646605,0.0006049451,0.000606981,0.001556687,0.001252685,0.000749032,0.006494782],"category_scores_gemma":[0.005282702,0.0003713557,0.000903687,0.001141646,0.001047359,0.003797629,0.002113983,0.001803314,0.001177312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001259058,"about_ca_system_score_gemma":0.001242813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00330192,"about_ca_topic_score_gemma":0.004380537,"domain_scores_codex":[0.9990118,0.0002120587,0.00004772938,0.0002633911,0.0003289244,0.0001360873],"domain_scores_gemma":[0.9979883,0.001264366,0.0001453222,0.0003489891,0.0001753516,0.00007757085],"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.0009093066,0.0001949311,0.001852594,0.0005500144,0.00009651032,0.0002767963,0.0004708784,0.4994462,0.01624011,0.1969846,0.01737732,0.2656008],"study_design_scores_gemma":[0.0000557293,0.00006008158,0.0001743825,0.00001197022,0.00001356714,0.00005079532,0.00005579588,0.9093714,0.00441177,0.08188692,0.003898185,0.000009379062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06458521,0.0003104142,0.9207439,0.0009611198,0.00009791466,0.00006562297,0.0003067387,0.002418816,0.01051018],"genre_scores_gemma":[0.4099177,0.000345539,0.5789321,0.000273802,0.00008223262,0.0002412485,0.0008669888,0.0006824291,0.008658073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006494782,"threshold_uncertainty_score":0.02172726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2261811080","doi":"10.20382/jocg.v7i1a13","title":"The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Discretization; Terrain; Mathematics; Mathematical optimization; Geography; Mathematical analysis; Cartography","authors":[{"name":"Stephan Friedrichs","is_ca":false},{"name":"Michael Hemmer","is_ca":false},{"name":"James King","is_ca":true},{"name":"Christiane Schmidt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01881783910499414,"gpt":0.2144861473966614,"spread":0.1956683082916673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009862286,0.0008958508,0.001131687,0.0005005882,0.0005597555,0.001340759,0.001578511,0.001733287,0.004072208],"category_scores_gemma":[0.005178499,0.0005790642,0.0009682687,0.00107042,0.001294138,0.002616158,0.001514923,0.002173584,0.0003427475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001456401,"about_ca_system_score_gemma":0.001518295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005266465,"about_ca_topic_score_gemma":0.005669347,"domain_scores_codex":[0.9991923,0.0001985515,0.00004730831,0.0002343508,0.0001873948,0.0001401345],"domain_scores_gemma":[0.997663,0.001695314,0.0001747426,0.0002371293,0.0001036014,0.0001262772],"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.0001681125,0.0000993327,0.001033856,0.000226812,0.00002289267,0.0001079569,0.0001132915,0.9295447,0.001662378,0.03045969,0.003683019,0.03287786],"study_design_scores_gemma":[0.00003853961,0.00003753417,0.0001377105,0.00001916809,0.000007771206,0.00005296125,0.00006128211,0.9708366,0.000611747,0.0270525,0.00113753,0.000006650077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07490221,0.0007956143,0.9120455,0.001615201,0.00009624707,0.0001958651,0.001005025,0.0007435054,0.008600788],"genre_scores_gemma":[0.4712174,0.000600629,0.5229633,0.0003190589,0.00007668214,0.0003365212,0.001402189,0.0001484697,0.002935731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005266465,"threshold_uncertainty_score":0.01362294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102170762","doi":"10.20382/jocg.v2i1a3","title":"Delaunay triangulation of imprecise points, preprocess and actually get a fast query time","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Delaunay triangulation; Computer science; Constrained Delaunay triangulation; Triangulation; Bowyer–Watson algorithm; Pitteway triangulation; Point set triangulation; Artificial intelligence; Algorithm; Mathematics; Geometry","authors":[{"name":"Olivier Devillers","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0047364920417147,"gpt":0.1985808638164776,"spread":0.1938443717747629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007962249,0.001132291,0.001809438,0.001463233,0.0009186495,0.001738741,0.001837635,0.001189679,0.007105445],"category_scores_gemma":[0.0058335,0.0009935478,0.0009557788,0.002215229,0.0008897125,0.003517248,0.002557142,0.001277426,0.004344038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005912613,"about_ca_system_score_gemma":0.000906783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003397817,"about_ca_topic_score_gemma":0.003627715,"domain_scores_codex":[0.9982446,0.0002241259,0.0001404958,0.0003882406,0.0008666462,0.0001357601],"domain_scores_gemma":[0.9969694,0.0008684515,0.0002411813,0.00120663,0.0006228194,0.00009169283],"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.0005951506,0.0001176464,0.001936476,0.0005241935,0.0001020743,0.0004812791,0.0006871937,0.07682931,0.08948958,0.01331478,0.01069689,0.8052254],"study_design_scores_gemma":[0.0002239383,0.0005896192,0.003119936,0.0001104179,0.000125217,0.002153482,0.0008613249,0.7482848,0.144767,0.04354333,0.05602371,0.0001972566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01510564,0.0002794359,0.9816828,0.000129064,0.00005904096,0.00008320125,0.0001008717,0.001737713,0.0008222365],"genre_scores_gemma":[0.07447015,0.000247753,0.9226873,0.00008295212,0.00005804936,0.0001251743,0.0004263098,0.0003933276,0.001508948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007105445,"threshold_uncertainty_score":0.02377009,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2252238546","doi":"10.20382/jocg.v6i1a14","title":"A new algorithm for computing visibility graphs of polygonal obstacles in the plane","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Science Foundation","keywords":"Visibility; Visibility graph; Computer science; Plane (geometry); Algorithm; Planar graph; Mathematics; Graph; Theoretical computer science; Geometry; Physics; Regular polygon; Optics","authors":[{"name":"Danny Z. Chen","is_ca":false},{"name":"Haitao Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02505012111509505,"gpt":0.2493882568495848,"spread":0.2243381357344898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003990952,0.001033473,0.0008843523,0.001724708,0.000764205,0.001180739,0.002008863,0.0009086095,0.004142713],"category_scores_gemma":[0.003196004,0.0007478794,0.001380068,0.001798034,0.000775042,0.003297927,0.002689522,0.001515387,0.0008701962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008077567,"about_ca_system_score_gemma":0.001434586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006491593,"about_ca_topic_score_gemma":0.009909702,"domain_scores_codex":[0.9993449,0.00007684575,0.00005647046,0.0001941003,0.0002279987,0.00009971722],"domain_scores_gemma":[0.9990262,0.0003527098,0.00009255371,0.0002418075,0.0002274787,0.00005927439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004717231,0.0001887975,0.002485027,0.0003873915,0.0001742729,0.0003168428,0.0003911423,0.2161733,0.02404537,0.05569896,0.01147467,0.6881925],"study_design_scores_gemma":[0.0001745148,0.0001532171,0.0008860026,0.00003931891,0.00007431423,0.0002904948,0.000128012,0.9164148,0.01242585,0.05545376,0.01389454,0.00006525554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01085184,0.00009814954,0.9854996,0.00009489357,0.00004062953,0.00008313137,0.0001674148,0.001798733,0.001365584],"genre_scores_gemma":[0.08319885,0.0001308448,0.9138885,0.00004761327,0.00002906463,0.0001351322,0.0008657965,0.0002611363,0.001443144],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006491593,"threshold_uncertainty_score":0.01385874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2235983888","doi":"10.20382/jocg.v7i2a6","title":"Smoothed complexity of convex hulls by witnesses and collectors","year":2016,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut Universitaire de France; Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Convex hull; Hull; Combinatorics; Mathematics; Simple (philosophy); Regular polygon; Euclidean geometry; Point (geometry); Convex body; Gaussian; Convex polytope; Convex set; Geometry; Convex optimization; Physics; Engineering","authors":[{"name":"Olivier Devillers","is_ca":false},{"name":"Marc Glisse","is_ca":false},{"name":"Xavier Goaoc","is_ca":false},{"name":"Rémy Thomasse","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02022524646681237,"gpt":0.226774547255903,"spread":0.2065493007890907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002859824,0.0007292416,0.001510363,0.002812078,0.001290094,0.004359883,0.002836476,0.001572438,0.005675085],"category_scores_gemma":[0.03306566,0.001199785,0.00171407,0.001873537,0.003585599,0.01008844,0.004526053,0.002602589,0.0004395041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002245759,"about_ca_system_score_gemma":0.001082339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001630552,"about_ca_topic_score_gemma":0.001194589,"domain_scores_codex":[0.9972811,0.0004747137,0.000170603,0.0006207782,0.00104114,0.0004116419],"domain_scores_gemma":[0.9664656,0.02218297,0.003235032,0.004957682,0.001544943,0.001613809],"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.0006027321,0.00008510028,0.01003615,0.000315336,0.0001277872,0.0004449658,0.001114288,0.2275325,0.0111876,0.7206874,0.002899275,0.02496684],"study_design_scores_gemma":[0.00003301511,0.00006023475,0.001807321,0.00003514346,0.00004232833,0.0002284169,0.0002178693,0.479209,0.004435271,0.5125991,0.001289522,0.00004279221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4707191,0.0004507634,0.5211889,0.0009152013,0.00006154712,0.0001044144,0.000972756,0.0007049771,0.004882325],"genre_scores_gemma":[0.9311773,0.0004501691,0.06282382,0.0001179293,0.0001327366,0.000217367,0.001137931,0.0002580057,0.003684832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005675085,"threshold_uncertainty_score":0.01898503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2773875520","doi":"10.20382/jocg.v9i1a8","title":"Array-based compact data structures for triangulations: Practical solutions with theoretical guarantees","year":2017,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Distributed computing; Mathematical optimization; Theoretical computer science; Algorithm; Computational science; Topology (electrical circuits); Mathematics; Combinatorics","authors":[{"name":"Luca Castelli Aleardi","is_ca":false},{"name":"Olivier Devillers","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07517421534455519,"gpt":0.3201279061553591,"spread":0.2449536908108039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001255451,0.0008776928,0.0009970218,0.001255861,0.0009985551,0.00285043,0.002521096,0.001882,0.007481824],"category_scores_gemma":[0.01526042,0.0007187189,0.0009379914,0.003546092,0.001482204,0.007323246,0.003912731,0.002170508,0.002762201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001280067,"about_ca_system_score_gemma":0.001409878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001148243,"about_ca_topic_score_gemma":0.00174298,"domain_scores_codex":[0.9981273,0.0003632825,0.0001932983,0.0002437882,0.0008585405,0.0002137672],"domain_scores_gemma":[0.991355,0.003570287,0.000767811,0.003263053,0.0008832285,0.000160566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006845148,0.0002097212,0.001638008,0.000941753,0.00005214496,0.0002177557,0.0009871495,0.2045926,0.02034439,0.3444336,0.01726188,0.4086365],"study_design_scores_gemma":[0.0001851156,0.00025889,0.0002555689,0.0001541951,0.00004199503,0.0003350527,0.0005842388,0.6347905,0.02527371,0.3151156,0.0229481,0.00005699663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02790173,0.0004840436,0.9631396,0.0008425809,0.00006458804,0.00008725088,0.0004254911,0.002126612,0.004928105],"genre_scores_gemma":[0.2119935,0.0006970393,0.7797754,0.000222118,0.0001019253,0.0004982066,0.001501544,0.0007417164,0.004468498],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007481824,"threshold_uncertainty_score":0.02502918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963492452","doi":"10.20382/jocg.v11i2a2","title":"Exact computation of the matching distance on 2-parameter persistence modules","year":2020,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Austrian Science Fund","keywords":"Persistence (discontinuity); Computation; Computer science; Matching (statistics); Algorithm; Mathematics; Statistics; Engineering","authors":[{"name":"Michael Kerber","is_ca":false},{"name":"Michael Lesnick","is_ca":false},{"name":"Steve Oudot","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02491083856105914,"gpt":0.2164718685251791,"spread":0.19156102996412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007769957,0.0004421218,0.0006677627,0.001592995,0.0004273822,0.001558759,0.0009310113,0.0006383647,0.004309189],"category_scores_gemma":[0.005040572,0.0002555224,0.0003325386,0.001072647,0.0009494455,0.005047231,0.002227995,0.0008622404,0.0006969084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008636647,"about_ca_system_score_gemma":0.000445242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004095917,"about_ca_topic_score_gemma":0.0005286743,"domain_scores_codex":[0.999459,0.00009861769,0.00003608673,0.0001427127,0.000176317,0.00008723522],"domain_scores_gemma":[0.9985908,0.0005876166,0.0002055457,0.0003083797,0.0001750929,0.0001325338],"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.0003043787,0.0001097453,0.005485358,0.0003018579,0.00005727013,0.0002930522,0.0004055528,0.1153966,0.01675232,0.7470638,0.002483922,0.1113461],"study_design_scores_gemma":[0.00002428742,0.00009769535,0.001531927,0.00002091619,0.00001170107,0.0001631718,0.0001042275,0.4761201,0.006809817,0.5122952,0.002786221,0.00003463745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4018455,0.0002927191,0.5909354,0.0001376162,0.00002680599,0.00004676609,0.0003332427,0.0006296978,0.00575224],"genre_scores_gemma":[0.9209528,0.0001081529,0.07615606,0.0000314443,0.00002661282,0.00005589382,0.0003526425,0.000141033,0.0021754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004309189,"threshold_uncertainty_score":0.01441562,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3105922857","doi":"10.20382/jocg.v5i1a10","title":"Steinitz theorems for simple orthogonal polyhedra","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Office of Naval Research; National Science Foundation","keywords":"Polyhedron; Combinatorics; Polyhedral graph; Vertex (graph theory); Mathematics; Bipartite graph; Dual polyhedron; Regular polygon; Graph; 1-planar graph; Line graph; Geometry","authors":[{"name":"David Eppstein","is_ca":false},{"name":"Elena Mumford","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01006204869238695,"gpt":0.2102579755694352,"spread":0.2001959268770483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448526,0.0006198437,0.0004854625,0.001790383,0.0009719788,0.001681729,0.0008761357,0.000610409,0.00878494],"category_scores_gemma":[0.00356094,0.0003542788,0.0008005034,0.001167737,0.001769939,0.002582741,0.001870342,0.001409821,0.001496006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009038803,"about_ca_system_score_gemma":0.0005679347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001495771,"about_ca_topic_score_gemma":0.001527308,"domain_scores_codex":[0.9994044,0.00008279839,0.00003409199,0.0001161086,0.0002528533,0.0001098257],"domain_scores_gemma":[0.9987186,0.0004843709,0.0001621824,0.0001964083,0.0003117279,0.000126823],"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.00001292242,0.000009638986,0.0001666569,0.00002724822,0.000003379387,0.00003670906,0.00007059303,0.004840802,0.0006992508,0.9822096,0.001107693,0.01081545],"study_design_scores_gemma":[0.00001320335,0.00001766594,0.0001782697,0.00001111899,0.000004086997,0.00006913448,0.00008721834,0.03131565,0.00111909,0.9609293,0.00624445,0.00001080933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09977473,0.0003373964,0.832544,0.0003768721,0.0001331889,0.0001286958,0.0004687792,0.0004134551,0.06582282],"genre_scores_gemma":[0.7434509,0.0008642524,0.2256405,0.0004221695,0.0001835657,0.0003094499,0.001133876,0.0002743125,0.02772106],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00878494,"threshold_uncertainty_score":0.02938861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963119423","doi":"10.20382/jocg.v8i2a4","title":"Minimum cycle and homology bases of surface-embedded graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Army Research Office; National Science Foundation","keywords":"Cycle basis; Mathematics; Combinatorics; Homology (biology); Basis (linear algebra); Minimum weight; Graph; Discrete mathematics; Line graph; Graph power; Geometry","authors":[{"name":"Glencora Borradaile","is_ca":false},{"name":"Erin Wolf Chambers","is_ca":false},{"name":"Kyle Fox","is_ca":false},{"name":"Amir Nayyeri","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01296518955699168,"gpt":0.2329869204101069,"spread":0.2200217308531152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003720086,0.0006197119,0.0008053485,0.001258495,0.000690473,0.001243619,0.001649539,0.000994314,0.00398461],"category_scores_gemma":[0.003126328,0.0004948272,0.0005652854,0.001202238,0.0008831624,0.00285136,0.001613945,0.001142288,0.0007371162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009874259,"about_ca_system_score_gemma":0.0007644155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002231923,"about_ca_topic_score_gemma":0.002493015,"domain_scores_codex":[0.9995989,0.00007782908,0.00001707547,0.0001114981,0.0001097267,0.00008498513],"domain_scores_gemma":[0.9987351,0.0006415779,0.0001461975,0.0001794643,0.0001582728,0.000139364],"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.0004657372,0.0002890209,0.004213291,0.0004365745,0.00007385757,0.0002777006,0.000885281,0.3693293,0.02647547,0.3295226,0.007398753,0.2606325],"study_design_scores_gemma":[0.00005546597,0.00007393822,0.0005679791,0.00003042924,0.00001348602,0.000083039,0.0002057382,0.6315353,0.006915691,0.3574468,0.003048824,0.00002321899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5055053,0.0004917519,0.4832053,0.0006213189,0.00003671829,0.0001644279,0.0006300844,0.00102548,0.008319546],"genre_scores_gemma":[0.6918324,0.0003738469,0.2995459,0.00009288292,0.00004345454,0.0002223966,0.002019109,0.0002891942,0.005580832],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00398461,"threshold_uncertainty_score":0.0133298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2227225096","doi":"10.20382/jocg.v13i1a2","title":"A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons","year":2015,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Beacon; Routing (electronic design automation); Robot; Computer science; Combinatorics; Obstacle; Electric beacon; Set (abstract data type); Mathematics; Computer network; Geography; Real-time computing; Artificial intelligence","authors":[{"name":"Thomas C. Shermer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02525107484599017,"gpt":0.255541776581067,"spread":0.2302907017350768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001093612,0.001527142,0.001130056,0.002048366,0.001723405,0.005122716,0.002331138,0.001324262,0.01724949],"category_scores_gemma":[0.00930919,0.000836431,0.001650999,0.002921991,0.002764025,0.006696212,0.004019543,0.004095527,0.003087722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002162054,"about_ca_system_score_gemma":0.0007934202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002367703,"about_ca_topic_score_gemma":0.002321461,"domain_scores_codex":[0.9984038,0.0003576533,0.00009309287,0.0003315066,0.0005216368,0.0002922736],"domain_scores_gemma":[0.9946209,0.003630723,0.000473699,0.0004233641,0.0004271502,0.0004241091],"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.0001068196,0.00006544264,0.000689588,0.0002857627,0.00002453947,0.0001706516,0.0002301192,0.04940468,0.00132024,0.8963395,0.01260184,0.03876092],"study_design_scores_gemma":[0.00003505376,0.00007440893,0.0003833522,0.00009390423,0.00003508426,0.0002858756,0.0001515532,0.1705292,0.0008985455,0.8024545,0.02501738,0.00004109675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04602044,0.001723778,0.813475,0.002648212,0.0005224056,0.0001971193,0.0009475019,0.0009458632,0.1335197],"genre_scores_gemma":[0.5458912,0.004380852,0.382245,0.001879005,0.001450537,0.001082622,0.002920081,0.001086715,0.05906399],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01724949,"threshold_uncertainty_score":0.05770528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2296706642","doi":"10.20382/jocg.v5i1a4","title":"Hyperbolic Delaunay complexes and Voronoi diagrams made practical","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Voronoi diagram; Delaunay triangulation; Bowyer–Watson algorithm; Computer science; Geology; Geometry; Mathematics; Algorithm","authors":[{"name":"М. Б. Богданов","is_ca":false},{"name":"Olivier Devillers","is_ca":false},{"name":"Monique Teillaud","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02859963742090648,"gpt":0.2673007184467753,"spread":0.2387010810258688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007337637,0.0004731391,0.0005591228,0.001432033,0.001492648,0.004044371,0.001049099,0.0008804896,0.005386535],"category_scores_gemma":[0.006455169,0.000506248,0.0004824221,0.001243225,0.003473578,0.004976075,0.002737941,0.001315515,0.0006845594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001674063,"about_ca_system_score_gemma":0.0007558438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003643195,"about_ca_topic_score_gemma":0.002880833,"domain_scores_codex":[0.9988946,0.000258108,0.00004459577,0.0002140648,0.0004434404,0.0001450911],"domain_scores_gemma":[0.9982064,0.0007284526,0.0001946792,0.0003022866,0.0002948991,0.0002733569],"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.00000697517,0.000002720841,0.0001999816,0.00001471087,0.00000285009,0.00003282279,0.0001186008,0.005529414,0.0002342889,0.9900232,0.0003417549,0.003492688],"study_design_scores_gemma":[0.000008052036,0.000009342566,0.0001768066,0.0000217606,0.000005393348,0.00007621338,0.0001867174,0.04714872,0.000907562,0.9376062,0.01384199,0.00001128167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1917199,0.002083019,0.7082026,0.001457553,0.0003106963,0.00009911405,0.0003349147,0.0002420691,0.09555016],"genre_scores_gemma":[0.8491768,0.001256797,0.1263946,0.0001313125,0.0001847368,0.00008034208,0.0003434852,0.0001540522,0.02227785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005386535,"threshold_uncertainty_score":0.01801974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2527987597","doi":"10.20382/jocg.v8i1a10","title":"How many three-dimensional Hilbert curves are there?","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Algebraic and Geometric Analysis","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Hilbert curve; Hilbert R-tree; Octant (instrument); Mathematics; Hilbert space; Locality; Point (geometry); Software; Pure mathematics; Geometry; Computer science; Rigged Hilbert space; Unitary operator; Physics","authors":[{"name":"HJ Herman Haverkort","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02297092673404886,"gpt":0.2294830516176812,"spread":0.2065121248836324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001306686,0.0004999674,0.0006513685,0.001572806,0.003104004,0.004508986,0.0007641034,0.00162618,0.01088144],"category_scores_gemma":[0.006109008,0.0004012377,0.0008897438,0.002303849,0.004465732,0.00944229,0.002427944,0.001792427,0.001939026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001358598,"about_ca_system_score_gemma":0.0008060318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001315317,"about_ca_topic_score_gemma":0.0008803621,"domain_scores_codex":[0.9989327,0.0002854623,0.00007009398,0.0001724446,0.0002661154,0.00027314],"domain_scores_gemma":[0.997381,0.000880956,0.0003279956,0.0005122608,0.0004535002,0.0004442332],"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.00007592851,0.00002118064,0.001396821,0.00008891973,0.00001425618,0.0002014273,0.000884908,0.001421279,0.001261981,0.9427369,0.003257413,0.04863907],"study_design_scores_gemma":[0.00001853754,0.00003586441,0.0007953185,0.0001048763,0.00001636824,0.0006002709,0.002036652,0.005221677,0.002342407,0.9304866,0.05826721,0.00007427014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4527008,0.005385237,0.3555125,0.01104038,0.0005966137,0.0001370796,0.001027617,0.001371327,0.1722285],"genre_scores_gemma":[0.8819488,0.001956813,0.0988474,0.0005015669,0.0001561385,0.0001209094,0.0005105206,0.0003379056,0.01561982],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01088144,"threshold_uncertainty_score":0.03640199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037925904","doi":"10.20382/jocg.v8i1a14","title":"Central Trajectories","year":2015,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Danmarks Grundforskningsfond; National Research Foundation","keywords":"Trajectory; Centrality; Combinatorics; RADIUS; Cluster (spacecraft); Cluster analysis; Set (abstract data type); Physics; Mathematics; Computer science","authors":[{"name":"Marc van Kreveld","is_ca":false},{"name":"Maarten Löffler","is_ca":false},{"name":"Frank Staals","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02189977168603004,"gpt":0.228053883473357,"spread":0.2061541117873269,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008264376,0.001296728,0.001199104,0.001426921,0.002269135,0.003357263,0.002436081,0.001807979,0.04518461],"category_scores_gemma":[0.005439025,0.0006803594,0.001440076,0.001809447,0.00117221,0.004506664,0.004078055,0.001793882,0.01134143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002287123,"about_ca_system_score_gemma":0.0024907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004646515,"about_ca_topic_score_gemma":0.006685174,"domain_scores_codex":[0.9983234,0.0001849399,0.0001011816,0.0007783403,0.0003483445,0.0002638376],"domain_scores_gemma":[0.9972452,0.0004985393,0.0002736179,0.00108554,0.0006486112,0.0002484936],"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.001464727,0.0002511501,0.006624001,0.0008789488,0.0001629338,0.0008084713,0.0009871192,0.1793304,0.02237947,0.4365925,0.07555591,0.2749643],"study_design_scores_gemma":[0.0001301835,0.0002181369,0.002130851,0.0001778289,0.00008320007,0.0009213322,0.0008058692,0.5452171,0.02106153,0.3160244,0.1131242,0.0001052855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06365273,0.0008794587,0.8784262,0.00107769,0.0003488558,0.0004837988,0.005998326,0.006632131,0.04250079],"genre_scores_gemma":[0.3853193,0.0008164261,0.5439852,0.0004735169,0.0001485716,0.0006238278,0.0163976,0.002886674,0.04934888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04518461,"threshold_uncertainty_score":0.1511576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2347186258","doi":"10.20382/jocg.v10i1a3","title":"Minimax Rates for Estimating the Dimension of a Manifold","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Samsung; National Science Foundation","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Minimax; Dimension (graph theory); Bounding overwatch; Embedding; Lemma (botany); Manifold (fluid mechanics); Probability distribution; Distribution (mathematics); Omega; Order (exchange); Discrete mathematics; Mathematical analysis; Statistics; Mathematical optimization; Computer science","authors":[{"name":"Larry Wasserman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01556548880336076,"gpt":0.2464128874285505,"spread":0.2308473986251897,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02441683,0.002442649,0.004396271,0.003811267,0.001597631,0.004653177,0.003979999,0.004283444,0.003753698],"category_scores_gemma":[0.1361078,0.001408206,0.001752605,0.002565101,0.007862831,0.0124205,0.006897345,0.007941014,0.0009970384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002535661,"about_ca_system_score_gemma":0.001546719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008984152,"about_ca_topic_score_gemma":0.0005019578,"domain_scores_codex":[0.9890789,0.005967241,0.0006269505,0.001953864,0.001932401,0.0004406808],"domain_scores_gemma":[0.8874022,0.09700567,0.003841387,0.006606353,0.003923782,0.001220609],"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.0005738529,0.0001162,0.003720467,0.0006531575,0.0002640673,0.0002440004,0.0004578738,0.2991029,0.002636664,0.6491333,0.004418876,0.03867857],"study_design_scores_gemma":[0.00003606638,0.0001137807,0.0007218678,0.0001347018,0.00002563946,0.0001118604,0.00005887531,0.5133327,0.00135849,0.4826646,0.001379088,0.00006243204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02966077,0.002835434,0.9601597,0.002430511,0.0001501303,0.0001146888,0.0003577947,0.0002859547,0.00400504],"genre_scores_gemma":[0.5771063,0.005499622,0.4046188,0.001315823,0.001318435,0.00151704,0.001666637,0.000805993,0.006151366],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02441683,"threshold_uncertainty_score":0.1291301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964200445","doi":"10.20382/jocg.v8i2a2","title":"Degree four plane spanners: Simpler and better","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Spanner; Combinatorics; Degree (music); Mathematics; Upper and lower bounds; Equilateral triangle; Bounded function; Euclidean geometry; Delaunay triangulation; Plane (geometry); General position; Geometry; Physics; Mathematical analysis","authors":[{"name":"Iyad Kanj","is_ca":false},{"name":"Ljubomir Perković","is_ca":false},{"name":"Duru Türkoğlu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03600596015336006,"gpt":0.2348440229917289,"spread":0.1988380628383689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005129984,0.0009911116,0.0009846039,0.0006904152,0.0006500822,0.001639256,0.001357571,0.001080496,0.01147093],"category_scores_gemma":[0.002603079,0.0005362933,0.001038128,0.001024968,0.001233041,0.005407849,0.003517477,0.002131517,0.002755618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006661917,"about_ca_system_score_gemma":0.000500957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008619645,"about_ca_topic_score_gemma":0.001882126,"domain_scores_codex":[0.9988922,0.0001446604,0.00007576853,0.0003466163,0.000355109,0.0001856321],"domain_scores_gemma":[0.9981614,0.000323374,0.0001882908,0.000914193,0.000179122,0.0002337491],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009385064,0.0006307573,0.005449109,0.001202916,0.0001579244,0.0009922828,0.001523605,0.1526302,0.1221639,0.3290014,0.009580761,0.3757285],"study_design_scores_gemma":[0.0003804503,0.002396698,0.004592292,0.0004170805,0.0002243826,0.002376747,0.0015504,0.3584116,0.1092611,0.3956894,0.1244528,0.0002470069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3393907,0.0009932768,0.6195974,0.0007278697,0.0002282108,0.0002622503,0.0004695882,0.00210719,0.03622345],"genre_scores_gemma":[0.6169581,0.0008436963,0.3569898,0.0004422463,0.0001398688,0.0002476018,0.001882316,0.0009271061,0.02156913],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01147093,"threshold_uncertainty_score":0.03837413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105256528","doi":"10.20382/jocg.v6i1a8","title":"Quasi-parallel segments and characterization of unique bichromatic matchings","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Matching (statistics); Combinatorics; Characterization (materials science); Plane (geometry); Point (geometry); Set (abstract data type); Property (philosophy); Mathematics; Line segment; Line (geometry); General position; Position (finance); Algorithm; Computer science; Geometry; Physics; Optics","authors":[{"name":"Andrei Asinowski","is_ca":false},{"name":"Tillmann Miltzow","is_ca":false},{"name":"Günter Rote","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00647455589633572,"gpt":0.1898562267895858,"spread":0.1833816708932501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000464961,0.0003144886,0.0005474855,0.001580962,0.0006627322,0.001263618,0.0008199262,0.0006735374,0.004982608],"category_scores_gemma":[0.003822546,0.0004267628,0.0003321644,0.001723407,0.00078573,0.001789672,0.00138475,0.0005616211,0.0005879634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005277432,"about_ca_system_score_gemma":0.0002950426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006571972,"about_ca_topic_score_gemma":0.0005793897,"domain_scores_codex":[0.9991805,0.00009703635,0.00007594399,0.0002490533,0.0002743139,0.0001230939],"domain_scores_gemma":[0.9980677,0.0004948927,0.0006161163,0.0003970752,0.0002698861,0.0001544965],"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.001658249,0.0002985781,0.02692812,0.0004989082,0.0001198243,0.001059219,0.001361397,0.06205267,0.1590863,0.5065596,0.004231507,0.2361456],"study_design_scores_gemma":[0.0001530213,0.0007409318,0.02235381,0.0001430836,0.00009775823,0.003499028,0.001364921,0.4038867,0.13197,0.4147046,0.02096241,0.0001236368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7440307,0.0002125919,0.240655,0.0001228809,0.00001986417,0.0001002836,0.0006240511,0.0004309572,0.01380358],"genre_scores_gemma":[0.906283,0.0000992748,0.09027557,0.00003829933,0.0000137028,0.0000548361,0.0008994998,0.00006413619,0.002271625],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004982608,"threshold_uncertainty_score":0.0166685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2888306059","doi":"10.20382/jocg.v9i1a9","title":"Drawing planar graphs with prescribed face areas","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Planar graph; Bipartite graph; Combinatorics; Mathematics; Eulerian path; Universality (dynamical systems); Plane (geometry); Graph; Geometry; Discrete mathematics; Pure mathematics; Physics; Lagrangian","authors":[{"name":"Linda Kleist","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0140403078016984,"gpt":0.2182549412851509,"spread":0.2042146334834525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000244604,0.0005625391,0.0004070986,0.0004948961,0.0004373509,0.0006685682,0.0007111104,0.0006081188,0.003731892],"category_scores_gemma":[0.002492145,0.0004399905,0.0004579546,0.0008103475,0.0007608914,0.001631666,0.001039115,0.0007531095,0.0005815363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005468897,"about_ca_system_score_gemma":0.0002090678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0012672,"about_ca_topic_score_gemma":0.001771238,"domain_scores_codex":[0.9995968,0.00008692243,0.00002179358,0.0001151599,0.0001140418,0.00006536805],"domain_scores_gemma":[0.9989899,0.0004328745,0.0001852014,0.0002294789,0.00008717067,0.00007544344],"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.0002004257,0.0001165876,0.002497409,0.0003459032,0.00006153143,0.0006411081,0.0006055943,0.3468729,0.0429917,0.3820731,0.003929406,0.2196643],"study_design_scores_gemma":[0.0000774438,0.0002048231,0.001869881,0.00007637057,0.0000485414,0.000878763,0.0004596393,0.5320692,0.02982965,0.4060627,0.02837153,0.00005148906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2447806,0.0003580581,0.7307337,0.0002484282,0.00004638915,0.00006637092,0.0001981691,0.0007640503,0.02280429],"genre_scores_gemma":[0.7314567,0.000639628,0.2604406,0.0001084483,0.0000424443,0.00011051,0.0003755071,0.0002417139,0.006584349],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003731892,"threshold_uncertainty_score":0.01248449,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964027251","doi":"10.20382/jocg.v7i1a12","title":"An algorithm for the Euclidean cell decomposition of a non-compact strictly convex projective surface","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Australian Research Council","keywords":"Mathematics; Euclidean geometry; Regular polygon; Convex body; Projective test; Decomposition; Surface (topology); Algorithm; Combinatorics; Computer science; Pure mathematics; Convex optimization; Geometry; Chemistry","authors":[{"name":"Stephan Tillmann","is_ca":false},{"name":"Sampson Wong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01872738557021052,"gpt":0.2694661494803144,"spread":0.2507387639101039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003498377,0.0004351794,0.0005697808,0.0008044354,0.0003225278,0.001013697,0.001342765,0.0005618433,0.006330331],"category_scores_gemma":[0.001527211,0.0003588049,0.0005761093,0.0007213847,0.000454094,0.00112761,0.001798111,0.001211081,0.002268706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004772732,"about_ca_system_score_gemma":0.0005753072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001995682,"about_ca_topic_score_gemma":0.003351282,"domain_scores_codex":[0.9997709,0.00002572688,0.00001949597,0.00004711795,0.00009731497,0.00003935309],"domain_scores_gemma":[0.9996767,0.00008683451,0.00001675708,0.00008938697,0.0001015163,0.00002871892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002577243,0.0001003412,0.001953399,0.0002117923,0.00005039314,0.0003315608,0.0005736505,0.1124075,0.04455973,0.1450776,0.01049022,0.6839862],"study_design_scores_gemma":[0.00007342872,0.0001020247,0.0005388621,0.00002492304,0.00001789629,0.0002057548,0.000188507,0.8911984,0.02094079,0.06362153,0.02305478,0.00003310766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01560076,0.00004625394,0.9813742,0.00005278226,0.00002866795,0.00004419806,0.000088023,0.0008601335,0.001904982],"genre_scores_gemma":[0.1541533,0.00008733769,0.8394845,0.00004748649,0.00001272279,0.0001096687,0.0007413395,0.0004861019,0.004877483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006330331,"threshold_uncertainty_score":0.02117711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3046659318","doi":"10.20382/jocg.v10i1a17","title":"Interesting paths in the mapper complex","year":2018,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Path (computing); Graph; Enhanced Data Rates for GSM Evolution; Data point; Binary number; Function (biology); Variable (mathematics); Algorithm; Computer science; Mathematical analysis; Artificial intelligence","authors":[{"name":"Ananth Kalyanaraman","is_ca":false},{"name":"Methun Kamruzzaman","is_ca":false},{"name":"Bala Krishnamoorthy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02876442213096773,"gpt":0.2424581865558708,"spread":0.2136937644249031,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00125488,0.0006624855,0.0008004405,0.003256621,0.0009472598,0.00242932,0.0008248888,0.001054378,0.003932001],"category_scores_gemma":[0.01018744,0.0006115778,0.0008205496,0.001680704,0.001302432,0.003642294,0.002246684,0.001052762,0.0005736601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001061511,"about_ca_system_score_gemma":0.0006725095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002163798,"about_ca_topic_score_gemma":0.002614233,"domain_scores_codex":[0.9989113,0.0002242998,0.00005979658,0.0003451795,0.0003578917,0.0001016929],"domain_scores_gemma":[0.9959306,0.002185835,0.0005594666,0.0004786465,0.0005385708,0.0003069593],"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.0003672499,0.0001559822,0.03083684,0.0005189783,0.0001582928,0.001558986,0.002098202,0.4056763,0.02267741,0.3797851,0.007903479,0.1482632],"study_design_scores_gemma":[0.00002564819,0.00007172387,0.005179251,0.00004852293,0.00003065871,0.0004799761,0.0003688305,0.670081,0.004572223,0.3077565,0.01134355,0.00004205281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3266838,0.0004144442,0.6643578,0.0007746545,0.00003998724,0.0001391317,0.001739386,0.001336573,0.004514131],"genre_scores_gemma":[0.6305183,0.0003643911,0.3611301,0.0001962316,0.00003719621,0.0002768721,0.002419788,0.0004953916,0.004561666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003932001,"threshold_uncertainty_score":0.01315385,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2604480575","doi":"10.20382/jocg.v8i2a3","title":"Hyperplane separability and convexity of probabilistic point sets","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Mathematics; Convex hull; Combinatorics; Hyperplane; Probabilistic logic; Convexity; Separable space; Reduction (mathematics); Orthogonal convex hull; Regular polygon; Subspace topology; Point (geometry); Convex combination; Hull; Discrete mathematics; Convex body; Convex optimization; Mathematical analysis; Statistics; Geometry","authors":[{"name":"Martin Fink","is_ca":false},{"name":"John Hershberger","is_ca":false},{"name":"Nirman Kumar","is_ca":false},{"name":"Subhash Suri","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02299352665663522,"gpt":0.2301167273940917,"spread":0.2071232007374564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002426211,0.001333341,0.00253679,0.002290104,0.001739032,0.004379223,0.00347787,0.001408207,0.008779068],"category_scores_gemma":[0.02088688,0.001169854,0.002678516,0.003651775,0.0024328,0.007137982,0.006531646,0.004668002,0.002163332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002894579,"about_ca_system_score_gemma":0.002161536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00477537,"about_ca_topic_score_gemma":0.004103174,"domain_scores_codex":[0.9948853,0.0008654983,0.0003462772,0.001192877,0.002067803,0.0006422101],"domain_scores_gemma":[0.9858131,0.008543126,0.001464547,0.002498213,0.001148273,0.0005328258],"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.001099629,0.0003118555,0.01159982,0.00045186,0.0002697782,0.0004258198,0.0008940565,0.5550818,0.005734676,0.1691586,0.01243545,0.2425367],"study_design_scores_gemma":[0.00004500666,0.00005293041,0.001221957,0.00002817294,0.00002475927,0.0001902113,0.0001406746,0.846934,0.004047681,0.1448089,0.002472045,0.00003363743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05313753,0.0003106798,0.9381886,0.0006974981,0.00003698586,0.000223916,0.001210965,0.001405998,0.004787794],"genre_scores_gemma":[0.6240008,0.0003889118,0.3640352,0.0002334821,0.0001607568,0.0005274225,0.004980911,0.0004563056,0.005216195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008779068,"threshold_uncertainty_score":0.02936894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2970343152","doi":"10.20382/jocg.v10i2a3","title":"Orthogonal Terrain Guarding is NP-complete","year":2019,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Terrain; Combinatorics; Vertex (graph theory); Mathematics; Order (exchange); Monotone polygon; Algorithm; Geometry; Graph; Geography; Cartography","authors":[{"name":"Édouard Bonnet","is_ca":false},{"name":"Panos Giannopoulos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01055088905779633,"gpt":0.2078477104875396,"spread":0.1972968214297432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006778163,0.001620097,0.002290454,0.0005845816,0.001939792,0.004193051,0.002344861,0.001840754,0.01334362],"category_scores_gemma":[0.003713464,0.0009998274,0.002087519,0.002221087,0.001905565,0.006072167,0.002479665,0.004324261,0.002228677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002623314,"about_ca_system_score_gemma":0.002626044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00825574,"about_ca_topic_score_gemma":0.009075311,"domain_scores_codex":[0.9981506,0.0001876744,0.0000917542,0.0007178573,0.000381025,0.0004710612],"domain_scores_gemma":[0.9951156,0.003508815,0.0003536904,0.0004542904,0.0003098435,0.0002576288],"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.002457108,0.001283305,0.007078646,0.00525402,0.000670401,0.002038452,0.001116666,0.3358242,0.01906969,0.1635996,0.2239489,0.237659],"study_design_scores_gemma":[0.0007170196,0.0002528671,0.002875067,0.000212313,0.0002578382,0.002038909,0.001009781,0.4161102,0.008551676,0.5054498,0.0624297,0.00009488939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3881881,0.009362159,0.3763517,0.03290911,0.001239225,0.00115221,0.04525188,0.008960765,0.1365849],"genre_scores_gemma":[0.7873183,0.005774525,0.1353195,0.004335866,0.0009873755,0.0007762545,0.02971862,0.001216326,0.03455313],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01334362,"threshold_uncertainty_score":0.04463887,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2788091414","doi":"10.20382/jocg.v9i1a2","title":"Scalable exact visualization of isocontours in road networks via minimum-link paths","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Heuristics; Scalability; Simple (philosophy); Time complexity; Computer science; Key (lock); Link (geometry); Mathematical optimization; Limit (mathematics); Linear programming; Mathematics; Algorithm; Computer network","authors":[{"name":"Moritz Baum","is_ca":false},{"name":"Thomas Bläsius","is_ca":false},{"name":"Andreas Gemsa","is_ca":false},{"name":"Ignaz Rutter","is_ca":false},{"name":"Franziska Wegner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01160676713131791,"gpt":0.244979447530885,"spread":0.2333726803995671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004357803,0.001204293,0.00101797,0.001162724,0.0006064603,0.001859722,0.001200893,0.0008982944,0.003345472],"category_scores_gemma":[0.004059344,0.0005689836,0.0006220939,0.001266014,0.000578227,0.002178778,0.001856814,0.001110894,0.0006227749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001014869,"about_ca_system_score_gemma":0.001027729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006582446,"about_ca_topic_score_gemma":0.01094783,"domain_scores_codex":[0.9996049,0.0001051077,0.00001681523,0.00007127506,0.0001537195,0.00004825758],"domain_scores_gemma":[0.9989261,0.0005680881,0.00008953904,0.0001718169,0.0001746701,0.00006977279],"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.0002354975,0.00007496285,0.001943216,0.0002299481,0.0000517265,0.0002259943,0.0004643104,0.8827259,0.006779608,0.01492907,0.005297244,0.0870425],"study_design_scores_gemma":[0.00001528898,0.000009824857,0.0001492638,0.000008073071,0.00000304806,0.00002887242,0.00005756821,0.9879848,0.001263223,0.009396368,0.001076494,0.000007200299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1237136,0.0005148127,0.8648234,0.0006233646,0.00006122592,0.00011171,0.001004897,0.004415135,0.004731816],"genre_scores_gemma":[0.5592139,0.0004360504,0.4366754,0.00006277332,0.00002640217,0.0001287337,0.001161483,0.0006380964,0.001657028],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006582446,"threshold_uncertainty_score":0.01308823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2788434477","doi":"10.20382/jocg.v9i1a3","title":"Flat foldings of plane graphs with prescribed angles and edge lengths","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Division of Emerging Frontiers in Research and Innovation; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Conjecture; Vertex (graph theory); Plane (geometry); Geometry; Enhanced Data Rates for GSM Evolution; Infinitesimal; Graph; Mathematical analysis; Computer science; Telecommunications","authors":[{"name":"Zachary Abel","is_ca":false},{"name":"Erik D. Demaine","is_ca":false},{"name":"Martin L. Demaine","is_ca":false},{"name":"David Eppstein","is_ca":false},{"name":"Anna Lubiw","is_ca":true},{"name":"Ryuhei Uehara","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00990543431285126,"gpt":0.1785841264830084,"spread":0.1686786921701572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005117179,0.0004271047,0.000439722,0.0004927323,0.0007304247,0.001164009,0.0006081348,0.0007137365,0.002485639],"category_scores_gemma":[0.004803482,0.0004268727,0.0006208988,0.0005148432,0.001075349,0.002831366,0.0007247301,0.0005230575,0.0003191847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005436049,"about_ca_system_score_gemma":0.0003197506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001552938,"about_ca_topic_score_gemma":0.00186464,"domain_scores_codex":[0.9994811,0.0001083671,0.00004828714,0.0001664748,0.00007811726,0.000117677],"domain_scores_gemma":[0.9965789,0.001770714,0.0004950443,0.0006347845,0.0002548466,0.0002657376],"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.002377318,0.0003332924,0.05382273,0.0004427703,0.0001408315,0.002886091,0.001806879,0.4086489,0.08912164,0.2893479,0.004919909,0.1461518],"study_design_scores_gemma":[0.00007994517,0.000330478,0.01016064,0.00006848581,0.00005803276,0.0008264398,0.001723262,0.5181546,0.04820321,0.4169652,0.003367425,0.00006227514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9190394,0.00007706929,0.07647333,0.0001452106,0.00001365689,0.00004322437,0.0003325647,0.0003214386,0.003554169],"genre_scores_gemma":[0.9766107,0.00006483641,0.0216384,0.00004635695,0.000006659082,0.00003159597,0.0006172056,0.00005973407,0.0009244621],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002485639,"threshold_uncertainty_score":0.008315265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1855377430","doi":"10.20382/jocg.v2i1a1","title":"Connected rectilinear graphs on point sets","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Office of Naval Research; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Combinatorics; Mathematics; Orientation (vector space); Vertex (graph theory); Graph; Perpendicular; Pairwise comparison; Point (geometry); Line segment; Geometry","authors":[{"name":"Maarten Löffler","is_ca":false},{"name":"Elena Mumford","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009102678068484239,"gpt":0.2180990645206803,"spread":0.208996386452196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003889867,0.0006194205,0.000627325,0.001390404,0.0006529929,0.001264025,0.0009872731,0.0008706047,0.005657987],"category_scores_gemma":[0.003761777,0.0006677254,0.0005123214,0.002216396,0.0009469512,0.002062238,0.00160705,0.0008765566,0.000773623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000958112,"about_ca_system_score_gemma":0.0003161875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003006643,"about_ca_topic_score_gemma":0.003552237,"domain_scores_codex":[0.999299,0.0001839051,0.00004271126,0.0001947881,0.0001698043,0.0001096695],"domain_scores_gemma":[0.9979874,0.001091363,0.0003856244,0.0002155903,0.0001759411,0.0001441481],"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.0005040471,0.0001028629,0.004292564,0.0003767735,0.00008418856,0.001227819,0.0007730655,0.3427439,0.01156044,0.5532786,0.009248951,0.07580667],"study_design_scores_gemma":[0.0001089845,0.0000794879,0.002906093,0.00009990471,0.00003361953,0.0005124513,0.0004285381,0.4740345,0.003059903,0.497529,0.02117215,0.00003541927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5090694,0.001521961,0.4527826,0.001445126,0.0001070501,0.0002460629,0.002408628,0.0007211736,0.03169808],"genre_scores_gemma":[0.7342172,0.001724361,0.2435436,0.000319296,0.00008252426,0.0002777846,0.004133703,0.0002023987,0.01549919],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005657987,"threshold_uncertainty_score":0.01892787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2490727251","doi":"10.20382/jocg.v9i1a5","title":"On the Geodesic Centers of Polygonal Domains","year":2016,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Science Foundation","keywords":"Geodesic; Combinatorics; Mathematics; Shortest path problem; Bounded function; Center (category theory); Euclidean geometry; Equivalence (formal languages); Path (computing); Domain (mathematical analysis); Discrete mathematics; Geometry; Computer science; Mathematical analysis; Crystallography","authors":[{"name":"Haitao Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01436506126156185,"gpt":0.2163739961313764,"spread":0.2020089348698145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007293521,0.0008632158,0.001138605,0.001922789,0.001002968,0.001451472,0.001670919,0.001065653,0.003518445],"category_scores_gemma":[0.006794532,0.0004876565,0.0007069416,0.001932713,0.001724839,0.003028427,0.002221246,0.001150316,0.0007735132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001026825,"about_ca_system_score_gemma":0.0006500017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002800687,"about_ca_topic_score_gemma":0.001980486,"domain_scores_codex":[0.9992137,0.0001809879,0.00004140347,0.0002390952,0.0002198019,0.0001049648],"domain_scores_gemma":[0.9978278,0.001286405,0.0002453725,0.0002554521,0.000246409,0.0001384677],"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.0007737678,0.0001663121,0.004898293,0.0004922748,0.00009515814,0.0004357511,0.0009333573,0.5467075,0.01292254,0.2190842,0.006383881,0.207107],"study_design_scores_gemma":[0.00008376247,0.00009651377,0.0006806363,0.00003710774,0.00002143269,0.0001554074,0.0002992202,0.8121604,0.008943724,0.1718385,0.005650563,0.0000327193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2653695,0.0008484086,0.7247885,0.0005046762,0.0000478638,0.000191984,0.0006048827,0.001447343,0.006196739],"genre_scores_gemma":[0.5644304,0.0004178968,0.4305749,0.00007468578,0.00005407968,0.0001710098,0.001386301,0.000348821,0.002541839],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003518445,"threshold_uncertainty_score":0.01177031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1932504660","doi":"10.20382/jocg.v5i1a6","title":"Partial covering of a circle by equal circles. Part I: The mechanical models","year":2012,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Magyar Tudományos Akadémia; Hungarian Scientific Research Fund","keywords":"Tensegrity; Mathematics; Cover (algebra); Stiffness; Unit circle; RADIUS; Relaxation (psychology); Stability (learning theory); Combinatorics; Geometry; Computer science; Structural engineering; Engineering; Mechanical engineering","authors":[{"name":"Zsolt Gáspár","is_ca":false},{"name":"Tibor Tarnai","is_ca":false},{"name":"Krisztián Hincz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01100274313870731,"gpt":0.1812511341890563,"spread":0.170248391050349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003665805,0.0005194735,0.0004337342,0.0005220036,0.0005285852,0.0009015021,0.0009468069,0.0008019838,0.003640052],"category_scores_gemma":[0.00147756,0.0003624323,0.0005836514,0.0005639247,0.001719477,0.001552614,0.001139673,0.0004512437,0.0005272171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006904613,"about_ca_system_score_gemma":0.0003525187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001421659,"about_ca_topic_score_gemma":0.001057953,"domain_scores_codex":[0.9996179,0.0001302524,0.0000139308,0.00009578829,0.00009935153,0.00004271785],"domain_scores_gemma":[0.9995365,0.0001381272,0.000103909,0.0001140398,0.00005470372,0.00005276759],"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.00006119713,0.00001486466,0.000368251,0.0001266744,0.00001758773,0.0001626962,0.0001756096,0.3899046,0.005580207,0.5834551,0.002363787,0.01776934],"study_design_scores_gemma":[0.00002013487,0.0001251856,0.00056348,0.0000395926,0.0000235046,0.0004287341,0.0001639791,0.7278585,0.003913516,0.2442653,0.02256328,0.00003486725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1176414,0.001708583,0.8348551,0.0006839386,0.0001112819,0.00006891006,0.0002052567,0.0001412748,0.04458426],"genre_scores_gemma":[0.8969,0.001122464,0.08530778,0.0001368738,0.00009126675,0.0001688153,0.0002129614,0.00006514906,0.01599466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003640052,"threshold_uncertainty_score":0.01217723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2890636645","doi":"10.20382/jocg.v9i1a11","title":"Planar and Poly-Arc Lombardi Drawings","year":2011,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Planarity testing; Planar graph; Planar; Graph; Book embedding; Combinatorics; Mathematics; Computer science; Line graph; 1-planar graph; Computer graphics (images)","authors":[{"name":"Christian A. Duncan","is_ca":false},{"name":"David Eppstein","is_ca":false},{"name":"Michael T. Goodrich","is_ca":false},{"name":"Stephen Kobourov","is_ca":false},{"name":"Maarten Löffler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0167009891185495,"gpt":0.2115198730847965,"spread":0.194818883966247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002288379,0.0005531072,0.0003129987,0.0008551592,0.0005504049,0.001633221,0.0006688661,0.001063367,0.01112528],"category_scores_gemma":[0.002608275,0.0004953145,0.0004816697,0.001282053,0.0011746,0.001691337,0.001183672,0.001400632,0.001714319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005894933,"about_ca_system_score_gemma":0.0003187152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001684124,"about_ca_topic_score_gemma":0.002410803,"domain_scores_codex":[0.9994953,0.00009365411,0.0000203376,0.0001282111,0.0001825622,0.00007996426],"domain_scores_gemma":[0.9993219,0.000198197,0.0001140978,0.0001566117,0.0001395838,0.00006954397],"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.0001179081,0.00002997594,0.001013117,0.0001583891,0.00001915564,0.0003744129,0.0003564988,0.04761307,0.008036223,0.8180276,0.01054191,0.1137118],"study_design_scores_gemma":[0.00004275177,0.00007751592,0.001852127,0.00009014096,0.00003328384,0.001007913,0.0003132218,0.1694436,0.008207092,0.698454,0.1204124,0.00006597344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1001602,0.001330012,0.8093449,0.0008832433,0.000160083,0.0001096379,0.0006313541,0.001222806,0.0861577],"genre_scores_gemma":[0.573079,0.001911755,0.3815256,0.0004217371,0.0001241936,0.0001830714,0.001415528,0.0005245381,0.04081465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01112528,"threshold_uncertainty_score":0.03721774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962836387","doi":"10.20382/jocg.v4i1a8","title":"Network farthest-point diagrams","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Point (geometry); Combinatorics; Geometry","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Kai Dannies","is_ca":false},{"name":"Jean-Lou De Carufel","is_ca":true},{"name":"Christoph Doell","is_ca":false},{"name":"Carsten Grimm","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Stefan Schirra","is_ca":false},{"name":"Michiel H. M. Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01250951356358548,"gpt":0.2209002061460982,"spread":0.2083906925825127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008702003,0.0006582832,0.0006225725,0.002888458,0.000728405,0.002206921,0.001201672,0.001124381,0.008474747],"category_scores_gemma":[0.008172783,0.000350775,0.0005351056,0.002482472,0.0009024977,0.00529298,0.001917308,0.001056328,0.001253417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001240908,"about_ca_system_score_gemma":0.0007085699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002388818,"about_ca_topic_score_gemma":0.003109996,"domain_scores_codex":[0.9985796,0.0002902665,0.00009217048,0.0004293629,0.0004879298,0.0001207307],"domain_scores_gemma":[0.9966397,0.001516577,0.0004535912,0.0004369022,0.0006896232,0.0002636193],"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.0002111285,0.00007701603,0.003932544,0.0004389822,0.00005238281,0.0003459548,0.0006053533,0.1969679,0.006924319,0.6763034,0.01079592,0.1033452],"study_design_scores_gemma":[0.00005151907,0.00009176038,0.001403062,0.000119695,0.00003853753,0.0003798831,0.0002317434,0.356073,0.00497763,0.5554394,0.08114259,0.00005125645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04666145,0.0006724062,0.9325102,0.0005547431,0.00007382659,0.0001558423,0.003523175,0.0009848559,0.01486337],"genre_scores_gemma":[0.4204139,0.001552462,0.5556784,0.0002521517,0.0001027475,0.0005370265,0.007925543,0.0004054901,0.01313242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008474747,"threshold_uncertainty_score":0.02835083,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1517258173","doi":"10.20382/jocg.v5i1a14","title":"Incidences with $k$-non-degenerate sets and their applications","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Israeli Centers for Research Excellence; National Science Foundation","keywords":"Combinatorics; Mathematics; Degenerate energy levels; Upper and lower bounds; Plane (geometry); Polynomial; Degree (music); Space (punctuation); Set (abstract data type); Discrete mathematics; Geometry; Mathematical analysis; Physics","authors":[{"name":"Abdul Basit","is_ca":false},{"name":"Adam Sheffer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006298468167368431,"gpt":0.1859001417722851,"spread":0.1796016736049167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052198,0.001292396,0.001636646,0.003116343,0.002912158,0.003254011,0.003729317,0.001467958,0.008058873],"category_scores_gemma":[0.01520983,0.001360418,0.002784652,0.004189805,0.0045063,0.005762022,0.008831656,0.006652352,0.00165555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003485666,"about_ca_system_score_gemma":0.0009706712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00260851,"about_ca_topic_score_gemma":0.001758625,"domain_scores_codex":[0.9962327,0.0007038147,0.0002313661,0.0006769575,0.001363737,0.0007914315],"domain_scores_gemma":[0.9906338,0.004894074,0.001293809,0.001365291,0.0008577542,0.0009552932],"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.0001664539,0.0001764558,0.003082958,0.0001570844,0.00004036032,0.0003444809,0.0008457901,0.02067612,0.00325613,0.9364246,0.002196007,0.03263353],"study_design_scores_gemma":[0.00004150272,0.0000923544,0.001317884,0.0000599148,0.00004949465,0.0006661008,0.0003821753,0.1397583,0.004566904,0.8467404,0.006267224,0.00005777516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3486578,0.000854715,0.5952134,0.001198413,0.0002726479,0.0001963662,0.0003156311,0.0004565397,0.05283452],"genre_scores_gemma":[0.839439,0.001190211,0.1443176,0.0003657107,0.0005257422,0.0002492641,0.0006589312,0.0002804226,0.01297307],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008058873,"threshold_uncertainty_score":0.0269596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3081710876","doi":"10.20382/jocg.v11i1a4","title":"Rigid foldability is NP-hard","year":2018,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Division of Emerging Frontiers in Research and Innovation; Japan Society for the Promotion of Science; National Science Foundation","keywords":"Intersection (aeronautics); Combinatorics; Vertex (graph theory); Partition (number theory); Mathematics; Folding (DSP implementation); Planar; Reduction (mathematics); Kinematics; Flexibility (engineering); Plane (geometry); Algorithm; Computer science; Geometry; Graph; Physics; Structural engineering; Engineering; Classical mechanics","authors":[{"name":"Hugo A. Akitaya","is_ca":false},{"name":"Erik D. Demaine","is_ca":false},{"name":"Takashi Horiyama","is_ca":false},{"name":"Thomas C. Hull","is_ca":false},{"name":"Jason S. Ku","is_ca":false},{"name":"Tomohiro Tachi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008976801698028948,"gpt":0.1985288392687596,"spread":0.1895520375707306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006958127,0.001263871,0.001600909,0.0006295323,0.001884152,0.00430327,0.002389551,0.002437498,0.01399536],"category_scores_gemma":[0.006135937,0.0008273133,0.002304414,0.001167907,0.002271016,0.005586979,0.002609817,0.00513446,0.001864171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001437174,"about_ca_system_score_gemma":0.001408213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002409399,"about_ca_topic_score_gemma":0.002745429,"domain_scores_codex":[0.9983755,0.0002800469,0.00008525219,0.000560712,0.0003309469,0.0003674771],"domain_scores_gemma":[0.9891014,0.009266809,0.0003964419,0.0005435908,0.0003959715,0.0002958531],"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.001749976,0.001325864,0.006225882,0.003190207,0.0006935829,0.002584558,0.001236694,0.411725,0.02719458,0.3105537,0.09404328,0.1394767],"study_design_scores_gemma":[0.0002393659,0.0001370315,0.001255651,0.0001075594,0.0001313,0.0008251271,0.0005438186,0.2363346,0.008045677,0.73435,0.01796569,0.00006426682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3997042,0.002913352,0.4492346,0.02406368,0.0008461968,0.0007440416,0.01223112,0.003335813,0.106927],"genre_scores_gemma":[0.8516693,0.001742766,0.09555902,0.003569831,0.0006483945,0.0007952458,0.01359454,0.0008665677,0.03155439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01399536,"threshold_uncertainty_score":0.04681909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295922106","doi":"10.20382/jocg.v6i1a2","title":"The maximum number of faces of the Minkowski sum of three convex polytopes","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"FP7 Research Potential of Convergence Regions; European Social Fund; European Commission","keywords":"Polytope; Minkowski addition; Combinatorics; Regular polygon; Minkowski space; Mathematics; Geometry","authors":[{"name":"Menelaos I. Karavelas","is_ca":false},{"name":"Christos Konaxis","is_ca":false},{"name":"Eleni Tzanaki","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02474012601281481,"gpt":0.2525215576842991,"spread":0.2277814316714843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001084198,0.001578199,0.001036831,0.001941673,0.0010937,0.002695437,0.002380588,0.0006991276,0.007522857],"category_scores_gemma":[0.005997026,0.0007166137,0.001305872,0.00106657,0.002284949,0.005099378,0.002326136,0.002420251,0.001309064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001618208,"about_ca_system_score_gemma":0.0006248564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001148601,"about_ca_topic_score_gemma":0.001392663,"domain_scores_codex":[0.9988039,0.000234318,0.00008289261,0.0002345856,0.0003857448,0.000258578],"domain_scores_gemma":[0.9977913,0.001115292,0.0002608665,0.0002679544,0.0002926857,0.0002718539],"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.0002146043,0.00005770722,0.002227303,0.0003067304,0.00005338848,0.0003777035,0.0003427807,0.09483386,0.008960067,0.8492393,0.003971396,0.03941509],"study_design_scores_gemma":[0.00001826714,0.0000619089,0.002169525,0.0001267074,0.00004512228,0.0005064651,0.0002947846,0.3957101,0.01332937,0.5780571,0.00956508,0.0001157711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2756837,0.001995841,0.6387482,0.0008752456,0.0003450373,0.00009623328,0.0008112825,0.0003762332,0.08106824],"genre_scores_gemma":[0.8264008,0.001725932,0.1572936,0.0002591933,0.0002848578,0.0004161902,0.0007250653,0.0004260653,0.01246834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007522857,"threshold_uncertainty_score":0.02516645,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096242358","doi":"10.20382/jocg.v6i1a12","title":"The Lebesgue universal covering problem","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Covering space; Lebesgue integration; Regular polygon; Combinatorics; Reduction (mathematics); Pure mathematics; Geometry","authors":[{"name":"John C. Baez","is_ca":false},{"name":"Karine Bagdasaryan","is_ca":false},{"name":"Philip Gibbs","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05083805768200748,"gpt":0.2701838847343962,"spread":0.2193458270523887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452273,0.0006633183,0.001367517,0.001205062,0.001747641,0.002815882,0.001275132,0.001955652,0.00926214],"category_scores_gemma":[0.006300264,0.0004738385,0.001250858,0.001344421,0.002642709,0.004748043,0.003235897,0.001977743,0.001107495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001866343,"about_ca_system_score_gemma":0.0006667598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001772462,"about_ca_topic_score_gemma":0.0006420825,"domain_scores_codex":[0.9986749,0.000331962,0.00005824496,0.0002879044,0.0003278231,0.0003191264],"domain_scores_gemma":[0.9977596,0.001463762,0.0001271178,0.0002573544,0.0001775698,0.0002145962],"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.00007015561,0.00002170585,0.0004633009,0.00009598915,0.00003504596,0.0001303709,0.000199142,0.008470222,0.0005117774,0.9670984,0.006094714,0.01680924],"study_design_scores_gemma":[0.00002610093,0.00002360702,0.0004828051,0.0000297379,0.00001423781,0.0001524247,0.0001385451,0.03020298,0.0005967371,0.9535679,0.01475037,0.00001454693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3509808,0.01009551,0.4712415,0.01183116,0.0004797395,0.0001317775,0.002097616,0.0006144851,0.1525275],"genre_scores_gemma":[0.925607,0.004314306,0.04454325,0.0007431657,0.0007024411,0.0002050836,0.001714035,0.0001828081,0.02198793],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00926214,"threshold_uncertainty_score":0.03098494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963712264","doi":"10.20382/jocg.v4i1a6","title":"Simplicial flat norm with scale","year":2012,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Science Foundation","keywords":"Simplicial approximation theorem; Simplicial homology; Simplicial complex; Mathematics; Abstract simplicial complex; Simplicial manifold; h-vector; Simplicial set; Betti number; Norm (philosophy); Combinatorics; Bounding overwatch; Discrete mathematics; Pure mathematics; Computer science","authors":[{"name":"Sharif Ibrahim","is_ca":false},{"name":"Bala Krishnamoorthy","is_ca":false},{"name":"Kevin R. Vixie","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009232245547067383,"gpt":0.2022948082470004,"spread":0.193062562699933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132801,0.0005952612,0.0009277248,0.001279054,0.0006632159,0.002042616,0.001138358,0.0008569525,0.003129623],"category_scores_gemma":[0.007585435,0.0003857158,0.000793382,0.001154356,0.001758646,0.00529168,0.002333567,0.001455534,0.0003906366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001272788,"about_ca_system_score_gemma":0.0005827686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002886113,"about_ca_topic_score_gemma":0.003458348,"domain_scores_codex":[0.9992529,0.0001270679,0.00003891418,0.0002068435,0.000267882,0.0001063888],"domain_scores_gemma":[0.9976153,0.001209559,0.0002380408,0.0004468856,0.0002777315,0.0002124725],"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.0002253479,0.0001027954,0.005072513,0.0002241932,0.00005420965,0.0002122904,0.0004823478,0.3230723,0.007862638,0.5672138,0.003800318,0.09167722],"study_design_scores_gemma":[0.000009563614,0.00003461607,0.0004704336,0.00001233417,0.000007403959,0.00006369098,0.0001068893,0.7060736,0.002425993,0.289065,0.001714512,0.00001604818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1942846,0.0003549282,0.7986446,0.0005315486,0.00006537283,0.00005812506,0.0002897248,0.0008476991,0.004923359],"genre_scores_gemma":[0.7362458,0.0002121147,0.2586857,0.0001883885,0.00008506921,0.00009386618,0.0007908211,0.0003729986,0.003325283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003129623,"threshold_uncertainty_score":0.01046968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2768380610","doi":"10.20382/jocg.v8i1a2","title":"Towards plane spanners of degree 3","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"University of Ottawa; Carleton University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Degree (music); Mathematics; Vertex (graph theory); Spanner; General position; Plane (geometry); Regular polygon; Lattice (music); Position (finance); Geometry; Graph; Physics; Computer science","authors":[{"name":"Ahmad Biniaz","is_ca":true},{"name":"Prosenjit Bose","is_ca":true},{"name":"Jean-Lou De Carufel","is_ca":true},{"name":"Cyril Gavoille","is_ca":false},{"name":"Anil Maheshwari","is_ca":true},{"name":"Michiel H. M. Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01177071991036442,"gpt":0.206267280737115,"spread":0.1944965608267505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003207374,0.0006081811,0.0006164297,0.0008441246,0.0004565509,0.0008926828,0.0006439875,0.0004423296,0.004586258],"category_scores_gemma":[0.001846078,0.0003035577,0.0006710613,0.000944602,0.0007796859,0.001873734,0.001973546,0.0008430029,0.001290071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003913204,"about_ca_system_score_gemma":0.00043385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001872064,"about_ca_topic_score_gemma":0.00342402,"domain_scores_codex":[0.9995678,0.00006252486,0.00002583444,0.000101759,0.0001307953,0.0001112605],"domain_scores_gemma":[0.9994698,0.0001694465,0.00009483051,0.0001145349,0.00009051,0.00006086245],"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.0009707393,0.0002863717,0.01235633,0.0004339401,0.0001318565,0.0006855814,0.001407749,0.3788398,0.05094085,0.1794086,0.008507705,0.3660304],"study_design_scores_gemma":[0.00008039278,0.0004078115,0.001906413,0.00007432238,0.00002864788,0.0004655733,0.0007948012,0.7116961,0.03340695,0.2358664,0.01522179,0.00005081733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.587217,0.0003184571,0.3985797,0.0002019791,0.00004262042,0.00007087701,0.0004462743,0.001088378,0.01203478],"genre_scores_gemma":[0.6809384,0.0002271479,0.3131016,0.00008544757,0.00003278929,0.00005089618,0.001119276,0.0002501593,0.004194235],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004586258,"threshold_uncertainty_score":0.01534253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3082140337","doi":"10.20382/jocg.v11i1a6","title":"On the planar edge-length ratio of planar graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Horizon 2020 Framework Programme; Ministero dell’Istruzione, dell’Università e della Ricerca; Università degli Studi Roma Tre","keywords":"Combinatorics; Mathematics; Planar graph; Planar; Bipartite graph; Outerplanar graph; Enhanced Data Rates for GSM Evolution; 1-planar graph; Book embedding; Pathwidth; Graph; Line graph; Computer science","authors":[{"name":"Manuel Borrazzo","is_ca":false},{"name":"Fabrizio Frati","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01028629300594665,"gpt":0.1975308627673269,"spread":0.1872445697613803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00185762,0.001612465,0.001040029,0.003984326,0.001216279,0.002427931,0.002079119,0.001140007,0.009166573],"category_scores_gemma":[0.02429942,0.0007575351,0.0007756131,0.003472941,0.002517356,0.006225539,0.002823879,0.0024483,0.002215057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001798499,"about_ca_system_score_gemma":0.0006002666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001446949,"about_ca_topic_score_gemma":0.0009102763,"domain_scores_codex":[0.9969277,0.0008190596,0.0001219759,0.0006345371,0.0009398205,0.0005570191],"domain_scores_gemma":[0.9821135,0.0135591,0.001485913,0.0011735,0.001112587,0.000555272],"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.001210309,0.0003163123,0.007568173,0.0007113255,0.0001721744,0.000721328,0.0006537367,0.2510354,0.04651379,0.4905278,0.01730165,0.1832679],"study_design_scores_gemma":[0.000100757,0.0003407741,0.005117845,0.0002101054,0.0001946685,0.001909836,0.0005970371,0.4385247,0.03420822,0.4950805,0.02357241,0.0001431833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.348616,0.008622094,0.5024936,0.003279331,0.0002233041,0.0001812891,0.001202304,0.00186203,0.1335201],"genre_scores_gemma":[0.8913186,0.006578181,0.09296483,0.0006935996,0.0003927443,0.0002281694,0.001009796,0.0009709916,0.00584308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009166573,"threshold_uncertainty_score":0.03066522,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3023761765","doi":"10.20382/jocg.v11i1a1","title":"On optimal polyline simplification using the Hausdorff and Fréchet distance","year":2018,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Hausdorff distance; Subsequence; Combinatorics; Hausdorff space; Line segment; Line (geometry); Time complexity; Algorithm; Geometry; Mathematical analysis","authors":[{"name":"Marc van Kreveld","is_ca":false},{"name":"Maarten Löffler","is_ca":false},{"name":"Lionov Wiratma","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01587739429800557,"gpt":0.2400329222241248,"spread":0.2241555279261192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009312194,0.0009097595,0.001620966,0.0013813,0.000987703,0.001617169,0.001477307,0.001077609,0.004811593],"category_scores_gemma":[0.006183542,0.0005348593,0.001282046,0.002402721,0.001612191,0.003600492,0.001834703,0.001529641,0.0009617328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001519332,"about_ca_system_score_gemma":0.0009400912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003238303,"about_ca_topic_score_gemma":0.003683565,"domain_scores_codex":[0.9983202,0.0002671892,0.0001045817,0.0003683316,0.0007111609,0.0002285099],"domain_scores_gemma":[0.9972653,0.001540916,0.0002516728,0.0005494314,0.0002819906,0.0001106908],"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.0002331792,0.0001375805,0.00112561,0.0003578489,0.00007501951,0.0001933907,0.0002828794,0.6676913,0.01239023,0.09361497,0.004916952,0.218981],"study_design_scores_gemma":[0.00003562157,0.00008973249,0.0004850351,0.00003015809,0.00002219343,0.0001057347,0.0000843159,0.9311931,0.008694714,0.05399939,0.005234135,0.00002585294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03623426,0.0005066727,0.9562024,0.0002534144,0.00004452236,0.00007270491,0.0001492067,0.0007815695,0.005755158],"genre_scores_gemma":[0.3015755,0.0007494363,0.6925468,0.0001193343,0.0000940387,0.0001204348,0.0008148456,0.0004867684,0.003492784],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004811593,"threshold_uncertainty_score":0.01609635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3090078726","doi":"10.20382/jocg.v11i1a11","title":"An improved cost function for hierarchical cluster trees","year":2019,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Ohio State University; National Science Foundation","keywords":"Hierarchical clustering; Cluster analysis; Granularity; Tree (set theory); Function (biology); Mathematics; Graph; Similarity (geometry); Tree structure; Computer science; Set (abstract data type); Hierarchical clustering of networks; Data mining; Algorithm; Correlation clustering; Combinatorics; CURE data clustering algorithm; Artificial intelligence; Statistics","authors":[{"name":"Dingkang Wang","is_ca":false},{"name":"Yusu Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01200130474763249,"gpt":0.2603167225421988,"spread":0.2483154177945663,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003645015,0.001409199,0.001864888,0.002441043,0.001109801,0.001913223,0.003600646,0.003036758,0.005621748],"category_scores_gemma":[0.01181097,0.0005466718,0.001514978,0.003394328,0.0009888894,0.005197858,0.002322358,0.002611193,0.001146519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003351697,"about_ca_system_score_gemma":0.002543148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005589978,"about_ca_topic_score_gemma":0.004632697,"domain_scores_codex":[0.9970371,0.000917497,0.0001549679,0.0003522382,0.00119089,0.0003472852],"domain_scores_gemma":[0.9949948,0.002145973,0.0003079747,0.000537781,0.001719317,0.0002942886],"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.0002333522,0.0001665398,0.001430188,0.0002597699,0.00006737715,0.0001610842,0.0001390022,0.703162,0.004308856,0.1148445,0.01414162,0.1610857],"study_design_scores_gemma":[0.00001226409,0.00004697012,0.0002534038,0.00001669566,0.00001077916,0.00006745964,0.00001881228,0.9782473,0.0007039233,0.01782306,0.002785462,0.00001369536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01142904,0.0005326101,0.9836873,0.0005246269,0.00009368736,0.0001477529,0.0002493246,0.0003850097,0.002950639],"genre_scores_gemma":[0.2527145,0.0007181219,0.734918,0.0004585945,0.0002047063,0.0006274726,0.001367736,0.0006242662,0.008366722],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005621748,"threshold_uncertainty_score":0.0243184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2618186495","doi":"10.20382/jocg.v8i1a8","title":"A new drawing for simple Venn diagrams based on algebraic construction","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Venn diagram; Simple (philosophy); Readability; Mathematics; Diagram; Domain (mathematical analysis); Algebraic number; Algebra over a field; Discrete mathematics; Computer science; Pure mathematics; Mathematics education; Programming language; Statistics; Epistemology","authors":[{"name":"Arnaud Bannier","is_ca":false},{"name":"Nicolas Bodin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01385926201105564,"gpt":0.2423047760116783,"spread":0.2284455140006227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001611535,0.0009229577,0.0007640939,0.004131797,0.001353906,0.002915696,0.002036667,0.00111799,0.01230714],"category_scores_gemma":[0.009819311,0.0008244358,0.00130188,0.002559115,0.001800989,0.005697411,0.003221163,0.002053956,0.002671884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007482204,"about_ca_system_score_gemma":0.0009231828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001242152,"about_ca_topic_score_gemma":0.001724848,"domain_scores_codex":[0.998161,0.0005534169,0.0001663497,0.0004666809,0.000557166,0.00009542974],"domain_scores_gemma":[0.9959394,0.001856938,0.000260763,0.0007488163,0.0008760914,0.0003181415],"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.0001187611,0.00005554427,0.001078508,0.0005672451,0.00005000703,0.0004915422,0.001712149,0.011481,0.0225944,0.7503439,0.01572832,0.1957787],"study_design_scores_gemma":[0.00007797968,0.0001366183,0.0008294971,0.0002550787,0.000064351,0.00196873,0.0004172703,0.1294113,0.01977885,0.5441695,0.302708,0.0001827724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001785637,0.0001026182,0.9931871,0.0001029307,0.0001099155,0.00005666526,0.0001409015,0.001219231,0.003294969],"genre_scores_gemma":[0.02644297,0.00019508,0.96999,0.00007579538,0.00007634506,0.0001410979,0.0003250753,0.000669268,0.002084458],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01230714,"threshold_uncertainty_score":0.04117149,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4301413600","doi":"10.20382/jocg.v5i1a1","title":"Unions of onions: preprocessing imprecise points for fast onion decomposition","year":2014,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Disjoint sets; Decomposition; Combinatorics; Mathematics; Matching (statistics); Disjoint union (topology); Binary logarithm; Time complexity; Regular polygon; Set (abstract data type); Point (geometry); Data structure; Discrete mathematics; Unit disk; Computer science; Chemistry; Statistics; Geometry","authors":[{"name":"Wolfgang Mulzer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01515668206177541,"gpt":0.2662926280989182,"spread":0.2511359460371428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008797047,0.00176297,0.001797168,0.002480532,0.001181592,0.003041968,0.002890194,0.001458224,0.01102509],"category_scores_gemma":[0.007149363,0.001103746,0.002093489,0.003918825,0.001141204,0.005365756,0.005757827,0.002580978,0.004614145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001022567,"about_ca_system_score_gemma":0.001097496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003990701,"about_ca_topic_score_gemma":0.006530981,"domain_scores_codex":[0.9981608,0.0001787694,0.0002160559,0.0003628508,0.0007727482,0.0003088007],"domain_scores_gemma":[0.9965345,0.0009196921,0.0002345281,0.00160475,0.0005714672,0.000135208],"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.0020297,0.0002686282,0.005864054,0.0007857647,0.0001712686,0.0006353875,0.001729947,0.1023714,0.03621034,0.05915628,0.04327312,0.7475041],"study_design_scores_gemma":[0.0001683286,0.0002200974,0.001478293,0.0001269863,0.00006180497,0.000366804,0.0009981279,0.8121123,0.04216183,0.1046964,0.03753004,0.00007899114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0364756,0.0003326487,0.9482235,0.0002776817,0.000101728,0.0001793482,0.001556127,0.008777685,0.004075661],"genre_scores_gemma":[0.1983501,0.0002864202,0.7860416,0.0001421045,0.00006857257,0.0003425225,0.007765668,0.002309103,0.004693932],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01102509,"threshold_uncertainty_score":0.03688264,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3112638984","doi":"10.20382/jocg.v13i1a3","title":"Improved polytope volume calculations based on Hamiltonian Monte Carlo with boundary reflections and sweet arithmetics","year":2021,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Monte Carlo method; Polytope; Mathematics; Hamiltonian (control theory); Arithmetic; Geometry; Mathematical optimization; Statistics","authors":[{"name":"Frédéric Cazals","is_ca":false},{"name":"Augustin Chevallier","is_ca":false},{"name":"Sylvain Pion","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03433791763792107,"gpt":0.2955755437150198,"spread":0.2612376260770987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029165,0.000417931,0.001016003,0.0007457329,0.0006721923,0.001140255,0.001433531,0.0007913864,0.004071945],"category_scores_gemma":[0.005274139,0.0003153127,0.0005643113,0.0007257879,0.001563046,0.00157315,0.001588928,0.001500498,0.0005574694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007579319,"about_ca_system_score_gemma":0.0009339787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002423339,"about_ca_topic_score_gemma":0.003208142,"domain_scores_codex":[0.9992718,0.0002408085,0.00002408931,0.0000669498,0.0003040327,0.00009239178],"domain_scores_gemma":[0.9980308,0.001073751,0.000100582,0.0004835174,0.0001995651,0.0001118394],"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.0001099569,0.00007459886,0.0008064326,0.00007503374,0.00003094619,0.00009597758,0.0001344471,0.6326429,0.002927097,0.3321146,0.001393989,0.029594],"study_design_scores_gemma":[0.000008764917,0.00001453085,0.00005276317,0.00000554182,0.000002803897,0.000008912,0.00000886525,0.959935,0.0007710847,0.03864631,0.000539072,0.000006408387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09296399,0.0002827208,0.8942004,0.0002493347,0.0001127199,0.00005362135,0.00009449863,0.0009115824,0.01113101],"genre_scores_gemma":[0.6464561,0.0001552723,0.3494022,0.0001498562,0.00005867637,0.0001484626,0.0001912266,0.0005790338,0.002859198],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004071945,"threshold_uncertainty_score":0.01362205,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W6925877189","doi":"10.20382/jocg.v13i1a12","title":"Realizations of indecomposable persistence modules of arbitrarily large dimensions","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Digital Radiography and Breast Imaging","field":"Medicine","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Core Research for Evolutional Science and Technology","keywords":"Indecomposable module; Persistent homology; Topological data analysis; Simple (philosophy); Algebraic number; Persistence (discontinuity); Algebra over a field; Representation (politics)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01319785501436081,"gpt":0.2191340072214817,"spread":0.2059361522071209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005998394,0.0002827071,0.00036038,0.001589353,0.0008118714,0.002081271,0.0005503608,0.0004722166,0.003934684],"category_scores_gemma":[0.002459455,0.0003959353,0.0005060881,0.0005353701,0.001869013,0.003266917,0.002426062,0.001004384,0.0003029601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006728339,"about_ca_system_score_gemma":0.0002907224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002537712,"about_ca_topic_score_gemma":0.0002121852,"domain_scores_codex":[0.9994643,0.00009159842,0.00003795354,0.0001196243,0.0001543135,0.0001322113],"domain_scores_gemma":[0.9982784,0.0007002028,0.000281988,0.0002679121,0.0001637369,0.0003077618],"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.0000411157,0.00002299762,0.001630754,0.00004084369,0.00001048711,0.0003255404,0.0003971912,0.00319113,0.003837746,0.9853179,0.0003005011,0.004883599],"study_design_scores_gemma":[0.00003427145,0.00008914543,0.002078895,0.00003289089,0.00001887372,0.0006203601,0.0004332633,0.02989623,0.005365458,0.9566674,0.00473177,0.00003142143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8616427,0.0003315236,0.1223329,0.0003546347,0.00003810861,0.0000281342,0.0001887299,0.0002708902,0.01481243],"genre_scores_gemma":[0.9869701,0.0001178303,0.009601685,0.0000411324,0.00002897242,0.00003393952,0.0001406225,0.00003832926,0.003027527],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003934684,"threshold_uncertainty_score":0.01316279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295197591","doi":"10.20382/jocg.v6i2a2","title":"Finding the largest disk containing a query point in logarithmic time with linear storage","year":2014,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Israeli Centers for Research Excellence; Tel Aviv University","keywords":"Logarithm; Point (geometry); Computer science; Mathematics; Geometry; Mathematical analysis","authors":[{"name":"Tal Kaminker","is_ca":false},{"name":"Micha Sharir","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007528022982602999,"gpt":0.1976891067314645,"spread":0.1901610837488615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000836266,0.001297912,0.00182592,0.00170099,0.001392302,0.00345133,0.003866154,0.001958786,0.01346983],"category_scores_gemma":[0.008688425,0.0007681092,0.001424576,0.004585313,0.001292051,0.00831189,0.003467269,0.001474161,0.005153588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00212208,"about_ca_system_score_gemma":0.003809248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00564395,"about_ca_topic_score_gemma":0.01053337,"domain_scores_codex":[0.9979873,0.0002069872,0.0001839154,0.0005711237,0.0007335926,0.000317075],"domain_scores_gemma":[0.9912259,0.003879706,0.0008399313,0.003062737,0.0006071058,0.0003845746],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00670724,0.001223098,0.01595327,0.002353068,0.00035154,0.0007335349,0.001021272,0.1328236,0.08989025,0.03153685,0.07827648,0.6391298],"study_design_scores_gemma":[0.002631838,0.001040422,0.008371202,0.0002257297,0.0004034178,0.001562426,0.001413586,0.7402392,0.0848251,0.128422,0.03067468,0.0001904449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.328802,0.003755467,0.5951257,0.00763021,0.0003682717,0.0007319224,0.008907907,0.02266968,0.03200871],"genre_scores_gemma":[0.5832456,0.0008427242,0.3972746,0.0004442884,0.0002557978,0.0003461514,0.007880636,0.0008492495,0.008860852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01346983,"threshold_uncertainty_score":0.04506111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1706661728","doi":"10.20382/jocg.v2i1a5","title":"Good quality virtual realization of unit disk graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"University of Alberta","funders":"National Science Foundation","keywords":"Realization (probability); Mathematics; Unit disk; Quality (philosophy); Unit (ring theory); Combinatorics; Statistics; Physics; Mathematics education","authors":[{"name":"Sriram V. Pemmaraju","is_ca":false},{"name":"Imran A. Pirwani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01540619575692122,"gpt":0.2484930050846238,"spread":0.2330868093277026,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006591603,0.0005832004,0.0008040817,0.0004780682,0.000613893,0.001475524,0.001086248,0.0008446508,0.00376212],"category_scores_gemma":[0.003501923,0.0004652796,0.0005967066,0.0006636584,0.0009558735,0.002326936,0.001400602,0.0009322651,0.0005849303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000826497,"about_ca_system_score_gemma":0.0005054477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001230203,"about_ca_topic_score_gemma":0.001552182,"domain_scores_codex":[0.9991326,0.0002745038,0.00004592475,0.0001941172,0.0002020581,0.0001508274],"domain_scores_gemma":[0.9986153,0.0005689273,0.0001700102,0.0003922958,0.0001370658,0.0001165366],"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.0006519315,0.0001636637,0.002021441,0.0002464811,0.00006760882,0.0004384515,0.0004857203,0.56987,0.02334653,0.3000417,0.004864255,0.09780219],"study_design_scores_gemma":[0.000066404,0.0002061111,0.000481883,0.00001871149,0.00002279592,0.0002149603,0.0001968129,0.8128141,0.008083116,0.1728642,0.005000377,0.00003055124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2934527,0.0002505044,0.6975223,0.0004721898,0.00003216456,0.00009662918,0.000370219,0.0007491429,0.007054164],"genre_scores_gemma":[0.7862598,0.0001700658,0.209822,0.0000630131,0.00001995007,0.0001075191,0.0007120091,0.0001268324,0.002718708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00376212,"threshold_uncertainty_score":0.01258558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3207367190","doi":"10.20382/jocg.v12i1a4","title":"Walking the dog fast in practice: Algorithm engineering of the Fréchet distance","year":2021,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Algorithm; Mathematics; Similarity (geometry); Bottleneck; Distance measures; Data structure; Measure (data warehouse); Benchmark (surveying); Computer science; Quadratic equation; Data mining; Artificial intelligence; Image (mathematics)","authors":[{"name":"Karl Bringmann","is_ca":false},{"name":"Marvin Künnemann","is_ca":false},{"name":"André Nusser","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005795975449699902,"gpt":0.2068089838378906,"spread":0.2010130083881907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003954504,0.001308826,0.001387325,0.001489899,0.001212607,0.004231401,0.003337995,0.002355745,0.007356411],"category_scores_gemma":[0.03542345,0.001046781,0.001281278,0.002155169,0.002569838,0.008975867,0.004795081,0.004852658,0.003696302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002285207,"about_ca_system_score_gemma":0.003102604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004505422,"about_ca_topic_score_gemma":0.003582338,"domain_scores_codex":[0.993036,0.001967397,0.0005085859,0.001908273,0.002054998,0.0005247867],"domain_scores_gemma":[0.9877659,0.006608934,0.0004771203,0.003346676,0.001520701,0.0002806269],"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.0003833364,0.000186865,0.002902149,0.0004844142,0.00009575681,0.0002064036,0.0006324954,0.1779849,0.008073574,0.2489142,0.02012526,0.5400106],"study_design_scores_gemma":[0.00008278168,0.0001171111,0.0003205038,0.00009266663,0.00002102251,0.0002330888,0.0001476165,0.6752516,0.005991024,0.3032216,0.01447339,0.00004762855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01105546,0.0005458031,0.9816828,0.0006746269,0.0001068906,0.00006740999,0.00008826852,0.002285677,0.003493167],"genre_scores_gemma":[0.1580047,0.0005146014,0.8366435,0.0002935416,0.0001512618,0.000250408,0.0005575045,0.0009199159,0.002664612],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007356411,"threshold_uncertainty_score":0.02460963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150278422","doi":"10.20382/jocg.v3i1a5","title":"Colouring the triangles determined by a point set","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Australian Research Council; Australian Government","keywords":"Mathematics; Set (abstract data type); Combinatorics; Point (geometry); Geometry; Computer science","authors":[{"name":"Ruy Fabila‐Monroy","is_ca":false},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02403805481280369,"gpt":0.2067943884350725,"spread":0.1827563336222688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005214334,0.000448428,0.0004645164,0.001088064,0.001413373,0.001640142,0.001293972,0.0008151865,0.007462868],"category_scores_gemma":[0.003126122,0.0005191977,0.0005724383,0.001267219,0.001785501,0.002047909,0.001907928,0.001250928,0.0007628335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001349042,"about_ca_system_score_gemma":0.000572823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006788086,"about_ca_topic_score_gemma":0.006521893,"domain_scores_codex":[0.9992446,0.0001387672,0.00002439798,0.0001531991,0.0002276716,0.0002114176],"domain_scores_gemma":[0.9982912,0.0006745855,0.000212933,0.000353113,0.0002982482,0.000169933],"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.001487385,0.000174622,0.015802,0.0003012682,0.000104395,0.000987027,0.002129685,0.1255771,0.1062539,0.6466113,0.007618892,0.09295231],"study_design_scores_gemma":[0.00016289,0.0003839662,0.01083186,0.00009568801,0.00007723839,0.001139859,0.001539656,0.3655807,0.0489927,0.544037,0.02704772,0.0001107236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7332304,0.0002165977,0.2248788,0.0004058567,0.00009860483,0.00010137,0.0004225203,0.0002619298,0.0403839],"genre_scores_gemma":[0.8818143,0.0002883936,0.1061585,0.00009966795,0.00004333284,0.00008384147,0.0007764965,0.0002017376,0.01053371],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007462868,"threshold_uncertainty_score":0.02496576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2549157564","doi":"10.20382/jocg.v7i1a18","title":"Recognizing shrinkable complexes is NP-complete","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Chemistry; Computer science","authors":[{"name":"Dominique Attali","is_ca":false},{"name":"Olivier Devillers","is_ca":false},{"name":"Marc Glisse","is_ca":false},{"name":"Sylvain Lazard","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02363857069236365,"gpt":0.2185945684865865,"spread":0.1949559977942228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010061,0.00112266,0.001891889,0.0006694159,0.002229059,0.005682342,0.002763971,0.002498827,0.0110141],"category_scores_gemma":[0.00943801,0.001374128,0.003131866,0.001687083,0.00223997,0.009712851,0.003589212,0.004016806,0.00180176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001608288,"about_ca_system_score_gemma":0.001821775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004414503,"about_ca_topic_score_gemma":0.007593211,"domain_scores_codex":[0.9974275,0.0002883359,0.000293663,0.000989109,0.0006560915,0.0003452134],"domain_scores_gemma":[0.979226,0.01606922,0.0009886313,0.002021622,0.001064976,0.0006295664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001863959,0.001051503,0.01566986,0.004416839,0.0006714817,0.003250744,0.002840147,0.250739,0.06957807,0.2302473,0.07874491,0.3409261],"study_design_scores_gemma":[0.0002894736,0.0001767693,0.00281461,0.0001666092,0.0002365335,0.001556791,0.002302933,0.3105323,0.02849245,0.6197832,0.03350829,0.0001401135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4446948,0.001351466,0.4930854,0.01008163,0.0003148751,0.001094536,0.01290332,0.006489324,0.02998454],"genre_scores_gemma":[0.6069108,0.0008896222,0.3576027,0.001302331,0.0002149749,0.0006853854,0.02143003,0.0009218199,0.0100424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0110141,"threshold_uncertainty_score":0.03684586,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3037345875","doi":"10.20382/jocg.v13i1a8","title":"A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Euclidean space; Combinatorics; Mathematics; Approximation algorithm; Transportation theory; Linear space; Euclidean distance; Euclidean geometry; Point (geometry); Function (biology); Facility location problem; Space (punctuation); Mathematical optimization; Discrete mathematics; Computer science; Geometry","authors":[{"name":"Kyle Fox","is_ca":false},{"name":"Jiashuai Lu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01076187894291781,"gpt":0.1844469788609128,"spread":0.173685099917995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001703753,0.001758862,0.001934071,0.001057733,0.001397484,0.002682369,0.004889016,0.00227931,0.01510041],"category_scores_gemma":[0.005453716,0.0006906472,0.001975154,0.002516886,0.001313403,0.004999108,0.003858861,0.003330641,0.003975119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004286787,"about_ca_system_score_gemma":0.003594819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01362751,"about_ca_topic_score_gemma":0.01630013,"domain_scores_codex":[0.9985303,0.0002231566,0.00009032399,0.0003941125,0.0004624923,0.0002996092],"domain_scores_gemma":[0.9980895,0.0007938194,0.0001387844,0.0005793477,0.0002404612,0.0001581432],"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.0009344931,0.0002950077,0.0008189129,0.0002853022,0.00007531903,0.0001277451,0.0002814683,0.6802368,0.004039225,0.111073,0.01455091,0.1872818],"study_design_scores_gemma":[0.00006189605,0.0000386783,0.00005359748,0.00001112127,0.0000128504,0.00002396705,0.00002739225,0.9695889,0.0005963764,0.02730482,0.002271767,0.000008538531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01922656,0.0002941478,0.9691259,0.0004632855,0.000103338,0.0001490035,0.0004127667,0.003539562,0.006685453],"genre_scores_gemma":[0.1941685,0.0002532287,0.7917475,0.0002594718,0.0001013298,0.0004146525,0.001644783,0.0006736543,0.01073679],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01510041,"threshold_uncertainty_score":0.05051595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}