{"meta":{"query_hash":"166d19718669","filters":{"venue":"Journal of Computational Geometry (Carleton University)"},"cohort_total":106,"direct_labels_cover":0,"predictions_cover":106,"exported":106,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/166d19718669","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Computational+Geometry+%28Carleton+University%29"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.006298468167368431,"score_gpt":0.18590014177228512,"score_spread":0.1796016736049167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517258173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2959051,0.00013658848,0.70244783,0.00073383405,0.00007431034,0.00013782592,0.00000261743,0.00001856771,0.0005432873],"genre_scores_gemma":[0.9030314,0.000033918994,0.09634443,0.00022135551,0.00010234239,0.0000014045024,0.000007271465,0.0000060561238,0.00025178184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889135,0.00007265259,0.0002751,0.00022742352,0.0003696359,0.00016383569],"domain_scores_gemma":[0.9980198,0.0002905385,0.00037409738,0.00013557354,0.0009900946,0.00018987137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022064299,0.00015675659,0.00021555282,0.0009646759,0.000229582,0.00020620308,0.0004948545,0.000052908446,0.0000276463],"category_scores_gemma":[0.000013846147,0.00012779009,0.000070181784,0.001636744,0.00008204442,0.00151098,0.00012511821,0.00017018274,0.0000154287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008836829,0.00039248227,0.0055753943,0.00007820976,0.0005189663,0.0001054427,0.0012081739,0.6296462,0.0025540374,0.11524041,0.0034699282,0.24112238],"study_design_scores_gemma":[0.007277054,0.0028459057,0.1933598,0.00028639185,0.000177243,0.0031716987,0.0025185726,0.5631488,0.004934465,0.1523362,0.06786022,0.0020836322],"about_ca_topic_score_codex":0.000012560225,"about_ca_topic_score_gemma":0.0000026994992,"teacher_disagreement_score":0.6071263,"about_ca_system_score_codex":0.000066878085,"about_ca_system_score_gemma":0.00028279994,"threshold_uncertainty_score":0.52111286},"labels":[],"label_agreement":null},{"id":"W1599115183","doi":"10.20382/jocg.v7i1a1","title":"Density of Range Capturing Hypergraphs","year":2014,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; General position; Vertex (graph theory); Regular polygon; Upper and lower bounds; Homothetic transformation; Convex hull; Element (criminal law); Integer (computer science); Discrete mathematics; Geometry; Graph; Mathematical analysis; Computer science","score_opus":0.011950627074551457,"score_gpt":0.20808191159341108,"score_spread":0.1961312845188596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599115183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3538261,0.00022788835,0.6437253,0.00031822754,0.0010893614,0.00010258698,0.0000114879595,0.000028103379,0.00067095505],"genre_scores_gemma":[0.9095661,0.000064315755,0.08968202,0.00011448939,0.00032168353,1.7475034e-7,0.00002355741,0.000012985105,0.00021465025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971043,0.0002886033,0.00080993137,0.0004127034,0.0011441549,0.0002403443],"domain_scores_gemma":[0.9949666,0.00055135484,0.0017886823,0.00037858597,0.00209694,0.00021778351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080888165,0.000313079,0.00073840545,0.0030078036,0.00013791167,0.0001103341,0.0015075116,0.0002614658,0.000019785008],"category_scores_gemma":[0.00013753895,0.00034633986,0.0006060153,0.0015124944,0.00009965487,0.00053174794,0.0008734803,0.0007105649,0.000006239649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007462345,0.00015536365,0.0019017321,0.00016561324,0.0003131974,0.00011112313,0.00021587897,0.9613957,0.00015951975,0.028573317,0.0007166304,0.0062173014],"study_design_scores_gemma":[0.008906796,0.0016293299,0.15225737,0.0017320842,0.0010207916,0.0013188915,0.00037306687,0.58313376,0.0052161515,0.20706771,0.03431727,0.0030267613],"about_ca_topic_score_codex":0.000023429668,"about_ca_topic_score_gemma":0.0000032379796,"teacher_disagreement_score":0.55574,"about_ca_system_score_codex":0.00021020713,"about_ca_system_score_gemma":0.0007390384,"threshold_uncertainty_score":0.99989885},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.01540619575692122,"score_gpt":0.24849300508462382,"score_spread":0.2330868093277026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1706661728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41409007,0.000016362132,0.58401704,0.00024396548,0.00025369137,0.000028317536,0.000025303529,0.000016293587,0.0013089702],"genre_scores_gemma":[0.9842947,0.000026240374,0.015173771,0.0000690992,0.000052914012,3.5479758e-8,0.000020747433,0.0000034863322,0.00035899563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99819416,0.0001660395,0.00052621367,0.00020188799,0.0007491115,0.00016257736],"domain_scores_gemma":[0.9971753,0.00058149133,0.0008647614,0.000252194,0.0009470184,0.00017927377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068935397,0.00012530226,0.00035063596,0.0021470955,0.000114714734,0.00005479019,0.0011406784,0.00010393189,0.00010840983],"category_scores_gemma":[0.00030716817,0.00011257539,0.00027133213,0.005357135,0.00014399899,0.00087647163,0.0002252413,0.00032615388,0.0000061153864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040418872,0.0002457102,0.017209351,0.000008921492,0.00015654859,0.000039960367,0.00006819544,0.018642623,0.00039136354,0.9508513,0.00019900972,0.012146553],"study_design_scores_gemma":[0.0040976964,0.0016580828,0.7279094,0.00005577187,0.000322054,0.00020665543,0.0008208445,0.015233109,0.0010322867,0.19587055,0.05191543,0.0008781518],"about_ca_topic_score_codex":0.00005504911,"about_ca_topic_score_gemma":0.000013547884,"teacher_disagreement_score":0.7549808,"about_ca_system_score_codex":0.00002942545,"about_ca_system_score_gemma":0.00015647715,"threshold_uncertainty_score":0.45906913},"labels":[],"label_agreement":null},{"id":"W1719651336","doi":"10.20382/jocg.v6i1a10","title":"Forcing subarrangements in complete arrangements of pseudocircles","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Forcing (mathematics); Mathematics; Mathematical analysis","score_opus":0.0376082411431994,"score_gpt":0.2785174577325209,"score_spread":0.24090921658932152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1719651336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97407,0.000033057317,0.022765283,0.00012251142,0.0002820199,0.00008363327,0.000024829385,0.000007971885,0.0026107049],"genre_scores_gemma":[0.9817176,0.000013942718,0.017926104,0.0000343591,0.000078180274,1.0242584e-7,0.0000047784715,0.000009942177,0.00021500837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849707,0.000054813674,0.0005664916,0.00011384356,0.00057751604,0.00019027258],"domain_scores_gemma":[0.9978276,0.0006376718,0.0007310176,0.00010199396,0.0006219157,0.000079798025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062285585,0.00012264251,0.00037800262,0.0021355706,0.00005850072,0.000020021005,0.00035012615,0.0000692892,0.00015825519],"category_scores_gemma":[0.0003325913,0.00012832238,0.00015607962,0.0014748222,0.00006873473,0.00037909116,0.0000708141,0.00030447135,0.0000025406516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002251913,0.003170787,0.23546915,0.0029874002,0.001903885,0.0008401557,0.006230382,0.032481328,0.012255876,0.67677474,0.004117697,0.021516686],"study_design_scores_gemma":[0.02033423,0.0017228769,0.1842944,0.001056578,0.00053633447,0.0003403625,0.0117297545,0.0049531874,0.0030309,0.7440942,0.026464887,0.0014422752],"about_ca_topic_score_codex":0.000023479666,"about_ca_topic_score_gemma":0.000027351678,"teacher_disagreement_score":0.06731947,"about_ca_system_score_codex":0.00006827511,"about_ca_system_score_gemma":0.000117224605,"threshold_uncertainty_score":0.5232835},"labels":[],"label_agreement":null},{"id":"W1831059542","doi":"10.20382/jocg.v3i1a8","title":"Minimum area polyomino Venn diagrams","year":2012,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Venn diagram; Polyomino; Computer science; Diagram; Mathematics; Geometry; Mathematics education; Database","score_opus":0.037976730295315834,"score_gpt":0.2699739155014311,"score_spread":0.2319971852061153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831059542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83989584,0.0001356252,0.15390967,0.00017123637,0.0012365796,0.00012162467,0.000008116636,0.000039251154,0.004482056],"genre_scores_gemma":[0.9537668,0.0000128023175,0.044903275,0.000046161887,0.00045022508,1.364271e-7,0.0000028623476,0.000024788864,0.0007929153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983614,0.00009338568,0.00046483002,0.000107315944,0.0006502845,0.00032276823],"domain_scores_gemma":[0.9968961,0.0013639717,0.0007927896,0.0001678429,0.00049402344,0.0002852741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042743506,0.0001893543,0.00041423884,0.00075777736,0.00011110373,0.000026722963,0.0003880329,0.00010704449,0.000113679554],"category_scores_gemma":[0.0005234065,0.00018999355,0.00024907666,0.0008586579,0.00007396775,0.0006630212,0.00010511203,0.00030646787,0.000022199167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003220374,0.0017954134,0.009027943,0.00020543704,0.0006465273,0.00025110404,0.0014778022,0.005144266,0.00054261746,0.9697463,0.008273304,0.002567249],"study_design_scores_gemma":[0.004351074,0.0005515213,0.0044337222,0.00025864103,0.0004876123,0.00064807397,0.0019751466,0.0010880617,0.00081250403,0.949978,0.03465791,0.0007577423],"about_ca_topic_score_codex":8.01561e-7,"about_ca_topic_score_gemma":2.8620804e-7,"teacher_disagreement_score":0.113870986,"about_ca_system_score_codex":0.00027809088,"about_ca_system_score_gemma":0.00012074216,"threshold_uncertainty_score":0.7747712},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.009102678068484239,"score_gpt":0.21809906452068029,"score_spread":0.20899638645219604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1855377430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6465034,0.000022337339,0.34747234,0.0013814445,0.0016330841,0.000096987955,0.0000073564056,0.00006191541,0.0028211428],"genre_scores_gemma":[0.90720206,0.000010254417,0.09183196,0.0004525429,0.00015241945,1.4218698e-7,0.000012967715,0.000009329866,0.00032833754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821424,0.00012804756,0.00040875914,0.00028186437,0.0007509005,0.00021620556],"domain_scores_gemma":[0.99722713,0.00065580994,0.0004953695,0.00022951096,0.001155077,0.0002371111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052939175,0.00018454612,0.0002641765,0.002095424,0.00022124615,0.00012711206,0.0007763584,0.000113638074,0.00009308441],"category_scores_gemma":[0.00023270588,0.00018894591,0.00023485985,0.0024948188,0.0000646506,0.00086766493,0.000113072696,0.0005872563,0.000035751174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027679923,0.0005839777,0.00086995,0.000021112704,0.00025752452,0.00045696562,0.00030592884,0.394228,0.0040831524,0.5565662,0.00587614,0.036474247],"study_design_scores_gemma":[0.011636327,0.0043641464,0.098826416,0.00021105153,0.0002049359,0.0032282835,0.00044895377,0.4127997,0.011848926,0.23199712,0.2222909,0.0021432457],"about_ca_topic_score_codex":0.000004355454,"about_ca_topic_score_gemma":0.00000419896,"teacher_disagreement_score":0.32456908,"about_ca_system_score_codex":0.0000828335,"about_ca_system_score_gemma":0.00035212247,"threshold_uncertainty_score":0.77049905},"labels":[],"label_agreement":null},{"id":"W1857045085","doi":"10.20382/jocg.v3i1a1","title":"The emergence of sparse spanners and well-separated pair decomposition under anarchy","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Spanner; Euclidean geometry; Combinatorics; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Mathematics; Constant (computer programming); Euclidean distance; Graph; Network topology; Computer science; Discrete mathematics; Theoretical computer science; Algorithm; Computer network; Distributed computing; Artificial intelligence; Geometry","score_opus":0.02514194668334845,"score_gpt":0.26345494322076585,"score_spread":0.2383129965374174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857045085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.467948,0.00017052604,0.5299997,0.00034629158,0.00015325916,0.00006999008,0.000001966575,0.00001302406,0.0012972702],"genre_scores_gemma":[0.9749101,0.000120448654,0.024713058,0.000039094866,0.000018783328,8.330917e-8,0.0000011209103,0.000005319758,0.00019201933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862003,0.00022091337,0.00030264287,0.00016382265,0.00049056695,0.00020204703],"domain_scores_gemma":[0.99812776,0.00043774064,0.00040807435,0.0001709089,0.0007030979,0.00015241075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055186526,0.00010888914,0.00017821189,0.000828954,0.00022886353,0.000031834,0.00079959433,0.000044693006,0.000030433723],"category_scores_gemma":[0.000035256664,0.00009181187,0.000105864965,0.0016283192,0.00028768953,0.00071225694,0.00019849514,0.0002198993,0.000004438279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009407061,0.00034668975,0.011064375,0.000038755286,0.0005086906,0.00032079875,0.0014161912,0.20724836,0.0016802904,0.7634514,0.0014196011,0.01156412],"study_design_scores_gemma":[0.00513746,0.003274627,0.23209466,0.0002375286,0.00016102589,0.00088714564,0.0054022805,0.13482429,0.009509133,0.5965077,0.010923031,0.0010410958],"about_ca_topic_score_codex":0.000009763611,"about_ca_topic_score_gemma":0.0000024341578,"teacher_disagreement_score":0.5069621,"about_ca_system_score_codex":0.000046018245,"about_ca_system_score_gemma":0.00014749118,"threshold_uncertainty_score":0.37439793},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_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","score_opus":0.009044944806347294,"score_gpt":0.2073174917531666,"score_spread":0.1982725469468193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1922419250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5735469,0.000022780336,0.42347,0.001225833,0.00043548804,0.00010602707,0.0000029152907,0.00003346984,0.001156651],"genre_scores_gemma":[0.9655716,0.000008494614,0.033103857,0.0008085009,0.000116551535,3.3867767e-7,0.000009970092,0.0000073745623,0.00037330866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981607,0.00017220825,0.00043984153,0.00028335326,0.0007174524,0.0002264414],"domain_scores_gemma":[0.9976445,0.00053072633,0.0005038291,0.00021446573,0.0008899242,0.00021654426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043449595,0.00017850715,0.00026524242,0.0017322394,0.00019563286,0.00019785788,0.00076169684,0.00007621877,0.000143779],"category_scores_gemma":[0.00012088761,0.00017854746,0.00023359097,0.0018899667,0.00005212573,0.0016827798,0.00013350241,0.0002870907,0.00007776645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016268626,0.0009084968,0.002191999,0.000054830136,0.00035783037,0.00023489854,0.00074348244,0.34868762,0.005582803,0.5350142,0.009302574,0.09675859],"study_design_scores_gemma":[0.005627053,0.002718559,0.32497174,0.0002542044,0.00008921204,0.00065206405,0.00041086998,0.20633557,0.0029466532,0.41933823,0.03518532,0.0014705526],"about_ca_topic_score_codex":0.000009251748,"about_ca_topic_score_gemma":5.997997e-7,"teacher_disagreement_score":0.39202476,"about_ca_system_score_codex":0.00016929625,"about_ca_system_score_gemma":0.00021366966,"threshold_uncertainty_score":0.7280954},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.011002743138707307,"score_gpt":0.18125113418905628,"score_spread":0.17024839105034897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1932504660","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51365274,0.00025727812,0.48529863,0.00005845038,0.00026733108,0.000033332773,0.000014378631,0.000013406545,0.00040447034],"genre_scores_gemma":[0.99831617,0.00006205883,0.0013945691,0.000025561238,0.00015799588,5.59244e-8,0.000008634477,0.000008302972,0.000026629303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991073,0.00004278728,0.00028971152,0.00005683129,0.00035090165,0.0001524817],"domain_scores_gemma":[0.99934417,0.00013010368,0.0001886109,0.00006561473,0.00017438062,0.00009709331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019406845,0.00008455442,0.00020172105,0.00023068923,0.00006265506,0.000016706996,0.00018380072,0.000052867385,0.00007481533],"category_scores_gemma":[0.000017595514,0.000075720985,0.00015789965,0.0005618601,0.00003438529,0.0004803522,0.000033325407,0.00015048722,0.0000018275825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020140622,0.000021154805,0.00023015101,0.000009947348,0.0001518125,0.0000021371004,0.00007498721,0.99336326,0.00053829665,0.0032077413,0.0005342756,0.001846105],"study_design_scores_gemma":[0.0012667502,0.000115581504,0.0038909356,0.00005399372,0.00031118622,0.000065863416,0.000513249,0.97961473,0.003513141,0.0028678842,0.0074774604,0.00030921365],"about_ca_topic_score_codex":0.000005120381,"about_ca_topic_score_gemma":4.4779927e-7,"teacher_disagreement_score":0.4846635,"about_ca_system_score_codex":0.000083339524,"about_ca_system_score_gemma":0.000025900259,"threshold_uncertainty_score":0.30878124},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Covering space; Lebesgue integration; Regular polygon; Combinatorics; Reduction (mathematics); Pure mathematics; Geometry","score_opus":0.050838057682007484,"score_gpt":0.2701838847343962,"score_spread":0.2193458270523887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096242358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6668831,0.0005940424,0.28732944,0.0021886295,0.0009547714,0.00021806877,0.000024787621,0.000071796174,0.041735385],"genre_scores_gemma":[0.97271365,0.00007242115,0.019795,0.00007452845,0.00028376427,9.755932e-8,0.0000033044143,0.000018342113,0.00703888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853885,0.00009762262,0.00035551615,0.00010051983,0.00069403317,0.00021342956],"domain_scores_gemma":[0.99670947,0.0012210137,0.0005434261,0.00010229728,0.0012463902,0.00017738545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087831006,0.00012586151,0.00023820084,0.00076309306,0.00020811112,0.00008460236,0.0004376173,0.00006049029,0.000018827597],"category_scores_gemma":[0.00052553,0.00009961311,0.00014851951,0.0014170831,0.00009167515,0.00051794853,0.00011120915,0.00025307824,0.000008125433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005233315,0.00021110656,0.0010361063,0.00011638525,0.000495003,0.00035365392,0.0012927307,0.06377771,0.00001581349,0.90379006,0.023161713,0.0052263774],"study_design_scores_gemma":[0.0036819482,0.00073906354,0.00052417547,0.00014085075,0.00018666859,0.00045199614,0.014093622,0.0020106814,0.00013266882,0.5510988,0.4265146,0.00042492436],"about_ca_topic_score_codex":0.000015977377,"about_ca_topic_score_gemma":0.0000051959214,"teacher_disagreement_score":0.4033529,"about_ca_system_score_codex":0.00027845887,"about_ca_system_score_gemma":0.00050121715,"threshold_uncertainty_score":0.40621048},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.0047364920417147,"score_gpt":0.1985808638164776,"score_spread":0.1938443717747629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102170762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.549913,0.000049511276,0.44899726,0.00028228565,0.000242104,0.00007865978,0.00000784029,0.000017096027,0.00041225355],"genre_scores_gemma":[0.9092461,0.000014121763,0.090085424,0.00007463054,0.00014698846,1.5773155e-7,0.000014366121,0.000007619843,0.00041061142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838006,0.0001048235,0.0004912725,0.00025374064,0.00061327225,0.00015685291],"domain_scores_gemma":[0.99719805,0.0005306594,0.00074131077,0.00017256617,0.0011809404,0.00017649481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065669947,0.00015638005,0.00030538265,0.0014512014,0.00012498247,0.00009236227,0.0005239725,0.00011193274,0.00005736032],"category_scores_gemma":[0.00020437657,0.00016322832,0.0001450483,0.0014042774,0.00008321708,0.0013261181,0.0001625082,0.00028737052,0.0000069494063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001051354,0.0011188993,0.0054323706,0.00021146156,0.0007428276,0.00023051348,0.0032658868,0.5083675,0.05961815,0.12370028,0.002086495,0.29417425],"study_design_scores_gemma":[0.0121325245,0.0021357122,0.17043138,0.00027823303,0.0003599136,0.0020806578,0.00052830385,0.69634897,0.016448017,0.07560373,0.022064386,0.0015881541],"about_ca_topic_score_codex":0.0000043384757,"about_ca_topic_score_gemma":0.0000026599346,"teacher_disagreement_score":0.35933307,"about_ca_system_score_codex":0.000050857652,"about_ca_system_score_gemma":0.00040820072,"threshold_uncertainty_score":0.6656258},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.00647455589633572,"score_gpt":0.18985622678958583,"score_spread":0.1833816708932501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105256528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4934566,0.00002113019,0.50577635,0.00039451645,0.00011429605,0.00008152871,0.0000022904192,0.000010929567,0.0001423483],"genre_scores_gemma":[0.90950745,0.000039480725,0.08988791,0.00015244618,0.000055202927,3.1492542e-7,0.000016571055,0.0000061406404,0.00033446337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862385,0.00012273733,0.0004549728,0.00017007503,0.0004925216,0.00013585211],"domain_scores_gemma":[0.9980743,0.00020850121,0.0006928602,0.000114162875,0.00077449455,0.00013570828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027666753,0.0001334299,0.00026783717,0.0011814354,0.00010133078,0.00009215397,0.00040247804,0.00006454281,0.000044237295],"category_scores_gemma":[0.000035424902,0.00013697364,0.000092141905,0.0011956807,0.000052852018,0.0015809442,0.00013160524,0.00013653877,0.00000862691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026150307,0.002760369,0.015072271,0.0007165697,0.0012992078,0.00021241308,0.004632812,0.29890978,0.113074124,0.41104677,0.0019433195,0.15007088],"study_design_scores_gemma":[0.0054889075,0.0022005802,0.43663362,0.00043664358,0.00015383457,0.0007995158,0.0005075321,0.4700174,0.0042299884,0.07268892,0.005834665,0.001008373],"about_ca_topic_score_codex":0.000013724891,"about_ca_topic_score_gemma":4.0920315e-7,"teacher_disagreement_score":0.42156136,"about_ca_system_score_codex":0.00007434069,"about_ca_system_score_gemma":0.00018123281,"threshold_uncertainty_score":0.5585623},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Australian Government","keywords":"Mathematics; Set (abstract data type); Combinatorics; Point (geometry); Geometry; Computer science","score_opus":0.02403805481280369,"score_gpt":0.20679438843507247,"score_spread":0.18275633362226879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150278422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21173434,0.00016038155,0.7844769,0.00084638444,0.00046567136,0.00011023131,0.000008490766,0.000032958313,0.0021646656],"genre_scores_gemma":[0.958671,0.000021292646,0.040119298,0.00036421895,0.00012925502,2.7927211e-7,0.000007311556,0.000007461415,0.0006798965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998475,0.00019082369,0.00039041415,0.00019624896,0.0005489484,0.00019853252],"domain_scores_gemma":[0.9981416,0.00043457624,0.0005266154,0.00017525762,0.0005764414,0.00014551765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059170945,0.00014966741,0.00021789175,0.0007885746,0.00025419422,0.000099571735,0.000999841,0.00006153733,0.00006022402],"category_scores_gemma":[0.00008785094,0.00012489285,0.00019794436,0.0015542132,0.000068851834,0.00094379456,0.00017391382,0.00022500748,0.000013399184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015920268,0.0018855669,0.00543575,0.0001180935,0.0018608317,0.0019757643,0.01232348,0.27297267,0.0042891474,0.46255547,0.090016596,0.14497459],"study_design_scores_gemma":[0.019449012,0.0054541677,0.08117853,0.00034635182,0.000632626,0.004888559,0.0041021593,0.29867104,0.016326005,0.15276583,0.41317657,0.003009154],"about_ca_topic_score_codex":0.000010099214,"about_ca_topic_score_gemma":0.000001987761,"teacher_disagreement_score":0.7469366,"about_ca_system_score_codex":0.000120188764,"about_ca_system_score_gemma":0.00024693736,"threshold_uncertainty_score":0.50929826},"labels":[],"label_agreement":null},{"id":"W2197147576","doi":"10.20382/jocg.v7i1a10","title":"Recursively-Regular Subdivisions and Applications","year":2013,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Social Fund; Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst","keywords":"Subdivision; Mathematics; Embedding; Combinatorics; Projection (relational algebra); Cone (formal languages); Polyhedron; Class (philosophy); Graph; Tree (set theory); Discrete mathematics; Computer science; Algorithm","score_opus":0.011312073626481756,"score_gpt":0.21660931250940735,"score_spread":0.2052972388829256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2197147576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05306294,0.0010022343,0.94251925,0.0013705277,0.00063236285,0.00036012888,0.000029587472,0.00005273511,0.00097020867],"genre_scores_gemma":[0.6953404,0.00064611924,0.3007777,0.00041939627,0.0009367777,0.0000050114368,0.00013055949,0.000033789256,0.0017102321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976343,0.00019230168,0.0006089674,0.00049406843,0.0008251629,0.00024519276],"domain_scores_gemma":[0.99591696,0.00049980526,0.0010779772,0.00035582625,0.0018174995,0.00033192063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004298014,0.00031008598,0.0004883224,0.002370284,0.00028392288,0.0003456798,0.0012509616,0.00025616356,0.000038932983],"category_scores_gemma":[0.00007285414,0.00033936076,0.0002855019,0.0015238248,0.00011973773,0.00088528363,0.0010847705,0.00072494295,0.000023654939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002995524,0.00028055452,0.0003219598,0.00013412895,0.00042367232,0.00009467646,0.00025775007,0.585337,0.00009761476,0.33692437,0.005227622,0.07087074],"study_design_scores_gemma":[0.002868131,0.0006400228,0.024634697,0.0004975064,0.000416059,0.00083526515,0.0003394045,0.15079503,0.00027281264,0.52535784,0.29166898,0.0016742711],"about_ca_topic_score_codex":0.000011300963,"about_ca_topic_score_gemma":9.745773e-7,"teacher_disagreement_score":0.6422775,"about_ca_system_score_codex":0.00022024509,"about_ca_system_score_gemma":0.0007078677,"threshold_uncertainty_score":0.9999058},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.025251074845990165,"score_gpt":0.25554177658106697,"score_spread":0.23029070173507682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227225096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19415909,0.00017552223,0.80042785,0.0010259013,0.003262806,0.0003605235,0.000067523666,0.00003959415,0.0004811899],"genre_scores_gemma":[0.9273632,0.0000070498145,0.071396425,0.00020394096,0.0007238099,0.00000175496,0.00016317588,0.000021085667,0.00011954248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968038,0.000274519,0.000909497,0.0005259778,0.0011067251,0.0003794465],"domain_scores_gemma":[0.9945424,0.0011027819,0.001347911,0.00027496406,0.0024294565,0.00030247326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015530818,0.00036207362,0.00069342874,0.0034147694,0.00018630554,0.00030649517,0.0013777774,0.0003339707,0.000010641273],"category_scores_gemma":[0.00037219943,0.00042807893,0.000489592,0.0019205593,0.00007790829,0.00065024645,0.0005276867,0.00084646,0.0000033624885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023816343,0.00029238008,0.00063321285,0.00006774354,0.00012801118,0.00011987959,0.00016121696,0.8826686,0.000022364673,0.11152326,0.0009770999,0.0031680684],"study_design_scores_gemma":[0.0074951225,0.00068549946,0.0044611073,0.00036086515,0.00012915532,0.00008910411,0.00012779572,0.77454233,0.00012196704,0.20126425,0.009923155,0.00079964957],"about_ca_topic_score_codex":0.000019342671,"about_ca_topic_score_gemma":0.000010093488,"teacher_disagreement_score":0.7332041,"about_ca_system_score_codex":0.00087400904,"about_ca_system_score_gemma":0.004850964,"threshold_uncertainty_score":0.9998171},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_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","score_opus":0.020225246466812365,"score_gpt":0.22677454725590304,"score_spread":0.20654930078909067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235983888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25903615,0.0006407818,0.7372045,0.0012297878,0.0007769946,0.00018011293,0.00013015766,0.000028819482,0.00077268924],"genre_scores_gemma":[0.9677948,0.00016879103,0.031059599,0.00011876851,0.0001655187,3.4161985e-7,0.000041915806,0.000015049153,0.00063522975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974447,0.000262882,0.00073615456,0.00041969333,0.0009107428,0.00022583702],"domain_scores_gemma":[0.9954107,0.00077387574,0.0016505931,0.00026080172,0.0016748708,0.0002291712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050399103,0.00031328373,0.0007434304,0.0018428613,0.00015962993,0.00012264364,0.0010474701,0.00022185137,0.000048975235],"category_scores_gemma":[0.00012167493,0.00030089665,0.0002669076,0.0012808685,0.00036713685,0.00057900674,0.00074786466,0.00040700386,0.0000025605632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001058518,0.0017314155,0.009199131,0.0014086685,0.0034525755,0.00041583116,0.0016984523,0.36120862,0.009177788,0.53575045,0.044189945,0.030708622],"study_design_scores_gemma":[0.013954704,0.0026653912,0.05408159,0.00221135,0.0007786751,0.00083949964,0.00053583505,0.0957729,0.017618407,0.74091625,0.06725308,0.0033723481],"about_ca_topic_score_codex":0.000015066917,"about_ca_topic_score_gemma":0.0000018497506,"teacher_disagreement_score":0.70875865,"about_ca_system_score_codex":0.00020735664,"about_ca_system_score_gemma":0.0009034653,"threshold_uncertainty_score":0.9999443},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.025050121115095053,"score_gpt":0.24938825684958482,"score_spread":0.22433813573448977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252238546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1390589,0.00018165004,0.85949296,0.00054161914,0.000351504,0.00014951183,0.000011710295,0.000010695721,0.00020144744],"genre_scores_gemma":[0.6437804,0.000004594736,0.35584652,0.00013651392,0.00014591498,1.09389454e-7,0.00001555676,0.000004302902,0.000066073735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806947,0.00019645673,0.0005362647,0.0002093831,0.0007975771,0.00019085029],"domain_scores_gemma":[0.99714565,0.0010833673,0.0005712201,0.00015555939,0.00088562735,0.00015854654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012992257,0.00013970083,0.00029415838,0.0012570019,0.0000896557,0.00007208958,0.0009101237,0.00006523108,0.0000049724817],"category_scores_gemma":[0.00014252763,0.0001234132,0.00019856635,0.0022546626,0.000049583155,0.0006209956,0.00010535637,0.00019980871,0.0000013333774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022059518,0.00044244344,0.0024402349,0.00003731476,0.0001587467,0.000097857956,0.002480365,0.66833115,0.00010029534,0.11095703,0.0038756023,0.21085837],"study_design_scores_gemma":[0.009807792,0.0020871186,0.063821614,0.00015080563,0.00010426017,0.0005812181,0.0025024822,0.7376823,0.00058099313,0.1650265,0.017020393,0.0006345069],"about_ca_topic_score_codex":0.000032963926,"about_ca_topic_score_gemma":0.0000052972164,"teacher_disagreement_score":0.5047215,"about_ca_system_score_codex":0.00012237675,"about_ca_system_score_gemma":0.0007785439,"threshold_uncertainty_score":0.5032644},"labels":[],"label_agreement":null},{"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.016834781048207712,"score_gpt":0.21770333013737017,"score_spread":0.20086854908916246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256871140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19696623,0.00011304287,0.7996563,0.00095093297,0.00056774553,0.00008194824,0.000008386081,0.000012764322,0.0016426918],"genre_scores_gemma":[0.9558402,0.000004390465,0.043505374,0.00009047194,0.000097901604,1.0114024e-7,0.000003359649,0.0000042787597,0.00045396577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816114,0.00020618935,0.0004145821,0.00018301971,0.0008931685,0.00014193158],"domain_scores_gemma":[0.997393,0.00027013983,0.0006638544,0.00025446172,0.0012588712,0.00015967412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065458624,0.000121792815,0.00023940548,0.00046545788,0.00010543351,0.00004913982,0.0010557374,0.000054554315,0.000007715868],"category_scores_gemma":[0.00021834449,0.00009840698,0.00022119589,0.002226523,0.00012232426,0.0007875535,0.00025035496,0.0002073877,0.0000028638567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116025236,0.00022058035,0.0064305435,0.000030135645,0.00010396418,0.000024425068,0.00050235214,0.7924734,0.00012556669,0.19228493,0.0017847648,0.005903345],"study_design_scores_gemma":[0.008593085,0.0014441856,0.17058575,0.00027217774,0.00022146905,0.0006262056,0.0013324062,0.3689133,0.0052486993,0.2725361,0.16904938,0.0011772455],"about_ca_topic_score_codex":0.00000597918,"about_ca_topic_score_gemma":0.0000017258349,"teacher_disagreement_score":0.75887394,"about_ca_system_score_codex":0.00018301804,"about_ca_system_score_gemma":0.00061102724,"threshold_uncertainty_score":0.401292},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Discretization; Terrain; Mathematics; Mathematical optimization; Geography; Mathematical analysis; Cartography","score_opus":0.018817839104994145,"score_gpt":0.21448614739666144,"score_spread":0.1956683082916673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261811080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06981621,0.00059313735,0.9246127,0.0033926663,0.00043631406,0.000121525205,0.0000044795884,0.000033775603,0.0009892008],"genre_scores_gemma":[0.88707983,0.00008214706,0.11138541,0.00017250284,0.00026846342,4.6276728e-7,0.000014663887,0.000009888345,0.0009866136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822235,0.00022379546,0.00041222834,0.00021448547,0.000684846,0.00024231576],"domain_scores_gemma":[0.9974555,0.00044921442,0.00047448877,0.00014002682,0.0012417838,0.00023899664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001178926,0.00014889607,0.00021097757,0.0007047036,0.0005332472,0.00032732042,0.00058031664,0.00006161163,0.000003830844],"category_scores_gemma":[0.00020540904,0.00012737112,0.00010455032,0.0014178059,0.0001202692,0.0011404566,0.00025929694,0.00021191734,0.000005273931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087159526,0.00008841282,0.0012259263,0.000010732468,0.00015381146,0.000069939866,0.00093797693,0.74066174,0.0000567842,0.22581975,0.0074651805,0.023422591],"study_design_scores_gemma":[0.0054779425,0.0012746789,0.01430254,0.0001393291,0.00016154913,0.0017113884,0.0030125487,0.5069116,0.00015027201,0.07359674,0.39237902,0.00088239985],"about_ca_topic_score_codex":0.000006660385,"about_ca_topic_score_gemma":0.0000031163909,"teacher_disagreement_score":0.81726366,"about_ca_system_score_codex":0.00016505929,"about_ca_system_score_gemma":0.0004847707,"threshold_uncertainty_score":0.51940435},"labels":[],"label_agreement":null},{"id":"W2293635260","doi":"10.20382/jocg.v2i1a7","title":"Points with large quadrant depth","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quadrant (abdomen); Mathematics; Geodesy; Geography; Medicine; Surgery","score_opus":0.018319679801177376,"score_gpt":0.2011631225846567,"score_spread":0.18284344278347933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293635260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1432759,0.00006329374,0.8509786,0.00024590403,0.00028546428,0.00007089272,0.0000042785878,0.000036355446,0.005039279],"genre_scores_gemma":[0.81931365,0.000011214453,0.18001555,0.00023842919,0.00009127805,1.14149486e-7,0.000006047933,0.0000079052825,0.0003158358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983424,0.00012346913,0.00034609972,0.00023807179,0.00070155476,0.00024838836],"domain_scores_gemma":[0.9980073,0.00017659598,0.00048505937,0.0001771433,0.0009448233,0.00020908735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043893524,0.00016882537,0.00025319943,0.0014182002,0.00018046555,0.000067460955,0.0007547423,0.00006366974,0.00008584],"category_scores_gemma":[0.000037398255,0.0001541302,0.00014925732,0.0020467106,0.000048712784,0.0012823883,0.00012984678,0.0002292186,0.000026419584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086782087,0.001540089,0.017576799,0.00006112904,0.0007789835,0.0021877114,0.0025515957,0.13895667,0.0001718464,0.80336064,0.002978592,0.028968109],"study_design_scores_gemma":[0.022131136,0.0073755416,0.5347063,0.00047584064,0.00049385946,0.004375077,0.0025664375,0.15729229,0.005101239,0.103648864,0.15888205,0.0029513438],"about_ca_topic_score_codex":0.000006780687,"about_ca_topic_score_gemma":0.000009336026,"teacher_disagreement_score":0.6997118,"about_ca_system_score_codex":0.00011171599,"about_ca_system_score_gemma":0.00038020854,"threshold_uncertainty_score":0.6285247},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israeli Centers for Research Excellence; Tel Aviv University","keywords":"Logarithm; Point (geometry); Computer science; Mathematics; Geometry; Mathematical analysis","score_opus":0.0075280229826029995,"score_gpt":0.19768910673146448,"score_spread":0.19016108374886148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295197591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3263841,0.00003774134,0.67138034,0.001117755,0.0001446178,0.00008115512,0.0000022229278,0.000018830144,0.00083325896],"genre_scores_gemma":[0.9685029,0.000006082841,0.03065642,0.00031918235,0.00017717129,2.5394033e-7,0.000008817276,0.000008178511,0.00032102547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983309,0.00026659184,0.0003556616,0.0002262646,0.0005955052,0.00022506207],"domain_scores_gemma":[0.99790996,0.00090497214,0.0004551334,0.0001637835,0.00045268761,0.00011347299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010605755,0.00015926895,0.00026841278,0.0012638309,0.00021803117,0.00011450762,0.0006776616,0.000061589155,0.000024946014],"category_scores_gemma":[0.00012566394,0.00012735528,0.000111024805,0.0019766788,0.00006480765,0.00090272824,0.00014049394,0.00037625586,0.0000135347855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010706896,0.00009676762,0.002295035,0.000008193245,0.000061677485,0.00014434388,0.0003223278,0.95842195,0.00009593993,0.033738244,0.00018627995,0.00452215],"study_design_scores_gemma":[0.0033579168,0.0010518789,0.048028193,0.00017257486,0.000047452668,0.0005517863,0.00029271704,0.9240963,0.00012356318,0.0067092683,0.015143799,0.00042453466],"about_ca_topic_score_codex":0.000013067119,"about_ca_topic_score_gemma":0.000009491423,"teacher_disagreement_score":0.64211875,"about_ca_system_score_codex":0.00020312058,"about_ca_system_score_gemma":0.0003016142,"threshold_uncertainty_score":0.51933974},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.02474012601281481,"score_gpt":0.2525215576842991,"score_spread":0.22778143167148432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295922106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.984184,0.00020570321,0.010037355,0.00065938407,0.00020532563,0.00013092073,0.000029691835,0.0000041715016,0.0045433976],"genre_scores_gemma":[0.995597,0.000046153746,0.0031857514,0.000024210449,0.000042962718,1.2931336e-7,8.6290805e-7,0.000007898364,0.0010950132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983064,0.00008946888,0.0006487488,0.0000786741,0.000722759,0.0001539652],"domain_scores_gemma":[0.99472135,0.001943385,0.0015183188,0.00016504314,0.0015992022,0.00005271563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046431422,0.00012059036,0.00040473233,0.00043915078,0.000106246574,0.000020505799,0.0006357206,0.00006967716,0.00024032462],"category_scores_gemma":[0.00045527896,0.00007560623,0.0002841003,0.0013441147,0.00029309635,0.0002811232,0.00014325033,0.00018066911,0.0000029230764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005028241,0.0010014293,0.10670701,0.001654463,0.0024037214,0.000021214606,0.0024218324,0.010019823,0.0010231761,0.8537062,0.010399991,0.010138362],"study_design_scores_gemma":[0.0025754413,0.00045815535,0.07513595,0.0004758638,0.00039158046,0.00013436697,0.012519514,0.0009886244,0.007690644,0.89151067,0.007757821,0.00036133933],"about_ca_topic_score_codex":0.000092306334,"about_ca_topic_score_gemma":0.000009815614,"teacher_disagreement_score":0.03780454,"about_ca_system_score_codex":0.00004024403,"about_ca_system_score_gemma":0.0002120323,"threshold_uncertainty_score":0.30831325},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.02859963742090648,"score_gpt":0.26730071844677533,"score_spread":0.23870108102586884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296706642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9181284,0.00011316589,0.077424735,0.0023595756,0.00016749809,0.00011335946,0.0000042168517,0.000021445303,0.001667629],"genre_scores_gemma":[0.9450375,0.000040844505,0.05357477,0.00017871519,0.00014952858,1.8411428e-7,0.0000030040437,0.00001296983,0.0010025045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872017,0.000130454,0.00036770946,0.00015405557,0.00039185953,0.00023575136],"domain_scores_gemma":[0.99700046,0.001764209,0.0004394341,0.000097350916,0.00045891586,0.00023965033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025827115,0.00015364321,0.00037732013,0.0010472963,0.00012427426,0.00005601335,0.00020136547,0.00010905193,0.0005082666],"category_scores_gemma":[0.00050834904,0.0001419213,0.00013217254,0.0008555739,0.000187788,0.00048471717,0.00011079814,0.00032966438,0.00003610947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017612058,0.0010087495,0.02790563,0.0001545665,0.0009587336,0.0005564913,0.00061871647,0.0021008092,0.00057958474,0.91093266,0.028409222,0.0265987],"study_design_scores_gemma":[0.005049344,0.0011438127,0.227843,0.00009539257,0.00048644346,0.0034147096,0.0037463806,0.0037126727,0.00019599631,0.7123383,0.041166745,0.0008071609],"about_ca_topic_score_codex":0.000023783856,"about_ca_topic_score_gemma":0.000002147499,"teacher_disagreement_score":0.19993737,"about_ca_system_score_codex":0.00008223005,"about_ca_system_score_gemma":0.00012543026,"threshold_uncertainty_score":0.5787383},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.015565488803360757,"score_gpt":0.2464128874285505,"score_spread":0.23084739862518974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2347186258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02874272,0.00002546003,0.96948344,0.0012100976,0.00024223342,0.00011979132,0.000005244491,0.000022578199,0.00014845144],"genre_scores_gemma":[0.4807972,0.0000030533606,0.5189899,0.00004740432,0.00003686553,1.9800144e-7,5.694703e-7,0.000004118971,0.00012068822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990538,0.000050991508,0.00031175523,0.00012215617,0.0003431429,0.00011818905],"domain_scores_gemma":[0.9971112,0.0012040179,0.0006396044,0.0001336684,0.00085533323,0.000056195862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003663197,0.000088408255,0.00017419607,0.0006204002,0.00010269151,0.000027131158,0.0006471408,0.00003664063,0.0000075806147],"category_scores_gemma":[0.00022482863,0.0000570459,0.00013495208,0.00070805673,0.000058649955,0.00045542946,0.00011628068,0.000057244473,0.0000010447758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021454222,0.00023119977,0.0015754823,0.0000625784,0.0002774185,0.000042112075,0.00056232006,0.24251378,0.0034949633,0.7130112,0.0037378208,0.03427656],"study_design_scores_gemma":[0.0049223737,0.001966066,0.006696316,0.00071118196,0.00016064008,0.00035305825,0.00030390488,0.8388153,0.012810676,0.12937008,0.0033557136,0.0005347129],"about_ca_topic_score_codex":0.0000015705067,"about_ca_topic_score_gemma":1.5687003e-7,"teacher_disagreement_score":0.5963015,"about_ca_system_score_codex":0.00007602316,"about_ca_system_score_gemma":0.00012290575,"threshold_uncertainty_score":0.23262644},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.014365061261561854,"score_gpt":0.2163739961313764,"score_spread":0.20200893486981453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490727251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20592548,0.00013299685,0.78647053,0.003721163,0.0013825612,0.00017464171,0.000059210495,0.000023354733,0.0021100661],"genre_scores_gemma":[0.9843145,0.000051974534,0.014320622,0.00044059847,0.00031885886,4.007984e-7,0.00001806511,0.000014380373,0.0005205831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969421,0.0003514769,0.0007032557,0.00037402887,0.0013683286,0.00026080295],"domain_scores_gemma":[0.99479824,0.0017447544,0.0016286336,0.00041200357,0.0012437899,0.00017255146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077846297,0.00030823832,0.0004888197,0.0020751478,0.00018988003,0.00011221349,0.0019858188,0.00018397102,0.00007209775],"category_scores_gemma":[0.00017318108,0.00023093722,0.00056700205,0.0012401044,0.0001603774,0.00041548457,0.0007290581,0.000636499,0.000013825659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017563411,0.00023119601,0.00019495595,0.0000504691,0.00045031827,0.00009665996,0.00015313536,0.4731354,0.00023905803,0.5156744,0.004531918,0.0050668176],"study_design_scores_gemma":[0.005711794,0.0018195877,0.025011586,0.0018774823,0.0003760353,0.00044967997,0.00025169572,0.08008636,0.0029531827,0.8540021,0.025843209,0.001617297],"about_ca_topic_score_codex":0.000005213463,"about_ca_topic_score_gemma":8.16862e-7,"teacher_disagreement_score":0.77838904,"about_ca_system_score_codex":0.00032407633,"about_ca_system_score_gemma":0.0009796593,"threshold_uncertainty_score":0.9417347},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.02297092673404886,"score_gpt":0.2294830516176812,"score_spread":0.20651212488363235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527987597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49335027,0.0012908374,0.48828965,0.014837579,0.00029760206,0.00013594172,0.00004101474,0.00004693457,0.0017101888],"genre_scores_gemma":[0.9746157,0.00016087428,0.01035605,0.0003702783,0.00025984723,1.477866e-7,0.0000043056657,0.000025407018,0.014207425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980366,0.00010625528,0.00038248213,0.0002111145,0.0010164072,0.0002471203],"domain_scores_gemma":[0.9959695,0.0015879713,0.001013043,0.00018013154,0.0010437467,0.0002056547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043316648,0.00021117128,0.0005148087,0.0015774387,0.00014498697,0.00003748654,0.0004471802,0.00010856282,0.00059363485],"category_scores_gemma":[0.00058586797,0.00014903893,0.00045167093,0.0018213154,0.00012838254,0.0005729068,0.00011371552,0.00021167353,0.000025223853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012460343,0.0023496938,0.16335547,0.0008355762,0.009452337,0.004313601,0.00017928766,0.007067334,0.00034825067,0.4108568,0.35199973,0.047995877],"study_design_scores_gemma":[0.011294872,0.001123383,0.15899196,0.0035306837,0.0026709891,0.00123692,0.0013640212,0.0020037845,0.00032854822,0.6774681,0.13789397,0.0020927638],"about_ca_topic_score_codex":0.000005540753,"about_ca_topic_score_gemma":0.000008671357,"teacher_disagreement_score":0.4812654,"about_ca_system_score_codex":0.00021419025,"about_ca_system_score_gemma":0.0001725422,"threshold_uncertainty_score":0.64998853},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_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","score_opus":0.023638570692363654,"score_gpt":0.21859456848658648,"score_spread":0.19495599779422282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549157564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072973065,0.00014971467,0.91863734,0.0051128124,0.00028445915,0.000045966655,0.000049366907,0.000047343387,0.0026999363],"genre_scores_gemma":[0.90829825,0.00015479211,0.08705192,0.0010983885,0.00019525544,1.04249416e-7,0.0000061885717,0.000009546499,0.0031855763],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811083,0.00012180892,0.0004458329,0.00031138552,0.00070518727,0.00030494286],"domain_scores_gemma":[0.99744546,0.0008008879,0.00055308366,0.00025746602,0.00069736416,0.0002457054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042960997,0.00017216467,0.0003971097,0.0021213559,0.00019696311,0.000114433315,0.0014683245,0.00007531334,0.0004834735],"category_scores_gemma":[0.00015849282,0.00012385231,0.0003223854,0.0035232652,0.000114129594,0.0013786482,0.00037890242,0.00017315973,0.000120462384],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033114484,0.00103514,0.031013258,0.00006490395,0.0021792375,0.0018690396,0.000487047,0.018321399,0.0042423783,0.43250257,0.069879755,0.43807414],"study_design_scores_gemma":[0.0038557604,0.00087332824,0.03205649,0.0001416401,0.00017968207,0.0006060889,0.00019623102,0.004840392,0.00083991676,0.08158232,0.8739779,0.0008502179],"about_ca_topic_score_codex":0.00001789532,"about_ca_topic_score_gemma":0.0000014580486,"teacher_disagreement_score":0.8353252,"about_ca_system_score_codex":0.0001451555,"about_ca_system_score_gemma":0.0001229874,"threshold_uncertainty_score":0.5293696},"labels":[],"label_agreement":null},{"id":"W2560760141","doi":"10.20382/jocg.v7i1a17","title":"Near-linear time medial axis approximation of smooth curves in $\\mathbb{R}^3$","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Medial axis; Mathematics; Combinatorics; Geometry","score_opus":0.049667041797638936,"score_gpt":0.27971511019496265,"score_spread":0.23004806839732372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560760141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94471866,0.00036021823,0.050492935,0.00048120826,0.00018837342,0.00013256024,0.000030362115,0.00001826375,0.0035773905],"genre_scores_gemma":[0.9488462,0.000093350194,0.049711164,0.00009937694,0.0001916201,2.270723e-7,0.000027054817,0.000020811507,0.0010101487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998092,0.00013042681,0.00064447266,0.000115828174,0.00084665255,0.00017065053],"domain_scores_gemma":[0.99695176,0.0008047359,0.00082409923,0.000098525525,0.001184752,0.00013610753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011366787,0.00013596425,0.00046582703,0.00148172,0.00003897292,0.000018841354,0.0003017042,0.00008780929,0.0000987185],"category_scores_gemma":[0.0012972773,0.00013352398,0.00014323865,0.002138961,0.000117613505,0.0005347774,0.00007173913,0.00022040564,0.000009667474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00477252,0.0063837753,0.026685672,0.009054583,0.0017697769,0.001338418,0.018375352,0.46762067,0.00056453445,0.38658962,0.060831048,0.01601404],"study_design_scores_gemma":[0.025872193,0.0045071268,0.013550058,0.0044556484,0.0008560347,0.00065603387,0.011216698,0.11596254,0.0020043012,0.7742262,0.04447358,0.0022195969],"about_ca_topic_score_codex":0.000018236717,"about_ca_topic_score_gemma":0.0000024191459,"teacher_disagreement_score":0.38763657,"about_ca_system_score_codex":0.0001635346,"about_ca_system_score_gemma":0.0005075736,"threshold_uncertainty_score":0.544495},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.010345783404801747,"score_gpt":0.20170838760784748,"score_spread":0.19136260420304574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570381751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18375276,0.000081624705,0.81366503,0.00039386266,0.00039290474,0.00005220427,0.0000036422657,0.000019205707,0.001638757],"genre_scores_gemma":[0.74347496,0.000008930979,0.2560714,0.00013222807,0.00011939402,6.30131e-8,0.0000066130447,0.0000052331848,0.00018118277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982968,0.0001784094,0.00052034756,0.0001836657,0.00066060905,0.00016014228],"domain_scores_gemma":[0.99694836,0.0007049683,0.00079671305,0.00014598461,0.0012729666,0.00013099513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007259866,0.00012754298,0.00029527053,0.0012605783,0.00012961471,0.00005698608,0.0005834705,0.000056903984,0.000016929089],"category_scores_gemma":[0.00022228263,0.00013619389,0.00019241664,0.0015826962,0.00005392717,0.00063338876,0.00013740965,0.00018031076,0.0000063147063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042411746,0.00012005455,0.0014126272,0.000039540286,0.00011483271,0.000027706581,0.00020197296,0.7655404,0.0010106309,0.19327912,0.0004671215,0.037743535],"study_design_scores_gemma":[0.0075253756,0.0020396765,0.021619,0.00044411715,0.00021084661,0.00074625347,0.0005467769,0.80912673,0.005582871,0.08487305,0.066257656,0.0010276255],"about_ca_topic_score_codex":0.000004178057,"about_ca_topic_score_gemma":9.318351e-7,"teacher_disagreement_score":0.5597222,"about_ca_system_score_codex":0.00006949439,"about_ca_system_score_gemma":0.00024254029,"threshold_uncertainty_score":0.55538255},"labels":[],"label_agreement":null},{"id":"W2571441785","doi":"10.20382/jocg.v7i1a2","title":"Strict Confluent Drawing","year":2013,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Multidisciplinary University Research Initiative; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Graph; Path (computing); Enhanced Data Rates for GSM Evolution; Graph drawing; Boundary (topology); Order (exchange); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.0162556366757558,"score_gpt":0.2238675157719984,"score_spread":0.2076118790962426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571441785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18188329,0.00048661037,0.81260765,0.000956862,0.0020711147,0.00021967768,0.000016528178,0.00006557177,0.0016927116],"genre_scores_gemma":[0.8499822,0.00012668401,0.14743035,0.00041567566,0.00069853663,7.222331e-7,0.00006156662,0.000023203867,0.0012610587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966788,0.0003396474,0.0008400062,0.000500468,0.001312944,0.00032810468],"domain_scores_gemma":[0.99476475,0.0006985491,0.0015412425,0.00038198518,0.0022824074,0.00033107828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073706615,0.0003797921,0.0006214806,0.00319365,0.00022347276,0.00049306365,0.0019003849,0.00029010238,0.000099971236],"category_scores_gemma":[0.00015995408,0.0004138334,0.0005240051,0.0018166393,0.000073846044,0.001169627,0.001172073,0.0009892575,0.00005024626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035077806,0.00015100265,0.00022442207,0.00006617354,0.00031321673,0.00019691366,0.00018964936,0.93485624,0.00006971208,0.047000043,0.004170649,0.012726933],"study_design_scores_gemma":[0.005125733,0.0010469862,0.037039433,0.0008443021,0.00046612765,0.0008975149,0.00037197018,0.6225416,0.00081357587,0.14913586,0.17928497,0.0024319],"about_ca_topic_score_codex":0.00002198821,"about_ca_topic_score_gemma":8.035906e-7,"teacher_disagreement_score":0.6680989,"about_ca_system_score_codex":0.00047662927,"about_ca_system_score_gemma":0.0013405168,"threshold_uncertainty_score":0.9998314},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.02299352665663522,"score_gpt":0.23011672739409167,"score_spread":0.20712320073745644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604480575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875595,0.000024207995,0.0030676888,0.0014683559,0.00029407244,0.00011616025,0.000007359914,0.000010482091,0.0074521545],"genre_scores_gemma":[0.9989262,0.000011112666,0.00064038084,0.00012598487,0.00008256344,7.5383284e-8,0.00000748128,0.0000040107598,0.00020214592],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990966,0.000017939352,0.0003156028,0.00013546778,0.00032847418,0.00010592051],"domain_scores_gemma":[0.9985793,0.000054424792,0.0004981686,0.00017724966,0.0006634319,0.00002742154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005043631,0.000100162426,0.00023400695,0.0004797356,0.00022379348,0.00008806149,0.00032373687,0.00003868094,0.00018296392],"category_scores_gemma":[0.0002983895,0.00010027008,0.00009260189,0.00022411617,0.0001918425,0.0010237443,0.00018354798,0.00010805196,0.000012046371],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001327373,0.0013907804,0.45280534,0.002742471,0.0008109485,0.00019815848,0.00031614368,0.2563565,0.00020923775,0.2531191,0.0069744876,0.023749476],"study_design_scores_gemma":[0.00196036,0.00008393268,0.91198367,0.00008661853,0.0001916182,0.000016679058,0.0004955034,0.031035934,0.000015799867,0.022499964,0.031365816,0.00026409738],"about_ca_topic_score_codex":0.00022743351,"about_ca_topic_score_gemma":0.00004084275,"teacher_disagreement_score":0.45917836,"about_ca_system_score_codex":0.000046782545,"about_ca_system_score_gemma":0.000048377802,"threshold_uncertainty_score":0.4088895},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.013859262011055636,"score_gpt":0.2423047760116783,"score_spread":0.22844551400062266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618186495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008610179,0.0000071186323,0.98915637,0.0015410751,0.00030579107,0.00006245742,0.000016452599,0.000028482036,0.00027208787],"genre_scores_gemma":[0.8194418,0.000009878584,0.17892517,0.0007305903,0.0002731156,1.1042586e-7,0.000019067194,0.000011913656,0.00058835105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989715,0.000053849257,0.00025095377,0.00016800231,0.00040438824,0.00015128897],"domain_scores_gemma":[0.99835455,0.00055986736,0.00036428386,0.00013521577,0.0004113222,0.00017478318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021314934,0.00010490257,0.00017472004,0.0009540661,0.000120234625,0.00009408146,0.00049437105,0.000048413815,0.000045720328],"category_scores_gemma":[0.00014128219,0.00008758417,0.0001648954,0.00095406786,0.000038076185,0.000701288,0.000052008247,0.00007094296,0.000009244714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021755081,0.00021760946,0.004402481,0.00003489834,0.00018460705,0.00009036636,0.00010140361,0.12221601,0.00034710256,0.6233274,0.016086064,0.23277454],"study_design_scores_gemma":[0.0146437865,0.0022314137,0.010656704,0.0004658832,0.00017739245,0.00017063577,0.00023431705,0.50833595,0.0016900431,0.116046235,0.3443659,0.0009817199],"about_ca_topic_score_codex":0.0000019636589,"about_ca_topic_score_gemma":9.1678896e-7,"teacher_disagreement_score":0.8108316,"about_ca_system_score_codex":0.00014215703,"about_ca_system_score_gemma":0.00039024078,"threshold_uncertainty_score":0.3571579},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.011770719910364423,"score_gpt":0.20626728073711498,"score_spread":0.19449656082675054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768380610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24150221,0.00008157432,0.7546173,0.00017251844,0.00008904705,0.000027230848,0.000015732663,0.000051337087,0.0034431044],"genre_scores_gemma":[0.96670634,0.00009663072,0.03292622,0.000014567151,0.00005121072,3.129318e-8,0.0000018478512,0.000010173668,0.00019297241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991877,0.000022795131,0.0002754659,0.000070891256,0.0003261559,0.00011699891],"domain_scores_gemma":[0.9991743,0.00016447298,0.00020069322,0.000072679264,0.00029270386,0.000095183066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009438347,0.00009936432,0.0002657254,0.000888065,0.000020122252,0.0000045763054,0.00024014007,0.000051731826,0.00009300581],"category_scores_gemma":[0.000044051292,0.00007834666,0.00015882254,0.0007761957,0.0000666051,0.00028034905,0.000031284442,0.00010486535,0.000004916802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027390238,0.00016189694,0.005162664,0.00010096175,0.001085713,0.00034299569,0.000100273406,0.7472426,0.020204552,0.010161845,0.004014009,0.21114856],"study_design_scores_gemma":[0.01623446,0.0041420604,0.18371499,0.0020012357,0.0016515548,0.0011412689,0.001649978,0.03365462,0.20093973,0.10700679,0.44399002,0.0038733056],"about_ca_topic_score_codex":0.0000029520795,"about_ca_topic_score_gemma":7.2351276e-7,"teacher_disagreement_score":0.7252041,"about_ca_system_score_codex":0.00015538197,"about_ca_system_score_gemma":0.000042677366,"threshold_uncertainty_score":0.3194884},"labels":[],"label_agreement":null},{"id":"W2769340683","doi":"10.20382/jocg.v9i1a14","title":"Canonical ordering for graphs on the cylinder, with applications to periodic straight-line drawings on the flat cyclinder and torus","year":2017,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Torus; Cylinder; Geometry; Mathematics; Line (geometry); Line drawings; Combinatorics; Engineering drawing; Engineering","score_opus":0.03362954508143733,"score_gpt":0.26345186032960455,"score_spread":0.2298223152481672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769340683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18507369,0.000077288925,0.7960427,0.0168199,0.00036986833,0.00079874863,0.00003770038,0.000025289519,0.00075484545],"genre_scores_gemma":[0.96948475,0.000037138758,0.028320247,0.001233185,0.00038591342,0.000011770782,0.00002216046,0.00001924321,0.00048559083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978657,0.00013110704,0.00040896452,0.00049937394,0.0008403046,0.00025456626],"domain_scores_gemma":[0.99583596,0.0016869847,0.000786487,0.0005091646,0.00097313686,0.00020826765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072330853,0.00031637814,0.00037473935,0.00095444155,0.0011040756,0.00060246116,0.001539423,0.00015456985,0.000014882302],"category_scores_gemma":[0.00014322766,0.00021260997,0.00023669816,0.00070050807,0.00015231909,0.00025894764,0.00045769245,0.00076518464,0.00000421244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023115128,0.00011178141,0.00007620267,0.000036513724,0.00028824777,0.000029146757,0.00034962143,0.6676158,0.000044657445,0.32114255,0.00081669574,0.00925767],"study_design_scores_gemma":[0.008600033,0.006875152,0.036311466,0.0019190055,0.0008791478,0.00079930044,0.0011933848,0.30804798,0.0013373939,0.39024782,0.24046083,0.003328468],"about_ca_topic_score_codex":0.000009433573,"about_ca_topic_score_gemma":0.000014481202,"teacher_disagreement_score":0.7844111,"about_ca_system_score_codex":0.00018192198,"about_ca_system_score_gemma":0.0008567804,"threshold_uncertainty_score":0.8669983},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.07517421534455519,"score_gpt":0.32012790615535913,"score_spread":0.24495369081080393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773875520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006383232,0.00021405872,0.9839032,0.0072165057,0.00095295924,0.00047360652,0.0003581611,0.000053380703,0.00044488316],"genre_scores_gemma":[0.6073247,0.000016201893,0.39140916,0.00014717308,0.00049301103,6.922366e-7,0.00051545276,0.000017587798,0.00007598422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683034,0.00030472444,0.00066763646,0.0006703563,0.0011644317,0.00036250037],"domain_scores_gemma":[0.9926482,0.0020233677,0.0017941628,0.0010769496,0.002198689,0.00025862697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011647816,0.00038303656,0.0006718689,0.0017425896,0.0007434073,0.0007101864,0.0027831236,0.0002718547,0.00003894507],"category_scores_gemma":[0.00078744575,0.00035312067,0.0003452826,0.0006806855,0.00037046729,0.0013977726,0.00058447174,0.0007958824,0.0000029982589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003971031,0.00019782058,0.00011156258,0.00006895783,0.0003765476,0.00007431514,0.000051685816,0.68118346,0.000020951346,0.31286657,0.0029518486,0.0016991961],"study_design_scores_gemma":[0.0047620106,0.0008076054,0.0072525893,0.00036506078,0.0006139821,0.0003974043,0.000099209334,0.70590013,0.00014366055,0.25558627,0.02324439,0.0008277033],"about_ca_topic_score_codex":0.000008383801,"about_ca_topic_score_gemma":0.000005962849,"teacher_disagreement_score":0.60094154,"about_ca_system_score_codex":0.00024679862,"about_ca_system_score_gemma":0.0036636635,"threshold_uncertainty_score":0.99989206},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.01160676713131791,"score_gpt":0.24497944753088502,"score_spread":0.2333726803995671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788091414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046069257,0.000061178216,0.95258266,0.00045704446,0.00023346306,0.00005959947,0.0000060006987,0.000016231032,0.0005145403],"genre_scores_gemma":[0.9930031,0.00010298865,0.006220756,0.0001316241,0.000095885225,5.729885e-8,0.000008900752,0.000008379756,0.00042835457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983925,0.0001569227,0.0005451152,0.0001896815,0.0005229713,0.00019277474],"domain_scores_gemma":[0.9979921,0.00027402418,0.00073229853,0.00016594042,0.00070176006,0.00013387844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004821947,0.00012997369,0.000305266,0.0014769001,0.00005435708,0.00004848708,0.0007062323,0.00009034704,0.000056119243],"category_scores_gemma":[0.00009667941,0.000112435155,0.00013457949,0.0021543745,0.000067779714,0.0012428103,0.0001367761,0.00010209191,0.0000059763033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024275288,0.0009236686,0.052964218,0.00007754975,0.00033151684,0.00037466397,0.0006184384,0.5627428,0.0013311044,0.1653641,0.0036397665,0.21138938],"study_design_scores_gemma":[0.00569216,0.0006734048,0.06869555,0.00050752435,0.00006929941,0.00009016405,0.0002313604,0.9050743,0.00057623285,0.0064982143,0.0113347145,0.00055706437],"about_ca_topic_score_codex":0.0000138178275,"about_ca_topic_score_gemma":0.000005034318,"teacher_disagreement_score":0.9469338,"about_ca_system_score_codex":0.00015993736,"about_ca_system_score_gemma":0.00021077359,"threshold_uncertainty_score":0.45849726},"labels":[],"label_agreement":null},{"id":"W2788294399","doi":"10.20382/jocg.v9i1a1","title":"Computing maxmin edge length triangulations","year":2017,"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cutting-plane method; Combinatorics; Minimax; Point (geometry); Integer programming; Integer (computer science); Triangulation; Set (abstract data type); Polynomial; Discrete mathematics; Algorithm; Computer science; Mathematical optimization; Geometry","score_opus":0.02080231691856677,"score_gpt":0.24996725564721475,"score_spread":0.229164938728648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788294399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16700818,0.00009082372,0.826097,0.001553663,0.0010464204,0.00009270582,0.0000061140818,0.000038390786,0.0040666633],"genre_scores_gemma":[0.8988393,0.00001507731,0.09958776,0.00013262505,0.00042582848,7.5493304e-8,0.000009200569,0.000008720469,0.0009814389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814165,0.00013195234,0.0004941697,0.0002768386,0.0007107818,0.00024463382],"domain_scores_gemma":[0.99670845,0.00043345187,0.0011890416,0.00040449388,0.0010513947,0.00021319317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006634695,0.00018360399,0.00031993535,0.0013614646,0.0010190725,0.0004804,0.0016329823,0.000090711685,0.000038143477],"category_scores_gemma":[0.00028666013,0.00020001267,0.0002683778,0.0008334113,0.00010042432,0.002004635,0.00035931685,0.00028828956,0.000025427897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092785085,0.00029620432,0.00325731,0.000027285783,0.00028528113,0.0003559076,0.00045379196,0.6130333,0.00032442503,0.25705788,0.0032505628,0.12156526],"study_design_scores_gemma":[0.007803072,0.00077661907,0.28401002,0.00020468487,0.00018074215,0.0009294637,0.00034279737,0.5211851,0.0010299508,0.043049257,0.13934787,0.0011404075],"about_ca_topic_score_codex":0.000008277709,"about_ca_topic_score_gemma":0.0000028055445,"teacher_disagreement_score":0.7318311,"about_ca_system_score_codex":0.00017171845,"about_ca_system_score_gemma":0.00044543168,"threshold_uncertainty_score":0.815628},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_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","score_opus":0.00990543431285126,"score_gpt":0.17858412648300845,"score_spread":0.16867869217015719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788434477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9578728,0.0003231389,0.040821657,0.000017869397,0.00019389903,0.000043689794,0.000022024398,0.000019948955,0.0006849872],"genre_scores_gemma":[0.9877239,0.00008234211,0.012089317,0.000008064466,0.00003707364,3.0236865e-8,0.000006378146,0.00000995225,0.000042927764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948925,0.000013024602,0.00015246394,0.000057146797,0.00019902046,0.000089085464],"domain_scores_gemma":[0.9994521,0.000058397825,0.00012959693,0.00003935248,0.00020874459,0.00011181957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009006343,0.00008491495,0.00019396257,0.0004036059,0.00002102716,0.000011384801,0.000087566346,0.00003956816,0.000008086559],"category_scores_gemma":[0.000012182844,0.00007873104,0.000027187738,0.0002643267,0.000030115332,0.00026640206,0.000023094255,0.0000799802,4.781846e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000776697,0.00007477031,0.0011474264,0.00025657075,0.00046250364,0.0002858056,0.0007567345,0.9334359,0.01862859,0.038502354,0.0017820139,0.0038906238],"study_design_scores_gemma":[0.05729759,0.01343228,0.022133216,0.0024793593,0.0022881166,0.004624806,0.016053937,0.09092398,0.19211867,0.15512681,0.4387238,0.004797437],"about_ca_topic_score_codex":0.0000029180235,"about_ca_topic_score_gemma":0.0000010746115,"teacher_disagreement_score":0.84251195,"about_ca_system_score_codex":0.000040023253,"about_ca_system_score_gemma":0.00004307025,"threshold_uncertainty_score":0.32105586},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.014040307801698399,"score_gpt":0.21825494128515086,"score_spread":0.20421463348345245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888306059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23076102,0.00008662563,0.7648448,0.0011923914,0.00039601006,0.00008983851,0.0000058980518,0.00003300745,0.0025904332],"genre_scores_gemma":[0.9343609,0.000016324648,0.06463087,0.00013143303,0.00013122679,1.5191648e-7,0.000008271719,0.0000087041235,0.0007120866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9982682,0.00008875074,0.0003141987,0.00027615693,0.0008211787,0.00023151195],"domain_scores_gemma":[0.99746716,0.00023454166,0.00087271834,0.0003601491,0.0008477575,0.00021765934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035037135,0.00018697919,0.00028340236,0.0011749406,0.00073397503,0.0004615825,0.0014829998,0.00007113507,0.000016227872],"category_scores_gemma":[0.00009443492,0.00017690269,0.00016594116,0.000764102,0.00011043779,0.0022702133,0.0001637605,0.00026566652,0.000009727454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003753092,0.0003133982,0.011616519,0.00004317398,0.00054984464,0.0011460419,0.00073171523,0.7190493,0.00041651487,0.23886375,0.0025410901,0.02435335],"study_design_scores_gemma":[0.0139824115,0.0030262098,0.5953817,0.00063022936,0.0003945897,0.0027179793,0.00089716935,0.17484665,0.0026294503,0.08622423,0.11702953,0.0022398718],"about_ca_topic_score_codex":0.000013452413,"about_ca_topic_score_gemma":0.0000052367163,"teacher_disagreement_score":0.7035999,"about_ca_system_score_codex":0.00011072807,"about_ca_system_score_gemma":0.0003872507,"threshold_uncertainty_score":0.7213882},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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)","score_opus":0.016700989118549496,"score_gpt":0.21151987308479653,"score_spread":0.19481888396624703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890636645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09115114,0.0014664007,0.9021047,0.0007943499,0.0014070111,0.00015580046,0.000023598508,0.000060077728,0.0028369215],"genre_scores_gemma":[0.82711947,0.00024802182,0.17081194,0.0003756849,0.00050629245,3.5986935e-7,0.000045260258,0.000022339744,0.00087064365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975006,0.00019841053,0.0006240464,0.000509973,0.0008805044,0.00028647555],"domain_scores_gemma":[0.99685216,0.00035256904,0.0010867526,0.00030291482,0.0010734686,0.0003321583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005815089,0.0003504359,0.0005842397,0.0027252282,0.00022304371,0.0002688437,0.0012689235,0.0002781157,0.00003513324],"category_scores_gemma":[0.0000799468,0.00038828034,0.0003335296,0.0011809642,0.00011631482,0.00089517643,0.00085302896,0.00083034567,0.000012581102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042887757,0.0007260964,0.0028168363,0.0004841758,0.0018868125,0.001872816,0.0027783653,0.3333571,0.0003518336,0.5454227,0.010229656,0.099644735],"study_design_scores_gemma":[0.0059113773,0.0015853631,0.06792969,0.00094172056,0.0006892581,0.0025703446,0.000461805,0.09039583,0.0008436583,0.7467583,0.07912401,0.0027886564],"about_ca_topic_score_codex":0.00002564971,"about_ca_topic_score_gemma":0.0000019135225,"teacher_disagreement_score":0.73596835,"about_ca_system_score_codex":0.00020860296,"about_ca_system_score_gemma":0.00083272456,"threshold_uncertainty_score":0.9998569},"labels":[],"label_agreement":null},{"id":"W2890802049","doi":"10.20382/jocg.v11i1a3","title":"New lower bounds for the number of pseudoline arrangements","year":2019,"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Sorting network; Graph; Sorting; Constant (computer programming); Sorting algorithm; Algorithm; Computer science; Mathematical analysis","score_opus":0.010241576557437881,"score_gpt":0.23630385694285558,"score_spread":0.2260622803854177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890802049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12761119,0.0000913307,0.868996,0.0009478314,0.0011693058,0.0001603427,0.000006647335,0.000010581798,0.0010067571],"genre_scores_gemma":[0.84943384,0.00002270233,0.14566875,0.00025404122,0.0003169988,1.9542509e-7,0.00000845316,0.000008401885,0.004286649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862784,0.000051550105,0.00037968054,0.00017015872,0.0006142573,0.00015652663],"domain_scores_gemma":[0.99750024,0.00072448817,0.00055204233,0.00018369299,0.000936345,0.00010316261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000415199,0.0001230734,0.00023633068,0.0005286659,0.00010848236,0.00006843848,0.0008004395,0.0000531739,0.00015542553],"category_scores_gemma":[0.000051133946,0.00010458182,0.00025727262,0.0013644767,0.000030450605,0.0006704436,0.00011512517,0.00013598983,0.000021476722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036707125,0.00023286311,0.0045490786,0.000053985408,0.00049445714,0.000017706121,0.00025090954,0.76712364,0.00054645486,0.18143284,0.011163259,0.03376774],"study_design_scores_gemma":[0.013724636,0.0017733303,0.06756922,0.00022783424,0.00037006912,0.0004932868,0.00044121692,0.33808392,0.0017529353,0.076426566,0.4981629,0.0009740938],"about_ca_topic_score_codex":0.0000070913075,"about_ca_topic_score_gemma":7.8265896e-7,"teacher_disagreement_score":0.7233273,"about_ca_system_score_codex":0.00008328468,"about_ca_system_score_gemma":0.000431644,"threshold_uncertainty_score":0.42647228},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Point (geometry); Combinatorics; Geometry","score_opus":0.012509513563585475,"score_gpt":0.22090020614609818,"score_spread":0.2083906925825127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962836387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10057445,0.00012793679,0.8945165,0.0015637656,0.00032479974,0.00012961224,0.0000012735564,0.00004133288,0.0027203027],"genre_scores_gemma":[0.8810544,0.000026925623,0.11733043,0.00039465292,0.000218296,2.3968778e-7,0.0000019848565,0.0000113904725,0.00096167094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822533,0.00020021986,0.0003201003,0.00020703263,0.00069088524,0.00035645074],"domain_scores_gemma":[0.99747723,0.00066983467,0.00036914131,0.0002361305,0.0009724533,0.000275222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046412268,0.00014557148,0.00025627945,0.0009543239,0.00016786135,0.00015169372,0.0012875773,0.00006345377,0.00012029891],"category_scores_gemma":[0.000091337606,0.00014056398,0.00019381668,0.0023027223,0.000115732946,0.0017566138,0.00030005473,0.00037261532,0.00012351334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056965553,0.00016437242,0.004815128,0.000014861379,0.00016263808,0.00034121072,0.00020548495,0.5422246,0.00012654449,0.40993932,0.006435083,0.035513803],"study_design_scores_gemma":[0.0021483675,0.0008598766,0.042669043,0.000096914475,0.0000311811,0.0004971048,0.00035515588,0.045860916,0.00014984465,0.8690964,0.037658725,0.00057644874],"about_ca_topic_score_codex":0.0000065578515,"about_ca_topic_score_gemma":7.492534e-7,"teacher_disagreement_score":0.78047997,"about_ca_system_score_codex":0.00015219674,"about_ca_system_score_gemma":0.00017908223,"threshold_uncertainty_score":0.57320327},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.012965189556991682,"score_gpt":0.23298692041010693,"score_spread":0.22002173085311524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963119423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87094307,0.00014387768,0.12646078,0.0008462792,0.00017410553,0.000030617484,0.000019298415,0.0000095418945,0.001372412],"genre_scores_gemma":[0.97353137,0.00008624156,0.02603737,0.00006274862,0.000024335402,1.601152e-8,0.0000026092496,0.000002484768,0.00025284858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988829,0.000091082504,0.00030283595,0.0001930432,0.0003727267,0.00015744388],"domain_scores_gemma":[0.9978304,0.0004602655,0.0008164295,0.0002884603,0.0004542263,0.00015020989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033315993,0.00010986071,0.00036416814,0.0011011059,0.00024535749,0.00009318297,0.0012008769,0.00007009265,0.00004788245],"category_scores_gemma":[0.00022865445,0.00009831235,0.00017982784,0.0009604903,0.00027983374,0.00085361575,0.0004211469,0.00014808754,0.000003147999],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045601765,0.0014041085,0.19035111,0.00012484365,0.0019687042,0.0023990658,0.00056975434,0.1707972,0.0010594301,0.5486358,0.004301602,0.077932365],"study_design_scores_gemma":[0.0061367764,0.0021479062,0.78668404,0.00011134961,0.00044926337,0.0007660716,0.0007225183,0.052644014,0.00093951734,0.13077234,0.017737266,0.00088892423],"about_ca_topic_score_codex":0.000038116046,"about_ca_topic_score_gemma":0.0000023766333,"teacher_disagreement_score":0.5963329,"about_ca_system_score_codex":0.000025014338,"about_ca_system_score_gemma":0.000090737965,"threshold_uncertainty_score":0.40090612},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund","keywords":"Persistence (discontinuity); Computation; Computer science; Matching (statistics); Algorithm; Mathematics; Statistics; Engineering","score_opus":0.024910838561059138,"score_gpt":0.2164718685251791,"score_spread":0.19156102996411997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963492452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24810533,0.00005838316,0.74760574,0.0036922437,0.00012369764,0.00004079085,0.000013026026,0.000012477859,0.00034828595],"genre_scores_gemma":[0.97741216,0.000014300446,0.021943916,0.00050754315,0.00004591174,3.485991e-8,0.0000022234785,0.0000032998662,0.000070636204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984118,0.00015782751,0.00034963168,0.00021482684,0.00072703586,0.00013889623],"domain_scores_gemma":[0.9981358,0.00055766065,0.0006563794,0.000152993,0.000365971,0.00013116818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020727133,0.00012334093,0.00028951935,0.0005179658,0.00013388688,0.00006180119,0.0012069435,0.0000512241,0.00001648852],"category_scores_gemma":[0.00018927269,0.00009037011,0.0003219879,0.0032088975,0.00010491278,0.00054013636,0.00023449586,0.0002720985,0.000006022785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007736773,0.0001494133,0.0020200766,0.00002960776,0.0001812893,0.0000614033,0.00043977253,0.92833996,0.0001044124,0.057119478,0.00050784607,0.010969354],"study_design_scores_gemma":[0.0041993484,0.0023618257,0.25557905,0.00042249868,0.00043597753,0.00017656806,0.0024702835,0.6491738,0.0013439867,0.062731445,0.019955928,0.0011493046],"about_ca_topic_score_codex":0.000006397291,"about_ca_topic_score_gemma":4.2854236e-7,"teacher_disagreement_score":0.7293068,"about_ca_system_score_codex":0.00006422744,"about_ca_system_score_gemma":0.00007027123,"threshold_uncertainty_score":0.36851862},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.009232245547067383,"score_gpt":0.20229480824700038,"score_spread":0.193062562699933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963712264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33918872,0.00009389766,0.6571289,0.00056116615,0.00018779338,0.000031121683,0.0000068217055,0.00002316807,0.00277842],"genre_scores_gemma":[0.95241135,0.000015622734,0.046691604,0.00022238372,0.00023256628,4.2810296e-8,0.0000054020034,0.0000041228755,0.00041687692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985963,0.00006787454,0.00025168216,0.00015235307,0.00064276555,0.00028899676],"domain_scores_gemma":[0.9984903,0.00026560927,0.00035773928,0.00016520142,0.00042047436,0.00030070564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031436537,0.00013036844,0.00027600394,0.0015101797,0.00014934734,0.00007332696,0.0008498962,0.00006291478,0.00009342945],"category_scores_gemma":[0.000040260962,0.00010173493,0.00016902617,0.0039007806,0.000078939265,0.0015665955,0.0002059357,0.00021491754,0.000035416193],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000634286,0.0018505361,0.28483108,0.000054860724,0.0017501106,0.00093749544,0.0011576733,0.16756675,0.0003465574,0.38041395,0.01200826,0.14844845],"study_design_scores_gemma":[0.0059463596,0.0025355231,0.5458886,0.00008912552,0.0006188864,0.0019471467,0.0011211132,0.013238778,0.0008790863,0.014040408,0.41210812,0.001586817],"about_ca_topic_score_codex":0.000012794899,"about_ca_topic_score_gemma":0.0000025405777,"teacher_disagreement_score":0.61322266,"about_ca_system_score_codex":0.00010747327,"about_ca_system_score_gemma":0.00010393347,"threshold_uncertainty_score":0.414863},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.03357880101853126,"score_gpt":0.24181612233605343,"score_spread":0.20823732131752218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963964459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40606287,0.00017050683,0.59226096,0.0004754034,0.00039689773,0.000056824727,0.0000024909416,0.000017455604,0.0005565974],"genre_scores_gemma":[0.8764902,0.000012637083,0.12297618,0.00012389963,0.00018963273,6.020312e-8,0.000006633626,0.000007383888,0.00019341505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817723,0.00016302888,0.00041792725,0.00023051345,0.0007854962,0.00022578769],"domain_scores_gemma":[0.99799806,0.00021569103,0.0004044597,0.00014604247,0.00096365233,0.00027211205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007133261,0.00015515534,0.0002739132,0.002327229,0.00008037606,0.000119852506,0.00061156263,0.00007982643,0.000010071776],"category_scores_gemma":[0.00014408988,0.00017023894,0.0001277155,0.0035065592,0.00004065016,0.0014059378,0.00016118369,0.0002641914,0.000008625356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006370879,0.00015612054,0.0038533655,0.000006129977,0.00003310038,0.00032665272,0.00024877393,0.9709492,0.00016725049,0.021574,0.00047017055,0.0021515838],"study_design_scores_gemma":[0.0034247458,0.0005414117,0.01358094,0.00009338988,0.00003700768,0.00073783094,0.00049844675,0.9488744,0.00031814547,0.011948532,0.019492654,0.0004524757],"about_ca_topic_score_codex":0.00003066978,"about_ca_topic_score_gemma":0.000005258901,"teacher_disagreement_score":0.4704273,"about_ca_system_score_codex":0.00039826796,"about_ca_system_score_gemma":0.0009527583,"threshold_uncertainty_score":0.6942143},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.018727385570210524,"score_gpt":0.26946614948031444,"score_spread":0.2507387639101039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964027251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16736381,0.00010373286,0.8311759,0.00026920665,0.00043696447,0.00026378146,0.000025942327,0.000016835076,0.0003438097],"genre_scores_gemma":[0.79972565,0.000010057386,0.19986448,0.00009527692,0.00016726636,2.2334653e-7,0.00002166006,0.000008368565,0.00010699255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981867,0.00018154421,0.00045913752,0.00023619956,0.00073869526,0.00019771344],"domain_scores_gemma":[0.9953975,0.0008903874,0.00081508927,0.00019740775,0.002479571,0.00022002365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008977657,0.0001727222,0.0003210512,0.0008325056,0.00019236577,0.000110993096,0.0008802412,0.000074802185,0.000005377822],"category_scores_gemma":[0.000046836976,0.00015112461,0.00021653395,0.0018633474,0.00007100813,0.0012252331,0.000069402835,0.00019794275,0.000002736924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013244474,0.00033725693,0.00033733368,0.000015923903,0.0001309007,0.000019696501,0.0007365102,0.97682595,0.00086567225,0.0032396254,0.001174719,0.016183976],"study_design_scores_gemma":[0.0027051212,0.0015969201,0.0056176474,0.000026774673,0.00008902432,0.00009338339,0.000944359,0.9783935,0.0041384934,0.0034431035,0.0027260343,0.00022566745],"about_ca_topic_score_codex":0.000023715445,"about_ca_topic_score_gemma":0.0000012143931,"teacher_disagreement_score":0.6323619,"about_ca_system_score_codex":0.00021512625,"about_ca_system_score_gemma":0.0008630632,"threshold_uncertainty_score":0.6162683},"labels":[],"label_agreement":null},{"id":"W2964178647","doi":"10.20382/jocg.v7i2a8","title":"$1$-string $B_2$-VPG representation of planar graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Planar; Planar graph; String (physics); Enhanced Data Rates for GSM Evolution; Graph; Representation (politics); Grid; Geometry; Computer science; Telecommunications","score_opus":0.015875335257328694,"score_gpt":0.22345510327284096,"score_spread":0.20757976801551226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964178647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2756798,0.000067839814,0.7224192,0.00078835455,0.00037764994,0.00006012265,0.000008315471,0.00002176776,0.00057693326],"genre_scores_gemma":[0.9363845,0.00005744989,0.06290654,0.00007496798,0.00010829849,1.2056027e-7,0.000005757868,0.0000067076926,0.00045568464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813753,0.00014510263,0.0005313532,0.00023470823,0.0007721624,0.00017916568],"domain_scores_gemma":[0.99712986,0.00070805516,0.0008030337,0.00019286698,0.001019963,0.00014621034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003670637,0.00014137368,0.0002948705,0.0019786227,0.000108634944,0.000042725806,0.0006823573,0.00007112702,0.00003553852],"category_scores_gemma":[0.00014914453,0.000121306846,0.00023962442,0.0024775623,0.00007316462,0.0013307363,0.00010039441,0.00011965205,0.000008917067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025985885,0.00030620172,0.009236641,0.0000435363,0.00038475558,0.00020969738,0.00031017634,0.14525874,0.011620088,0.73451537,0.002991404,0.09486351],"study_design_scores_gemma":[0.018895123,0.0034112835,0.2783292,0.0010547773,0.00040738197,0.0017458133,0.00083416636,0.031623747,0.06105848,0.53684765,0.063637756,0.0021546038],"about_ca_topic_score_codex":0.0000064622423,"about_ca_topic_score_gemma":0.0000012405343,"teacher_disagreement_score":0.6607047,"about_ca_system_score_codex":0.00012447375,"about_ca_system_score_gemma":0.0002698093,"threshold_uncertainty_score":0.49467498},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.036005960153360064,"score_gpt":0.2348440229917289,"score_spread":0.19883806283836886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964200445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39610547,0.0000843818,0.59787905,0.0031747108,0.00050440547,0.00006388726,0.000006814359,0.000020893327,0.0021603976],"genre_scores_gemma":[0.9302503,0.000030442658,0.0684603,0.00034097306,0.0003047906,8.829125e-8,0.000005763838,0.0000068839317,0.0006004574],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986403,0.00007430752,0.00029736655,0.00023904868,0.00055150525,0.0001974827],"domain_scores_gemma":[0.99802625,0.00028455618,0.0006567106,0.00026668457,0.00056627166,0.00019951769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037149768,0.00015582066,0.00024907675,0.0009247123,0.00052887475,0.0004006527,0.0009485638,0.00007668456,0.000028692317],"category_scores_gemma":[0.0001238828,0.00015906087,0.00012349385,0.00037717377,0.00009777942,0.0017757309,0.0003152146,0.00022521801,0.000011797703],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041174327,0.00045167122,0.03607296,0.000119815515,0.0009908316,0.0028376637,0.00082369044,0.23738602,0.0011591668,0.22077347,0.017323932,0.48164904],"study_design_scores_gemma":[0.006109811,0.00095122895,0.6902185,0.00015242868,0.00015674367,0.0022490926,0.0001999284,0.089277245,0.0006118878,0.0561374,0.1529264,0.0010093083],"about_ca_topic_score_codex":0.0000103309785,"about_ca_topic_score_gemma":0.000004445116,"teacher_disagreement_score":0.65414554,"about_ca_system_score_codex":0.00007490083,"about_ca_system_score_gemma":0.00018508513,"threshold_uncertainty_score":0.64863145},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.010550889057796328,"score_gpt":0.20784771048753956,"score_spread":0.19729682142974322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970343152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35260877,0.00009159531,0.6398996,0.0014064705,0.00089289853,0.00011333229,0.00001319812,0.000039111168,0.0049350304],"genre_scores_gemma":[0.91521174,0.000014987518,0.081475385,0.001112743,0.00026339618,1.3303078e-7,0.000016140182,0.000011996683,0.0018934581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.997724,0.0001464547,0.0005049536,0.0003422288,0.0010017285,0.00028065155],"domain_scores_gemma":[0.99766797,0.0004119608,0.0005972962,0.00023662786,0.0008835862,0.00020257809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005635735,0.00020992896,0.00035995516,0.0018531737,0.00017549275,0.00016359218,0.00097519305,0.000092108035,0.00023320063],"category_scores_gemma":[0.000046160527,0.00022438138,0.00033213175,0.002246298,0.000043489566,0.0014479941,0.00023446864,0.00032114927,0.00013858668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017168628,0.00028014317,0.007530789,0.000065054584,0.00047425376,0.0002977289,0.0009125161,0.6896392,0.0029999828,0.26360837,0.009153525,0.024866756],"study_design_scores_gemma":[0.0070738066,0.0015060169,0.059542533,0.00021376666,0.00013734629,0.0020003582,0.00054829527,0.2662038,0.00092956866,0.04445071,0.6159052,0.0014885953],"about_ca_topic_score_codex":0.0000038223616,"about_ca_topic_score_gemma":6.744673e-7,"teacher_disagreement_score":0.6067517,"about_ca_system_score_codex":0.00019476346,"about_ca_system_score_gemma":0.00040995583,"threshold_uncertainty_score":0.9150007},"labels":[],"label_agreement":null},{"id":"W2971946515","doi":"10.20382/jocg.v6i1a1","title":"On a Conjecture of Lovász on Circle-Representations of Simple 4-Regular Planar Graphs","year":2012,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Social Fund","keywords":"Combinatorics; Planar graph; Mathematics; Conjecture; Simple (philosophy); Discrete mathematics; Realization (probability); Intersection (aeronautics); Graph","score_opus":0.018798535108596904,"score_gpt":0.2717825177839632,"score_spread":0.25298398267536626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971946515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41189817,0.00019730722,0.5848677,0.00041675335,0.00052454555,0.00030931798,0.00017475487,0.000026909083,0.001584529],"genre_scores_gemma":[0.98238075,0.00003676972,0.017285649,0.00006567258,0.000074497926,3.3651176e-7,0.000035286404,0.000018629089,0.00010242761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660116,0.00041294235,0.0006983305,0.00039057358,0.0015703839,0.00032661343],"domain_scores_gemma":[0.9944587,0.0016850532,0.0017149172,0.0006231694,0.0012538723,0.00026434145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062407146,0.00029040413,0.0007296922,0.004324762,0.00011438491,0.00004146443,0.0019849136,0.00024373307,0.000049309725],"category_scores_gemma":[0.00019249938,0.00031362218,0.0006019459,0.0020501537,0.00028753164,0.00042832608,0.0005202235,0.0010551898,0.000005872372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029944116,0.0003988921,0.0008616615,0.00013133339,0.00046868753,0.00010859616,0.00029344246,0.6005833,0.00028779943,0.39377806,0.0004387791,0.0023499804],"study_design_scores_gemma":[0.0032300495,0.00154474,0.026319403,0.0006759231,0.00020165855,0.00013239506,0.0003819074,0.00617147,0.0034689624,0.9557507,0.0014378406,0.0006849626],"about_ca_topic_score_codex":0.000017353139,"about_ca_topic_score_gemma":0.0000014200308,"teacher_disagreement_score":0.59441185,"about_ca_system_score_codex":0.0001959809,"about_ca_system_score_gemma":0.00053695665,"threshold_uncertainty_score":0.9999316},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hausdorff distance; Subsequence; Combinatorics; Hausdorff space; Line segment; Line (geometry); Time complexity; Algorithm; Geometry; Mathematical analysis","score_opus":0.015877394298005575,"score_gpt":0.2400329222241248,"score_spread":0.22415552792611923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023761765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33496377,0.00006668068,0.66351324,0.0008949733,0.00026259536,0.00005521533,0.0000039097263,0.000012802168,0.00022678741],"genre_scores_gemma":[0.9399724,0.000013084275,0.05910705,0.000368912,0.0003241051,8.235111e-8,0.000004919606,0.0000058658497,0.00020357069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998689,0.00011808496,0.00029612612,0.00021893007,0.00052036764,0.00015752054],"domain_scores_gemma":[0.99806625,0.0004512519,0.00042238823,0.00017150564,0.00077543355,0.000113200564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041859216,0.00013340583,0.0001654358,0.00069564313,0.0003949498,0.00014121787,0.0005171624,0.00005316161,0.000018001785],"category_scores_gemma":[0.00009025353,0.000112693,0.00008566782,0.001453276,0.0001523429,0.0006655,0.000116896044,0.00019015696,0.000005953937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019814982,0.0001445127,0.00034238183,0.000010783157,0.0001128512,0.000050370578,0.0004226692,0.6681176,0.00084548164,0.31299815,0.001116747,0.015640335],"study_design_scores_gemma":[0.0017433878,0.00094136427,0.01376642,0.00007302936,0.00006949489,0.00050348265,0.00025454187,0.9303777,0.0013536119,0.021675017,0.028858133,0.00038378744],"about_ca_topic_score_codex":0.000004052058,"about_ca_topic_score_gemma":0.0000013304812,"teacher_disagreement_score":0.60500866,"about_ca_system_score_codex":0.00012028262,"about_ca_system_score_gemma":0.00019491474,"threshold_uncertainty_score":0.45954874},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.010761878942917812,"score_gpt":0.18444697886091282,"score_spread":0.17368509991799502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037345875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91780204,0.0000494969,0.07954917,0.001156227,0.00012519295,0.00030141577,0.000032782613,0.000031371866,0.00095228216],"genre_scores_gemma":[0.9812416,0.000007037619,0.017185794,0.00044282677,0.00014671485,0.000002480868,0.00028388767,0.000015058574,0.0006746369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989761,0.000013613509,0.00026617362,0.00015485837,0.0004609316,0.0001283288],"domain_scores_gemma":[0.9991971,0.00006103146,0.00026780818,0.000061872866,0.00039000346,0.000022187114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033126274,0.00011363325,0.00017906727,0.0013731598,0.00036105636,0.000070639086,0.00016775525,0.000023704284,0.00031281982],"category_scores_gemma":[0.00002439938,0.000119112774,0.00008316686,0.0017502236,0.00004813,0.00093833107,0.0000382406,0.00013106025,0.000007878462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011875834,0.00038417915,0.010832139,0.00041630046,0.00030284197,0.00003602137,0.00018046204,0.9454496,0.000085186955,0.032992765,0.004014325,0.0041185967],"study_design_scores_gemma":[0.006579826,0.0005440731,0.07851694,0.000050964398,0.00046218807,0.000029134902,0.0028847046,0.5009527,0.000029359418,0.004705063,0.40457326,0.0006717725],"about_ca_topic_score_codex":0.000043865588,"about_ca_topic_score_gemma":0.000006986108,"teacher_disagreement_score":0.44449687,"about_ca_system_score_codex":0.00007371592,"about_ca_system_score_gemma":0.00006629718,"threshold_uncertainty_score":0.4857278},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.021899771686030044,"score_gpt":0.22805388347335698,"score_spread":0.20615411178732693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037925904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024308687,0.00026809162,0.9661035,0.0009494898,0.0033889764,0.000121854566,0.000054568012,0.00006757434,0.0047372663],"genre_scores_gemma":[0.6644813,0.00024406803,0.32791117,0.00035360118,0.0018755647,2.822842e-7,0.0001943926,0.00003948395,0.0049001435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978499,0.00012285744,0.000419215,0.00031977092,0.0009987715,0.0002895032],"domain_scores_gemma":[0.99745786,0.00012785922,0.00083353603,0.00032582186,0.00097410585,0.00028083564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004548576,0.00024678468,0.00043594014,0.0016446828,0.000090018126,0.0003575865,0.002450177,0.00014337737,0.00002618337],"category_scores_gemma":[0.000059693728,0.00025938128,0.00029497282,0.0010879376,0.00007102116,0.0012695623,0.0015507187,0.0006428237,0.0000101270825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104748266,0.00037820445,0.0018033497,0.00016917581,0.00096279127,0.001889933,0.00076958275,0.7898395,0.000005076491,0.12001824,0.054666314,0.029393107],"study_design_scores_gemma":[0.0057203984,0.0009825489,0.027544951,0.0006255062,0.0005762839,0.00038873527,0.0010408071,0.21207917,0.00008022236,0.20315048,0.54559755,0.0022133482],"about_ca_topic_score_codex":0.000015270569,"about_ca_topic_score_gemma":0.0000015390444,"teacher_disagreement_score":0.6401726,"about_ca_system_score_codex":0.00037051775,"about_ca_system_score_gemma":0.0008727638,"threshold_uncertainty_score":0.9999858},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.028764422130967734,"score_gpt":0.24245818655587084,"score_spread":0.21369376442490312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046659318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13337304,0.000019653187,0.852122,0.002295775,0.00040470855,0.00007574246,0.0000036896272,0.000019468303,0.011685925],"genre_scores_gemma":[0.9494106,0.0000044807907,0.049521793,0.0006269725,0.00020675425,3.8177962e-8,0.0000039231154,0.0000031744894,0.00022226587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989367,0.00011673299,0.00023085385,0.00013282985,0.0004280743,0.00015482391],"domain_scores_gemma":[0.99906564,0.0002242486,0.0002402546,0.00015706128,0.0002652135,0.00004761369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005617158,0.00008557421,0.00012983166,0.0008958704,0.00011743042,0.00015843862,0.0014944095,0.00002381376,0.000037276135],"category_scores_gemma":[0.000043481377,0.00006875353,0.000075817195,0.001581042,0.000080537946,0.000966931,0.00027713287,0.00017518083,0.000024657224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016948569,0.00090099615,0.023278708,0.00006789471,0.00035422627,0.0030933295,0.0054186177,0.027760047,0.00023550907,0.6305414,0.05686243,0.2513174],"study_design_scores_gemma":[0.0038609179,0.0012168805,0.28328666,0.00021184132,0.000058423437,0.00054767635,0.003561405,0.25081453,0.000049311144,0.030887727,0.4248625,0.000642158],"about_ca_topic_score_codex":0.000008197043,"about_ca_topic_score_gemma":0.000004472869,"teacher_disagreement_score":0.81603754,"about_ca_system_score_codex":0.000059706344,"about_ca_system_score_gemma":0.00005870712,"threshold_uncertainty_score":0.28036878},"labels":[],"label_agreement":null},{"id":"W3046875671","doi":"10.20382/jocg.v10i1a9","title":"Simplices modelled on spaces of constant curvature","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Commission","keywords":"Mathematics; Sectional curvature; Constant curvature; Constant (computer programming); Degeneracy (biology); Curvature; Manifold (fluid mechanics); Euclidean geometry; Riemannian manifold; Pure mathematics; Mathematical analysis; Geometry; Scalar curvature; Computer science","score_opus":0.05500991867050343,"score_gpt":0.3049519675806311,"score_spread":0.24994204891012767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046875671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95281965,0.00014200583,0.026919557,0.0006430117,0.0002516143,0.00008201503,0.00005410443,0.000012419892,0.019075628],"genre_scores_gemma":[0.9915718,0.00006637322,0.007065951,0.00004364281,0.00010482147,4.24676e-8,0.00000213917,0.00000910519,0.0011361558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986859,0.00005022561,0.00038597122,0.000117557014,0.00060581637,0.00015454393],"domain_scores_gemma":[0.9961868,0.00098197,0.0015761706,0.0002026211,0.000957574,0.00009484171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041140732,0.00014071638,0.00042811842,0.0011086455,0.00023856174,0.000079430785,0.0005644206,0.00009046843,0.0000768261],"category_scores_gemma":[0.0006863095,0.00012370174,0.0002076231,0.00043673383,0.00014472206,0.00046931932,0.00009446466,0.00024284996,0.0000025907798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008009902,0.00049199583,0.0021363837,0.0004153514,0.0006981246,0.00020764647,0.0005570545,0.053447153,0.00011867888,0.9345935,0.0037092597,0.0028238674],"study_design_scores_gemma":[0.008159311,0.0019314926,0.008321281,0.0011385004,0.000636595,0.00023882382,0.005188114,0.008017334,0.0020994875,0.9263351,0.03698565,0.0009483179],"about_ca_topic_score_codex":0.0000132688365,"about_ca_topic_score_gemma":0.000002386181,"teacher_disagreement_score":0.04542982,"about_ca_system_score_codex":0.00006396582,"about_ca_system_score_gemma":0.00019403237,"threshold_uncertainty_score":0.5044411},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.008976801698028948,"score_gpt":0.19852883926875958,"score_spread":0.18955203757073064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081710876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73935974,0.000054305012,0.25594637,0.000105832936,0.0010095624,0.00004555568,0.000024130282,0.000047759713,0.0034067654],"genre_scores_gemma":[0.97998273,0.000041457577,0.019202147,0.00011939072,0.00034545,3.429681e-8,0.0000027557383,0.00001326167,0.0002927702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992935,0.00002023359,0.00021850037,0.00008805366,0.00023785904,0.0001418724],"domain_scores_gemma":[0.99922156,0.00006243574,0.000119667595,0.00008468487,0.0004023347,0.000109313536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014060523,0.00010284405,0.00019219624,0.00036688067,0.00006590703,0.000021074817,0.00018295328,0.000059272486,0.00031879952],"category_scores_gemma":[0.000021877151,0.00010797105,0.00010428484,0.00043254046,0.000043942153,0.0003055416,0.000033899996,0.00011705436,0.00003077868],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008910043,0.0004407739,0.0023730427,0.0004333105,0.0012854523,0.00050642807,0.0013287378,0.78746754,0.055640057,0.0693521,0.050664805,0.029616773],"study_design_scores_gemma":[0.0036311643,0.0010543057,0.007264801,0.00012895172,0.00020741115,0.00036333292,0.0004660486,0.024763688,0.041926052,0.06332825,0.8559956,0.0008704262],"about_ca_topic_score_codex":0.0000014443953,"about_ca_topic_score_gemma":5.819949e-7,"teacher_disagreement_score":0.80533075,"about_ca_system_score_codex":0.0001408665,"about_ca_system_score_gemma":0.00005128943,"threshold_uncertainty_score":0.44029316},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.010286293005946646,"score_gpt":0.19753086276732693,"score_spread":0.1872445697613803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082140337","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5313244,0.00007717082,0.4632567,0.001758304,0.0007077218,0.00015803204,0.000011872911,0.0000193913,0.0026864393],"genre_scores_gemma":[0.9835957,0.000020447278,0.01527348,0.00043686494,0.00008613258,1.465348e-7,0.000011428649,0.0000071801333,0.00056857156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981113,0.00018787067,0.0004309389,0.00021627393,0.0008793834,0.00017421383],"domain_scores_gemma":[0.9969891,0.0012963287,0.0006604027,0.00024457497,0.00070191507,0.000107679494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055248034,0.00016137485,0.00028481666,0.001391435,0.00013408985,0.00006660689,0.00095297286,0.000071281815,0.00008303735],"category_scores_gemma":[0.000089164154,0.00013241982,0.0002328468,0.0019864226,0.000060176666,0.0006131898,0.0000613526,0.00028528384,0.000040494346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010384072,0.000132643,0.00069299387,0.000016158303,0.00014765172,0.000033624714,0.00024023226,0.24699327,0.00045228863,0.74629873,0.0029710066,0.0019175737],"study_design_scores_gemma":[0.010769458,0.0064790156,0.10602612,0.00060813717,0.00028462405,0.00082005054,0.0020777371,0.25667182,0.0075634704,0.52975225,0.077063054,0.0018842649],"about_ca_topic_score_codex":0.0000042198244,"about_ca_topic_score_gemma":9.238238e-7,"teacher_disagreement_score":0.45227137,"about_ca_system_score_codex":0.00009244758,"about_ca_system_score_gemma":0.00032459706,"threshold_uncertainty_score":0.53999233},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.012001304747632493,"score_gpt":0.26031672254219884,"score_spread":0.24831541779456634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090078726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101082444,0.000014302942,0.8973471,0.00051056745,0.0004936161,0.00025214057,0.000009540297,0.00003300637,0.00025728834],"genre_scores_gemma":[0.78172344,0.000005835636,0.21662253,0.00022921528,0.00022820801,6.022067e-7,0.000012668402,0.000015357888,0.0011621425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985156,0.00011354666,0.00028298618,0.00027430305,0.00053759007,0.00027599253],"domain_scores_gemma":[0.99789333,0.00053358567,0.00028408275,0.00023416014,0.00082582596,0.00022903494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042227007,0.00013461639,0.0002437565,0.0011052651,0.00012965636,0.00012801151,0.00092409,0.00008266805,0.000026453421],"category_scores_gemma":[0.00005326219,0.0001357151,0.00017025508,0.0009378103,0.000051086827,0.0015691805,0.0001650254,0.0003103836,0.000010727583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010395618,0.00029813868,0.001046842,0.000048552887,0.0001835622,0.000045351113,0.0001905847,0.86390436,0.0021820448,0.016849315,0.00035321928,0.11385845],"study_design_scores_gemma":[0.0035983336,0.0020372656,0.00921838,0.000030395502,0.00002149704,0.00010519125,0.00014114633,0.95423245,0.0001519749,0.006785677,0.023434946,0.00024272873],"about_ca_topic_score_codex":0.000002927521,"about_ca_topic_score_gemma":0.0000017301169,"teacher_disagreement_score":0.68072456,"about_ca_system_score_codex":0.00023243578,"about_ca_system_score_gemma":0.0002623531,"threshold_uncertainty_score":0.5534301},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.010062048692386947,"score_gpt":0.2102579755694352,"score_spread":0.20019592687704826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105922857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16696058,0.0000857313,0.8301477,0.0010352018,0.00045441606,0.00021077163,0.000011768811,0.00003557342,0.0010582722],"genre_scores_gemma":[0.869669,0.000010618345,0.12876448,0.00042954224,0.00034131616,0.0000010600402,0.000030231915,0.0000112761445,0.00074245967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982504,0.00010884591,0.00047506194,0.00025747257,0.0006345611,0.000273617],"domain_scores_gemma":[0.99659735,0.0008024123,0.0005385073,0.0001726206,0.0016581344,0.00023097348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004316432,0.00018278892,0.00028752256,0.00133733,0.00024541238,0.00020659402,0.0008274965,0.00008602114,0.00013528479],"category_scores_gemma":[0.000122037236,0.00018301597,0.00029739286,0.0015602146,0.00006134825,0.001659138,0.00013934959,0.00018811673,0.000034113167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001034437,0.00027508877,0.00093591877,0.000035451947,0.00026129358,0.00004661219,0.00020748824,0.3678334,0.0008934316,0.5402594,0.009326005,0.07982241],"study_design_scores_gemma":[0.0056646694,0.0017035599,0.034899797,0.00006896485,0.00011388153,0.00052311417,0.00040515367,0.3093488,0.0012870979,0.50430125,0.14071734,0.00096638344],"about_ca_topic_score_codex":0.0000065458426,"about_ca_topic_score_gemma":0.0000011047903,"teacher_disagreement_score":0.7027084,"about_ca_system_score_codex":0.00012816206,"about_ca_system_score_gemma":0.0004106703,"threshold_uncertainty_score":0.7463175},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.03433791763792107,"score_gpt":0.29557554371501976,"score_spread":0.26123762607709866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112638984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40532053,0.0002547718,0.58876336,0.0012182555,0.0006458299,0.00035483227,0.00015217629,0.00004938589,0.0032408603],"genre_scores_gemma":[0.5665647,0.000048606504,0.43009147,0.00024284856,0.00025173943,0.0000010952039,0.000041530515,0.00005823604,0.0026997812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756974,0.00039574286,0.0005954406,0.00042950502,0.0007321724,0.00027740595],"domain_scores_gemma":[0.9958359,0.00081778807,0.001010493,0.0003771072,0.0016444554,0.0003142443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006185744,0.0004017652,0.0007897117,0.0018353605,0.00034786784,0.00025603818,0.0003305273,0.0003369823,0.000039696606],"category_scores_gemma":[0.00032211732,0.00039812824,0.00039194568,0.00094533706,0.00018927513,0.00019715009,0.00021075238,0.0012678656,6.806058e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010691361,0.0012162771,0.0034385535,0.0008338786,0.0020769255,0.0015705622,0.0013521914,0.9765366,0.00038002254,0.0048822975,0.0018160846,0.0048275273],"study_design_scores_gemma":[0.013949736,0.004976028,0.01881393,0.0043421527,0.0050010933,0.0014344086,0.008712833,0.85392517,0.00045118708,0.0072571677,0.077297315,0.0038389992],"about_ca_topic_score_codex":0.00008572763,"about_ca_topic_score_gemma":0.00016383162,"teacher_disagreement_score":0.16124415,"about_ca_system_score_codex":0.0005318048,"about_ca_system_score_gemma":0.0014181866,"threshold_uncertainty_score":0.99984705},"labels":[],"label_agreement":null},{"id":"W3135217630","doi":"10.20382/jocg.v11i2a7","title":"Topological data analysis in information space","year":2020,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Austrian Science Fund; Deutsche Forschungsgemeinschaft","keywords":"Simplex; Histogram; Context (archaeology); Euclidean space; Mathematics; Euclidean geometry; Point (geometry); Topological data analysis; Dimension (graph theory); Topology (electrical circuits); Euclidean distance; Probability distribution; Computer science; Theoretical computer science; Algorithm; Combinatorics; Artificial intelligence; Image (mathematics); Geography; Statistics; Geometry","score_opus":0.03036330825642656,"score_gpt":0.2336477017209446,"score_spread":0.20328439346451804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135217630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052084744,0.000054563538,0.9388106,0.007906871,0.0000654013,0.0000347757,0.000036539295,0.000021708442,0.0009848035],"genre_scores_gemma":[0.94397277,0.000038561077,0.055027228,0.0008037933,0.00005061713,2.4286466e-8,0.00006927235,0.0000013217533,0.00003643691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847573,0.0001246797,0.0004346015,0.00022265669,0.0005739424,0.00016841665],"domain_scores_gemma":[0.99845374,0.00033210797,0.0004393237,0.00027601118,0.00028830062,0.00021053813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042769534,0.00010883786,0.0003756309,0.0026887846,0.000061027873,0.000116148476,0.0021227447,0.00007281053,0.00012515154],"category_scores_gemma":[0.000436087,0.000095484866,0.00018230343,0.013554073,0.000054169996,0.002841785,0.00073046744,0.0002677823,0.000027832366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013566574,0.00022732638,0.043896068,0.000016813014,0.0010598563,0.00057614216,0.0003916537,0.76556915,0.00000861889,0.16378771,0.0029283855,0.021402586],"study_design_scores_gemma":[0.0021183917,0.0005892627,0.21196595,0.000012324374,0.0005535673,0.000053143733,0.0008303218,0.66000694,0.00001650304,0.007915444,0.11546247,0.00047565997],"about_ca_topic_score_codex":0.000028481138,"about_ca_topic_score_gemma":0.0000043665896,"teacher_disagreement_score":0.891888,"about_ca_system_score_codex":0.000071241164,"about_ca_system_score_gemma":0.0001125465,"threshold_uncertainty_score":0.6512283},"labels":[],"label_agreement":null},{"id":"W3155566642","doi":"10.20382/jocg.v13i2a5","title":"Orientation preserving maps of the n × n grid","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Orientation (vector space); Grid; Computer science; Geometry; Mathematics","score_opus":0.00947932411795094,"score_gpt":0.196966089331903,"score_spread":0.18748676521395205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155566642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36304343,0.00015246132,0.6308811,0.0017567646,0.0023773068,0.00016380148,0.000042464122,0.000022212065,0.001560524],"genre_scores_gemma":[0.97867405,0.0000068330655,0.020155724,0.00019970429,0.00015170155,3.648412e-7,0.00001778195,0.000005926548,0.00078788126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796396,0.0002894092,0.0003912425,0.00016431857,0.0010607421,0.00013034545],"domain_scores_gemma":[0.99800855,0.0003031686,0.0007771219,0.00019482282,0.0006469541,0.0000693633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056111277,0.00009849508,0.00017519941,0.0009179539,0.0003951439,0.000041563042,0.0012236888,0.000026292919,0.00007949181],"category_scores_gemma":[0.0000783139,0.000092812836,0.00021007485,0.0030964275,0.000042922613,0.0006828466,0.0005977454,0.0002681938,0.0000015432767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042477564,0.000113953465,0.0015470404,0.000012607382,0.00006018955,0.000019479196,0.0002938518,0.9339084,0.0003120259,0.056737967,0.004200041,0.002751984],"study_design_scores_gemma":[0.007089334,0.0018921918,0.13434984,0.00012532911,0.0002401543,0.001401637,0.0026749272,0.26202625,0.0049097156,0.096961826,0.48731577,0.0010130308],"about_ca_topic_score_codex":0.000008167478,"about_ca_topic_score_gemma":0.0000010415026,"teacher_disagreement_score":0.67188215,"about_ca_system_score_codex":0.0002033949,"about_ca_system_score_gemma":0.00043578504,"threshold_uncertainty_score":0.37847975},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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)","score_opus":0.0057959754496999015,"score_gpt":0.20680898383789056,"score_spread":0.20101300838819067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207367190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012520314,0.00019031158,0.9832496,0.0023924683,0.00051684876,0.00005185031,0.0000077795185,0.000008064069,0.0010627479],"genre_scores_gemma":[0.6911738,0.00011807139,0.30713186,0.0004071028,0.0001985954,1.6576455e-7,0.000006288814,0.000011199003,0.00095295196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882317,0.000110948546,0.00025850246,0.0001304766,0.00054470054,0.00013221709],"domain_scores_gemma":[0.9985412,0.00044659196,0.00038202785,0.00021018878,0.0003819542,0.000038040656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004404256,0.00008563399,0.00014894112,0.0003341169,0.000083245875,0.00009867227,0.001039555,0.000026751499,0.0000070893525],"category_scores_gemma":[0.00014506995,0.00006429865,0.00011332532,0.0022638137,0.000038391976,0.00111093,0.0004283216,0.00027310778,0.000001205288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026889687,0.00042763655,0.0034325437,0.00006625863,0.00046272035,0.001336896,0.0013116495,0.6019498,0.0002185678,0.20728418,0.0011968755,0.18228596],"study_design_scores_gemma":[0.0025687523,0.00013246345,0.11163796,0.00041257995,0.0001490365,0.0004757829,0.0030743787,0.6912237,0.0007904075,0.0044105686,0.18465488,0.00046950954],"about_ca_topic_score_codex":0.0000058508276,"about_ca_topic_score_gemma":0.0000016855488,"teacher_disagreement_score":0.6786535,"about_ca_system_score_codex":0.00009569325,"about_ca_system_score_gemma":0.0001499158,"threshold_uncertainty_score":0.2622023},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.015156682061775414,"score_gpt":0.2662926280989182,"score_spread":0.2511359460371428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301413600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074428976,0.0002366387,0.9221187,0.0010234411,0.0013195823,0.00034198392,0.00009001214,0.000043026674,0.0003976133],"genre_scores_gemma":[0.7167227,0.000059991577,0.28228855,0.0001543855,0.00038650527,0.000001539108,0.00018687885,0.000020416723,0.00017897204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699664,0.00028251825,0.00101832,0.00052390766,0.0009060115,0.0002725967],"domain_scores_gemma":[0.9929143,0.0010067194,0.0023472048,0.00037426729,0.0030860882,0.00027139907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001043256,0.0003382529,0.0006898478,0.0028814853,0.0002704721,0.00019052658,0.0013289058,0.0002922415,0.000013845573],"category_scores_gemma":[0.00030937063,0.00038364463,0.00059828034,0.0014190801,0.00009077283,0.00086793484,0.00050064485,0.00053365045,0.0000032247574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015391575,0.00028839812,0.00010536198,0.00029681678,0.00024107765,0.000011819839,0.00022220841,0.9487428,0.0005309502,0.026906045,0.00097395596,0.021526655],"study_design_scores_gemma":[0.004977685,0.0013929086,0.005505126,0.0018351268,0.0004984897,0.00031819026,0.00022047762,0.774337,0.0053544557,0.18493235,0.019401876,0.0012263008],"about_ca_topic_score_codex":0.0000068039367,"about_ca_topic_score_gemma":0.0000023069442,"teacher_disagreement_score":0.64229375,"about_ca_system_score_codex":0.00035933062,"about_ca_system_score_gemma":0.0013994138,"threshold_uncertainty_score":0.99986154},"labels":[],"label_agreement":null},{"id":"W4392970340","doi":"10.20382/jocg.v16i2a8","title":"Computing Shortest Closed Curves on Non-Orientable Surfaces","year":2024,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Centre National de la Recherche Scientifique; Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.008206478363680299,"score_gpt":0.23055012333275918,"score_spread":0.22234364496907888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392970340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58573174,0.0032877063,0.39672688,0.00048217128,0.0018065338,0.00032807197,0.00011988253,0.00054755586,0.01096942],"genre_scores_gemma":[0.97853994,0.0007123001,0.019941444,0.00010142968,0.0002647996,1.8521526e-7,0.000057885125,0.000053133797,0.00032885413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802107,0.000057181052,0.0006095532,0.00030312713,0.00074452127,0.00026457963],"domain_scores_gemma":[0.99839085,0.00037688322,0.00039058784,0.00019463833,0.00046974886,0.0001772784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027052243,0.00037126732,0.0007480463,0.0018155099,0.00007854622,0.00007953777,0.0005814732,0.00019963832,0.000050697086],"category_scores_gemma":[0.00004320005,0.00038966126,0.000478546,0.0014899812,0.00007141393,0.00016991278,0.0004237455,0.0015461183,0.000022477654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021615851,0.00006031191,0.0002425111,0.00042896587,0.00051672163,0.00024445695,0.00004026237,0.9906961,0.000096720985,0.00037953514,0.005078439,0.0021944065],"study_design_scores_gemma":[0.0010623948,0.0006281596,0.0053664865,0.008651368,0.0013231424,0.0001315648,0.0003872434,0.91730464,0.0023171997,0.030018317,0.030948348,0.0018611179],"about_ca_topic_score_codex":0.0000104871315,"about_ca_topic_score_gemma":0.0000014633879,"teacher_disagreement_score":0.3928082,"about_ca_system_score_codex":0.0005574837,"about_ca_system_score_gemma":0.00015607828,"threshold_uncertainty_score":0.9998555},"labels":[],"label_agreement":null},{"id":"W4412216168","doi":"10.20382/jocg.v15i1a6","title":"Sorting under partial (interval order) information","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Interval (graph theory); Sorting; Order (exchange); Mathematics; Computer science; Combinatorics; Algorithm; Economics","score_opus":0.011488732816971027,"score_gpt":0.21010318980686277,"score_spread":0.19861445698989175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412216168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13180687,0.00003840195,0.8646759,0.001305315,0.0008975859,0.00007621662,0.000007721303,0.000039090875,0.0011529501],"genre_scores_gemma":[0.95806164,0.000005221259,0.040679574,0.00074947625,0.00016077458,4.653769e-7,0.000033454475,0.000005633789,0.0003037364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786276,0.00021142897,0.0005432153,0.0001590347,0.0010170551,0.00020652715],"domain_scores_gemma":[0.9978798,0.00024191508,0.0007765937,0.00013384287,0.0008342662,0.00013355518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006581477,0.00013475154,0.0002121535,0.0016019123,0.0005035426,0.00015217438,0.0007873106,0.000037674057,0.00016398692],"category_scores_gemma":[0.000079806276,0.00015657193,0.00018008021,0.0027092057,0.00003197294,0.0022908768,0.0004143263,0.0003543072,0.000016858925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057551464,0.00008162059,0.00018197639,0.0000064950405,0.000064498556,0.00003649278,0.00025209785,0.9011056,0.000052004765,0.08511397,0.0012384488,0.011809234],"study_design_scores_gemma":[0.0044119633,0.0014067309,0.0102029815,0.000034406774,0.00009415992,0.0013127764,0.002168698,0.6606356,0.00041329302,0.03575651,0.2827966,0.00076632405],"about_ca_topic_score_codex":0.0000060532066,"about_ca_topic_score_gemma":5.153457e-7,"teacher_disagreement_score":0.8262548,"about_ca_system_score_codex":0.0003227801,"about_ca_system_score_gemma":0.0005599878,"threshold_uncertainty_score":0.6384818},"labels":[],"label_agreement":null},{"id":"W4415966265","doi":"10.20382/jocg.v16i1a12","title":"Who needs crossings?: Noncrossing linkages are universal, and deciding (global) rigidity is hard","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Rigidity (electromagnetism); Multigraph; Graph; Existential quantification; Complement graph; Complement (music)","score_opus":0.006575591961191947,"score_gpt":0.20325244946375634,"score_spread":0.1966768575025644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415966265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8515876,0.0003804189,0.14575513,0.0003174685,0.00025383002,0.00003163711,0.000017473782,0.000034337878,0.0016221269],"genre_scores_gemma":[0.9914961,0.00018626745,0.0073290626,0.00011481777,0.00007388294,1.6972617e-8,0.000004768014,0.0000068658906,0.000788223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9992158,0.000028176344,0.0002553734,0.00011463839,0.00024023814,0.00014578005],"domain_scores_gemma":[0.99911827,0.00010691991,0.0002054524,0.000067257795,0.00040719658,0.000094908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010907359,0.000145248,0.0002915862,0.0009747338,0.00027921624,0.0002179463,0.00016972877,0.000093777286,0.00003248672],"category_scores_gemma":[0.00003152376,0.00013785403,0.00014221857,0.001961656,0.00009120625,0.00054813403,0.000054874792,0.00018583887,0.0000010521661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030436024,0.00001134323,0.049480125,0.0000581392,0.00033457507,0.000049607945,0.00019548943,0.9406983,0.00013186401,0.0012768868,0.002575576,0.0051576435],"study_design_scores_gemma":[0.0033259916,0.00009305799,0.5420925,0.00073838653,0.0006338813,0.00012329251,0.0030833157,0.3950203,0.0009430197,0.0043916805,0.04887264,0.0006819282],"about_ca_topic_score_codex":0.00001082873,"about_ca_topic_score_gemma":0.0000021617095,"teacher_disagreement_score":0.545678,"about_ca_system_score_codex":0.00032017712,"about_ca_system_score_gemma":0.000081613536,"threshold_uncertainty_score":0.5621524},"labels":[],"label_agreement":null},{"id":"W6888425079","doi":"10.20382/jocg.v13i1a14","title":"Algorithms for approximate sparse regression and nearest induced hulls","year":2021,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degeneracy (biology); Set (abstract data type); Affine transformation; Regular polygon; Approximation algorithm; Convex hull; Conjecture; k-nearest neighbors algorithm; Randomized algorithm; Simple (philosophy)","score_opus":0.03918475331428511,"score_gpt":0.25983895760885284,"score_spread":0.22065420429456772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888425079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16533928,0.00019243917,0.8324273,0.0010366593,0.00051091023,0.00008464149,0.000012584982,0.00002586008,0.00037030695],"genre_scores_gemma":[0.37934792,0.000090015594,0.61953074,0.00028344072,0.00023981392,3.0015588e-7,0.000013529962,0.000012857401,0.00048138393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987513,0.000092204304,0.0002838425,0.00025502307,0.00041840345,0.00019924287],"domain_scores_gemma":[0.9980605,0.00041951815,0.00034430335,0.00016547559,0.00083317014,0.00017703495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030427237,0.00014057392,0.0002790602,0.00069935294,0.00024612638,0.00016068181,0.00049082004,0.00007778215,0.000012978986],"category_scores_gemma":[0.000089796864,0.00014110014,0.00017111954,0.0012325383,0.00006397874,0.0007115634,0.0002788675,0.00022780264,0.0000014332879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037634192,0.00116133,0.0025281932,0.000303954,0.00081848144,0.0030782637,0.0017439803,0.0403681,0.00383751,0.56402564,0.004061547,0.37769666],"study_design_scores_gemma":[0.011718698,0.0018065935,0.03270301,0.0007538104,0.00023453141,0.0035691122,0.0020002036,0.62900555,0.0078068064,0.22547503,0.08340788,0.0015187728],"about_ca_topic_score_codex":0.000003116479,"about_ca_topic_score_gemma":0.0000010654375,"teacher_disagreement_score":0.5886375,"about_ca_system_score_codex":0.00006507822,"about_ca_system_score_gemma":0.0002802269,"threshold_uncertainty_score":0.5753897},"labels":[],"label_agreement":null},{"id":"W6888428011","doi":"10.20382/jocg.v16i1a7","title":"Simplification of polyline bundles of graphs and trees","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bundle; Line segment; Vertex (graph theory); Generalization; Path (computing); Set (abstract data type); Hausdorff distance","score_opus":0.014307294734958093,"score_gpt":0.22466723407896474,"score_spread":0.21035993934400665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888428011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69783914,0.00013618376,0.3011677,0.00042446412,0.0001507237,0.000050438197,0.000010929214,0.00002082642,0.00019958177],"genre_scores_gemma":[0.97869325,0.000110702276,0.020942314,0.00002538174,0.000033950233,7.428078e-8,0.000015612244,0.000004343394,0.00017435882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99871475,0.00007844554,0.0004430582,0.00015085458,0.00050123397,0.00011168021],"domain_scores_gemma":[0.9978475,0.0004832883,0.0006541171,0.000118536285,0.0008084326,0.00008814877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041368656,0.00009921918,0.00025383953,0.002339223,0.00007389941,0.000024228784,0.00038175704,0.000052541225,0.0000078829125],"category_scores_gemma":[0.00008649618,0.00010367533,0.00012618575,0.003277733,0.00008692795,0.0005512287,0.000113604525,0.00009563308,0.0000019480658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000128824,0.00025182532,0.008008954,0.00010159648,0.00024597105,0.000038834005,0.00056586537,0.5544515,0.009077857,0.38583282,0.00092753506,0.040368397],"study_design_scores_gemma":[0.0036050766,0.0014166862,0.6272811,0.00019497887,0.00014896835,0.00022355634,0.0008637196,0.22455454,0.010437554,0.12416325,0.006586742,0.0005238345],"about_ca_topic_score_codex":0.000008763039,"about_ca_topic_score_gemma":0.0000020395921,"teacher_disagreement_score":0.6192722,"about_ca_system_score_codex":0.000030115738,"about_ca_system_score_gemma":0.00017319154,"threshold_uncertainty_score":0.42277572},"labels":[],"label_agreement":null},{"id":"W6888440185","doi":"10.20382/v16i1a5","title":"Density approximation for moving groups","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Kernel density estimation; Track (disk drive); Group (periodic table); Kernel (algebra); Tracking (education); Density estimation; Maxima","score_opus":0.01758062281630666,"score_gpt":0.2240018861337144,"score_spread":0.20642126331740776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888440185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08800251,0.000008435151,0.9102129,0.00072103157,0.00041232764,0.00009069549,0.000006481854,0.000064453954,0.0004811851],"genre_scores_gemma":[0.7310312,0.000027112414,0.26658493,0.00022351283,0.00032644338,3.4015528e-7,0.00006646399,0.000012220291,0.0017278094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990273,0.000038614162,0.00021347852,0.00015654723,0.00039998972,0.0001640431],"domain_scores_gemma":[0.9988544,0.00026259516,0.00029833944,0.00012183597,0.00038486664,0.00007795086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005138828,0.000086156746,0.00015404262,0.0013528594,0.00016127242,0.00012996604,0.0006987404,0.00003453745,0.0000051076395],"category_scores_gemma":[0.00006671461,0.00009198691,0.00013336116,0.0018942154,0.000023069972,0.0015130026,0.00023351495,0.000095839634,0.000018133876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010281867,0.00019191245,0.002149692,0.00014099476,0.0003484261,0.00037926092,0.000467375,0.2208253,0.0002459748,0.63820076,0.022856945,0.11409057],"study_design_scores_gemma":[0.0022866584,0.00030269162,0.029276583,0.000058062982,0.00006555818,0.000059394017,0.00047408193,0.8607525,0.0001938947,0.064112954,0.04206416,0.00035344242],"about_ca_topic_score_codex":0.0000017900863,"about_ca_topic_score_gemma":4.815456e-7,"teacher_disagreement_score":0.64362794,"about_ca_system_score_codex":0.00008343287,"about_ca_system_score_gemma":0.00007083162,"threshold_uncertainty_score":0.37511173},"labels":[],"label_agreement":null},{"id":"W6888461022","doi":"10.20382/jocg.v12i2a5","title":"The Stretch Factor of Hexagon-Delaunay Triangulations","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Delaunay triangulation; Equilateral triangle; Upper and lower bounds; Voronoi diagram; Polygon (computer graphics); Square (algebra); Triangulation; Pitteway triangulation","score_opus":0.011484366665485916,"score_gpt":0.21031590607306858,"score_spread":0.19883153940758266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888461022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51468635,0.0003009054,0.48169833,0.0016100835,0.0009578296,0.00012418164,0.00003451179,0.000020762036,0.00056703365],"genre_scores_gemma":[0.98628134,0.000017937537,0.012917199,0.0000784486,0.000100573016,3.823603e-7,0.000011382513,0.0000059712315,0.0005867873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788934,0.00028634194,0.00049719034,0.00016628217,0.0009927765,0.00016809488],"domain_scores_gemma":[0.9971079,0.0010203916,0.0007884322,0.00019284635,0.00078582607,0.000104572035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005613242,0.000116792304,0.00021345384,0.001043442,0.0006757814,0.000073378535,0.001046142,0.000032400945,0.00014220591],"category_scores_gemma":[0.00010201949,0.0001072368,0.00024325223,0.0026705822,0.00006864188,0.0005427917,0.00030767595,0.00028515322,0.0000025883178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010592534,0.00018039177,0.0007248529,0.000007712643,0.00017301633,0.000041214356,0.00040818565,0.8027123,0.00029153665,0.15801203,0.0016153479,0.035727467],"study_design_scores_gemma":[0.0067162756,0.0023990104,0.08325923,0.00004788205,0.00016692847,0.00079527934,0.0027550147,0.4572484,0.0015415484,0.07786022,0.3662834,0.00092682894],"about_ca_topic_score_codex":0.000005845799,"about_ca_topic_score_gemma":0.0000016340379,"teacher_disagreement_score":0.47159496,"about_ca_system_score_codex":0.00020524775,"about_ca_system_score_gemma":0.0005839046,"threshold_uncertainty_score":0.51976323},"labels":[],"label_agreement":null},{"id":"W6888484399","doi":"10.20382/jocg.v15i2a4","title":"On the geometric thickness of 2-degenerate graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geometric graph theory; Vertex (graph theory); Spatial network; Geometric shape; Geometric modeling; Geometric networks; Graph; Geometric data analysis; Plane (geometry); Geometric design","score_opus":0.010248179830771975,"score_gpt":0.21364375133575592,"score_spread":0.20339557150498394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888484399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25295758,0.00020339963,0.74067754,0.0020138829,0.00069074647,0.000097624026,0.0000053753474,0.000017379178,0.0033364347],"genre_scores_gemma":[0.9847063,0.000042772535,0.0135635,0.00064014667,0.00005277043,2.5335746e-7,0.000004444232,0.000004933298,0.0009848739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981244,0.00023789678,0.0004889634,0.00021654047,0.0007561728,0.0001759812],"domain_scores_gemma":[0.9959887,0.0017369224,0.0006007399,0.00024905225,0.0013425394,0.00008202378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008250113,0.0001612082,0.00029304405,0.0039183,0.00023679838,0.00008484461,0.0011516305,0.00007905804,0.000035411944],"category_scores_gemma":[0.0002841843,0.00013100801,0.00026479654,0.008449479,0.000094775925,0.0004750495,0.00017561967,0.0003013306,0.0000070050714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005157443,0.00012208533,0.00021551934,0.000014980107,0.00013039567,0.000019923737,0.00004377384,0.34520766,0.00019283615,0.6450694,0.0026863643,0.0062454455],"study_design_scores_gemma":[0.0064746724,0.0018870331,0.062508665,0.0005693902,0.00033339116,0.00029082663,0.00057881244,0.1571746,0.015448098,0.7001492,0.053492628,0.0010926758],"about_ca_topic_score_codex":0.000004901476,"about_ca_topic_score_gemma":8.705906e-7,"teacher_disagreement_score":0.7317487,"about_ca_system_score_codex":0.00011239758,"about_ca_system_score_gemma":0.0005038,"threshold_uncertainty_score":0.5342352},"labels":[],"label_agreement":null},{"id":"W6888493691","doi":"10.20382/jocg.v16i1a4","title":"Geometric hitting set for line-constrained disks and related problems","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Point (geometry); Plane (geometry); Quadratic equation; Running time; Hitting time; Computational geometry; Square (algebra)","score_opus":0.024080537216046093,"score_gpt":0.24109867560120543,"score_spread":0.21701813838515935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888493691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25696453,0.0001401518,0.74027437,0.0013457347,0.00054012,0.00020360333,0.00002002617,0.0000927071,0.00041874667],"genre_scores_gemma":[0.95747143,0.00006287787,0.04099575,0.00008288234,0.00015638678,7.1970237e-7,0.000055995763,0.000012437666,0.0011614922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998304,0.00009190842,0.00051614066,0.00029674024,0.0005199522,0.00027124092],"domain_scores_gemma":[0.9971519,0.0011449459,0.0005493304,0.00012094835,0.0008421472,0.0001907235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009380893,0.00017043587,0.0002940597,0.0036529708,0.00028590477,0.00014416236,0.00047364915,0.00009895141,0.000011680523],"category_scores_gemma":[0.00031526922,0.00018030805,0.00018824471,0.006123957,0.0000646923,0.0008905422,0.0001745727,0.0002183905,0.000009524003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041717158,0.00007912398,0.00068635267,0.00008485479,0.0002312608,0.00009793532,0.0005817079,0.8993479,0.00031704587,0.042684544,0.0013089117,0.054538663],"study_design_scores_gemma":[0.0052868314,0.0011166338,0.02116246,0.00014850033,0.0001264632,0.00074180163,0.00042286306,0.8731908,0.00038820543,0.071155496,0.025605228,0.00065470114],"about_ca_topic_score_codex":0.0000024034202,"about_ca_topic_score_gemma":5.672652e-7,"teacher_disagreement_score":0.7005069,"about_ca_system_score_codex":0.00009825595,"about_ca_system_score_gemma":0.00027323692,"threshold_uncertainty_score":0.73527485},"labels":[],"label_agreement":null},{"id":"W6888518616","doi":"10.20382/jocg.v8i1a10-sup-a","title":"Source Code","year":2017,"lang":"en","type":"other","venue":"Journal of Computational Geometry (Carleton University)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Source code; Code (set theory); Set (abstract data type); Software; Key (lock)","score_opus":0.015221486896852831,"score_gpt":0.2373882821004757,"score_spread":0.22216679520362287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888518616","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010322165,0.0007975907,0.037312243,0.00015880098,0.0011029135,0.00018420516,0.00043779163,0.00016195182,0.9588123],"genre_scores_gemma":[0.0044346834,0.0001082198,0.006190469,0.0000680438,0.0011619477,5.189466e-8,0.000064610664,0.0005739636,0.987398],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974803,0.00017788044,0.00038562185,0.0003126367,0.0013029642,0.0003406515],"domain_scores_gemma":[0.99474335,0.00021950573,0.0035897868,0.00039864224,0.0007005567,0.0003481718],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039270136,0.00042060795,0.0008402123,0.008106154,0.00020867572,0.00012060226,0.0015039726,0.0004106462,0.0018867067],"category_scores_gemma":[0.00017439637,0.00046335737,0.000556601,0.0010612278,0.00029854718,0.000340524,0.0002109204,0.00079409726,0.00092446385],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001592156,0.00013848444,0.0005561938,0.000061014827,0.0009728633,0.000611764,0.00003411565,0.021646686,0.000023625944,0.0019026663,0.97134507,0.0025483167],"study_design_scores_gemma":[0.0018159177,0.00013253055,0.0006562584,0.00051944307,0.00031605898,0.0003090561,0.000060304512,0.0002004723,0.000006380449,0.00028591542,0.9952756,0.00042203354],"about_ca_topic_score_codex":0.000043089945,"about_ca_topic_score_gemma":0.00002823747,"teacher_disagreement_score":0.031121774,"about_ca_system_score_codex":0.00049000455,"about_ca_system_score_gemma":0.0007251931,"threshold_uncertainty_score":0.99985343},"labels":[],"label_agreement":null},{"id":"W6888536549","doi":"10.20382/jocg.v13i1a15","title":"Orthogonal point location and rectangle stabbing queries in 3-d","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rectangle; Disjoint sets; Data structure; Point (geometry); Pointer (user interface); Point location; Upper and lower bounds","score_opus":0.007822135440358806,"score_gpt":0.19238386639733573,"score_spread":0.18456173095697692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888536549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46215716,0.0002746181,0.5356395,0.00096184073,0.00033286898,0.000076991804,0.0000050107797,0.000018353116,0.00053362147],"genre_scores_gemma":[0.9700776,0.000023696663,0.029441554,0.00019280596,0.000060170652,4.6118822e-7,0.000011370612,0.000005323198,0.00018704441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984626,0.00022485244,0.00034771423,0.00020741815,0.0006050312,0.00015237533],"domain_scores_gemma":[0.9987621,0.00030776416,0.0003500943,0.00009225366,0.00039466514,0.000093135626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006898119,0.00010901115,0.00018923149,0.0017987589,0.0002720581,0.0000734371,0.0003745037,0.000029833122,0.00003826501],"category_scores_gemma":[0.00006927506,0.00013049567,0.00006643641,0.0027370949,0.000038890954,0.0009771528,0.00028488704,0.00028665442,0.0000013670974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090239846,0.0001299343,0.0027234624,0.0000151017375,0.000034746776,0.00015976046,0.0005778259,0.8341995,0.00018376512,0.1487687,0.00027095256,0.012846043],"study_design_scores_gemma":[0.008588046,0.002702861,0.25895816,0.00017066966,0.00008747877,0.003452787,0.005538653,0.5257769,0.0005082075,0.09297171,0.0998031,0.0014413744],"about_ca_topic_score_codex":0.000010672764,"about_ca_topic_score_gemma":0.0000067005453,"teacher_disagreement_score":0.50792044,"about_ca_system_score_codex":0.00030284998,"about_ca_system_score_gemma":0.0004220723,"threshold_uncertainty_score":0.53214586},"labels":[],"label_agreement":null},{"id":"W6888537253","doi":"10.20382/jocg.v7i2","title":"Journal of Computational Geometry, Vol. 7 No. 2 (2016): Special Issue of Selected Papers from SoCG 2015","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Special section; Key (lock)","score_opus":0.012001306892397479,"score_gpt":0.2206147639986438,"score_spread":0.20861345710624632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888537253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26642382,0.0006048075,0.7210189,0.0010744566,0.006964465,0.00021505446,0.00009270132,0.000039196493,0.003566603],"genre_scores_gemma":[0.73694205,0.00010005304,0.2505764,0.00042359286,0.009789833,3.0396984e-7,0.00014482507,0.000041240422,0.0019816887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99515957,0.00039536715,0.0014152011,0.00035540652,0.00232436,0.0003500969],"domain_scores_gemma":[0.9803743,0.0010059559,0.0025445474,0.00023266063,0.015299729,0.00054284703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00118562,0.00034169352,0.0008194654,0.0031374977,0.00016642705,0.00014592288,0.0014448469,0.00020169513,0.00040424106],"category_scores_gemma":[0.0011360401,0.00035366236,0.0004307918,0.0042307507,0.00017930227,0.0016279749,0.00026464585,0.0005631789,0.000058056863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005841308,0.00056477793,0.0015813947,0.000030940653,0.00066795613,0.0002004113,0.00064397417,0.8515722,0.00040836475,0.0035605915,0.127738,0.012447235],"study_design_scores_gemma":[0.022351244,0.006239471,0.075058594,0.00055241835,0.000733724,0.0012303458,0.0017018594,0.16256218,0.0026154907,0.05438918,0.6705116,0.0020539223],"about_ca_topic_score_codex":0.000030596104,"about_ca_topic_score_gemma":0.000003894354,"teacher_disagreement_score":0.68901,"about_ca_system_score_codex":0.00046362038,"about_ca_system_score_gemma":0.0028223135,"threshold_uncertainty_score":0.9998915},"labels":[],"label_agreement":null},{"id":"W6907340915","doi":"10.20382/jocg.v15i2a1","title":"Extending orthogonal planar graph drawings is fixed-parameter tractable","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Parasite Biology and Host Interactions","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vienna Science and Technology Fund; Austrian Science Fund; European Commission","keywords":"Planar graph; Parameterized complexity; Bounded function; Graph drawing; Graph; Book embedding; Vertex (graph theory); Treewidth; Planar","score_opus":0.00850334009077879,"score_gpt":0.266609281395087,"score_spread":0.2581059413043082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6907340915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9440724,0.000049328002,0.03220154,0.000791044,0.00040817953,0.000049785114,0.000018462957,0.000012528972,0.022396682],"genre_scores_gemma":[0.98671925,0.000025994828,0.004783795,0.00080643065,0.000042910553,1.0530089e-7,0.000008525641,0.0000045006054,0.007608484],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99910766,0.00006184036,0.00024618505,0.00016205547,0.0002478865,0.00017435716],"domain_scores_gemma":[0.99914044,0.00038415362,0.00024555065,0.00007409195,0.000062689585,0.00009308993],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001814694,0.00011253483,0.00018670804,0.0007039379,0.000245823,0.000029900255,0.00027954896,0.00008985399,0.0016012389],"category_scores_gemma":[0.000046089328,0.00011365918,0.00019003375,0.00096936704,0.0001353564,0.0005345561,0.00005949648,0.00030115008,0.00007840512],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007131241,0.00056915294,0.8350904,0.000020844804,0.0007434877,0.0004154855,0.00040489397,0.08924424,0.0048310393,0.011512837,0.041617926,0.014836556],"study_design_scores_gemma":[0.0010422018,0.00018803898,0.7243138,0.00006703535,0.0001417344,0.00021320928,0.0003091986,0.0010709943,0.00060553144,0.009576652,0.262223,0.00024857593],"about_ca_topic_score_codex":0.000023947898,"about_ca_topic_score_gemma":0.0000057815296,"teacher_disagreement_score":0.22060509,"about_ca_system_score_codex":0.00020532013,"about_ca_system_score_gemma":0.000060849772,"threshold_uncertainty_score":0.99931145},"labels":[],"label_agreement":null},{"id":"W6907382603","doi":"10.20382/jocg.v3i1","title":"Journal of Computational Geometry, Vol. 3 No. 1 (2012)","year":2012,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Key (lock); Feature (linguistics); Field (mathematics); Set (abstract data type)","score_opus":0.013373719029095756,"score_gpt":0.22047722181624024,"score_spread":0.20710350278714448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6907382603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16062255,0.0008809034,0.8320045,0.00044721048,0.004620863,0.00011279539,0.000015064462,0.000029423907,0.0012667065],"genre_scores_gemma":[0.8063114,0.00006724034,0.1897019,0.0003875736,0.0023632862,1.968948e-7,0.000023735438,0.000021742291,0.0011228961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958223,0.00033335737,0.0011983904,0.00026062768,0.0018825834,0.00050272193],"domain_scores_gemma":[0.9880841,0.0010455489,0.0020408481,0.00023271526,0.008008576,0.000588217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017398067,0.00032754012,0.00062878284,0.0038205218,0.00028774852,0.00018013763,0.0013759339,0.00017083375,0.00028283717],"category_scores_gemma":[0.00067625544,0.00033302474,0.0005397716,0.0034754851,0.00012964834,0.0041941735,0.0002803762,0.0006116933,0.0000939979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026328114,0.0009427984,0.004884882,0.000064793414,0.0006131329,0.00015967988,0.00046571935,0.89048994,0.00023234007,0.043962386,0.037977967,0.0199431],"study_design_scores_gemma":[0.01252428,0.0035209635,0.16731976,0.00043240224,0.0005980562,0.0053522317,0.00073622935,0.11862575,0.0011873204,0.044181816,0.6433223,0.0021989003],"about_ca_topic_score_codex":0.000004050053,"about_ca_topic_score_gemma":5.627932e-7,"teacher_disagreement_score":0.7718642,"about_ca_system_score_codex":0.00039585878,"about_ca_system_score_gemma":0.00090835313,"threshold_uncertainty_score":0.9999122},"labels":[],"label_agreement":null},{"id":"W6907494475","doi":"10.20382/jocg.v16i2a1","title":"Discrete Fréchet distance oracles","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Oracle; Sublinear function; Path (computing); Constant (computer programming); Focus (optics); Construct (python library); Graph; Computational geometry","score_opus":0.006357200739715545,"score_gpt":0.22265187343626697,"score_spread":0.21629467269655142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6907494475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04193411,0.0003165764,0.9500809,0.0017464949,0.0007241145,0.000071100185,0.000006967132,0.000039934792,0.005079826],"genre_scores_gemma":[0.9138658,0.000041358482,0.08270416,0.00042299376,0.00012415028,1.6853856e-7,0.000011181909,0.000005499771,0.002824695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849254,0.0001227525,0.00040960943,0.00024278139,0.00054197956,0.00019033342],"domain_scores_gemma":[0.9980435,0.00041421765,0.0003994236,0.00018900508,0.00083138695,0.00012247862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036075327,0.00015509695,0.0002629738,0.0016367211,0.0002177192,0.00014980313,0.0008822336,0.00007036962,0.000024713845],"category_scores_gemma":[0.00010291558,0.00016084364,0.00020159243,0.003087605,0.000066191446,0.001104801,0.0001932913,0.000234236,0.0000110248975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008281732,0.00012910721,0.0014110239,0.00002972374,0.00016844666,0.00012160997,0.000103834434,0.38562676,0.00017005457,0.58474654,0.004083956,0.023326132],"study_design_scores_gemma":[0.0043657855,0.00052853354,0.062467553,0.00033363665,0.00016430073,0.00024886033,0.0004029113,0.19620766,0.0016834842,0.1768181,0.5559076,0.0008715618],"about_ca_topic_score_codex":0.000003871687,"about_ca_topic_score_gemma":0.0000027080698,"teacher_disagreement_score":0.8719317,"about_ca_system_score_codex":0.00018923366,"about_ca_system_score_gemma":0.0004738659,"threshold_uncertainty_score":0.6559013},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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)","score_opus":0.013197855014360806,"score_gpt":0.2191340072214817,"score_spread":0.20593615220712091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925877189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9755836,0.00019385334,0.016193682,0.00034451782,0.000116574534,0.00007773516,0.00014435443,0.000008633823,0.0073370216],"genre_scores_gemma":[0.9944931,0.00001818078,0.00506892,0.000080346515,0.000020542262,6.8960816e-8,0.000031951175,0.0000064593337,0.00028042973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99883986,0.000055921773,0.0003308428,0.00009374922,0.00055972603,0.000119878685],"domain_scores_gemma":[0.9985798,0.00015252455,0.00047291917,0.00009016258,0.0005934089,0.000111209825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002066623,0.00007898255,0.00029376085,0.0016255641,0.00013318294,0.0000064366527,0.0001673361,0.000024126768,0.000115650444],"category_scores_gemma":[0.00004175549,0.00008444212,0.0002951791,0.0018948124,0.0000936811,0.0002520489,0.00008872811,0.00021100618,3.7229628e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017958606,0.00419619,0.170819,0.0003331243,0.00181916,0.00065121957,0.0012115358,0.7142367,0.0038627512,0.09416032,0.0031304723,0.0037837077],"study_design_scores_gemma":[0.02518024,0.008859632,0.745531,0.001402501,0.0029715807,0.008102698,0.035001975,0.05271823,0.0037823753,0.02392216,0.09125054,0.0012770583],"about_ca_topic_score_codex":0.000010006631,"about_ca_topic_score_gemma":5.255701e-7,"teacher_disagreement_score":0.66151845,"about_ca_system_score_codex":0.00008235886,"about_ca_system_score_gemma":0.00026447352,"threshold_uncertainty_score":0.344345},"labels":[],"label_agreement":null},{"id":"W6925887548","doi":"10.20382/jocg.v16i1a13","title":"Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Prenatal Screening and Diagnostics","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University","funders":"","keywords":"Geodesic; Simple polygon; Voronoi diagram; Polygon (computer graphics); Simple (philosophy); Set (abstract data type); RADIUS; SIMPLE algorithm; Point (geometry)","score_opus":0.015568999501474518,"score_gpt":0.24787197042018538,"score_spread":0.23230297091871085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925887548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94226265,0.00077172933,0.051288694,0.0015397654,0.0001628102,0.000099657365,0.00000912719,0.00002443156,0.0038411613],"genre_scores_gemma":[0.9945756,0.000026396505,0.004841241,0.00014112408,0.00017694049,8.570077e-8,0.000012770653,0.000009512514,0.00021633913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.999003,0.00005819236,0.0002867312,0.00011482966,0.00037714915,0.00016012219],"domain_scores_gemma":[0.9986721,0.0008811786,0.00013584793,0.000072372044,0.00013559233,0.00010289086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003646605,0.00009914305,0.0002044606,0.00080011773,0.000087853114,0.000063005114,0.00014954632,0.000052578096,0.000046792193],"category_scores_gemma":[0.00026231658,0.0000748781,0.00014088255,0.0011782141,0.000061645194,0.00018268278,0.00006541239,0.00041788406,0.000006111692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013496977,0.0007182951,0.19154799,0.0007928312,0.0010733384,0.0120083755,0.0025779984,0.6152388,0.0011796035,0.06582737,0.006646472,0.10103925],"study_design_scores_gemma":[0.007933893,0.0018446877,0.515155,0.00535111,0.0011041991,0.0050358847,0.0081751635,0.39260164,0.00065391266,0.023649802,0.037552632,0.00094203063],"about_ca_topic_score_codex":0.000050465616,"about_ca_topic_score_gemma":0.0000060257044,"teacher_disagreement_score":0.32360706,"about_ca_system_score_codex":0.00018287967,"about_ca_system_score_gemma":0.00025340865,"threshold_uncertainty_score":0.30534405},"labels":[],"label_agreement":null},{"id":"W6925964192","doi":"10.20382/jocg.v13i1a4","title":"FPT-Algorithms for computing Gromov-Hausdorff and interleaving distances between trees","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"COVID-19 Pandemic Impacts","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Metric space; Intrinsic metric; Shortest path problem; Metric (unit); Interleaving; Edit distance; Shortest-path tree; Distance; Merge (version control)","score_opus":0.041266992345401654,"score_gpt":0.24950594281661623,"score_spread":0.20823895047121457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925964192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68101937,0.00055337936,0.3162793,0.0007619913,0.0003932778,0.00012077803,0.0002265261,0.000015383652,0.0006300013],"genre_scores_gemma":[0.99242043,0.00002076339,0.006710718,0.00018210406,0.00022527385,2.0792774e-7,0.000019685991,0.000014742587,0.00040609483],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883676,0.000042573793,0.00054390274,0.00022572977,0.00013175097,0.00021929777],"domain_scores_gemma":[0.99790514,0.0008386151,0.00093148387,0.0000781805,0.00011823117,0.00012834583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081543595,0.00013219008,0.00044120164,0.001345682,0.0003653763,0.00006557915,0.00033756392,0.000042953383,0.00007690294],"category_scores_gemma":[0.00016814066,0.00017041362,0.0001796856,0.0007331907,0.000069842776,0.00039131506,0.0001952062,0.00028658708,0.0000022754946],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048411757,0.00029722395,0.5304021,0.00020730936,0.0011449569,0.00017984731,0.0037549448,0.32794067,0.00004544511,0.09783238,0.0033072843,0.034403723],"study_design_scores_gemma":[0.010360151,0.0022328862,0.38466597,0.00015403492,0.0001987307,0.00028726953,0.0062168874,0.07798707,0.000043844724,0.103255905,0.4132895,0.0013077765],"about_ca_topic_score_codex":0.000031965454,"about_ca_topic_score_gemma":0.0000024379658,"teacher_disagreement_score":0.4099822,"about_ca_system_score_codex":0.0004751132,"about_ca_system_score_gemma":0.000090323585,"threshold_uncertainty_score":0.6949266},"labels":[],"label_agreement":null},{"id":"W6925997529","doi":"10.20382/jocg.v16i2a4","title":"Practical software for triangulating and simplifying 4-manifolds","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Diatoms and Algae Research","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Software; Dimension (graph theory); Triangulation; Heuristic; Manifold (fluid mechanics); Deformation (meteorology)","score_opus":0.028813107852701067,"score_gpt":0.3155088031152552,"score_spread":0.2866956952625541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925997529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.669859,0.00007263992,0.3284794,0.0007984932,0.00017188667,0.00009070057,0.000011516478,0.000011732347,0.000504608],"genre_scores_gemma":[0.90110195,0.000011974438,0.09803813,0.00011325376,0.00010037808,1.6028572e-7,0.0000028883164,0.0000060836505,0.0006252123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991595,0.000059512833,0.00022031872,0.00012167513,0.00027973985,0.00015922128],"domain_scores_gemma":[0.9977983,0.0012749075,0.00020203175,0.000048309033,0.0005857352,0.00009070859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005638991,0.00007236934,0.00018818992,0.0006429047,0.00018673658,0.00010486751,0.00013827837,0.000050348088,0.00005742137],"category_scores_gemma":[0.0006638791,0.00007039838,0.000077623925,0.0005964802,0.0000561936,0.00037876525,0.00009001147,0.00011919877,0.000002319914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004422103,0.0012297041,0.05322505,0.0016100777,0.0010534778,0.0011843846,0.0007207034,0.18645333,0.040287197,0.56200945,0.03129171,0.11651279],"study_design_scores_gemma":[0.043394893,0.0043614334,0.2076518,0.0023163538,0.0014609803,0.0013090788,0.011267696,0.09516184,0.023829289,0.16662927,0.4399893,0.002628068],"about_ca_topic_score_codex":0.0000052448304,"about_ca_topic_score_gemma":8.7464156e-7,"teacher_disagreement_score":0.4086976,"about_ca_system_score_codex":0.00008301425,"about_ca_system_score_gemma":0.0003656624,"threshold_uncertainty_score":0.28707626},"labels":[],"label_agreement":null},{"id":"W6926161935","doi":"10.20382/jocg.v14i1","title":"Journal of Computational Geometry, Vol. 14 No. 1 (2023)","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Plant and animal studies","field":"Agricultural and Biological Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Key (lock); Feature (linguistics); Field (mathematics); Set (abstract data type); Term (time)","score_opus":0.02753964512012163,"score_gpt":0.204064547552357,"score_spread":0.17652490243223537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926161935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99625504,0.00020291678,0.0004146491,0.0009246608,0.0006790194,0.000052968822,0.0000938549,0.0000212683,0.0013556281],"genre_scores_gemma":[0.99521166,0.00018727354,0.0010219336,0.00013743414,0.0010327823,5.7204016e-8,0.000038601804,0.000002019917,0.0023682616],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9981142,0.00009567075,0.00051415805,0.00014146199,0.0008799346,0.00025454172],"domain_scores_gemma":[0.99532837,0.00090860645,0.0007889612,0.000016762328,0.0027748784,0.00018242428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054923224,0.00016281764,0.0004009669,0.00054114615,0.00027127127,0.00006349564,0.0004688365,0.00008965356,0.0003721631],"category_scores_gemma":[0.00034115315,0.00008513257,0.00034564108,0.0025075425,0.00010009754,0.00037296643,0.00012906996,0.00030763177,0.00010256279],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023743678,0.0011993311,0.12291102,0.00013425083,0.0023425636,0.0032440936,0.00041872953,0.36135843,0.015698705,0.0051140925,0.43162325,0.053581163],"study_design_scores_gemma":[0.0014077423,0.0014775833,0.74531263,0.00013449966,0.00011896516,0.00036474236,0.0010795419,0.0018138702,0.00008403196,0.00469954,0.2431357,0.00037113528],"about_ca_topic_score_codex":0.000014352929,"about_ca_topic_score_gemma":0.00001539434,"teacher_disagreement_score":0.62240165,"about_ca_system_score_codex":0.00009449349,"about_ca_system_score_gemma":0.00008213593,"threshold_uncertainty_score":0.40749252},"labels":[],"label_agreement":null},{"id":"W6926255130","doi":"10.20382/jocg.v16i2a6","title":"Robustly guarding polygons","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Marine Invertebrate Physiology and Ecology","field":"Earth and Planetary Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Robustness (evolution); Guard (computer science); Approximation algorithm; Polygon (computer graphics); Constant (computer programming); Visibility; Domain (mathematical analysis)","score_opus":0.006569673843731423,"score_gpt":0.1890649422360971,"score_spread":0.18249526839236568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926255130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9279493,0.0001405223,0.012548207,0.0011474008,0.0008690087,0.00004248351,0.000010539103,0.0000137544175,0.057278775],"genre_scores_gemma":[0.995898,0.00002381535,0.0017380016,0.00044398487,0.00007642986,5.5488787e-9,0.0000144053865,9.865329e-7,0.001804364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9993557,0.00008524893,0.00019077634,0.00009686766,0.00012606497,0.00014537059],"domain_scores_gemma":[0.99921006,0.00033033942,0.00016695683,0.00005185726,0.00017135107,0.00006943718],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017914755,0.000075978336,0.0001873422,0.0008623558,0.00017575329,0.000016957865,0.00024904686,0.000066775865,0.0014919462],"category_scores_gemma":[0.000047821406,0.000073272095,0.00011045312,0.00090658746,0.00007474067,0.00024587483,0.00002325699,0.00020224234,0.000039887927],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018906684,0.00003609951,0.34609193,0.000016255228,0.00022319076,0.00014499274,0.000026742357,0.6268849,0.000021170335,0.0070958263,0.0061943205,0.013075507],"study_design_scores_gemma":[0.00083133543,0.00019557659,0.9351298,0.000024394018,0.000070183356,0.00007736495,0.00028637095,0.020616665,0.000027880998,0.015933076,0.026678199,0.00012911548],"about_ca_topic_score_codex":0.000085615044,"about_ca_topic_score_gemma":0.00006106173,"teacher_disagreement_score":0.6062682,"about_ca_system_score_codex":0.000017132199,"about_ca_system_score_gemma":0.00020706661,"threshold_uncertainty_score":0.9994208},"labels":[],"label_agreement":null},{"id":"W6926285796","doi":"10.20382/jocg.v13i1a13","title":"Recognizing weighted and seeded disk graphs","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unit disk graph; Intersection graph; Vertex (graph theory); Planar graph; Intersection (aeronautics); Graph; Stars","score_opus":0.008482291990980738,"score_gpt":0.18264390229779687,"score_spread":0.17416161030681612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926285796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9750182,0.0002455269,0.023260582,0.000069443864,0.0003602118,0.000040114428,0.0000084168405,0.000046763635,0.0009507072],"genre_scores_gemma":[0.99632984,0.000040405,0.0033933502,0.000052454994,0.000053104453,5.9530546e-8,0.0000048135867,0.000011414032,0.000114553455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993031,0.000046097673,0.00019021414,0.00008940913,0.00024340213,0.000127799],"domain_scores_gemma":[0.99944884,0.00020024065,0.00012686975,0.000041450177,0.00009158528,0.00009101701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014187323,0.00009521967,0.00016551718,0.00073393225,0.00024656925,0.000016232132,0.00014341202,0.000021349253,0.000056781104],"category_scores_gemma":[0.000011915066,0.00011067699,0.00008085352,0.00086749595,0.00002644513,0.00026168814,0.000085552056,0.00034762043,8.8831956e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007794915,0.00002643542,0.000985311,0.00002579464,0.00010610318,0.00025869536,0.00015770967,0.9841976,0.001934941,0.0014170244,0.00028645803,0.010525948],"study_design_scores_gemma":[0.01842266,0.0031302085,0.062314548,0.00042365023,0.00080718717,0.00806209,0.014283368,0.48973584,0.010948358,0.10176829,0.2864581,0.0036457162],"about_ca_topic_score_codex":6.483261e-7,"about_ca_topic_score_gemma":2.096444e-7,"teacher_disagreement_score":0.4944618,"about_ca_system_score_codex":0.000103308725,"about_ca_system_score_gemma":0.000025525555,"threshold_uncertainty_score":0.45132768},"labels":[],"label_agreement":null},{"id":"W6944628196","doi":"10.20382/jocg.v16i2a2","title":"Constrained and ordered level planarity parameterized by the number of levels","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Planarity testing; Parameterized complexity; Disjoint sets; Time complexity; Graph; Crossing number (knot theory); Twist; Order (exchange)","score_opus":0.02604492658022801,"score_gpt":0.28367366597794924,"score_spread":0.25762873939772124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6944628196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3042461,0.00006570733,0.69305414,0.0013846288,0.000092676724,0.00007141097,0.000035782898,0.000008421125,0.0010411114],"genre_scores_gemma":[0.95720303,0.000015864056,0.041804705,0.00014968826,0.000009579396,9.062861e-8,0.0000019702768,0.0000030757906,0.0008119842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876595,0.00021999149,0.00029035946,0.00015351696,0.00041296365,0.00015721004],"domain_scores_gemma":[0.9975985,0.0012871417,0.0003136221,0.00015822922,0.00056135695,0.00008110083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005154751,0.000104688246,0.00025824766,0.000550602,0.00014590219,0.00005353325,0.00079441257,0.000054683776,0.000024184888],"category_scores_gemma":[0.00016245859,0.00008738811,0.00010042691,0.0015659239,0.00033941006,0.0004183049,0.00022663901,0.00026475562,0.0000010825224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006199825,0.00032458978,0.011223865,0.00009481823,0.000859271,0.00015496429,0.00044724744,0.013944398,0.0036547035,0.9314416,0.0029276276,0.034306914],"study_design_scores_gemma":[0.015740419,0.00062356656,0.10654112,0.00037462215,0.0002113424,0.001130381,0.0020673256,0.046497583,0.0053776545,0.7898919,0.030637428,0.0009066366],"about_ca_topic_score_codex":0.0000084343565,"about_ca_topic_score_gemma":8.845228e-7,"teacher_disagreement_score":0.65295696,"about_ca_system_score_codex":0.00005562497,"about_ca_system_score_gemma":0.00029437797,"threshold_uncertainty_score":0.35635835},"labels":[],"label_agreement":null},{"id":"W6944787213","doi":"10.20382/jocg.v14i1a5","title":"On the independence number of intersection graphs of axis-parallel segments","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Corporate Governance and Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hausdorff Research Institute for Mathematics; European Commission","keywords":"Intersection graph; Conjecture; Independence number; Bounded function; Graph; Treewidth; Constant (computer programming); Block graph; Intersection (aeronautics)","score_opus":0.01289508226664382,"score_gpt":0.19978062925456713,"score_spread":0.1868855469879233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6944787213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9823958,0.000009668959,0.00707443,0.00037938735,0.00038817563,0.00009353169,0.0000056829267,0.000005610718,0.0096476795],"genre_scores_gemma":[0.99892616,0.0000068060376,0.00018003117,0.00035005895,0.00005549651,2.3742919e-7,0.0000048878205,0.0000055354067,0.00047080856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987714,0.000028167584,0.00026885865,0.00009211458,0.0007529989,0.00008645763],"domain_scores_gemma":[0.9982941,0.000092769376,0.0011511511,0.00008376252,0.00036918756,0.000009009305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036257567,0.00008248775,0.00016070643,0.0007065758,0.00013133178,0.000020972793,0.00036129603,0.00001901546,0.0005974269],"category_scores_gemma":[0.000029547931,0.000073715295,0.00014968829,0.001304495,0.000044843564,0.0004628354,0.00024127902,0.00020131595,0.000007284781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008737306,0.00050142664,0.03265069,0.00009657598,0.00036274086,0.00008975761,0.00012325817,0.41313285,0.0001618201,0.5384412,0.011364854,0.002201137],"study_design_scores_gemma":[0.012221921,0.0012510355,0.38598803,0.0005876243,0.0009363643,0.00015506275,0.023718266,0.020551145,0.0003163562,0.37831447,0.1747065,0.0012532428],"about_ca_topic_score_codex":0.00009873145,"about_ca_topic_score_gemma":0.000005257798,"teacher_disagreement_score":0.3925817,"about_ca_system_score_codex":0.00009721042,"about_ca_system_score_gemma":0.00004837328,"threshold_uncertainty_score":0.65414053},"labels":[],"label_agreement":null},{"id":"W6945050253","doi":"10.20382/jocg.v16i1a8","title":"Reconfiguration of colorings in triangulations of the sphere","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Triangulation; Vertex (graph theory); Sequence (biology); Characterization (materials science); Generalization; Point set triangulation","score_opus":0.009465094711338476,"score_gpt":0.20897086399816722,"score_spread":0.19950576928682875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945050253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55992913,0.0002855542,0.4360454,0.0009969276,0.00067518296,0.00011475222,0.000008015487,0.000011854632,0.0019331578],"genre_scores_gemma":[0.9874038,0.000016490187,0.012054786,0.000024105686,0.00005523198,1.2624994e-7,0.000003189079,0.0000037923671,0.00043847438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998698,0.000120685385,0.00050031114,0.00013092312,0.0004614874,0.000088616165],"domain_scores_gemma":[0.9984434,0.0004700673,0.00040819257,0.00011598349,0.0005206594,0.000041679086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042510766,0.00008367775,0.00019824888,0.0011518276,0.00005056254,0.00003918556,0.00046466818,0.000055340155,0.00003422945],"category_scores_gemma":[0.000093321614,0.00007358708,0.00018522453,0.003478948,0.000051853254,0.0007238419,0.00007182328,0.00017094836,0.0000017680622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043042695,0.00009632208,0.0011807214,0.00006475114,0.00007699291,0.000023541746,0.00043385988,0.752705,0.0016348284,0.22798052,0.00033512653,0.015425328],"study_design_scores_gemma":[0.0042768517,0.000979923,0.30733255,0.0012583758,0.00018946255,0.00037893854,0.00092778984,0.52050096,0.016540688,0.10242795,0.04455298,0.00063354085],"about_ca_topic_score_codex":0.0000115972225,"about_ca_topic_score_gemma":0.0000084799085,"teacher_disagreement_score":0.42747468,"about_ca_system_score_codex":0.000120763456,"about_ca_system_score_gemma":0.000549902,"threshold_uncertainty_score":0.30007938},"labels":[],"label_agreement":null},{"id":"W6962973369","doi":"10.20382/jocg.v9i2","title":"Journal of Computational Geometry, Vol. 9 No. 2 (2018): Special Issue of Selected Papers from SoCG 2017","year":2018,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Special section; Key (lock); Field (mathematics)","score_opus":0.010448174499178491,"score_gpt":0.21760109500716734,"score_spread":0.20715292050798886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6962973369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3421851,0.00023264863,0.64541847,0.00062166894,0.0068927165,0.00017767589,0.000083312974,0.000032223597,0.004356191],"genre_scores_gemma":[0.79456633,0.00007816826,0.190956,0.0003788421,0.0125702415,1.9537461e-7,0.00008121312,0.000029682875,0.0013393105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956055,0.0003255906,0.0013766483,0.00038387853,0.0019407541,0.00036760006],"domain_scores_gemma":[0.9825064,0.0010505152,0.002673718,0.00026288957,0.01314979,0.00035671832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008882539,0.00034115626,0.00077645096,0.0031581724,0.0003096438,0.00015395103,0.0015755569,0.0002045176,0.0008725884],"category_scores_gemma":[0.00083563186,0.00035642085,0.00045806734,0.0040949853,0.00032009822,0.0014964369,0.00026801514,0.0005207468,0.000077993034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015503914,0.0014258537,0.004402475,0.00009567902,0.002083964,0.00044016296,0.0015971169,0.7049705,0.0033333057,0.011768688,0.22506687,0.043264985],"study_design_scores_gemma":[0.015876273,0.007834465,0.19509381,0.0005891966,0.00073744624,0.0012944626,0.0008797243,0.13755138,0.0061837984,0.040751737,0.5911723,0.0020354313],"about_ca_topic_score_codex":0.00002346252,"about_ca_topic_score_gemma":0.00000610992,"teacher_disagreement_score":0.5674191,"about_ca_system_score_codex":0.00033472892,"about_ca_system_score_gemma":0.0015631245,"threshold_uncertainty_score":0.9998888},"labels":[],"label_agreement":null},{"id":"W6963147319","doi":"10.20382/jocg.v15i2a7","title":"Worst-case deterministic fully-dynamic biconnectivity in changeable planar embeddings","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Commission","keywords":"Embedding; Vertex (graph theory); Planar; Enhanced Data Rates for GSM Evolution; Planar straight-line graph; Planar graph; Book embedding","score_opus":0.010769732400275622,"score_gpt":0.2355317721607354,"score_spread":0.22476203976045978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6963147319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.345726,0.00035447147,0.6520153,0.0005697451,0.00075971684,0.00008462483,0.00000978556,0.000049905626,0.00043041675],"genre_scores_gemma":[0.9720786,0.000028770042,0.027200012,0.00011200359,0.00014582645,3.747602e-7,0.000009426879,0.000011186604,0.00041377745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828696,0.00013156004,0.00042898412,0.00035164936,0.00053051306,0.0002703203],"domain_scores_gemma":[0.99825215,0.0008529983,0.00023524414,0.00014819973,0.00033906425,0.00017231854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006797772,0.00019418042,0.00029926194,0.0035550823,0.00015182103,0.00026796068,0.00050983345,0.00009642019,0.000031584546],"category_scores_gemma":[0.000096497206,0.00020988035,0.00018500608,0.0037390643,0.00004844943,0.0014591321,0.000117313095,0.0003830652,0.000025565867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015661235,0.00040126007,0.00049311225,0.00021198922,0.00027977384,0.03978298,0.0013033386,0.7064244,0.00069284136,0.1641858,0.0010494957,0.08501835],"study_design_scores_gemma":[0.0011702387,0.00046576236,0.003353957,0.0002549069,0.000057870533,0.0103027625,0.0002672828,0.93806213,0.00010523946,0.03276512,0.012750063,0.00044465225],"about_ca_topic_score_codex":0.000015558482,"about_ca_topic_score_gemma":0.00002727246,"teacher_disagreement_score":0.6263526,"about_ca_system_score_codex":0.0003926038,"about_ca_system_score_gemma":0.0004576745,"threshold_uncertainty_score":0.8558672},"labels":[],"label_agreement":null},{"id":"W6963357116","doi":"10.20382/jocg.v14i1a3","title":"SPQR-tree-like embedding representation for level planarity","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Planarity testing; Embedding; Book embedding; Representation (politics); Planar; Graph; Graph embedding; Planar graph","score_opus":0.05386085989245618,"score_gpt":0.2875350460733845,"score_spread":0.2336741861809283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6963357116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10255129,0.000035848094,0.8943242,0.0012695167,0.001034741,0.00015824672,0.000027040805,0.0000880527,0.00051109405],"genre_scores_gemma":[0.8089715,0.000039082057,0.1872385,0.00033068276,0.0005074171,0.0000010914863,0.00014598088,0.000017677989,0.0027480493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813575,0.00011270979,0.00045245793,0.00030591112,0.0007286538,0.00026451208],"domain_scores_gemma":[0.99712056,0.0009594889,0.00051811663,0.00017470993,0.0010582554,0.0001688527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006828578,0.00016195905,0.000277257,0.0023188544,0.0003022343,0.00014839818,0.0006927062,0.000088774505,0.000014787048],"category_scores_gemma":[0.00019298345,0.00018158827,0.00026679065,0.0036281059,0.000039782055,0.0012707561,0.00016267007,0.00018631964,0.000025011737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110877685,0.00008902397,0.0007844014,0.000031446514,0.00014889214,0.00011315728,0.00026802893,0.90798694,0.0003997743,0.048599653,0.01566143,0.025806373],"study_design_scores_gemma":[0.003248345,0.00049870403,0.03931489,0.00006989133,0.00008217325,0.00024246897,0.0004751489,0.84316486,0.00077187875,0.04209683,0.0695328,0.0005019856],"about_ca_topic_score_codex":0.000006986701,"about_ca_topic_score_gemma":0.000003933214,"teacher_disagreement_score":0.70708567,"about_ca_system_score_codex":0.00017329222,"about_ca_system_score_gemma":0.00033775275,"threshold_uncertainty_score":0.7404955},"labels":[],"label_agreement":null},{"id":"W6963620429","doi":"10.20382/jocg.v6i1","title":"Journal of Computational Geometry, Vol. 6 No. 1 (2015)","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Key (lock); Feature (linguistics); Field (mathematics); Set (abstract data type)","score_opus":0.019324206576099366,"score_gpt":0.23472078616059794,"score_spread":0.21539657958449857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6963620429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120313846,0.00051354326,0.8725591,0.0009124515,0.0041176453,0.00011964335,0.000015864136,0.000034166107,0.0014137794],"genre_scores_gemma":[0.7434773,0.000045611057,0.2528664,0.00046864725,0.0017753504,2.1069982e-7,0.000032014224,0.000024959176,0.0013095565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954053,0.00035093114,0.0012402637,0.00032732775,0.0023032373,0.00037294996],"domain_scores_gemma":[0.98136467,0.00080869644,0.00205105,0.00024522914,0.014866701,0.00066364865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018550113,0.00032306145,0.0006601626,0.00395199,0.00020671448,0.00024321073,0.0016004057,0.000166656,0.00009659535],"category_scores_gemma":[0.001184031,0.0003296192,0.00046948978,0.0037897704,0.00014138632,0.0024179548,0.0003044092,0.000591757,0.00008070102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024506098,0.00037453318,0.0010351787,0.000026014775,0.00030997925,0.00031255974,0.00027931144,0.927548,0.000057450536,0.016364546,0.04591032,0.0075370506],"study_design_scores_gemma":[0.01745777,0.00583454,0.029583227,0.0003844759,0.0004291945,0.004940624,0.0010932708,0.33907866,0.00066606764,0.114990525,0.48369527,0.0018463602],"about_ca_topic_score_codex":0.000007960198,"about_ca_topic_score_gemma":0.0000011870732,"teacher_disagreement_score":0.6231634,"about_ca_system_score_codex":0.0005237719,"about_ca_system_score_gemma":0.002172585,"threshold_uncertainty_score":0.9999156},"labels":[],"label_agreement":null},{"id":"W7080542863","doi":"10.20382/jocg.v16i2a7","title":"Effective computation of the Heegaard genus of 3-manifolds","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computation; Heuristics; Triangulation; Normal surface; Invariant (physics); Surface (topology); Genus","score_opus":0.0054527288747362275,"score_gpt":0.20349819939743846,"score_spread":0.19804547052270224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7080542863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4435428,0.00009865481,0.54550785,0.0012259124,0.0004101094,0.00011368388,0.0000035936055,0.000009902931,0.009087484],"genre_scores_gemma":[0.9930272,0.0000045708466,0.006409608,0.000062694126,0.000022575558,7.5268645e-8,8.9379796e-7,0.0000011219605,0.00047125923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9988965,0.00014376799,0.00035202404,0.00012939182,0.000371261,0.00010707933],"domain_scores_gemma":[0.99756026,0.0004214321,0.0007079971,0.00014620673,0.0011255238,0.00003858785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034055204,0.000096159645,0.00025757472,0.000550911,0.000088686174,0.000016165779,0.00078778627,0.00006798734,0.000006758629],"category_scores_gemma":[0.00014984906,0.000081903956,0.00021839383,0.0019283069,0.00010552597,0.00023215899,0.00025398817,0.00017933558,6.57951e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009888186,0.00020347175,0.0120287845,0.0002074007,0.00036087516,0.000037966947,0.00033315062,0.8767443,0.0016743524,0.09426851,0.0010001296,0.013042198],"study_design_scores_gemma":[0.0067936825,0.000980256,0.61184496,0.001383713,0.000396038,0.00029941017,0.0013088168,0.15747233,0.0423363,0.14167058,0.034848455,0.0006654933],"about_ca_topic_score_codex":0.000009127054,"about_ca_topic_score_gemma":6.7664797e-7,"teacher_disagreement_score":0.71927196,"about_ca_system_score_codex":0.00007839673,"about_ca_system_score_gemma":0.00025194607,"threshold_uncertainty_score":0.33399463},"labels":[],"label_agreement":null},{"id":"W7092295236","doi":"10.20382/jocg.v16i2a9","title":"Faster Fréchet distance approximation through truncated smoothing","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Medieval European History and Architecture","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Dimension (graph theory); Quadratic equation; Approximation algorithm; Measure (data warehouse); Smoothing; Constant (computer programming); Approximation theory; Time complexity","score_opus":0.015945536630000652,"score_gpt":0.20464051622226503,"score_spread":0.1886949795922644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092295236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3828016,0.00040671538,0.3018265,0.0015845746,0.0020287894,0.00016185016,0.000038568916,0.00006114535,0.31109026],"genre_scores_gemma":[0.9764076,0.000011349478,0.0023682243,0.00065038,0.0003111984,6.587102e-8,0.000017732065,0.00000905735,0.020224385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991264,0.00010173171,0.0002711395,0.00011535444,0.00027176965,0.00011365059],"domain_scores_gemma":[0.9990717,0.00015616338,0.00030034196,0.00007284299,0.00035315772,0.000045765777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016411333,0.00011059568,0.00019192361,0.00055810553,0.00028461707,0.0000696148,0.00023377154,0.00003130776,0.00037889127],"category_scores_gemma":[0.000047705955,0.000102980186,0.000133027,0.00026493456,0.00014701136,0.00047201838,0.000038378068,0.00026993506,0.000012843062],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042060768,0.00018044985,0.00025556757,0.00016083312,0.000284045,0.00014903562,0.017198721,0.04973162,0.000103833285,0.91461444,0.010966756,0.0059340755],"study_design_scores_gemma":[0.00085005007,0.00008555857,0.00048885605,0.00014927909,0.0000691516,0.000011031395,0.0021754382,0.00090355624,0.00003938897,0.00966278,0.9854311,0.00013384163],"about_ca_topic_score_codex":0.0000045757615,"about_ca_topic_score_gemma":0.0000058779106,"teacher_disagreement_score":0.9744643,"about_ca_system_score_codex":0.00011546581,"about_ca_system_score_gemma":0.000100460486,"threshold_uncertainty_score":0.419941},"labels":[],"label_agreement":null},{"id":"W7104289419","doi":"10.20382/jocg.v16i1a16","title":"Dynamic unit-disk range reporting","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Amortized analysis; Data structure; Set (abstract data type); Range (aeronautics); Point (geometry); Range query (database); Constant (computer programming); Space (punctuation)","score_opus":0.014139266720189333,"score_gpt":0.25532853712106013,"score_spread":0.2411892704008708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104289419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19798425,0.00023522635,0.79553473,0.0012791817,0.00077237503,0.00007739645,0.0000027837823,0.00004462585,0.0040694354],"genre_scores_gemma":[0.88955677,0.000034126908,0.1071622,0.00037206008,0.00006766928,1.6836202e-7,0.000010728821,0.000006197719,0.0027900818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791324,0.00013931957,0.0008984558,0.00025907226,0.0005804811,0.00020940308],"domain_scores_gemma":[0.99652845,0.0004437108,0.0015166795,0.0002059194,0.0011797352,0.00012547895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008512512,0.00016215534,0.00032460282,0.0025029609,0.00025126128,0.00013551673,0.0007773469,0.00008442218,0.000024440658],"category_scores_gemma":[0.00036854978,0.00017498067,0.00024984154,0.0038218875,0.000051761224,0.00096433976,0.00020798779,0.0002911613,0.000009063779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009836434,0.00023229148,0.0053664227,0.000057706555,0.00031216457,0.00048160533,0.00018546305,0.7483095,0.00038514443,0.18578875,0.0021361606,0.05664642],"study_design_scores_gemma":[0.005318656,0.00055415113,0.1928468,0.00038905453,0.00023261116,0.0008799454,0.00057046395,0.54686576,0.0006022294,0.09463806,0.15619057,0.00091167085],"about_ca_topic_score_codex":0.0000053244526,"about_ca_topic_score_gemma":0.0000030213646,"teacher_disagreement_score":0.69157255,"about_ca_system_score_codex":0.00020851672,"about_ca_system_score_gemma":0.0006800717,"threshold_uncertainty_score":0.71355045},"labels":[],"label_agreement":null},{"id":"W7105854729","doi":"10.20382/jocg.v16i1a17","title":"Folding polyominoes into cubes","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polyomino; Cube (algebra); Simple (philosophy); Unit cube; Folding (DSP implementation); Square (algebra)","score_opus":0.005011217730162019,"score_gpt":0.19439734239453516,"score_spread":0.18938612466437313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105854729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5702254,0.0013270096,0.42476532,0.00008999975,0.0015846799,0.000033554825,0.000008078401,0.000105800915,0.0018601354],"genre_scores_gemma":[0.98642457,0.00019385791,0.012856567,0.000016960843,0.00023696876,3.4445513e-8,0.0000028422862,0.000015900067,0.00025232247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994566,0.000011995713,0.00017364632,0.000068805886,0.00018122261,0.000107745174],"domain_scores_gemma":[0.999645,0.000100110316,0.000042687945,0.000038942,0.00009758979,0.000075688564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009430377,0.00009042143,0.00014806922,0.000703688,0.00004372221,0.00005167985,0.00012674504,0.000044926957,0.00006733499],"category_scores_gemma":[0.000012133452,0.000091765454,0.000096578566,0.00047343926,0.000014331351,0.00040408914,0.000026938791,0.00012983721,0.000012171089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026324,0.000015363712,0.000023538758,0.00017652541,0.00018948068,0.0004010782,0.00021322204,0.9102067,0.016587034,0.052135993,0.0014144743,0.018610299],"study_design_scores_gemma":[0.0016117678,0.00052714034,0.000535444,0.0008539,0.00030598315,0.0006930247,0.0016084927,0.31843108,0.031427458,0.09850625,0.5446019,0.00089758565],"about_ca_topic_score_codex":0.0000017004476,"about_ca_topic_score_gemma":4.5701248e-7,"teacher_disagreement_score":0.5917756,"about_ca_system_score_codex":0.00014553331,"about_ca_system_score_gemma":0.00005209026,"threshold_uncertainty_score":0.37420866},"labels":[],"label_agreement":null},{"id":"W7106146625","doi":"10.20382/jocg.v16i1a18","title":"An algorithm to construct one-vertex triangulations of Heegaard splittings","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Triangulation; Construct (python library); Boundary (topology); Heegaard splitting; Diagram; Bounded function","score_opus":0.02602626743368361,"score_gpt":0.29063889604352605,"score_spread":0.26461262860984247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106146625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5205573,0.000093308685,0.47670057,0.00057818554,0.00045043248,0.00010812316,0.00004795929,0.000035016707,0.0014291067],"genre_scores_gemma":[0.8049525,0.0000068023437,0.1941489,0.000060237944,0.00014916732,8.2317506e-8,0.000006962045,0.000014188555,0.00066118233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984849,0.00010631252,0.00053424697,0.00017923862,0.00051356317,0.00018171813],"domain_scores_gemma":[0.997529,0.0011777557,0.0003336752,0.00012920746,0.0006210047,0.00020938183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047231064,0.00013623225,0.0004188504,0.003015025,0.000079854704,0.00004201067,0.00032480992,0.000098510405,0.00034847655],"category_scores_gemma":[0.00028829303,0.00014098504,0.00023115677,0.0028377573,0.000105966,0.0003453912,0.000058120655,0.00024679906,0.0000135653745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018295473,0.00060742185,0.0013191763,0.00024356066,0.0011233897,0.0004754532,0.0012901119,0.01600712,0.00059829635,0.8212176,0.0046367617,0.15229815],"study_design_scores_gemma":[0.0057139536,0.0033333306,0.025918094,0.0008543822,0.0013091125,0.0015314674,0.006248387,0.033723556,0.001165748,0.8670806,0.05196575,0.0011555669],"about_ca_topic_score_codex":0.000011978344,"about_ca_topic_score_gemma":0.0000011836977,"teacher_disagreement_score":0.2843952,"about_ca_system_score_codex":0.00013103907,"about_ca_system_score_gemma":0.0003303596,"threshold_uncertainty_score":0.5749203},"labels":[],"label_agreement":null},{"id":"W7106834220","doi":"10.20382/jocg.v16i1a20","title":"Metric and geometric spanners that are resilient to degree-bounded edge faults","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa; University of Windsor","funders":"","keywords":"Vertex (graph theory); Bounded function; Metric dimension; Graph; Metric space; Degree (music); Matching (statistics); Metric (unit)","score_opus":0.02504757245345905,"score_gpt":0.23151972834366497,"score_spread":0.20647215589020593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106834220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5397989,0.0024687462,0.4526886,0.002593311,0.0011657333,0.00013151547,0.000009546185,0.00010478713,0.0010388781],"genre_scores_gemma":[0.9639878,0.00008887183,0.03465311,0.00028285608,0.000033838365,1.3809337e-7,0.000002004655,0.000011212789,0.0009401502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9980239,0.00009889969,0.0003340063,0.00038360796,0.00087902177,0.0002805099],"domain_scores_gemma":[0.998001,0.00058167934,0.0002578247,0.00018800204,0.00057644374,0.000395065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006152552,0.00019236628,0.0003113569,0.008605742,0.00018503547,0.00028417452,0.00065434346,0.00008662382,0.0000127283],"category_scores_gemma":[0.00015157048,0.00018068639,0.00018021508,0.009897382,0.000066608016,0.00080153946,0.0002922006,0.0003168007,0.000028861235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003229159,0.0005990613,0.018974118,0.00041554842,0.00124703,0.0048579075,0.0015051115,0.40416485,0.00044290788,0.3864394,0.032848123,0.148183],"study_design_scores_gemma":[0.009508378,0.0044974154,0.34950733,0.002600801,0.00079266814,0.004219896,0.0032126706,0.16415486,0.0024647892,0.13852757,0.31694964,0.0035639605],"about_ca_topic_score_codex":0.000016732327,"about_ca_topic_score_gemma":0.0000024496799,"teacher_disagreement_score":0.42418894,"about_ca_system_score_codex":0.00019773601,"about_ca_system_score_gemma":0.00022939939,"threshold_uncertainty_score":0.7678814},"labels":[],"label_agreement":null},{"id":"W7111411162","doi":"10.20382/jocg.v16i2a10","title":"Fine-Grained Complexity of Earth Mover’s Distance Under Translation","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Translation (biology); Earth (classical element); Algebra over a field; Context (archaeology)","score_opus":0.0288278873048255,"score_gpt":0.24364669503923286,"score_spread":0.21481880773440737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111411162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043783724,0.00016633543,0.95043975,0.0015713652,0.000366269,0.00007339901,0.000018091125,0.000024917601,0.0035561628],"genre_scores_gemma":[0.87930876,0.000014230716,0.12006479,0.00012897253,0.000037948972,5.9209682e-8,0.0000063617754,0.0000037776742,0.00043512168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985795,0.0001157682,0.00043171662,0.00019121301,0.00051853113,0.00016327685],"domain_scores_gemma":[0.9982589,0.00041154565,0.0004348562,0.00019413122,0.000617284,0.00008330907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028853526,0.00013605389,0.00032033192,0.0012918597,0.00014644569,0.00005127482,0.0008245603,0.00006211196,0.000029917563],"category_scores_gemma":[0.00003231784,0.00014686583,0.00026115167,0.0025978272,0.00022643273,0.0006422421,0.000116365685,0.00023422712,0.000001573366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009767557,0.00018495617,0.00087530294,0.000044209253,0.00016112189,0.000030256306,0.00012748125,0.0979916,0.00015149194,0.88845927,0.00026844622,0.011608203],"study_design_scores_gemma":[0.004602382,0.00044082224,0.114160225,0.00031087268,0.00010885779,0.000064518696,0.00028439562,0.20312819,0.0010159723,0.6448951,0.030506358,0.00048232835],"about_ca_topic_score_codex":0.000012923675,"about_ca_topic_score_gemma":0.000021997374,"teacher_disagreement_score":0.83552504,"about_ca_system_score_codex":0.000062019775,"about_ca_system_score_gemma":0.00029169043,"threshold_uncertainty_score":0.5989015},"labels":[],"label_agreement":null},{"id":"W7111415984","doi":"10.20382/jocg.v16i1a19","title":"Excluding cosmetic surgeries on hyperbolic 3-manifolds","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Knot (papermaking); Conjecture; Knot theory; Knot invariant; Tricolorability","score_opus":0.028274327781274325,"score_gpt":0.27788765871319915,"score_spread":0.24961333093192484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111415984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9343861,0.00013310571,0.04547406,0.0012672879,0.0008027104,0.00008208089,0.0000061880196,0.00003405359,0.017814415],"genre_scores_gemma":[0.988556,0.00003496466,0.006080173,0.000262959,0.00010246536,9.445746e-8,0.0000022168497,0.000010176089,0.004950911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986921,0.00012077636,0.00040680796,0.00015508193,0.0004074468,0.00021781404],"domain_scores_gemma":[0.9967757,0.0021512553,0.00041025702,0.00012400986,0.0004387216,0.0001000496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040420538,0.00015740794,0.00042757936,0.0032618544,0.00016392433,0.00003287542,0.00032600758,0.00010334432,0.00019250785],"category_scores_gemma":[0.0006286204,0.0001553738,0.00023508693,0.0024658223,0.000105274594,0.0001737287,0.00008471462,0.00028996659,0.000013762305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023652174,0.0003601703,0.0054902835,0.00009646957,0.00049401773,0.00035270685,0.00013984492,0.009680714,0.000047340323,0.96184766,0.014447685,0.00680656],"study_design_scores_gemma":[0.0047987984,0.0009845499,0.0485314,0.0004810805,0.0005583459,0.00039949626,0.0028751618,0.0011006709,0.0005686028,0.77889395,0.16010205,0.00070590805],"about_ca_topic_score_codex":0.00000481279,"about_ca_topic_score_gemma":0.000001161784,"teacher_disagreement_score":0.18295375,"about_ca_system_score_codex":0.00018787598,"about_ca_system_score_gemma":0.00024426778,"threshold_uncertainty_score":0.633596},"labels":[],"label_agreement":null},{"id":"W7116395976","doi":"10.20382/jocg.v16i2a11","title":"A universal in-place reconfiguration algorithm for sliding cube-shaped robots in a quadratic number of moves","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Control reconfiguration; Modular design; Bounding overwatch; Robot; Self-reconfiguring modular robot; Quadratic equation; Dimension (graph theory)","score_opus":0.009690633517852007,"score_gpt":0.23696810727055426,"score_spread":0.22727747375270224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116395976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25438467,0.00007033052,0.74390405,0.000066667424,0.00020056088,0.00010577195,0.000006335203,0.000008591706,0.0012530093],"genre_scores_gemma":[0.9689229,0.000057554626,0.030628191,0.000016587946,0.000025436515,2.3799144e-7,0.0000065744184,0.0000081463695,0.00033433756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991785,0.000042666823,0.00038464728,0.0000980529,0.00016509526,0.00013101923],"domain_scores_gemma":[0.99922246,0.00030065508,0.00014983896,0.000053653657,0.0002337177,0.00003965178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021762267,0.0001040248,0.0002708568,0.0012651811,0.000028186985,0.000016913495,0.0001675708,0.000074123695,0.000035262638],"category_scores_gemma":[0.000042005453,0.00012158194,0.00009689149,0.0011025851,0.000019175712,0.00032524465,0.00001672757,0.00017162366,0.0000011362561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055038738,0.000049903883,0.001411733,0.00007080139,0.00006931788,0.000035981888,0.00017335801,0.9811761,0.0003991332,0.0065356754,0.000072487375,0.009950512],"study_design_scores_gemma":[0.0014537923,0.0000681139,0.005636235,0.0003129059,0.00003404045,0.000020221816,0.0008904055,0.9872955,0.0008093574,0.002625879,0.00069351494,0.0001599979],"about_ca_topic_score_codex":0.00002417511,"about_ca_topic_score_gemma":0.000019912239,"teacher_disagreement_score":0.7145383,"about_ca_system_score_codex":0.00026954734,"about_ca_system_score_gemma":0.00013311817,"threshold_uncertainty_score":0.4957968},"labels":[],"label_agreement":null},{"id":"W7124446922","doi":"10.20382/jocgv16i1a22","title":"Optimal in-place compaction of sliding cubes","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Focus (optics); Control reconfiguration; Modular design; Robot; Control theory (sociology); Ideal (ethics); Topology (electrical circuits)","score_opus":0.010272908179110432,"score_gpt":0.2132085274568037,"score_spread":0.20293561927769327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124446922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69755673,0.0004577031,0.30022693,0.000047931087,0.00040042933,0.000025666253,0.0000038044327,0.000020431866,0.0012604032],"genre_scores_gemma":[0.99532646,0.00011225399,0.0043487917,0.0000043410105,0.00006239748,1.9493115e-8,0.0000021169476,0.000008665533,0.00013495142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993364,0.000022676284,0.00024476112,0.00006696027,0.00023244365,0.000096733194],"domain_scores_gemma":[0.9995797,0.00014918396,0.000059198264,0.000039142946,0.00012145201,0.00005130747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016248677,0.00007926461,0.00017134938,0.0011964561,0.000020150044,0.00002494503,0.00012733437,0.000043816606,0.00006937186],"category_scores_gemma":[0.000012319759,0.00008382566,0.000095611016,0.0008368788,0.000018723133,0.00032740628,0.000015773356,0.00021405148,0.000005365826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019756388,0.000016759452,0.00040290714,0.00007214685,0.000068309244,0.000121840625,0.00015970417,0.99221927,0.00066520914,0.0037716175,0.0003046503,0.0021778403],"study_design_scores_gemma":[0.0003652125,0.00013937858,0.0047124135,0.00037984003,0.00004690146,0.00018030526,0.00067830645,0.9771138,0.0034834647,0.0004962248,0.01221345,0.00019073166],"about_ca_topic_score_codex":0.0000066612747,"about_ca_topic_score_gemma":0.0000013899679,"teacher_disagreement_score":0.29776976,"about_ca_system_score_codex":0.00015934858,"about_ca_system_score_gemma":0.00005674871,"threshold_uncertainty_score":0.34183112},"labels":[],"label_agreement":null},{"id":"W7127190243","doi":"10.20382/jocg.v16i2a5","title":"A quadtree, a Steiner spanner, and approximate nearest neighbours in hyperbolic space","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Euclidean geometry; Euclidean space; Point (geometry); Hyperbolic geometry; Simple (philosophy); Spanner; Hyperbolic tree; Space (punctuation)","score_opus":0.006018767731506937,"score_gpt":0.20835488728107207,"score_spread":0.20233611954956512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127190243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42909566,0.00046240218,0.5658929,0.0021403225,0.00031915418,0.00009794136,0.0000029805972,0.000022824246,0.001965858],"genre_scores_gemma":[0.961431,0.00007631,0.03694767,0.00030084056,0.00007740577,2.8883673e-7,0.0000050701615,0.000006047735,0.0011553544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858874,0.00013819285,0.00037336323,0.00026866264,0.00041225844,0.00021877787],"domain_scores_gemma":[0.9986259,0.00037295828,0.00028602555,0.00014560111,0.00043932404,0.00013022572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004036827,0.00016482222,0.00030309157,0.0027183236,0.00012512498,0.00014797483,0.0004954641,0.00008132227,0.000009253445],"category_scores_gemma":[0.00009340836,0.00017473471,0.000105458486,0.0032979236,0.00006607289,0.0008691658,0.00021081584,0.00026683643,0.0000031827688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012832088,0.00024863434,0.007939573,0.000055460172,0.000112618494,0.0002480234,0.00034086825,0.6315539,0.00024617236,0.33621302,0.0009293077,0.021984126],"study_design_scores_gemma":[0.0072546815,0.0005805773,0.19355199,0.000392848,0.00010008104,0.00043551828,0.0007893186,0.6911762,0.0004225075,0.052078757,0.05244731,0.0007702545],"about_ca_topic_score_codex":0.00002407935,"about_ca_topic_score_gemma":0.000014862094,"teacher_disagreement_score":0.53233534,"about_ca_system_score_codex":0.00014976175,"about_ca_system_score_gemma":0.00040183656,"threshold_uncertainty_score":0.7125475},"labels":[],"label_agreement":null},{"id":"W7133355104","doi":"10.20382/jocg.v17i1a1","title":"Relating interleaving and Fréchet distances via ordered merge trees","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Interleaving; Merge (version control); Monotone polygon; Topology (electrical circuits); Binary number","score_opus":0.0072092613714521804,"score_gpt":0.21682045112091128,"score_spread":0.2096111897494591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133355104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1499054,0.00047223258,0.8454072,0.0012398566,0.00019578577,0.000027581606,0.0000047927497,0.000022427235,0.0027247278],"genre_scores_gemma":[0.9694328,0.00006371579,0.029081086,0.00014105559,0.00003296054,4.5688687e-8,0.0000036167653,0.0000022142553,0.0012425542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998879,0.000094669485,0.00033849996,0.00021354445,0.00031877335,0.00015546812],"domain_scores_gemma":[0.9985558,0.00056238024,0.0003514454,0.00012468388,0.00030673397,0.000098947516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030720927,0.00011696934,0.00028535113,0.0018170528,0.00018851404,0.00011397905,0.000665391,0.00005935204,0.00003227944],"category_scores_gemma":[0.00018421438,0.000103791666,0.00013808713,0.0037566668,0.0000864654,0.0008307249,0.00031321312,0.00022258598,0.0000024813735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019095407,0.0004699472,0.07170415,0.00008409544,0.001481857,0.0006613304,0.0006354948,0.08787103,0.00045998482,0.44087327,0.0036615112,0.39190638],"study_design_scores_gemma":[0.005627957,0.0011635303,0.36202186,0.00053675007,0.00064584106,0.00032808498,0.0029140657,0.25391406,0.0003687944,0.19913605,0.172019,0.001324006],"about_ca_topic_score_codex":0.00002478793,"about_ca_topic_score_gemma":0.000010757036,"teacher_disagreement_score":0.8195273,"about_ca_system_score_codex":0.00007790346,"about_ca_system_score_gemma":0.00007491753,"threshold_uncertainty_score":0.42325014},"labels":[],"label_agreement":null}]}