{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006545862,0.0001217928,0.0002394055,0.0004654579,0.0001054335,0.00004913982,0.001055737,0.00005455432,0.000007715868],"category_scores_gemma":[0.0002183445,0.00009840698,0.0002211959,0.002226523,0.0001223243,0.0007875535,0.000250355,0.0002073877,0.000002863857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000183018,"about_ca_system_score_gemma":0.0006110272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000597918,"about_ca_topic_score_gemma":0.000001725835,"domain_scores_codex":[0.9981611,0.0002061893,0.0004145821,0.0001830197,0.0008931685,0.0001419316],"domain_scores_gemma":[0.997393,0.0002701398,0.0006638544,0.0002544617,0.001258871,0.0001596741],"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.0001160252,0.0002205803,0.006430543,0.00003013564,0.0001039642,0.00002442507,0.0005023521,0.7924734,0.0001255667,0.1922849,0.001784765,0.005903345],"study_design_scores_gemma":[0.008593085,0.001444186,0.1705858,0.0002721777,0.000221469,0.0006262056,0.001332406,0.3689133,0.005248699,0.2725361,0.1690494,0.001177246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1969662,0.0001130429,0.7996563,0.000950933,0.0005677455,0.00008194824,0.000008386081,0.00001276432,0.001642692],"genre_scores_gemma":[0.9558402,0.000004390465,0.04350537,0.00009047194,0.0000979016,1.011402e-7,0.000003359649,0.00000427876,0.0004539658],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7588739,"threshold_uncertainty_score":0.401292,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007259866,0.000127543,0.0002952705,0.001260578,0.0001296147,0.00005698608,0.0005834705,0.00005690398,0.00001692909],"category_scores_gemma":[0.0002222826,0.0001361939,0.0001924166,0.001582696,0.00005392717,0.0006333888,0.0001374096,0.0001803108,0.000006314706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006949439,"about_ca_system_score_gemma":0.0002425403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004178057,"about_ca_topic_score_gemma":9.318351e-7,"domain_scores_codex":[0.9982968,0.0001784094,0.0005203476,0.0001836657,0.000660609,0.0001601423],"domain_scores_gemma":[0.9969484,0.0007049683,0.0007967131,0.0001459846,0.001272967,0.0001309951],"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.00004241175,0.0001200546,0.001412627,0.00003954029,0.0001148327,0.00002770658,0.000201973,0.7655404,0.001010631,0.1932791,0.0004671215,0.03774353],"study_design_scores_gemma":[0.007525376,0.002039677,0.021619,0.0004441171,0.0002108466,0.0007462535,0.0005467769,0.8091267,0.005582871,0.08487305,0.06625766,0.001027626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1837528,0.0000816247,0.813665,0.0003938627,0.0003929047,0.00005220427,0.000003642266,0.00001920571,0.001638757],"genre_scores_gemma":[0.743475,0.000008930979,0.2560714,0.0001322281,0.000119394,6.30131e-8,0.000006613045,0.000005233185,0.0001811828],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5597222,"threshold_uncertainty_score":0.5553825,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004344959,0.0001785072,0.0002652424,0.001732239,0.0001956329,0.0001978579,0.0007616968,0.00007621877,0.000143779],"category_scores_gemma":[0.0001208876,0.0001785475,0.000233591,0.001889967,0.00005212573,0.00168278,0.0001335024,0.0002870907,0.00007776645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001692963,"about_ca_system_score_gemma":0.0002136697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009251748,"about_ca_topic_score_gemma":5.997997e-7,"domain_scores_codex":[0.9981607,0.0001722083,0.0004398415,0.0002833533,0.0007174524,0.0002264414],"domain_scores_gemma":[0.9976445,0.0005307263,0.0005038291,0.0002144657,0.0008899242,0.0002165443],"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.0001626863,0.0009084968,0.002191999,0.00005483014,0.0003578304,0.0002348985,0.0007434824,0.3486876,0.005582803,0.5350142,0.009302574,0.09675859],"study_design_scores_gemma":[0.005627053,0.002718559,0.3249717,0.0002542044,0.00008921204,0.000652064,0.00041087,0.2063356,0.002946653,0.4193382,0.03518532,0.001470553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5735469,0.00002278034,0.42347,0.001225833,0.000435488,0.0001060271,0.000002915291,0.00003346984,0.001156651],"genre_scores_gemma":[0.9655716,0.000008494614,0.03310386,0.0008085009,0.0001165515,3.386777e-7,0.000009970092,0.000007374562,0.0003733087],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3920248,"threshold_uncertainty_score":0.7280954,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007133261,0.0001551553,0.0002739132,0.002327229,0.00008037606,0.0001198525,0.0006115626,0.00007982643,0.00001007178],"category_scores_gemma":[0.0001440899,0.0001702389,0.0001277155,0.003506559,0.00004065016,0.001405938,0.0001611837,0.0002641914,0.000008625356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000398268,"about_ca_system_score_gemma":0.0009527583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003066978,"about_ca_topic_score_gemma":0.000005258901,"domain_scores_codex":[0.9981772,0.0001630289,0.0004179273,0.0002305135,0.0007854962,0.0002257877],"domain_scores_gemma":[0.9979981,0.000215691,0.0004044597,0.0001460425,0.0009636523,0.0002721121],"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.00006370879,0.0001561205,0.003853366,0.000006129977,0.00003310038,0.0003266527,0.0002487739,0.9709492,0.0001672505,0.021574,0.0004701705,0.002151584],"study_design_scores_gemma":[0.003424746,0.0005414117,0.01358094,0.00009338988,0.00003700768,0.0007378309,0.0004984468,0.9488744,0.0003181455,0.01194853,0.01949265,0.0004524757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4060629,0.0001705068,0.592261,0.0004754034,0.0003968977,0.00005682473,0.000002490942,0.0000174556,0.0005565974],"genre_scores_gemma":[0.8764902,0.00001263708,0.1229762,0.0001238996,0.0001896327,6.020312e-8,0.000006633626,0.000007383888,0.000193415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4704273,"threshold_uncertainty_score":0.6942143,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001178926,0.0001488961,0.0002109776,0.0007047036,0.0005332472,0.0003273204,0.0005803166,0.00006161163,0.000003830844],"category_scores_gemma":[0.000205409,0.0001273711,0.0001045503,0.001417806,0.0001202692,0.001140457,0.0002592969,0.0002119173,0.000005273931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001650593,"about_ca_system_score_gemma":0.0004847707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006660385,"about_ca_topic_score_gemma":0.000003116391,"domain_scores_codex":[0.9982224,0.0002237955,0.0004122283,0.0002144855,0.000684846,0.0002423158],"domain_scores_gemma":[0.9974555,0.0004492144,0.0004744888,0.0001400268,0.001241784,0.0002389966],"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.00008715953,0.00008841282,0.001225926,0.00001073247,0.0001538115,0.00006993987,0.0009379769,0.7406617,0.0000567842,0.2258198,0.00746518,0.02342259],"study_design_scores_gemma":[0.005477943,0.001274679,0.01430254,0.0001393291,0.0001615491,0.001711388,0.003012549,0.5069116,0.000150272,0.07359674,0.392379,0.0008823999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06981621,0.0005931373,0.9246127,0.003392666,0.0004363141,0.0001215252,0.000004479588,0.0000337756,0.0009892008],"genre_scores_gemma":[0.8870798,0.00008214706,0.1113854,0.0001725028,0.0002684634,4.627673e-7,0.00001466389,0.000009888345,0.0009866136],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8172637,"threshold_uncertainty_score":0.5194044,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006566995,0.00015638,0.0003053827,0.001451201,0.0001249825,0.00009236227,0.0005239725,0.0001119327,0.00005736032],"category_scores_gemma":[0.0002043766,0.0001632283,0.0001450483,0.001404277,0.00008321708,0.001326118,0.0001625082,0.0002873705,0.000006949406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005085765,"about_ca_system_score_gemma":0.0004082007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004338476,"about_ca_topic_score_gemma":0.000002659935,"domain_scores_codex":[0.9983801,0.0001048235,0.0004912725,0.0002537406,0.0006132722,0.0001568529],"domain_scores_gemma":[0.997198,0.0005306594,0.0007413108,0.0001725662,0.00118094,0.0001764948],"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.001051354,0.001118899,0.005432371,0.0002114616,0.0007428276,0.0002305135,0.003265887,0.5083675,0.05961815,0.1237003,0.002086495,0.2941743],"study_design_scores_gemma":[0.01213252,0.002135712,0.1704314,0.000278233,0.0003599136,0.002080658,0.0005283038,0.696349,0.01644802,0.07560373,0.02206439,0.001588154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.549913,0.00004951128,0.4489973,0.0002822856,0.000242104,0.00007865978,0.00000784029,0.00001709603,0.0004122535],"genre_scores_gemma":[0.9092461,0.00001412176,0.09008542,0.00007463054,0.0001469885,1.577315e-7,0.00001436612,0.000007619843,0.0004106114],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3593331,"threshold_uncertainty_score":0.6656258,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001299226,0.0001397008,0.0002941584,0.001257002,0.0000896557,0.00007208958,0.0009101237,0.00006523108,0.000004972482],"category_scores_gemma":[0.0001425276,0.0001234132,0.0001985664,0.002254663,0.00004958316,0.0006209956,0.0001053564,0.0001998087,0.000001333377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001223767,"about_ca_system_score_gemma":0.0007785439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003296393,"about_ca_topic_score_gemma":0.000005297216,"domain_scores_codex":[0.9980695,0.0001964567,0.0005362647,0.0002093831,0.0007975771,0.0001908503],"domain_scores_gemma":[0.9971457,0.001083367,0.0005712201,0.0001555594,0.0008856273,0.0001585465],"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.0002205952,0.0004424434,0.002440235,0.00003731476,0.0001587467,0.00009785796,0.002480365,0.6683311,0.0001002953,0.110957,0.003875602,0.2108584],"study_design_scores_gemma":[0.009807792,0.002087119,0.06382161,0.0001508056,0.0001042602,0.0005812181,0.002502482,0.7376823,0.0005809931,0.1650265,0.01702039,0.0006345069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1390589,0.00018165,0.859493,0.0005416191,0.000351504,0.0001495118,0.0000117103,0.00001069572,0.0002014474],"genre_scores_gemma":[0.6437804,0.000004594736,0.3558465,0.0001365139,0.000145915,1.093895e-7,0.00001555676,0.000004302902,0.00006607374],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5047215,"threshold_uncertainty_score":0.5032644,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000503991,0.0003132837,0.0007434304,0.001842861,0.0001596299,0.0001226436,0.00104747,0.0002218514,0.00004897523],"category_scores_gemma":[0.0001216749,0.0003008966,0.0002669076,0.001280869,0.0003671368,0.0005790067,0.0007478647,0.0004070039,0.000002560563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002073566,"about_ca_system_score_gemma":0.0009034653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001506692,"about_ca_topic_score_gemma":0.000001849751,"domain_scores_codex":[0.9974447,0.000262882,0.0007361546,0.0004196933,0.0009107428,0.000225837],"domain_scores_gemma":[0.9954107,0.0007738757,0.001650593,0.0002608017,0.001674871,0.0002291712],"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.001058518,0.001731416,0.009199131,0.001408668,0.003452576,0.0004158312,0.001698452,0.3612086,0.009177788,0.5357504,0.04418994,0.03070862],"study_design_scores_gemma":[0.0139547,0.002665391,0.05408159,0.00221135,0.0007786751,0.0008394996,0.000535835,0.0957729,0.01761841,0.7409163,0.06725308,0.003372348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2590362,0.0006407818,0.7372045,0.001229788,0.0007769946,0.0001801129,0.0001301577,0.00002881948,0.0007726892],"genre_scores_gemma":[0.9677948,0.000168791,0.0310596,0.0001187685,0.0001655187,3.416199e-7,0.00004191581,0.00001504915,0.0006352297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7087587,"threshold_uncertainty_score":0.9999443,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001164782,0.0003830366,0.0006718689,0.00174259,0.0007434073,0.0007101864,0.002783124,0.0002718547,0.00003894507],"category_scores_gemma":[0.0007874458,0.0003531207,0.0003452826,0.0006806855,0.0003704673,0.001397773,0.0005844717,0.0007958824,0.000002998259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002467986,"about_ca_system_score_gemma":0.003663664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008383801,"about_ca_topic_score_gemma":0.000005962849,"domain_scores_codex":[0.9968303,0.0003047244,0.0006676365,0.0006703563,0.001164432,0.0003625004],"domain_scores_gemma":[0.9926482,0.002023368,0.001794163,0.00107695,0.002198689,0.000258627],"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.0003971031,0.0001978206,0.0001115626,0.00006895783,0.0003765476,0.00007431514,0.00005168582,0.6811835,0.00002095135,0.3128666,0.002951849,0.001699196],"study_design_scores_gemma":[0.004762011,0.0008076054,0.007252589,0.0003650608,0.0006139821,0.0003974043,0.00009920933,0.7059001,0.0001436606,0.2555863,0.02324439,0.0008277033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006383232,0.0002140587,0.9839032,0.007216506,0.0009529592,0.0004736065,0.0003581611,0.0000533807,0.0004448832],"genre_scores_gemma":[0.6073247,0.00001620189,0.3914092,0.0001471731,0.000493011,6.922366e-7,0.0005154528,0.0000175878,0.00007598422],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6009415,"threshold_uncertainty_score":0.9998921,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002072713,0.0001233409,0.0002895193,0.0005179658,0.0001338869,0.00006180119,0.001206944,0.0000512241,0.00001648852],"category_scores_gemma":[0.0001892727,0.00009037011,0.0003219879,0.003208898,0.0001049128,0.0005401364,0.0002344959,0.0002720985,0.000006022785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006422744,"about_ca_system_score_gemma":0.00007027123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006397291,"about_ca_topic_score_gemma":4.285424e-7,"domain_scores_codex":[0.9984118,0.0001578275,0.0003496317,0.0002148268,0.0007270359,0.0001388962],"domain_scores_gemma":[0.9981358,0.0005576606,0.0006563794,0.000152993,0.000365971,0.0001311682],"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.00007736773,0.0001494133,0.002020077,0.00002960776,0.0001812893,0.0000614033,0.0004397725,0.92834,0.0001044124,0.05711948,0.0005078461,0.01096935],"study_design_scores_gemma":[0.004199348,0.002361826,0.2555791,0.0004224987,0.0004359775,0.0001765681,0.002470284,0.6491738,0.001343987,0.06273144,0.01995593,0.001149305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2481053,0.00005838316,0.7476057,0.003692244,0.0001236976,0.00004079085,0.00001302603,0.00001247786,0.0003482859],"genre_scores_gemma":[0.9774122,0.00001430045,0.02194392,0.0005075432,0.00004591174,3.485991e-8,0.000002223479,0.000003299866,0.0000706362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7293068,"threshold_uncertainty_score":0.3685186,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004316432,0.0001827889,0.0002875226,0.00133733,0.0002454124,0.000206594,0.0008274965,0.00008602114,0.0001352848],"category_scores_gemma":[0.0001220372,0.000183016,0.0002973929,0.001560215,0.00006134825,0.001659138,0.0001393496,0.0001881167,0.00003411317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001281621,"about_ca_system_score_gemma":0.0004106703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006545843,"about_ca_topic_score_gemma":0.00000110479,"domain_scores_codex":[0.9982504,0.0001088459,0.0004750619,0.0002574726,0.0006345611,0.000273617],"domain_scores_gemma":[0.9965973,0.0008024123,0.0005385073,0.0001726206,0.001658134,0.0002309735],"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.0001034437,0.0002750888,0.0009359188,0.00003545195,0.0002612936,0.00004661219,0.0002074882,0.3678334,0.0008934316,0.5402594,0.009326005,0.07982241],"study_design_scores_gemma":[0.005664669,0.00170356,0.0348998,0.00006896485,0.0001138815,0.0005231142,0.0004051537,0.3093488,0.001287098,0.5043012,0.1407173,0.0009663834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1669606,0.0000857313,0.8301477,0.001035202,0.0004544161,0.0002107716,0.00001176881,0.00003557342,0.001058272],"genre_scores_gemma":[0.869669,0.00001061835,0.1287645,0.0004295422,0.0003413162,0.00000106004,0.00003023191,0.00001127614,0.0007424597],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7027084,"threshold_uncertainty_score":0.7463175,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003331599,0.0001098607,0.0003641681,0.001101106,0.0002453575,0.00009318297,0.001200877,0.00007009265,0.00004788245],"category_scores_gemma":[0.0002286544,0.00009831235,0.0001798278,0.0009604903,0.0002798337,0.0008536158,0.0004211469,0.0001480875,0.000003147999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002501434,"about_ca_system_score_gemma":0.00009073797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003811605,"about_ca_topic_score_gemma":0.000002376633,"domain_scores_codex":[0.9988829,0.0000910825,0.0003028359,0.0001930432,0.0003727267,0.0001574439],"domain_scores_gemma":[0.9978304,0.0004602655,0.0008164295,0.0002884603,0.0004542263,0.0001502099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0004560176,0.001404108,0.1903511,0.0001248436,0.001968704,0.002399066,0.0005697543,0.1707972,0.00105943,0.5486358,0.004301602,0.07793237],"study_design_scores_gemma":[0.006136776,0.002147906,0.786684,0.0001113496,0.0004492634,0.0007660716,0.0007225183,0.05264401,0.0009395173,0.1307723,0.01773727,0.0008889242],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8709431,0.0001438777,0.1264608,0.0008462792,0.0001741055,0.00003061748,0.00001929842,0.000009541895,0.001372412],"genre_scores_gemma":[0.9735314,0.00008624156,0.02603737,0.00006274862,0.0000243354,1.601152e-8,0.00000260925,0.000002484768,0.0002528486],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5963329,"threshold_uncertainty_score":0.4009061,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001553082,0.0003620736,0.0006934287,0.003414769,0.0001863055,0.0003064952,0.001377777,0.0003339707,0.00001064127],"category_scores_gemma":[0.0003721994,0.0004280789,0.000489592,0.001920559,0.00007790829,0.0006502465,0.0005276867,0.00084646,0.000003362489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000874009,"about_ca_system_score_gemma":0.004850964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001934267,"about_ca_topic_score_gemma":0.00001009349,"domain_scores_codex":[0.9968038,0.000274519,0.000909497,0.0005259778,0.001106725,0.0003794465],"domain_scores_gemma":[0.9945424,0.001102782,0.001347911,0.0002749641,0.002429456,0.0003024733],"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.0002381634,0.0002923801,0.0006332129,0.00006774354,0.0001280112,0.0001198796,0.000161217,0.8826686,0.00002236467,0.1115233,0.0009770999,0.003168068],"study_design_scores_gemma":[0.007495122,0.0006854995,0.004461107,0.0003608651,0.0001291553,0.00008910411,0.0001277957,0.7745423,0.000121967,0.2012642,0.009923155,0.0007996496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1941591,0.0001755222,0.8004279,0.001025901,0.003262806,0.0003605235,0.00006752367,0.00003959415,0.0004811899],"genre_scores_gemma":[0.9273632,0.000007049814,0.07139643,0.000203941,0.0007238099,0.00000175496,0.0001631759,0.00002108567,0.0001195425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7332041,"threshold_uncertainty_score":0.9998171,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002582711,0.0001536432,0.0003773201,0.001047296,0.0001242743,0.00005601335,0.0002013655,0.0001090519,0.0005082666],"category_scores_gemma":[0.000508349,0.0001419213,0.0001321725,0.0008555739,0.000187788,0.0004847172,0.0001107981,0.0003296644,0.00003610947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008223005,"about_ca_system_score_gemma":0.0001254303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002378386,"about_ca_topic_score_gemma":0.000002147499,"domain_scores_codex":[0.9987202,0.000130454,0.0003677095,0.0001540556,0.0003918595,0.0002357514],"domain_scores_gemma":[0.9970005,0.001764209,0.0004394341,0.00009735092,0.0004589159,0.0002396503],"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.0001761206,0.001008749,0.02790563,0.0001545665,0.0009587336,0.0005564913,0.0006187165,0.002100809,0.0005795847,0.9109327,0.02840922,0.0265987],"study_design_scores_gemma":[0.005049344,0.001143813,0.227843,0.00009539257,0.0004864435,0.00341471,0.003746381,0.003712673,0.0001959963,0.7123383,0.04116675,0.0008071609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9181284,0.0001131659,0.07742473,0.002359576,0.0001674981,0.0001133595,0.000004216852,0.0000214453,0.001667629],"genre_scores_gemma":[0.9450375,0.0000408445,0.05357477,0.0001787152,0.0001495286,1.841143e-7,0.000003004044,0.00001296983,0.001002504],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1999374,"threshold_uncertainty_score":0.5787383,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004331665,0.0002111713,0.0005148087,0.001577439,0.000144987,0.00003748654,0.0004471802,0.0001085628,0.0005936348],"category_scores_gemma":[0.000585868,0.0001490389,0.0004516709,0.001821315,0.0001283825,0.0005729068,0.0001137155,0.0002116735,0.00002522385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002141903,"about_ca_system_score_gemma":0.0001725422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005540753,"about_ca_topic_score_gemma":0.000008671357,"domain_scores_codex":[0.9980366,0.0001062553,0.0003824821,0.0002111145,0.001016407,0.0002471203],"domain_scores_gemma":[0.9959695,0.001587971,0.001013043,0.0001801315,0.001043747,0.0002056547],"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.001246034,0.002349694,0.1633555,0.0008355762,0.009452337,0.004313601,0.0001792877,0.007067334,0.0003482507,0.4108568,0.3519997,0.04799588],"study_design_scores_gemma":[0.01129487,0.001123383,0.158992,0.003530684,0.002670989,0.00123692,0.001364021,0.002003785,0.0003285482,0.6774681,0.137894,0.002092764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4933503,0.001290837,0.4882897,0.01483758,0.0002976021,0.0001359417,0.00004101474,0.00004693457,0.001710189],"genre_scores_gemma":[0.9746157,0.0001608743,0.01035605,0.0003702783,0.0002598472,1.477866e-7,0.000004305666,0.00002540702,0.01420742],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4812654,"threshold_uncertainty_score":0.6499885,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004548576,0.0002467847,0.0004359401,0.001644683,0.00009001813,0.0003575865,0.002450177,0.0001433774,0.00002618337],"category_scores_gemma":[0.00005969373,0.0002593813,0.0002949728,0.001087938,0.00007102116,0.001269562,0.001550719,0.0006428237,0.00001012708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003705178,"about_ca_system_score_gemma":0.0008727638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001527057,"about_ca_topic_score_gemma":0.000001539044,"domain_scores_codex":[0.9978499,0.0001228574,0.000419215,0.0003197709,0.0009987715,0.0002895032],"domain_scores_gemma":[0.9974579,0.0001278592,0.000833536,0.0003258219,0.0009741058,0.0002808356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001047483,0.0003782045,0.00180335,0.0001691758,0.0009627913,0.001889933,0.0007695828,0.7898395,0.000005076491,0.1200182,0.05466631,0.02939311],"study_design_scores_gemma":[0.005720398,0.0009825489,0.02754495,0.0006255062,0.0005762839,0.0003887353,0.001040807,0.2120792,0.00008022236,0.2031505,0.5455976,0.002213348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02430869,0.0002680916,0.9661035,0.0009494898,0.003388976,0.0001218546,0.00005456801,0.00006757434,0.004737266],"genre_scores_gemma":[0.6644813,0.000244068,0.3279112,0.0003536012,0.001875565,2.822842e-7,0.0001943926,0.00003948395,0.004900143],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6401726,"threshold_uncertainty_score":0.9999858,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003663197,0.00008840825,0.0001741961,0.0006204002,0.0001026915,0.00002713116,0.0006471408,0.00003664063,0.000007580615],"category_scores_gemma":[0.0002248286,0.0000570459,0.0001349521,0.0007080567,0.00005864996,0.0004554295,0.0001162807,0.00005724447,0.000001044776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007602316,"about_ca_system_score_gemma":0.0001229058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001570507,"about_ca_topic_score_gemma":1.5687e-7,"domain_scores_codex":[0.9990538,0.00005099151,0.0003117552,0.0001221562,0.0003431429,0.000118189],"domain_scores_gemma":[0.9971112,0.001204018,0.0006396044,0.0001336684,0.0008553332,0.00005619586],"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.0002145422,0.0002311998,0.001575482,0.0000625784,0.0002774185,0.00004211207,0.0005623201,0.2425138,0.003494963,0.7130112,0.003737821,0.03427656],"study_design_scores_gemma":[0.004922374,0.001966066,0.006696316,0.000711182,0.0001606401,0.0003530582,0.0003039049,0.8388153,0.01281068,0.1293701,0.003355714,0.0005347129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02874272,0.00002546003,0.9694834,0.001210098,0.0002422334,0.0001197913,0.000005244491,0.0000225782,0.0001484514],"genre_scores_gemma":[0.4807972,0.000003053361,0.5189899,0.00004740432,0.00003686553,1.980014e-7,5.694703e-7,0.000004118971,0.0001206882],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5963015,"threshold_uncertainty_score":0.2326264,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003714977,0.0001558207,0.0002490768,0.0009247123,0.0005288747,0.0004006527,0.0009485638,0.00007668456,0.00002869232],"category_scores_gemma":[0.0001238828,0.0001590609,0.0001234939,0.0003771738,0.00009777942,0.001775731,0.0003152146,0.000225218,0.0000117977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007490083,"about_ca_system_score_gemma":0.0001850851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001033098,"about_ca_topic_score_gemma":0.000004445116,"domain_scores_codex":[0.9986403,0.00007430752,0.0002973666,0.0002390487,0.0005515052,0.0001974827],"domain_scores_gemma":[0.9980263,0.0002845562,0.0006567106,0.0002666846,0.0005662717,0.0001995177],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0004117433,0.0004516712,0.03607296,0.0001198155,0.0009908316,0.002837664,0.0008236904,0.237386,0.001159167,0.2207735,0.01732393,0.481649],"study_design_scores_gemma":[0.006109811,0.000951229,0.6902185,0.0001524287,0.0001567437,0.002249093,0.0001999284,0.08927725,0.0006118878,0.0561374,0.1529264,0.001009308],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3961055,0.0000843818,0.5978791,0.003174711,0.0005044055,0.00006388726,0.000006814359,0.00002089333,0.002160398],"genre_scores_gemma":[0.9302503,0.00003044266,0.0684603,0.0003409731,0.0003047906,8.829125e-8,0.000005763838,0.000006883932,0.0006004574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6541455,"threshold_uncertainty_score":0.6486315,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002766675,0.0001334299,0.0002678372,0.001181435,0.0001013308,0.00009215397,0.000402478,0.00006454281,0.00004423729],"category_scores_gemma":[0.0000354249,0.0001369736,0.00009214191,0.001195681,0.00005285202,0.001580944,0.0001316052,0.0001365388,0.00000862691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007434069,"about_ca_system_score_gemma":0.0001812328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001372489,"about_ca_topic_score_gemma":4.092032e-7,"domain_scores_codex":[0.9986238,0.0001227373,0.0004549728,0.000170075,0.0004925216,0.0001358521],"domain_scores_gemma":[0.9980743,0.0002085012,0.0006928602,0.0001141629,0.0007744945,0.0001357083],"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.0002615031,0.002760369,0.01507227,0.0007165697,0.001299208,0.0002124131,0.004632812,0.2989098,0.1130741,0.4110468,0.001943319,0.1500709],"study_design_scores_gemma":[0.005488907,0.00220058,0.4366336,0.0004366436,0.0001538346,0.0007995158,0.0005075321,0.4700174,0.004229988,0.07268892,0.005834665,0.001008373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4934566,0.00002113019,0.5057763,0.0003945164,0.000114296,0.00008152871,0.000002290419,0.00001092957,0.0001423483],"genre_scores_gemma":[0.9095075,0.00003948072,0.08988791,0.0001524462,0.00005520293,3.149254e-7,0.00001657106,0.00000614064,0.0003344634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4215614,"threshold_uncertainty_score":0.5585623,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003503714,0.0001869792,0.0002834024,0.001174941,0.000733975,0.0004615825,0.001483,0.00007113507,0.00001622787],"category_scores_gemma":[0.00009443492,0.0001769027,0.0001659412,0.000764102,0.0001104378,0.002270213,0.0001637605,0.0002656665,0.000009727454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001107281,"about_ca_system_score_gemma":0.0003872507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001345241,"about_ca_topic_score_gemma":0.000005236716,"domain_scores_codex":[0.9982682,0.00008875074,0.0003141987,0.0002761569,0.0008211787,0.0002315119],"domain_scores_gemma":[0.9974672,0.0002345417,0.0008727183,0.0003601491,0.0008477575,0.0002176593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0003753092,0.0003133982,0.01161652,0.00004317398,0.0005498446,0.001146042,0.0007317152,0.7190493,0.0004165149,0.2388638,0.00254109,0.02435335],"study_design_scores_gemma":[0.01398241,0.00302621,0.5953817,0.0006302294,0.0003945897,0.002717979,0.0008971693,0.1748466,0.00262945,0.08622423,0.1170295,0.002239872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.230761,0.00008662563,0.7648448,0.001192391,0.0003960101,0.00008983851,0.000005898052,0.00003300745,0.002590433],"genre_scores_gemma":[0.9343609,0.00001632465,0.06463087,0.000131433,0.0001312268,1.519165e-7,0.000008271719,0.000008704124,0.0007120866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7035999,"threshold_uncertainty_score":0.7213882,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008977657,0.0001727222,0.0003210512,0.0008325056,0.0001923658,0.0001109931,0.0008802412,0.00007480218,0.000005377822],"category_scores_gemma":[0.00004683698,0.0001511246,0.000216534,0.001863347,0.00007100813,0.001225233,0.00006940283,0.0001979427,0.000002736924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002151262,"about_ca_system_score_gemma":0.0008630632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002371545,"about_ca_topic_score_gemma":0.000001214393,"domain_scores_codex":[0.9981867,0.0001815442,0.0004591375,0.0002361996,0.0007386953,0.0001977134],"domain_scores_gemma":[0.9953975,0.0008903874,0.0008150893,0.0001974077,0.002479571,0.0002200236],"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.0001324447,0.0003372569,0.0003373337,0.0000159239,0.0001309007,0.0000196965,0.0007365102,0.976826,0.0008656722,0.003239625,0.001174719,0.01618398],"study_design_scores_gemma":[0.002705121,0.00159692,0.005617647,0.00002677467,0.00008902432,0.00009338339,0.000944359,0.9783935,0.004138493,0.003443104,0.002726034,0.0002256674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1673638,0.0001037329,0.8311759,0.0002692066,0.0004369645,0.0002637815,0.00002594233,0.00001683508,0.0003438097],"genre_scores_gemma":[0.7997257,0.00001005739,0.1998645,0.00009527692,0.0001672664,2.233465e-7,0.00002166006,0.000008368565,0.0001069925],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6323619,"threshold_uncertainty_score":0.6162683,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005617158,0.00008557421,0.0001298317,0.0008958704,0.0001174304,0.0001584386,0.00149441,0.00002381376,0.00003727614],"category_scores_gemma":[0.00004348138,0.00006875353,0.0000758172,0.001581042,0.00008053795,0.000966931,0.0002771329,0.0001751808,0.00002465722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005970634,"about_ca_system_score_gemma":0.00005870712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008197043,"about_ca_topic_score_gemma":0.000004472869,"domain_scores_codex":[0.9989367,0.000116733,0.0002308539,0.0001328299,0.0004280743,0.0001548239],"domain_scores_gemma":[0.9990656,0.0002242486,0.0002402546,0.0001570613,0.0002652135,0.00004761369],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001694857,0.0009009962,0.02327871,0.00006789471,0.0003542263,0.003093329,0.005418618,0.02776005,0.0002355091,0.6305414,0.05686243,0.2513174],"study_design_scores_gemma":[0.003860918,0.001216881,0.2832867,0.0002118413,0.00005842344,0.0005476763,0.003561405,0.2508145,0.00004931114,0.03088773,0.4248625,0.000642158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.133373,0.00001965319,0.852122,0.002295775,0.0004047086,0.00007574246,0.000003689627,0.0000194683,0.01168592],"genre_scores_gemma":[0.9494106,0.000004480791,0.04952179,0.0006269725,0.0002067543,3.817796e-8,0.000003923115,0.000003174489,0.0002222659],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8160375,"threshold_uncertainty_score":0.2803688,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005043631,0.0001001624,0.0002340069,0.0004797356,0.0002237935,0.00008806149,0.0003237369,0.00003868094,0.0001829639],"category_scores_gemma":[0.0002983895,0.0001002701,0.00009260189,0.0002241162,0.0001918425,0.001023744,0.000183548,0.000108052,0.00001204637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004678254,"about_ca_system_score_gemma":0.0000483778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002274335,"about_ca_topic_score_gemma":0.00004084275,"domain_scores_codex":[0.9990966,0.00001793935,0.0003156028,0.0001354678,0.0003284742,0.0001059205],"domain_scores_gemma":[0.9985793,0.00005442479,0.0004981686,0.0001772497,0.0006634319,0.00002742154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.001327373,0.00139078,0.4528053,0.002742471,0.0008109485,0.0001981585,0.0003161437,0.2563565,0.0002092378,0.2531191,0.006974488,0.02374948],"study_design_scores_gemma":[0.00196036,0.00008393268,0.9119837,0.00008661853,0.0001916182,0.00001667906,0.0004955034,0.03103593,0.00001579987,0.02249996,0.03136582,0.0002640974],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9875595,0.000024208,0.003067689,0.001468356,0.0002940724,0.0001161602,0.000007359914,0.00001048209,0.007452155],"genre_scores_gemma":[0.9989262,0.00001111267,0.0006403808,0.0001259849,0.00008256344,7.538328e-8,0.00000748128,0.00000401076,0.0002021459],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4591784,"threshold_uncertainty_score":0.4088895,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005635735,0.000209929,0.0003599552,0.001853174,0.0001754928,0.0001635922,0.000975193,0.00009210804,0.0002332006],"category_scores_gemma":[0.00004616053,0.0002243814,0.0003321317,0.002246298,0.00004348957,0.001447994,0.0002344686,0.0003211493,0.0001385867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001947635,"about_ca_system_score_gemma":0.0004099558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003822362,"about_ca_topic_score_gemma":6.744673e-7,"domain_scores_codex":[0.997724,0.0001464547,0.0005049536,0.0003422288,0.001001728,0.0002806516],"domain_scores_gemma":[0.997668,0.0004119608,0.0005972962,0.0002366279,0.0008835862,0.0002025781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001716863,0.0002801432,0.007530789,0.00006505458,0.0004742538,0.0002977289,0.0009125161,0.6896392,0.002999983,0.2636084,0.009153525,0.02486676],"study_design_scores_gemma":[0.007073807,0.001506017,0.05954253,0.0002137667,0.0001373463,0.002000358,0.0005482953,0.2662038,0.0009295687,0.04445071,0.6159052,0.001488595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3526088,0.00009159531,0.6398996,0.001406471,0.0008928985,0.0001133323,0.00001319812,0.00003911117,0.00493503],"genre_scores_gemma":[0.9152117,0.00001498752,0.08147538,0.001112743,0.0002633962,1.330308e-7,0.00001614018,0.00001199668,0.001893458],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6067517,"threshold_uncertainty_score":0.9150007,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004821947,0.0001299737,0.000305266,0.0014769,0.00005435708,0.00004848708,0.0007062323,0.00009034704,0.00005611924],"category_scores_gemma":[0.00009667941,0.0001124352,0.0001345795,0.002154374,0.00006777971,0.00124281,0.0001367761,0.0001020919,0.000005976303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001599374,"about_ca_system_score_gemma":0.0002107736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001381783,"about_ca_topic_score_gemma":0.000005034318,"domain_scores_codex":[0.9983925,0.0001569227,0.0005451152,0.0001896815,0.0005229713,0.0001927747],"domain_scores_gemma":[0.9979921,0.0002740242,0.0007322985,0.0001659404,0.0007017601,0.0001338784],"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.0002427529,0.0009236686,0.05296422,0.00007754975,0.0003315168,0.000374664,0.0006184384,0.5627428,0.001331104,0.1653641,0.003639766,0.2113894],"study_design_scores_gemma":[0.00569216,0.0006734048,0.06869555,0.0005075244,0.00006929941,0.00009016405,0.0002313604,0.9050743,0.0005762329,0.006498214,0.01133471,0.0005570644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04606926,0.00006117822,0.9525827,0.0004570445,0.0002334631,0.00005959947,0.000006000699,0.00001623103,0.0005145403],"genre_scores_gemma":[0.9930031,0.0001029886,0.006220756,0.0001316241,0.00009588523,5.729885e-8,0.000008900752,0.000008379756,0.0004283546],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9469338,"threshold_uncertainty_score":0.4584973,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009006343,0.00008491495,0.0001939626,0.0004036059,0.00002102716,0.0000113848,0.00008756635,0.00003956816,0.000008086559],"category_scores_gemma":[0.00001218284,0.00007873104,0.00002718774,0.0002643267,0.00003011533,0.0002664021,0.00002309426,0.0000799802,4.781846e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004002325,"about_ca_system_score_gemma":0.00004307025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002918023,"about_ca_topic_score_gemma":0.000001074612,"domain_scores_codex":[0.9994892,0.0000130246,0.0001524639,0.0000571468,0.0001990205,0.00008908546],"domain_scores_gemma":[0.9994521,0.00005839783,0.0001295969,0.00003935248,0.0002087446,0.0001118196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000776697,0.00007477031,0.001147426,0.0002565708,0.0004625036,0.0002858056,0.0007567345,0.9334359,0.01862859,0.03850235,0.001782014,0.003890624],"study_design_scores_gemma":[0.05729759,0.01343228,0.02213322,0.002479359,0.002288117,0.004624806,0.01605394,0.09092398,0.1921187,0.1551268,0.4387238,0.004797437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9578728,0.0003231389,0.04082166,0.0000178694,0.000193899,0.00004368979,0.0000220244,0.00001994896,0.0006849872],"genre_scores_gemma":[0.9877239,0.00008234211,0.01208932,0.000008064466,0.00003707364,3.023687e-8,0.000006378146,0.00000995225,0.00004292776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.842512,"threshold_uncertainty_score":0.3210559,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005293917,0.0001845461,0.0002641765,0.002095424,0.0002212462,0.0001271121,0.0007763584,0.0001136381,0.00009308441],"category_scores_gemma":[0.0002327059,0.0001889459,0.0002348599,0.002494819,0.0000646506,0.0008676649,0.0001130727,0.0005872563,0.00003575117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000828335,"about_ca_system_score_gemma":0.0003521225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004355454,"about_ca_topic_score_gemma":0.00000419896,"domain_scores_codex":[0.9982142,0.0001280476,0.0004087591,0.0002818644,0.0007509005,0.0002162056],"domain_scores_gemma":[0.9972271,0.0006558099,0.0004953695,0.000229511,0.001155077,0.0002371111],"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.0002767992,0.0005839777,0.00086995,0.0000211127,0.0002575245,0.0004569656,0.0003059288,0.394228,0.004083152,0.5565662,0.00587614,0.03647425],"study_design_scores_gemma":[0.01163633,0.004364146,0.09882642,0.0002110515,0.0002049359,0.003228283,0.0004489538,0.4127997,0.01184893,0.2319971,0.2222909,0.002143246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6465034,0.00002233734,0.3474723,0.001381445,0.001633084,0.00009698795,0.000007356406,0.00006191541,0.002821143],"genre_scores_gemma":[0.9072021,0.00001025442,0.09183196,0.0004525429,0.0001524195,1.42187e-7,0.00001296771,0.000009329866,0.0003283375],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3245691,"threshold_uncertainty_score":0.7704991,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000778463,0.0003082383,0.0004888197,0.002075148,0.00018988,0.0001122135,0.001985819,0.000183971,0.00007209775],"category_scores_gemma":[0.0001731811,0.0002309372,0.000567002,0.001240104,0.0001603774,0.0004154846,0.0007290581,0.000636499,0.00001382566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003240763,"about_ca_system_score_gemma":0.0009796593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005213463,"about_ca_topic_score_gemma":8.16862e-7,"domain_scores_codex":[0.9969421,0.0003514769,0.0007032557,0.0003740289,0.001368329,0.0002608029],"domain_scores_gemma":[0.9947982,0.001744754,0.001628634,0.0004120036,0.00124379,0.0001725515],"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.0001756341,0.000231196,0.000194956,0.0000504691,0.0004503183,0.00009665996,0.0001531354,0.4731354,0.000239058,0.5156744,0.004531918,0.005066818],"study_design_scores_gemma":[0.005711794,0.001819588,0.02501159,0.001877482,0.0003760353,0.00044968,0.0002516957,0.08008636,0.002953183,0.8540021,0.02584321,0.001617297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2059255,0.0001329969,0.7864705,0.003721163,0.001382561,0.0001746417,0.0000592105,0.00002335473,0.002110066],"genre_scores_gemma":[0.9843145,0.00005197453,0.01432062,0.0004405985,0.0003188589,4.007984e-7,0.00001806511,0.00001438037,0.0005205831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.778389,"threshold_uncertainty_score":0.9417347,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001940684,0.00008455442,0.000201721,0.0002306892,0.00006265506,0.000016707,0.0001838007,0.00005286738,0.00007481533],"category_scores_gemma":[0.00001759551,0.00007572099,0.0001578996,0.0005618601,0.00003438529,0.0004803522,0.00003332541,0.0001504872,0.000001827583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008333952,"about_ca_system_score_gemma":0.00002590026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005120381,"about_ca_topic_score_gemma":4.477993e-7,"domain_scores_codex":[0.9991073,0.00004278728,0.0002897115,0.00005683129,0.0003509017,0.0001524817],"domain_scores_gemma":[0.9993442,0.0001301037,0.0001886109,0.00006561473,0.0001743806,0.00009709331],"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.00002014062,0.0000211548,0.000230151,0.000009947348,0.0001518125,0.0000021371,0.00007498721,0.9933633,0.0005382966,0.003207741,0.0005342756,0.001846105],"study_design_scores_gemma":[0.00126675,0.0001155815,0.003890936,0.00005399372,0.0003111862,0.00006586342,0.000513249,0.9796147,0.003513141,0.002867884,0.00747746,0.0003092136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5136527,0.0002572781,0.4852986,0.00005845038,0.0002673311,0.00003333277,0.00001437863,0.00001340654,0.0004044703],"genre_scores_gemma":[0.9983162,0.00006205883,0.001394569,0.00002556124,0.0001579959,5.59244e-8,0.000008634477,0.000008302972,0.0000266293],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4846635,"threshold_uncertainty_score":0.3087812,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005815089,0.0003504359,0.0005842397,0.002725228,0.0002230437,0.0002688437,0.001268924,0.0002781157,0.00003513324],"category_scores_gemma":[0.0000799468,0.0003882803,0.0003335296,0.001180964,0.0001163148,0.0008951764,0.000853029,0.0008303457,0.0000125811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000208603,"about_ca_system_score_gemma":0.0008327246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002564971,"about_ca_topic_score_gemma":0.000001913523,"domain_scores_codex":[0.9975006,0.0001984105,0.0006240464,0.000509973,0.0008805044,0.0002864756],"domain_scores_gemma":[0.9968522,0.000352569,0.001086753,0.0003029148,0.001073469,0.0003321583],"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.0004288776,0.0007260964,0.002816836,0.0004841758,0.001886813,0.001872816,0.002778365,0.3333571,0.0003518336,0.5454227,0.01022966,0.09964474],"study_design_scores_gemma":[0.005911377,0.001585363,0.06792969,0.0009417206,0.0006892581,0.002570345,0.000461805,0.09039583,0.0008436583,0.7467583,0.07912401,0.002788656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09115114,0.001466401,0.9021047,0.0007943499,0.001407011,0.0001558005,0.00002359851,0.00006007773,0.002836921],"genre_scores_gemma":[0.8271195,0.0002480218,0.1708119,0.0003756849,0.0005062924,3.598693e-7,0.00004526026,0.00002233974,0.0008706436],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7359684,"threshold_uncertainty_score":0.9998569,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004641227,0.0001455715,0.0002562795,0.0009543239,0.0001678613,0.0001516937,0.001287577,0.00006345377,0.0001202989],"category_scores_gemma":[0.00009133761,0.000140564,0.0001938167,0.002302722,0.0001157329,0.001756614,0.0003000547,0.0003726153,0.0001235133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001521967,"about_ca_system_score_gemma":0.0001790822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006557852,"about_ca_topic_score_gemma":7.492534e-7,"domain_scores_codex":[0.9982253,0.0002002199,0.0003201003,0.0002070326,0.0006908852,0.0003564507],"domain_scores_gemma":[0.9974772,0.0006698347,0.0003691413,0.0002361305,0.0009724533,0.000275222],"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.00005696555,0.0001643724,0.004815128,0.00001486138,0.0001626381,0.0003412107,0.0002054849,0.5422246,0.0001265445,0.4099393,0.006435083,0.0355138],"study_design_scores_gemma":[0.002148367,0.0008598766,0.04266904,0.00009691447,0.0000311811,0.0004971048,0.0003551559,0.04586092,0.0001498447,0.8690964,0.03765872,0.0005764487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1005744,0.0001279368,0.8945165,0.001563766,0.0003247997,0.0001296122,0.000001273556,0.00004133288,0.002720303],"genre_scores_gemma":[0.8810544,0.00002692562,0.1173304,0.0003946529,0.000218296,2.396878e-7,0.000001984856,0.00001139047,0.0009616709],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.78048,"threshold_uncertainty_score":0.5732033,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000220643,0.0001567566,0.0002155528,0.0009646759,0.000229582,0.0002062031,0.0004948545,0.00005290845,0.0000276463],"category_scores_gemma":[0.00001384615,0.0001277901,0.00007018178,0.001636744,0.00008204442,0.00151098,0.0001251182,0.0001701827,0.0000154287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006687808,"about_ca_system_score_gemma":0.0002827999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001256022,"about_ca_topic_score_gemma":0.000002699499,"domain_scores_codex":[0.9988914,0.00007265259,0.0002751,0.0002274235,0.0003696359,0.0001638357],"domain_scores_gemma":[0.9980198,0.0002905385,0.0003740974,0.0001355735,0.0009900946,0.0001898714],"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.00008836829,0.0003924823,0.005575394,0.00007820976,0.0005189663,0.0001054427,0.001208174,0.6296462,0.002554037,0.1152404,0.003469928,0.2411224],"study_design_scores_gemma":[0.007277054,0.002845906,0.1933598,0.0002863918,0.000177243,0.003171699,0.002518573,0.5631488,0.004934465,0.1523362,0.06786022,0.002083632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2959051,0.0001365885,0.7024478,0.0007338341,0.00007431034,0.0001378259,0.00000261743,0.00001856771,0.0005432873],"genre_scores_gemma":[0.9030314,0.00003391899,0.09634443,0.0002213555,0.0001023424,0.000001404502,0.000007271465,0.000006056124,0.0002517818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6071263,"threshold_uncertainty_score":0.5211129,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001406052,0.0001028441,0.0001921962,0.0003668807,0.00006590703,0.00002107482,0.0001829533,0.00005927249,0.0003187995],"category_scores_gemma":[0.00002187715,0.000107971,0.0001042848,0.0004325405,0.00004394215,0.0003055416,0.0000339,0.0001170544,0.00003077868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001408665,"about_ca_system_score_gemma":0.00005128943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001444395,"about_ca_topic_score_gemma":5.819949e-7,"domain_scores_codex":[0.9992935,0.00002023359,0.0002185004,0.00008805366,0.000237859,0.0001418724],"domain_scores_gemma":[0.9992216,0.00006243574,0.0001196676,0.00008468487,0.0004023347,0.0001093135],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008910043,0.0004407739,0.002373043,0.0004333105,0.001285452,0.0005064281,0.001328738,0.7874675,0.05564006,0.0693521,0.0506648,0.02961677],"study_design_scores_gemma":[0.003631164,0.001054306,0.007264801,0.0001289517,0.0002074112,0.0003633329,0.0004660486,0.02476369,0.04192605,0.06332825,0.8559956,0.0008704262],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7393597,0.00005430501,0.2559464,0.0001058329,0.001009562,0.00004555568,0.00002413028,0.00004775971,0.003406765],"genre_scores_gemma":[0.9799827,0.00004145758,0.01920215,0.0001193907,0.00034545,3.429681e-8,0.000002755738,0.00001326167,0.0002927702],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8053308,"threshold_uncertainty_score":0.4402932,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004643142,0.0001205904,0.0004047323,0.0004391508,0.0001062466,0.0000205058,0.0006357206,0.00006967716,0.0002403246],"category_scores_gemma":[0.000455279,0.00007560623,0.0002841003,0.001344115,0.0002930964,0.0002811232,0.0001432503,0.0001806691,0.000002923076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004024403,"about_ca_system_score_gemma":0.0002120323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009230633,"about_ca_topic_score_gemma":0.000009815614,"domain_scores_codex":[0.9983064,0.00008946888,0.0006487488,0.0000786741,0.000722759,0.0001539652],"domain_scores_gemma":[0.9947214,0.001943385,0.001518319,0.0001650431,0.001599202,0.00005271563],"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.0005028241,0.001001429,0.106707,0.001654463,0.002403721,0.00002121461,0.002421832,0.01001982,0.001023176,0.8537062,0.01039999,0.01013836],"study_design_scores_gemma":[0.002575441,0.0004581554,0.07513595,0.0004758638,0.0003915805,0.000134367,0.01251951,0.0009886244,0.007690644,0.8915107,0.007757821,0.0003613393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.984184,0.0002057032,0.01003736,0.0006593841,0.0002053256,0.0001309207,0.00002969184,0.000004171502,0.004543398],"genre_scores_gemma":[0.995597,0.00004615375,0.003185751,0.00002421045,0.00004296272,1.293134e-7,8.629081e-7,0.000007898364,0.001095013],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03780454,"threshold_uncertainty_score":0.3083133,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008783101,0.0001258615,0.0002382008,0.0007630931,0.0002081111,0.00008460236,0.0004376173,0.00006049029,0.0000188276],"category_scores_gemma":[0.00052553,0.00009961311,0.0001485195,0.001417083,0.00009167515,0.0005179485,0.0001112091,0.0002530782,0.000008125433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002784589,"about_ca_system_score_gemma":0.0005012171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001597738,"about_ca_topic_score_gemma":0.000005195921,"domain_scores_codex":[0.9985389,0.00009762262,0.0003555162,0.0001005198,0.0006940332,0.0002134296],"domain_scores_gemma":[0.9967095,0.001221014,0.0005434261,0.0001022973,0.00124639,0.0001773854],"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.0005233315,0.0002111066,0.001036106,0.0001163853,0.000495003,0.0003536539,0.001292731,0.06377771,0.00001581349,0.9037901,0.02316171,0.005226377],"study_design_scores_gemma":[0.003681948,0.0007390635,0.0005241755,0.0001408508,0.0001866686,0.0004519961,0.01409362,0.002010681,0.0001326688,0.5510988,0.4265146,0.0004249244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6668831,0.0005940424,0.2873294,0.002188629,0.0009547714,0.0002180688,0.00002478762,0.00007179617,0.04173538],"genre_scores_gemma":[0.9727136,0.00007242115,0.019795,0.00007452845,0.0002837643,9.755932e-8,0.000003304414,0.00001834211,0.00703888],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4033529,"threshold_uncertainty_score":0.4062105,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003143654,0.0001303684,0.0002760039,0.00151018,0.0001493473,0.00007332696,0.0008498962,0.00006291478,0.00009342945],"category_scores_gemma":[0.00004026096,0.0001017349,0.0001690262,0.003900781,0.00007893927,0.001566596,0.0002059357,0.0002149175,0.00003541619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001074733,"about_ca_system_score_gemma":0.0001039335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000127949,"about_ca_topic_score_gemma":0.000002540578,"domain_scores_codex":[0.9985963,0.00006787454,0.0002516822,0.0001523531,0.0006427655,0.0002889968],"domain_scores_gemma":[0.9984903,0.0002656093,0.0003577393,0.0001652014,0.0004204744,0.0003007056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000634286,0.001850536,0.2848311,0.00005486072,0.001750111,0.0009374954,0.001157673,0.1675667,0.0003465574,0.3804139,0.01200826,0.1484485],"study_design_scores_gemma":[0.00594636,0.002535523,0.5458886,0.00008912552,0.0006188864,0.001947147,0.001121113,0.01323878,0.0008790863,0.01404041,0.4121081,0.001586817],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3391887,0.00009389766,0.6571289,0.0005611661,0.0001877934,0.00003112168,0.000006821705,0.00002316807,0.00277842],"genre_scores_gemma":[0.9524114,0.00001562273,0.0466916,0.0002223837,0.0002325663,4.28103e-8,0.000005402003,0.000004122875,0.0004168769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6132227,"threshold_uncertainty_score":0.414863,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009438347,0.00009936432,0.0002657254,0.000888065,0.00002012225,0.000004576305,0.0002401401,0.00005173183,0.00009300581],"category_scores_gemma":[0.00004405129,0.00007834666,0.0001588225,0.0007761957,0.0000666051,0.000280349,0.00003128444,0.0001048654,0.000004916802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000155382,"about_ca_system_score_gemma":0.00004267737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000295208,"about_ca_topic_score_gemma":7.235128e-7,"domain_scores_codex":[0.9991877,0.00002279513,0.0002754659,0.00007089126,0.0003261559,0.0001169989],"domain_scores_gemma":[0.9991743,0.000164473,0.0002006932,0.00007267926,0.0002927039,0.00009518307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002739024,0.0001618969,0.005162664,0.0001009617,0.001085713,0.0003429957,0.0001002734,0.7472426,0.02020455,0.01016185,0.004014009,0.2111486],"study_design_scores_gemma":[0.01623446,0.00414206,0.183715,0.002001236,0.001651555,0.001141269,0.001649978,0.03365462,0.2009397,0.1070068,0.44399,0.003873306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2415022,0.00008157432,0.7546173,0.0001725184,0.00008904705,0.00002723085,0.00001573266,0.00005133709,0.003443104],"genre_scores_gemma":[0.9667063,0.00009663072,0.03292622,0.00001456715,0.00005121072,3.129318e-8,0.000001847851,0.00001017367,0.0001929724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7252041,"threshold_uncertainty_score":0.3194884,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005524803,0.0001613748,0.0002848167,0.001391435,0.0001340898,0.00006660689,0.0009529729,0.00007128181,0.00008303735],"category_scores_gemma":[0.00008916415,0.0001324198,0.0002328468,0.001986423,0.00006017667,0.0006131898,0.0000613526,0.0002852838,0.00004049435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009244758,"about_ca_system_score_gemma":0.0003245971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004219824,"about_ca_topic_score_gemma":9.238238e-7,"domain_scores_codex":[0.9981113,0.0001878707,0.0004309389,0.0002162739,0.0008793834,0.0001742138],"domain_scores_gemma":[0.9969891,0.001296329,0.0006604027,0.000244575,0.0007019151,0.0001076795],"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.0001038407,0.000132643,0.0006929939,0.0000161583,0.0001476517,0.00003362471,0.0002402323,0.2469933,0.0004522886,0.7462987,0.002971007,0.001917574],"study_design_scores_gemma":[0.01076946,0.006479016,0.1060261,0.0006081372,0.0002846241,0.0008200505,0.002077737,0.2566718,0.00756347,0.5297523,0.07706305,0.001884265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5313244,0.00007717082,0.4632567,0.001758304,0.0007077218,0.000158032,0.00001187291,0.0000193913,0.002686439],"genre_scores_gemma":[0.9835957,0.00002044728,0.01527348,0.0004368649,0.00008613258,1.465348e-7,0.00001142865,0.000007180133,0.0005685716],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4522714,"threshold_uncertainty_score":0.5399923,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004185922,0.0001334058,0.0001654358,0.0006956431,0.0003949498,0.0001412179,0.0005171624,0.00005316161,0.00001800179],"category_scores_gemma":[0.00009025353,0.000112693,0.00008566782,0.001453276,0.0001523429,0.0006655,0.000116896,0.000190157,0.000005953937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001202826,"about_ca_system_score_gemma":0.0001949147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004052058,"about_ca_topic_score_gemma":0.000001330481,"domain_scores_codex":[0.998689,0.000118085,0.0002961261,0.0002189301,0.0005203676,0.0001575205],"domain_scores_gemma":[0.9980662,0.0004512519,0.0004223882,0.0001715056,0.0007754336,0.0001132006],"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.0001981498,0.0001445127,0.0003423818,0.00001078316,0.0001128512,0.00005037058,0.0004226692,0.6681176,0.0008454816,0.3129981,0.001116747,0.01564034],"study_design_scores_gemma":[0.001743388,0.0009413643,0.01376642,0.00007302936,0.00006949489,0.0005034826,0.0002545419,0.9303777,0.001353612,0.02167502,0.02885813,0.0003837874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3349638,0.00006668068,0.6635132,0.0008949733,0.0002625954,0.00005521533,0.000003909726,0.00001280217,0.0002267874],"genre_scores_gemma":[0.9399724,0.00001308428,0.05910705,0.000368912,0.0003241051,8.235111e-8,0.000004919606,0.00000586585,0.0002035707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6050087,"threshold_uncertainty_score":0.4595487,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004222701,0.0001346164,0.0002437565,0.001105265,0.0001296564,0.0001280115,0.00092409,0.00008266805,0.00002645342],"category_scores_gemma":[0.00005326219,0.0001357151,0.0001702551,0.0009378103,0.00005108683,0.001569181,0.0001650254,0.0003103836,0.00001072758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002324358,"about_ca_system_score_gemma":0.0002623531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002927521,"about_ca_topic_score_gemma":0.000001730117,"domain_scores_codex":[0.9985156,0.0001135467,0.0002829862,0.000274303,0.0005375901,0.0002759925],"domain_scores_gemma":[0.9978933,0.0005335857,0.0002840828,0.0002341601,0.000825826,0.0002290349],"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.001039562,0.0002981387,0.001046842,0.00004855289,0.0001835622,0.00004535111,0.0001905847,0.8639044,0.002182045,0.01684931,0.0003532193,0.1138584],"study_design_scores_gemma":[0.003598334,0.002037266,0.00921838,0.0000303955,0.00002149704,0.0001051912,0.0001411463,0.9542325,0.0001519749,0.006785677,0.02343495,0.0002427287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1010824,0.00001430294,0.8973471,0.0005105674,0.0004936161,0.0002521406,0.000009540297,0.00003300637,0.0002572883],"genre_scores_gemma":[0.7817234,0.000005835636,0.2166225,0.0002292153,0.000228208,6.022067e-7,0.0000126684,0.00001535789,0.001162142],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6807246,"threshold_uncertainty_score":0.5534301,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002131493,0.0001049026,0.00017472,0.0009540661,0.0001202346,0.00009408146,0.0004943711,0.00004841381,0.00004572033],"category_scores_gemma":[0.0001412822,0.00008758417,0.0001648954,0.0009540679,0.00003807618,0.000701288,0.00005200825,0.00007094296,0.000009244714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000142157,"about_ca_system_score_gemma":0.0003902408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001963659,"about_ca_topic_score_gemma":9.16789e-7,"domain_scores_codex":[0.9989715,0.00005384926,0.0002509538,0.0001680023,0.0004043882,0.000151289],"domain_scores_gemma":[0.9983546,0.0005598674,0.0003642839,0.0001352158,0.0004113222,0.0001747832],"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.0002175508,0.0002176095,0.004402481,0.00003489834,0.0001846071,0.00009036636,0.0001014036,0.122216,0.0003471026,0.6233274,0.01608606,0.2327745],"study_design_scores_gemma":[0.01464379,0.002231414,0.0106567,0.0004658832,0.0001773924,0.0001706358,0.000234317,0.5083359,0.001690043,0.1160462,0.3443659,0.0009817199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008610179,0.000007118632,0.9891564,0.001541075,0.0003057911,0.00006245742,0.0000164526,0.00002848204,0.0002720879],"genre_scores_gemma":[0.8194418,0.000009878584,0.1789252,0.0007305903,0.0002731156,1.104259e-7,0.00001906719,0.00001191366,0.000588351],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8108316,"threshold_uncertainty_score":0.3571579,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001043256,0.0003382529,0.0006898478,0.002881485,0.0002704721,0.0001905266,0.001328906,0.0002922415,0.00001384557],"category_scores_gemma":[0.0003093706,0.0003836446,0.0005982803,0.00141908,0.00009077283,0.0008679348,0.0005006448,0.0005336505,0.000003224757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003593306,"about_ca_system_score_gemma":0.001399414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006803937,"about_ca_topic_score_gemma":0.000002306944,"domain_scores_codex":[0.9969966,0.0002825182,0.00101832,0.0005239077,0.0009060115,0.0002725967],"domain_scores_gemma":[0.9929143,0.001006719,0.002347205,0.0003742673,0.003086088,0.0002713991],"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.0001539158,0.0002883981,0.000105362,0.0002968168,0.0002410777,0.00001181984,0.0002222084,0.9487428,0.0005309502,0.02690605,0.000973956,0.02152666],"study_design_scores_gemma":[0.004977685,0.001392909,0.005505126,0.001835127,0.0004984897,0.0003181903,0.0002204776,0.774337,0.005354456,0.1849324,0.01940188,0.001226301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07442898,0.0002366387,0.9221187,0.001023441,0.001319582,0.0003419839,0.00009001214,0.00004302667,0.0003976133],"genre_scores_gemma":[0.7167227,0.00005999158,0.2822886,0.0001543855,0.0003865053,0.000001539108,0.0001868789,0.00002041672,0.000178972],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6422938,"threshold_uncertainty_score":0.9998615,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006185744,0.0004017652,0.0007897117,0.001835361,0.0003478678,0.0002560382,0.0003305273,0.0003369823,0.00003969661],"category_scores_gemma":[0.0003221173,0.0003981282,0.0003919457,0.0009453371,0.0001892751,0.0001971501,0.0002107524,0.001267866,6.806058e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005318048,"about_ca_system_score_gemma":0.001418187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008572763,"about_ca_topic_score_gemma":0.0001638316,"domain_scores_codex":[0.9975697,0.0003957429,0.0005954406,0.000429505,0.0007321724,0.000277406],"domain_scores_gemma":[0.9958359,0.0008177881,0.001010493,0.0003771072,0.001644455,0.0003142443],"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.001069136,0.001216277,0.003438554,0.0008338786,0.002076925,0.001570562,0.001352191,0.9765366,0.0003800225,0.004882297,0.001816085,0.004827527],"study_design_scores_gemma":[0.01394974,0.004976028,0.01881393,0.004342153,0.005001093,0.001434409,0.008712833,0.8539252,0.0004511871,0.007257168,0.07729732,0.003838999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4053205,0.0002547718,0.5887634,0.001218255,0.0006458299,0.0003548323,0.0001521763,0.00004938589,0.00324086],"genre_scores_gemma":[0.5665647,0.0000486065,0.4300915,0.0002428486,0.0002517394,0.000001095204,0.00004153051,0.00005823604,0.002699781],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1612442,"threshold_uncertainty_score":0.9998471,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002066623,0.00007898255,0.0002937609,0.001625564,0.0001331829,0.000006436653,0.0001673361,0.00002412677,0.0001156504],"category_scores_gemma":[0.00004175549,0.00008444212,0.0002951791,0.001894812,0.0000936811,0.0002520489,0.00008872811,0.0002110062,3.722963e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008235886,"about_ca_system_score_gemma":0.0002644735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001000663,"about_ca_topic_score_gemma":5.255701e-7,"domain_scores_codex":[0.9988399,0.00005592177,0.0003308428,0.00009374922,0.000559726,0.0001198787],"domain_scores_gemma":[0.9985798,0.0001525245,0.0004729192,0.00009016258,0.0005934089,0.0001112098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.001795861,0.00419619,0.170819,0.0003331243,0.00181916,0.0006512196,0.001211536,0.7142367,0.003862751,0.09416032,0.003130472,0.003783708],"study_design_scores_gemma":[0.02518024,0.008859632,0.745531,0.001402501,0.002971581,0.008102698,0.03500197,0.05271823,0.003782375,0.02392216,0.09125054,0.001277058],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9755836,0.0001938533,0.01619368,0.0003445178,0.0001165745,0.00007773516,0.0001443544,0.000008633823,0.007337022],"genre_scores_gemma":[0.9944931,0.00001818078,0.00506892,0.00008034652,0.00002054226,6.896082e-8,0.00003195117,0.000006459334,0.0002804297],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6615185,"threshold_uncertainty_score":0.344345,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001060575,0.000159269,0.0002684128,0.001263831,0.0002180312,0.0001145076,0.0006776616,0.00006158915,0.00002494601],"category_scores_gemma":[0.0001256639,0.0001273553,0.0001110248,0.001976679,0.00006480765,0.0009027282,0.0001404939,0.0003762559,0.00001353479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002031206,"about_ca_system_score_gemma":0.0003016142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001306712,"about_ca_topic_score_gemma":0.000009491423,"domain_scores_codex":[0.9983309,0.0002665918,0.0003556616,0.0002262646,0.0005955052,0.0002250621],"domain_scores_gemma":[0.99791,0.0009049721,0.0004551334,0.0001637835,0.0004526876,0.000113473],"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.000107069,0.00009676762,0.002295035,0.000008193245,0.00006167749,0.0001443439,0.0003223278,0.9584219,0.00009593993,0.03373824,0.00018628,0.00452215],"study_design_scores_gemma":[0.003357917,0.001051879,0.04802819,0.0001725749,0.00004745267,0.0005517863,0.000292717,0.9240963,0.0001235632,0.006709268,0.0151438,0.0004245347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3263841,0.00003774134,0.6713803,0.001117755,0.0001446178,0.00008115512,0.000002222928,0.00001883014,0.000833259],"genre_scores_gemma":[0.9685029,0.000006082841,0.03065642,0.0003191823,0.0001771713,2.539403e-7,0.000008817276,0.000008178511,0.0003210255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6421188,"threshold_uncertainty_score":0.5193397,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000689354,0.0001253023,0.000350636,0.002147096,0.0001147147,0.00005479019,0.001140678,0.0001039319,0.0001084098],"category_scores_gemma":[0.0003071682,0.0001125754,0.0002713321,0.005357135,0.000143999,0.0008764716,0.0002252413,0.0003261539,0.000006115386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002942545,"about_ca_system_score_gemma":0.0001564772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005504911,"about_ca_topic_score_gemma":0.00001354788,"domain_scores_codex":[0.9981942,0.0001660395,0.0005262137,0.000201888,0.0007491115,0.0001625774],"domain_scores_gemma":[0.9971753,0.0005814913,0.0008647614,0.000252194,0.0009470184,0.0001792738],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00004041887,0.0002457102,0.01720935,0.000008921492,0.0001565486,0.00003996037,0.00006819544,0.01864262,0.0003913635,0.9508513,0.0001990097,0.01214655],"study_design_scores_gemma":[0.004097696,0.001658083,0.7279094,0.00005577187,0.000322054,0.0002066554,0.0008208445,0.01523311,0.001032287,0.1958705,0.05191543,0.0008781518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4140901,0.00001636213,0.584017,0.0002439655,0.0002536914,0.00002831754,0.00002530353,0.00001629359,0.00130897],"genre_scores_gemma":[0.9842947,0.00002624037,0.01517377,0.0000690992,0.00005291401,3.547976e-8,0.00002074743,0.000003486332,0.0003589956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7549808,"threshold_uncertainty_score":0.4590691,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004404256,0.00008563399,0.0001489411,0.0003341169,0.00008324588,0.00009867227,0.001039555,0.0000267515,0.000007089352],"category_scores_gemma":[0.0001450699,0.00006429865,0.0001133253,0.002263814,0.00003839198,0.00111093,0.0004283216,0.0002731078,0.000001205288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009569325,"about_ca_system_score_gemma":0.0001499158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005850828,"about_ca_topic_score_gemma":0.000001685549,"domain_scores_codex":[0.9988232,0.0001109485,0.0002585025,0.0001304766,0.0005447005,0.0001322171],"domain_scores_gemma":[0.9985412,0.000446592,0.0003820279,0.0002101888,0.0003819542,0.00003804066],"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.00002688969,0.0004276366,0.003432544,0.00006625863,0.0004627203,0.001336896,0.001311649,0.6019498,0.0002185678,0.2072842,0.001196875,0.182286],"study_design_scores_gemma":[0.002568752,0.0001324635,0.111638,0.0004125799,0.0001490365,0.0004757829,0.003074379,0.6912237,0.0007904075,0.004410569,0.1846549,0.0004695095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01252031,0.0001903116,0.9832496,0.002392468,0.0005168488,0.00005185031,0.000007779518,0.000008064069,0.001062748],"genre_scores_gemma":[0.6911738,0.0001180714,0.3071319,0.0004071028,0.0001985954,1.657645e-7,0.000006288814,0.000011199,0.000952952],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6786535,"threshold_uncertainty_score":0.2622023,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005917095,0.0001496674,0.0002178917,0.0007885746,0.0002541942,0.00009957173,0.000999841,0.00006153733,0.00006022402],"category_scores_gemma":[0.00008785094,0.0001248928,0.0001979444,0.001554213,0.00006885183,0.0009437946,0.0001739138,0.0002250075,0.00001339918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001201888,"about_ca_system_score_gemma":0.0002469374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001009921,"about_ca_topic_score_gemma":0.000001987761,"domain_scores_codex":[0.998475,0.0001908237,0.0003904141,0.000196249,0.0005489484,0.0001985325],"domain_scores_gemma":[0.9981416,0.0004345762,0.0005266154,0.0001752576,0.0005764414,0.0001455177],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001592027,0.001885567,0.00543575,0.0001180935,0.001860832,0.001975764,0.01232348,0.2729727,0.004289147,0.4625555,0.0900166,0.1449746],"study_design_scores_gemma":[0.01944901,0.005454168,0.08117853,0.0003463518,0.000632626,0.004888559,0.004102159,0.298671,0.016326,0.1527658,0.4131766,0.003009154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2117343,0.0001603815,0.7844769,0.0008463844,0.0004656714,0.0001102313,0.000008490766,0.00003295831,0.002164666],"genre_scores_gemma":[0.958671,0.00002129265,0.0401193,0.000364219,0.000129255,2.792721e-7,0.000007311556,0.000007461415,0.0006798965],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7469366,"threshold_uncertainty_score":0.5092983,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042961,0.0001721647,0.0003971097,0.002121356,0.0001969631,0.0001144333,0.001468324,0.00007531334,0.0004834735],"category_scores_gemma":[0.0001584928,0.0001238523,0.0003223854,0.003523265,0.0001141296,0.001378648,0.0003789024,0.0001731597,0.0001204624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001451555,"about_ca_system_score_gemma":0.0001229874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001789532,"about_ca_topic_score_gemma":0.000001458049,"domain_scores_codex":[0.9981108,0.0001218089,0.0004458329,0.0003113855,0.0007051873,0.0003049429],"domain_scores_gemma":[0.9974455,0.0008008879,0.0005530837,0.000257466,0.0006973642,0.0002457054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003311448,0.00103514,0.03101326,0.00006490395,0.002179238,0.00186904,0.000487047,0.0183214,0.004242378,0.4325026,0.06987976,0.4380741],"study_design_scores_gemma":[0.00385576,0.0008733282,0.03205649,0.0001416401,0.0001796821,0.0006060889,0.000196231,0.004840392,0.0008399168,0.08158232,0.8739779,0.0008502179],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07297307,0.0001497147,0.9186373,0.005112812,0.0002844592,0.00004596666,0.00004936691,0.00004734339,0.002699936],"genre_scores_gemma":[0.9082983,0.0001547921,0.08705192,0.001098388,0.0001952554,1.042494e-7,0.000006188572,0.000009546499,0.003185576],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8353252,"threshold_uncertainty_score":0.5293696,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312627,0.0001136333,0.0001790673,0.00137316,0.0003610564,0.00007063909,0.0001677553,0.00002370428,0.0003128198],"category_scores_gemma":[0.00002439938,0.0001191128,0.00008316686,0.001750224,0.00004813,0.0009383311,0.0000382406,0.0001310603,0.000007878462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007371592,"about_ca_system_score_gemma":0.00006629718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004386559,"about_ca_topic_score_gemma":0.000006986108,"domain_scores_codex":[0.9989761,0.00001361351,0.0002661736,0.0001548584,0.0004609316,0.0001283288],"domain_scores_gemma":[0.9991971,0.00006103146,0.0002678082,0.00006187287,0.0003900035,0.00002218711],"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.001187583,0.0003841791,0.01083214,0.0004163005,0.000302842,0.00003602137,0.000180462,0.9454496,0.00008518696,0.03299277,0.004014325,0.004118597],"study_design_scores_gemma":[0.006579826,0.0005440731,0.07851694,0.0000509644,0.0004621881,0.0000291349,0.002884705,0.5009527,0.00002935942,0.004705063,0.4045733,0.0006717725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.917802,0.0000494969,0.07954917,0.001156227,0.0001251929,0.0003014158,0.00003278261,0.00003137187,0.0009522822],"genre_scores_gemma":[0.9812416,0.000007037619,0.01718579,0.0004428268,0.0001467149,0.000002480868,0.0002838877,0.00001505857,0.0006746369],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4444969,"threshold_uncertainty_score":0.4857278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}