{"meta":{"query_hash":"e398ba414c6d","filters":{"venue":"Computational Geometry"},"cohort_total":236,"direct_labels_cover":1,"predictions_cover":236,"exported":236,"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/e398ba414c6d","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computational+Geometry"},"results":[{"id":"W1497963486","doi":"10.1016/j.comgeo.2008.04.005","title":"The distance geometry of music","year":2008,"lang":"en","type":"book-chapter","venue":"Computational Geometry","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Interdisciplinary Research in Music Media and Technology; McGill University; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Euclidean geometry; Euclidean distance; Rhythm; Property (philosophy); Non-Euclidean geometry; Combinatorics; Geometry","score_opus":0.022290202225696918,"score_gpt":0.22846883403935542,"score_spread":0.2061786318136585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497963486","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072308036,0.026542604,0.60523224,0.0012770729,0.0020338462,0.00036509105,0.00007726438,0.0003827514,0.36336604],"genre_scores_gemma":[0.3156147,0.0037867038,0.040194385,0.0013293074,0.0006834378,0.000045491975,0.000110312416,0.00010706045,0.6381286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814034,0.000016914762,0.000492242,0.0004645214,0.0006286075,0.00025739046],"domain_scores_gemma":[0.9975346,0.0009853329,0.00041556612,0.0007037043,0.00031189254,0.000048913582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022294151,0.00028756983,0.000407987,0.0003723146,0.000562844,0.00004147508,0.0014310207,0.0002729062,0.000042802978],"category_scores_gemma":[0.00009883383,0.00022532622,0.00020983582,0.0003282661,0.00074941607,0.000101505,0.00060974335,0.0004730083,0.00010160756],"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.0000044378758,0.000015866435,0.00005032166,0.000025383826,0.00014850519,0.000020552581,0.00015879808,0.00038401873,2.6061764e-7,0.93532604,0.033456333,0.030409457],"study_design_scores_gemma":[0.000198259,0.000061933795,0.0019489691,0.00006819983,0.000016141146,0.00005683773,0.000011447021,0.0016356255,0.0000030668439,0.3783693,0.61729443,0.0003358012],"about_ca_topic_score_codex":0.0000019892243,"about_ca_topic_score_gemma":0.0000046377254,"teacher_disagreement_score":0.5838381,"about_ca_system_score_codex":0.000057901263,"about_ca_system_score_gemma":0.0001474787,"threshold_uncertainty_score":0.9188537},"labels":[],"label_agreement":null},{"id":"W1503791796","doi":"10.1016/s0925-7721(01)00059-1","title":"A decomposition-based approach to layered manufacturing☆☆A preliminary version of this paper appears in the Proceedings of the Seventh International Workshop on Algorithms and Data Structures, Providence, RI, 8–10 August 2001, LNCS 2125, pp. 389–400.","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polyhedron; Regular polygon; Algorithm; Computer science; Vertex (graph theory); Plane (geometry); Volume (thermodynamics); Cutting-plane method; Process (computing); Theoretical computer science; Geometry; Mathematics","score_opus":0.0306365213956014,"score_gpt":0.2740248191432383,"score_spread":0.24338829774763687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503791796","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.527658,0.00094772823,0.4473639,0.011377412,0.0010995048,0.0028913508,0.00036649016,0.00012353013,0.0081721125],"genre_scores_gemma":[0.9327035,0.000010990805,0.06598303,0.00080817845,0.00009769351,0.000026596404,0.00014765578,0.000010590606,0.00021177423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975584,0.00007909003,0.00046006835,0.000611776,0.0010703005,0.00022033411],"domain_scores_gemma":[0.9984239,0.0005641958,0.0002770081,0.0004083248,0.00025170625,0.00007488034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005957095,0.00020946834,0.00020477027,0.00041890322,0.00017670056,0.00014621182,0.0017851837,0.000091997324,0.0000979174],"category_scores_gemma":[0.00017428974,0.0001557474,0.00006775531,0.0011989609,0.000092651935,0.0005799087,0.00048035878,0.0002484217,0.000008629815],"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.00023295962,0.0011002291,0.0011246909,0.0001677734,0.000092227594,0.0000043685222,0.0011847516,0.860994,0.00019527835,0.008414265,0.07015979,0.05632967],"study_design_scores_gemma":[0.0009078334,0.00019263184,0.07669679,0.00016883451,0.000018495346,0.000038978877,0.0001624406,0.91501266,0.0005520622,0.0025038433,0.0034958364,0.00024959317],"about_ca_topic_score_codex":0.00001828734,"about_ca_topic_score_gemma":0.0000017217218,"teacher_disagreement_score":0.40504554,"about_ca_system_score_codex":0.000068182264,"about_ca_system_score_gemma":0.00007700082,"threshold_uncertainty_score":0.6351195},"labels":[],"label_agreement":null},{"id":"W1522976700","doi":"10.1016/s0925-7721(02)00134-7","title":"Long proteins with unique optimal foldings in the H-P model","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of New Brunswick","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Protein folding; Monomer; Folding (DSP implementation); Amino acid; Property (philosophy); Simple (philosophy); Amino acid residue; Combinatorics; Sequence (biology); Chemistry; State (computer science); Peptide sequence; Computer science; Mathematics; Biochemistry; Algorithm; Engineering","score_opus":0.006786635602184702,"score_gpt":0.2324253513832061,"score_spread":0.2256387157810214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522976700","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.59766823,0.00011497326,0.40120742,0.000060167968,0.000009629164,0.00016135465,0.000004203197,0.0000041204144,0.00076992164],"genre_scores_gemma":[0.95739156,0.000003828082,0.041899804,0.00046470662,0.000026784473,0.000030507868,0.00007417665,0.000010017856,0.00009859877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993915,0.000039207498,0.0000998831,0.0001858294,0.00014434685,0.00013923387],"domain_scores_gemma":[0.99972916,0.000014863729,0.00003790431,0.00013459998,0.00005764114,0.000025806761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016654006,0.00009459739,0.00006674631,0.000054924658,0.000054493365,0.000023301109,0.00013934063,0.000069681,0.0000042382726],"category_scores_gemma":[0.000039329014,0.00006685017,0.000028390648,0.00020563125,0.000048137455,0.0000041619714,0.00002370499,0.0000980197,0.000001595102],"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.00004892505,0.00005153699,0.007822422,0.000013599336,0.000022525244,0.000010360875,0.000076274,0.9758645,0.002027901,0.013372729,0.000108288186,0.00058090134],"study_design_scores_gemma":[0.0086764945,0.0025345827,0.14421642,0.0001677728,0.00010353226,0.0015299298,0.0008499005,0.67566216,0.049429517,0.10487259,0.009095174,0.0028619226],"about_ca_topic_score_codex":0.0000031123448,"about_ca_topic_score_gemma":0.000008768098,"teacher_disagreement_score":0.35972336,"about_ca_system_score_codex":0.0000101757,"about_ca_system_score_gemma":0.00010918294,"threshold_uncertainty_score":0.2726071},"labels":[],"label_agreement":null},{"id":"W1528651684","doi":"10.1016/j.comgeo.2017.10.002","title":"Continuous Yao graphs","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Exploratory Research for Advanced Technology; Natural Sciences and Engineering Research Council of Canada; Natur og Univers, Det Frie Forskningsråd; National Science Foundation","keywords":"Spanner; Combinatorics; Vertex (graph theory); Mathematics; Regular polygon; Algebraic number; Apex (geometry); Plane (geometry); Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.02671546909029007,"score_gpt":0.32140128542788193,"score_spread":0.2946858163375919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528651684","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.08250538,0.0001820763,0.90627515,0.0010196351,0.000467353,0.00014015593,0.00000650955,0.00017465472,0.009229087],"genre_scores_gemma":[0.9205903,0.0000047481662,0.0783846,0.00021836189,0.00005090998,0.00001022019,0.000005764599,0.000009405134,0.0007257023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985654,0.000048231643,0.00017142537,0.0003897398,0.00050311885,0.00032210242],"domain_scores_gemma":[0.9982647,0.0002914017,0.00014411894,0.00092070294,0.00024185452,0.00013725596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039525665,0.0001203524,0.00015408864,0.00031070822,0.0007686831,0.00051476137,0.0021803516,0.000045977973,0.00004159898],"category_scores_gemma":[0.00032408035,0.00011937491,0.00008851907,0.00033106262,0.00023532716,0.00082042074,0.0006648622,0.00018001188,0.00030284075],"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.000007220686,0.000050893414,0.008641217,0.000007766272,0.000025202204,0.000040143685,0.000050953066,0.0031289961,0.000065590204,0.9307849,0.0009474824,0.05624965],"study_design_scores_gemma":[0.00042117017,0.000051541036,0.11476041,0.000011171394,0.0000017956035,0.000030056337,0.000008781594,0.027997635,0.00015131461,0.8537632,0.0026152653,0.00018761854],"about_ca_topic_score_codex":0.0000060293846,"about_ca_topic_score_gemma":7.8343487e-7,"teacher_disagreement_score":0.8380849,"about_ca_system_score_codex":0.000023195598,"about_ca_system_score_gemma":0.00006424139,"threshold_uncertainty_score":0.5912166},"labels":[],"label_agreement":null},{"id":"W1535557537","doi":"10.1016/s0925-7721(00)00015-8","title":"Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":267,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Approximation algorithm; Simple (philosophy); Algorithm; Position (finance); Point (geometry); Path (computing); Shortest path problem; Mathematics; Grid; Lawn; Plane (geometry); Computer science; Combinatorics; Geometry","score_opus":0.010731073691518758,"score_gpt":0.22291545189570933,"score_spread":0.21218437820419056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535557537","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.7447552,0.0029633935,0.242508,0.006138516,0.00046411087,0.0023799387,0.00012182007,0.00006388448,0.0006051099],"genre_scores_gemma":[0.9613938,0.000050797193,0.036698632,0.0010565475,0.00010463672,0.00007570223,0.00027324483,0.000014789446,0.0003318897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980267,0.00013690327,0.00046504126,0.0004548299,0.00062275946,0.00029376266],"domain_scores_gemma":[0.9985436,0.0007777294,0.00015042153,0.00021556063,0.00023355492,0.000079124504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008006129,0.00020911547,0.00023624704,0.00017327993,0.00042788687,0.00015597731,0.00041621499,0.00007649889,0.00005374561],"category_scores_gemma":[0.000050474955,0.00015723094,0.00005198323,0.0007408163,0.00011165285,0.00039069742,0.00010707646,0.00016946887,0.0000036053684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002673906,0.00045719056,0.0019870305,0.00066444464,0.00021342168,0.000028437471,0.008232858,0.6569878,0.00041212584,0.028308114,0.027122704,0.27531847],"study_design_scores_gemma":[0.0013109122,0.00025821262,0.015279882,0.00009740097,0.00003228318,0.000076163116,0.0002373317,0.9587266,0.00017471304,0.009070592,0.014423367,0.00031256443],"about_ca_topic_score_codex":0.019942092,"about_ca_topic_score_gemma":0.00531924,"teacher_disagreement_score":0.30173877,"about_ca_system_score_codex":0.000082313796,"about_ca_system_score_gemma":0.0003262298,"threshold_uncertainty_score":0.9865842},"labels":[],"label_agreement":null},{"id":"W1536704310","doi":"10.1016/s0925-7721(01)00008-6","title":"A lower bound for β-skeleton belonging to minimum weight triangulations☆☆This work is partially supported by NSERC grant OPG0041629.","year":2001,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Skeleton (computer programming); Combinatorics; Mathematics; Euclidean geometry; Conjecture; Enhanced Data Rates for GSM Evolution; Triangulation; Set (abstract data type); Upper and lower bounds; Value (mathematics); Geometry; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.01871303024442876,"score_gpt":0.2697210495268319,"score_spread":0.2510080192824031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536704310","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.1811319,0.00031972385,0.8087025,0.007153549,0.0014214126,0.0007334111,0.000063543645,0.0001995627,0.00027439435],"genre_scores_gemma":[0.844616,0.000017082957,0.14213496,0.005654509,0.000867368,0.00020259879,0.00081321236,0.000050827555,0.005643433],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966339,0.00009115234,0.0007856895,0.0009508695,0.0008954578,0.0006429423],"domain_scores_gemma":[0.997417,0.00079836143,0.00023593337,0.000455624,0.00071306434,0.00038002586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068820186,0.0003693369,0.00038128614,0.0008533166,0.0006112922,0.00047508103,0.0007247465,0.00015425868,0.00035790403],"category_scores_gemma":[0.00018995978,0.00040416108,0.00025615413,0.003774391,0.00005153158,0.0006821281,0.00018913599,0.00016830719,0.0002773122],"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.0006342857,0.0012019995,0.005046077,0.00008230296,0.00040311675,0.00006877093,0.0016699979,0.22259733,0.0025388002,0.018905675,0.56893104,0.17792058],"study_design_scores_gemma":[0.0038098071,0.0006307122,0.02140676,0.00010608639,0.000080553364,0.00009938597,0.000025009742,0.48621365,0.0019625907,0.03208988,0.45208555,0.0014900183],"about_ca_topic_score_codex":0.000014372157,"about_ca_topic_score_gemma":0.000005776773,"teacher_disagreement_score":0.66656756,"about_ca_system_score_codex":0.00015900245,"about_ca_system_score_gemma":0.0003185583,"threshold_uncertainty_score":0.99984103},"labels":[],"label_agreement":null},{"id":"W1557286819","doi":"10.1016/j.comgeo.2008.09.008","title":"Dynamic ham-sandwich cuts in the plane","year":2009,"lang":"en","type":"book-chapter","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; National Science Foundation","keywords":"Combinatorics; Mathematics; Regular polygon; Cardinality (data modeling); General position; Convex polygon; Polygon (computer graphics); Time complexity; Partition (number theory); Point (geometry); Plane (geometry); Convex set; Line (geometry); Discrete mathematics; Convex optimization; Geometry; Computer science","score_opus":0.01446148464721942,"score_gpt":0.24617614672384475,"score_spread":0.23171466207662533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557286819","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082482287,0.004194798,0.6274635,0.0053696344,0.0014091432,0.0009930293,0.000085215266,0.0002974067,0.35936245],"genre_scores_gemma":[0.32049122,0.00044150566,0.14283283,0.015140621,0.0014464961,0.000085701016,0.005063732,0.00015544746,0.5143424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969834,0.000076562064,0.0006419568,0.00076923025,0.0011815599,0.00034725247],"domain_scores_gemma":[0.99806494,0.00074721174,0.00029710805,0.000565502,0.00023058892,0.00009462833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063697743,0.00044365777,0.0004005321,0.0011059811,0.00021312757,0.00031577545,0.0014445601,0.00028833773,0.00010996113],"category_scores_gemma":[0.000050574607,0.00038748415,0.00018932731,0.00062536367,0.000067349414,0.00032374228,0.00018551254,0.00066533434,0.000417054],"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.000014880357,0.000113683986,0.000016231983,0.00003713574,0.00005930332,0.00016262298,0.0002819568,0.16011035,0.000006369265,0.6724228,0.011046716,0.1557279],"study_design_scores_gemma":[0.00070300995,0.00019752924,0.0075915107,0.0001385649,0.00002766148,0.0003196765,0.000008855252,0.1856506,0.0000034058412,0.6346431,0.16992661,0.0007894649],"about_ca_topic_score_codex":0.0000037584427,"about_ca_topic_score_gemma":0.000013448499,"teacher_disagreement_score":0.48463067,"about_ca_system_score_codex":0.0001573632,"about_ca_system_score_gemma":0.0003147628,"threshold_uncertainty_score":0.9998577},"labels":[],"label_agreement":null},{"id":"W1561451935","doi":"10.1016/j.comgeo.2011.05.006","title":"A survey of geodesic paths on 3D surfaces","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geodesic; Mathematics; Geometry; Computer science","score_opus":0.06421114022435775,"score_gpt":0.26575912089879966,"score_spread":0.2015479806744419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561451935","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.36297813,0.00020139472,0.6336931,0.00003885034,0.00043597573,0.00012730501,0.000028875531,0.00008478149,0.002411622],"genre_scores_gemma":[0.91384894,0.0000053549543,0.0856568,0.0002314829,0.000032432086,0.0000066825487,0.00008910737,0.000009402608,0.000119784636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9981655,0.00018210044,0.000418632,0.00042037826,0.0005900612,0.00022332881],"domain_scores_gemma":[0.9981096,0.0007017403,0.00021543576,0.0003219804,0.0005488347,0.00010240251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077392056,0.00017484992,0.00022699116,0.0005116011,0.00011230194,0.000045776003,0.0005970815,0.00006835964,0.0001059672],"category_scores_gemma":[0.00021937156,0.00017371017,0.000072389084,0.0017341481,0.00006370212,0.00032299405,0.00014614768,0.000120029305,0.00013843452],"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.00012220575,0.0012313926,0.03871638,0.0000748397,0.0001783231,0.000024825875,0.0012392084,0.6354148,0.000216289,0.17041115,0.0025681164,0.14980249],"study_design_scores_gemma":[0.0003111997,0.00022246125,0.72939146,0.00001682065,0.000004440385,0.0000071657964,0.000005858077,0.25821647,0.0006568339,0.0108389305,0.0001305703,0.00019779449],"about_ca_topic_score_codex":0.000108061104,"about_ca_topic_score_gemma":0.0000092109285,"teacher_disagreement_score":0.6906751,"about_ca_system_score_codex":0.000032500902,"about_ca_system_score_gemma":0.00018332276,"threshold_uncertainty_score":0.70836955},"labels":[],"label_agreement":null},{"id":"W1562300282","doi":"10.1016/j.comgeo.2016.02.002","title":"Discrete Voronoi games and ϵ-nets, in two and three dimensions","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voronoi diagram; Stochastic game; Disjoint sets; Cardinality (data modeling); Mathematics; Combinatorics; Polynomial; Point (geometry); Set (abstract data type); Discrete mathematics; Mathematical optimization; Computer science; Mathematical economics; Geometry; Mathematical analysis","score_opus":0.04909594309911264,"score_gpt":0.3784666469523827,"score_spread":0.32937070385327005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562300282","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.77064,0.00029663517,0.22414458,0.0042636413,0.00006439754,0.000089800276,0.00003082079,0.000019432171,0.00045066915],"genre_scores_gemma":[0.9961102,0.000014073965,0.0030670518,0.00023252146,0.000031022708,0.000011380865,0.0000035647408,0.00000471877,0.0005254822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890137,0.00006296762,0.00028300897,0.00033313048,0.000301404,0.00011813119],"domain_scores_gemma":[0.9973159,0.0022570866,0.00008568508,0.00016682233,0.00008442985,0.00009006908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006960993,0.0000803752,0.0001276445,0.00027612815,0.00014008247,0.00006607135,0.00013625514,0.00002444492,0.00022307741],"category_scores_gemma":[0.00051770406,0.000050125353,0.000023577637,0.00051563536,0.00024301453,0.00023307024,0.00013315666,0.000054175478,0.00012196878],"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.00003049556,0.00005294282,0.19780518,0.0000022217894,0.000014780096,0.000002951814,0.00018305473,0.003435428,0.00037056935,0.54500055,0.0019375498,0.2511643],"study_design_scores_gemma":[0.00034138124,0.0000111235095,0.3425613,0.000009992167,0.0000021558742,0.000011961127,0.000081804064,0.0030904869,0.000022390226,0.6500241,0.0037688732,0.00007443835],"about_ca_topic_score_codex":0.00000892536,"about_ca_topic_score_gemma":0.000030961448,"teacher_disagreement_score":0.25108984,"about_ca_system_score_codex":0.000012806839,"about_ca_system_score_gemma":0.000023141338,"threshold_uncertainty_score":0.24425411},"labels":[],"label_agreement":null},{"id":"W1582516383","doi":"10.1016/s0925-7721(01)00009-8","title":"Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses☆☆A preliminary version of this report was presented at the Fifth Canadian Conference on Computational Geometry [32].","year":2001,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ellipse; Estimator; Mathematics; Geometry; Conic section; Robustness (evolution); Algorithm; Arc (geometry); Statistics","score_opus":0.019067213175143528,"score_gpt":0.263155399745561,"score_spread":0.24408818657041748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582516383","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.12599961,0.00020395123,0.87155867,0.00072326354,0.0001826866,0.0009314356,0.000053763848,0.000065789965,0.00028085735],"genre_scores_gemma":[0.9078988,0.000016307042,0.091398776,0.00016001519,0.00003057321,0.000058385744,0.0002465327,0.0000135534565,0.0001770639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997726,0.00017176259,0.0006714574,0.0004610348,0.00071093015,0.00025876824],"domain_scores_gemma":[0.99665934,0.0015933064,0.00048680237,0.00034915196,0.00078369206,0.00012770134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011790431,0.0002076342,0.00042956744,0.00077567314,0.00033865485,0.0000648106,0.00037500684,0.00011121031,0.00006997112],"category_scores_gemma":[0.0004763856,0.00017387794,0.00017706091,0.00084899395,0.00027969113,0.00013648659,0.00015208544,0.00010590959,0.000009860105],"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.0012773279,0.00013020089,0.000093645474,0.000089602516,0.00009842781,0.00002986602,0.0003143478,0.98151755,0.00006211588,0.0023309668,0.0010630573,0.012992896],"study_design_scores_gemma":[0.006035769,0.00024087318,0.0021933923,0.00007168191,0.00003968493,0.00020293276,0.000033091103,0.98336256,0.0021713434,0.0052816365,0.00019065775,0.0001763804],"about_ca_topic_score_codex":0.0014517526,"about_ca_topic_score_gemma":0.000029869809,"teacher_disagreement_score":0.7818992,"about_ca_system_score_codex":0.00019817744,"about_ca_system_score_gemma":0.0003096163,"threshold_uncertainty_score":0.70905364},"labels":[],"label_agreement":null},{"id":"W1584311686","doi":"10.1016/s0925-7721(01)00006-2","title":"The DFS-heuristic for orthogonal graph drawing☆☆Some of these result were published in the author's PhD thesis at Rutgers University; the author would like to thank her advisor, Prof. Endre Boros, for much helpful input. The results in Section 5 have been presented at the 8th Canadian Conference on Computational Geometry, Ottawa, 1996, see [1].","year":2001,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Graph; Heuristic; Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Discrete mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.03544733803028847,"score_gpt":0.27145615317288,"score_spread":0.23600881514259156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584311686","genre_codex":"commentary","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.37272346,0.00068582775,0.22153865,0.38677925,0.002836747,0.010235366,0.0027874259,0.00017245767,0.0022408199],"genre_scores_gemma":[0.991371,0.000020051544,0.0013284425,0.0023231006,0.00036127586,0.00027010788,0.0010204338,0.000036261103,0.0032693222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99433815,0.0010525131,0.0010727287,0.0010781374,0.0015709219,0.0008875439],"domain_scores_gemma":[0.98795295,0.009119851,0.00063256733,0.00092022686,0.0011398335,0.0002345982],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0047438825,0.00049844105,0.0004245846,0.0011028566,0.0021720869,0.0006350986,0.002544645,0.0002970056,0.00002290675],"category_scores_gemma":[0.001728737,0.0002902245,0.00032187466,0.0042214706,0.00040678948,0.00058154634,0.00044031534,0.00081906636,0.0000149966245],"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.0015598956,0.00037176907,0.0030131142,0.00005921644,0.00026416132,0.00002165255,0.0065785637,0.8333342,0.000056158973,0.07314923,0.07260686,0.008985147],"study_design_scores_gemma":[0.0037870812,0.0007631774,0.24117091,0.0001501975,0.00009046614,0.00010120236,0.0023924059,0.57980394,0.00012422829,0.042857274,0.12794816,0.00081098126],"about_ca_topic_score_codex":0.0025260623,"about_ca_topic_score_gemma":0.015494735,"teacher_disagreement_score":0.6186476,"about_ca_system_score_codex":0.0006317565,"about_ca_system_score_gemma":0.0009988633,"threshold_uncertainty_score":0.999955},"labels":[],"label_agreement":null},{"id":"W1658042064","doi":"10.1016/j.comgeo.2016.05.005","title":"Analysis of farthest point sampling for approximating geodesics in a graph","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Geodesic; Vertex (graph theory); Mathematics; Distance; Shortest path problem; Path graph; Bounded function; Computation; Graph; Discrete mathematics; Graph power; Algorithm; Geometry; Line graph; Mathematical analysis","score_opus":0.03545272358260807,"score_gpt":0.28902768903354975,"score_spread":0.25357496545094166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1658042064","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.1557273,0.00008437416,0.84335715,0.00039283518,0.00011195805,0.0001840273,0.00003112931,0.000040616975,0.000070629154],"genre_scores_gemma":[0.71712315,0.0000031382044,0.28264543,0.00010019758,0.000031559943,0.00002032154,0.00004774931,0.0000057220786,0.000022750492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983483,0.00005285967,0.00060297863,0.00040557492,0.0003573156,0.00023298021],"domain_scores_gemma":[0.9973073,0.0018078485,0.0002610382,0.0002244287,0.00033694255,0.0000624612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080130977,0.00013682105,0.000313949,0.0018360829,0.0000756109,0.00005025211,0.0003685596,0.000055251327,0.000013089662],"category_scores_gemma":[0.00036053613,0.000114976596,0.00020566517,0.004046325,0.000041437183,0.00037715028,0.00010178483,0.000051018236,0.000004630929],"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.000014598881,0.000111437876,0.009487882,0.000032996864,0.00020245755,7.951459e-7,0.0002112993,0.7621021,0.0007369814,0.14183444,0.000025068459,0.085239895],"study_design_scores_gemma":[0.00067146664,0.00006299292,0.11656326,0.00004559432,0.000054695865,0.0000029084888,0.000019374074,0.7717809,0.00040018233,0.11010563,0.0000935149,0.00019949152],"about_ca_topic_score_codex":0.000008117649,"about_ca_topic_score_gemma":0.000007830047,"teacher_disagreement_score":0.5613958,"about_ca_system_score_codex":0.00006496148,"about_ca_system_score_gemma":0.00009732493,"threshold_uncertainty_score":0.46886092},"labels":[],"label_agreement":null},{"id":"W1710148940","doi":"10.1016/j.comgeo.2015.06.005","title":"Approximating the bottleneck plane perfect matching of a point set","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Bottleneck; Matching (statistics); Plane (geometry); Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Set (abstract data type); Point (geometry); Algorithm; Computer science; Geometry; Artificial intelligence; Statistics","score_opus":0.03667188324158616,"score_gpt":0.26998025246331553,"score_spread":0.23330836922172937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1710148940","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.20057406,0.00030407257,0.7965734,0.00092082843,0.0003713855,0.00015696396,0.000010102331,0.00008139091,0.0010077672],"genre_scores_gemma":[0.85776603,0.0000015944846,0.1415251,0.0003858997,0.00014960961,0.000011441675,0.0000684959,0.000008656585,0.00008316443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981012,0.00014929674,0.00046289107,0.00031807844,0.00074996974,0.00021858876],"domain_scores_gemma":[0.9982671,0.0006895502,0.00025858372,0.00030500066,0.00036244985,0.00011727925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012770719,0.00015781891,0.00020523458,0.00028337192,0.00017850661,0.00013687027,0.0006528493,0.000049981158,0.000016101309],"category_scores_gemma":[0.00025095887,0.00012452032,0.00008840641,0.0011838767,0.00005839964,0.00042284798,0.00028781316,0.0001687132,0.000055938217],"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.000013876218,0.0000771571,0.00048267853,0.00003716669,0.000046704467,0.000005362065,0.0021543836,0.8822509,0.00019112992,0.09799137,0.0026797098,0.014069555],"study_design_scores_gemma":[0.00073502865,0.0001646416,0.0063658985,0.000040953593,0.00001358084,0.00016930114,0.00040792226,0.8331335,0.00070831587,0.15683207,0.0011496601,0.00027911086],"about_ca_topic_score_codex":0.000020742384,"about_ca_topic_score_gemma":0.0000013622617,"teacher_disagreement_score":0.657192,"about_ca_system_score_codex":0.000056395085,"about_ca_system_score_gemma":0.00023912331,"threshold_uncertainty_score":0.50777906},"labels":[],"label_agreement":null},{"id":"W1822031247","doi":"10.1016/j.comgeo.2017.06.009","title":"Strong matching of points with geometric shapes","year":2017,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equilateral triangle; Combinatorics; Mathematics; Matching (statistics); Disjoint sets; Incircle and excircles of a triangle; Regular polygon; Upper and lower bounds; General position; Geometry; Mathematical analysis","score_opus":0.029531536936662967,"score_gpt":0.2833987703164079,"score_spread":0.2538672333797449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1822031247","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.1066987,0.0009347274,0.8890847,0.0005325578,0.00071341346,0.00036457757,0.000075216674,0.00015090857,0.0014452303],"genre_scores_gemma":[0.72463757,0.000020499989,0.27452964,0.000100321355,0.00022847994,0.000025733965,0.000246619,0.000026182137,0.00018494415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962544,0.00011701763,0.00073724065,0.0010415294,0.0014402679,0.00040958458],"domain_scores_gemma":[0.9961352,0.0006146794,0.0012203889,0.00088570564,0.00095872884,0.0001853443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074165245,0.00048423297,0.00067844236,0.0020270217,0.0003787683,0.0006016892,0.0022631392,0.0002595789,0.000051194365],"category_scores_gemma":[0.0001945874,0.00046727195,0.0002377802,0.0012295024,0.00014216547,0.000665374,0.0019503528,0.00066383806,0.000046205252],"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.000023268512,0.0001723685,0.00082714314,0.0002812037,0.00022775515,0.000023667673,0.00017997301,0.9116695,0.00001703497,0.05224379,0.00043384792,0.03390046],"study_design_scores_gemma":[0.0014386509,0.00033259304,0.112324506,0.0006989919,0.00010587215,0.0001187265,0.000042255757,0.57553726,0.00046029428,0.3067703,0.00082042755,0.0013501116],"about_ca_topic_score_codex":0.000048689275,"about_ca_topic_score_gemma":0.000004864135,"teacher_disagreement_score":0.6179389,"about_ca_system_score_codex":0.00012487969,"about_ca_system_score_gemma":0.00081020343,"threshold_uncertainty_score":0.9997779},"labels":[],"label_agreement":null},{"id":"W1867622403","doi":"10.1016/j.comgeo.2015.11.001","title":"Kinetic k-Semi-Yao graph and its applications","year":2015,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Graph; k-nearest neighbors algorithm; Bounded function; Mathematics; Epigraph; Degree (music); Kinetic energy; Discrete mathematics; Physics; Computer science; Mathematical analysis","score_opus":0.030142382045293074,"score_gpt":0.2807996737333427,"score_spread":0.2506572916880496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1867622403","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.017103262,0.008475941,0.9699073,0.000989899,0.00086578913,0.00078768976,0.00008689615,0.0003404777,0.0014427479],"genre_scores_gemma":[0.8880918,0.00017564645,0.10828924,0.0007023739,0.00071971834,0.00034891683,0.0009862374,0.000037300695,0.0006487495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969093,0.0001226227,0.0005964141,0.0011290712,0.0008911366,0.00035144953],"domain_scores_gemma":[0.9972219,0.00045925862,0.00034256317,0.0005593056,0.0010604871,0.00035650595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005710644,0.00042465684,0.000413393,0.0010345867,0.00024799778,0.00048352414,0.0010453697,0.00029629204,0.000025941452],"category_scores_gemma":[0.00014951071,0.00047484942,0.0001383793,0.0014971757,0.0000699955,0.00034578965,0.0017942857,0.0005691178,0.00016285853],"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.00000597613,0.000142293,0.00009707809,0.00020087589,0.00009346569,0.000008212811,0.0001641624,0.8090106,0.00003819483,0.15869923,0.0049007004,0.026639163],"study_design_scores_gemma":[0.00040653904,0.000052567208,0.002986935,0.00005617291,0.00003351952,0.00006754071,0.000009660898,0.58627254,0.000056158955,0.39742044,0.012069991,0.0005679404],"about_ca_topic_score_codex":0.0000073964893,"about_ca_topic_score_gemma":0.0000013076448,"teacher_disagreement_score":0.87098855,"about_ca_system_score_codex":0.0001181338,"about_ca_system_score_gemma":0.0005795956,"threshold_uncertainty_score":0.99977034},"labels":[],"label_agreement":null},{"id":"W1964672542","doi":"10.1016/j.comgeo.2009.06.005","title":"Homogeneous 2-hop broadcast in 2D","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Homogeneous; Hop (telecommunications); Range (aeronautics); Computer science; Power consumption; Mathematics; Set (abstract data type); Mathematical optimization; Combinatorics; Discrete mathematics; Algorithm; Power (physics); Computer network; Physics; Engineering","score_opus":0.010821408733593264,"score_gpt":0.24448745983221187,"score_spread":0.2336660510986186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964672542","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.11644786,0.00089129526,0.8773334,0.0009145219,0.00036139146,0.0001740209,0.0000023373216,0.00019032256,0.0036848455],"genre_scores_gemma":[0.9241367,0.000009002263,0.074104965,0.0014302193,0.00013469625,0.000006454561,0.000013362418,0.0000066202606,0.0001579525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985504,0.000048327278,0.0002853873,0.00041074638,0.00038014282,0.000325003],"domain_scores_gemma":[0.99920756,0.00019783097,0.000071084585,0.0003351572,0.00008429796,0.000104044295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021413498,0.00014167384,0.00016688762,0.00034225103,0.00006938842,0.00012151055,0.0007352513,0.00007084192,0.000044303473],"category_scores_gemma":[0.000034975565,0.00015372648,0.000059789894,0.0015293972,0.000027661848,0.0002789993,0.00013053828,0.00018764472,0.00021378318],"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.0000055679525,0.00016307572,0.0011422699,0.0000041515436,0.000007376898,0.00013638342,0.00014652922,0.49958983,0.000029712346,0.06420671,0.0023248144,0.4322436],"study_design_scores_gemma":[0.0006170741,0.00014631847,0.101449795,0.000028220842,0.0000023937157,0.00014969023,0.000009135936,0.8060518,0.00004884314,0.08671861,0.004438432,0.00033969863],"about_ca_topic_score_codex":0.000005565996,"about_ca_topic_score_gemma":0.000002051175,"teacher_disagreement_score":0.8076889,"about_ca_system_score_codex":0.00007731103,"about_ca_system_score_gemma":0.00008049542,"threshold_uncertainty_score":0.6268784},"labels":[],"label_agreement":null},{"id":"W1965013906","doi":"10.1016/j.comgeo.2010.06.002","title":"A note on the perimeter of fat objects","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Perimeter; Constant (computer programming); Generalization; Object (grammar); Boundary (topology); Mathematics; Point (geometry); Function (biology); Fraction (chemistry); Combinatorics; Geometry; Mathematical analysis; Computer science; Artificial intelligence; Chemistry","score_opus":0.015173752263658311,"score_gpt":0.2597205595318366,"score_spread":0.2445468072681783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965013906","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.37780318,0.000035891764,0.6159558,0.0014955677,0.0010177925,0.00017138004,0.000007530751,0.00007025271,0.0034425727],"genre_scores_gemma":[0.9343073,9.127866e-7,0.06424757,0.0010398955,0.00020289887,0.00001118708,0.000016310863,0.000007271633,0.00016669306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986214,0.00006254441,0.0002680519,0.00030508803,0.0005678157,0.00017510298],"domain_scores_gemma":[0.9979811,0.0011469395,0.00013719285,0.00038000126,0.00028594822,0.00006886491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037306955,0.00013765096,0.00013645718,0.00032307667,0.00018237368,0.00009778426,0.00065407134,0.00006416443,0.00011351397],"category_scores_gemma":[0.00028218963,0.00010237925,0.0001051848,0.001111467,0.00008337168,0.00020994998,0.00015358496,0.00027069007,0.00013569646],"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.000018255856,0.00022026898,0.00035182023,0.000016921269,0.000039011542,0.000004985024,0.0005628544,0.10026512,0.013742571,0.84286624,0.0029889382,0.038922984],"study_design_scores_gemma":[0.00085872546,0.00038489953,0.054115165,0.00003435967,0.000015770132,0.00006929528,0.000039721082,0.7231887,0.03506403,0.17641059,0.009260857,0.00055786734],"about_ca_topic_score_codex":0.0000036833248,"about_ca_topic_score_gemma":0.0000022810689,"teacher_disagreement_score":0.6664557,"about_ca_system_score_codex":0.000015291851,"about_ca_system_score_gemma":0.000108197804,"threshold_uncertainty_score":0.41749045},"labels":[],"label_agreement":null},{"id":"W1965735113","doi":"10.1016/j.comgeo.2006.03.004","title":"Algorithms for optimal area triangulations of a convex polygon","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Regular polygon; Convex polygon; Rectilinear polygon; Polygon covering; Star-shaped polygon; Combinatorics; Computer science; Mathematics; Mathematical optimization; Algorithm; Geometry; Convex set; Convex optimization; Simple polygon","score_opus":0.026488356608938498,"score_gpt":0.2731884271811129,"score_spread":0.2467000705721744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965735113","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.05739261,0.00029240668,0.94046986,0.00050184905,0.00039524384,0.00032687184,0.000065058244,0.00009637363,0.00045974177],"genre_scores_gemma":[0.62379134,8.8045516e-7,0.37522015,0.00009408234,0.00019119334,0.000031933847,0.0003086138,0.000008112475,0.00035367062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842846,0.0000386199,0.0005053835,0.00037065192,0.00042953726,0.00022734732],"domain_scores_gemma":[0.998251,0.0006787683,0.00023043634,0.00021570468,0.0005571864,0.00006690063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032025686,0.00015733813,0.00023664915,0.0005591275,0.00017592958,0.00008652992,0.00036985913,0.00007436246,0.000032496977],"category_scores_gemma":[0.00008988988,0.00016860756,0.00016361263,0.0012466707,0.00005570159,0.00036322884,0.00008485765,0.000068345886,0.000013038735],"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.00001712952,0.00016366507,0.00025721674,0.000021281818,0.00002910786,0.0000012766969,0.00004791463,0.7793611,0.00048170122,0.20326161,0.0026542717,0.013703687],"study_design_scores_gemma":[0.0010682981,0.00012259776,0.018493809,0.000011833099,0.000013866483,0.000018602517,0.00001148998,0.9162228,0.0016200903,0.05937446,0.0028360486,0.00020608702],"about_ca_topic_score_codex":0.000016329543,"about_ca_topic_score_gemma":0.0000014205795,"teacher_disagreement_score":0.56639874,"about_ca_system_score_codex":0.00004495443,"about_ca_system_score_gemma":0.00018971307,"threshold_uncertainty_score":0.6875617},"labels":[],"label_agreement":null},{"id":"W1965954846","doi":"10.1016/j.comgeo.2013.11.005","title":"Reprint of: Approximating majority depth","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Set (abstract data type); Combinatorics; Mathematics; Point (geometry); Monte Carlo method; Algorithm; Discrete mathematics; Computer science; Statistics; Geometry; Graph","score_opus":0.01596087859365865,"score_gpt":0.2432439789978515,"score_spread":0.22728310040419283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965954846","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.19937727,0.00010013698,0.7970208,0.00038838247,0.0002423928,0.00019367844,0.0000018316738,0.00010473712,0.002570791],"genre_scores_gemma":[0.6413228,0.0000013836003,0.3583102,0.0001629299,0.000062493564,0.000019421303,0.00002154381,0.000004921148,0.00009432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828935,0.00006871195,0.0005274598,0.00038881815,0.00051507464,0.0002106011],"domain_scores_gemma":[0.9984514,0.0003627749,0.00024742624,0.000325055,0.00050881825,0.00010453239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041500715,0.00013917443,0.00019538621,0.00036374136,0.00012604876,0.00012742047,0.0005246506,0.000057258283,0.00011239223],"category_scores_gemma":[0.00020864207,0.0001416895,0.00009339156,0.0012430813,0.000046789348,0.00063319027,0.0002831506,0.00012848196,0.00022657966],"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.0000038871412,0.00025048343,0.00669713,0.000087162545,0.000061976985,0.0000033132603,0.00032240464,0.3792947,0.0014973483,0.3667345,0.0017947512,0.24325237],"study_design_scores_gemma":[0.0002792512,0.00004709203,0.13986197,0.000016992673,0.00000390567,0.000026745256,0.000025093954,0.7072342,0.0016073559,0.1503842,0.0003163643,0.00019678952],"about_ca_topic_score_codex":0.000030300986,"about_ca_topic_score_gemma":7.227153e-7,"teacher_disagreement_score":0.44194552,"about_ca_system_score_codex":0.000040003208,"about_ca_system_score_gemma":0.000108528155,"threshold_uncertainty_score":0.577793},"labels":[],"label_agreement":null},{"id":"W1966285206","doi":"10.1016/j.comgeo.2004.12.005","title":"The Erdős–Nagy theorem and its ramifications","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical economics; Law and economics; Mathematics; Economics","score_opus":0.011067270117584294,"score_gpt":0.2451078317531823,"score_spread":0.234040561635598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966285206","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.12632264,0.0046383543,0.85137254,0.013581253,0.00033304404,0.00019202022,0.000008866375,0.00030561502,0.0032456901],"genre_scores_gemma":[0.9793065,0.00004296806,0.019210448,0.00080239325,0.0001286705,0.000010417105,0.0000068888307,0.00000625951,0.000485454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991344,0.000053770418,0.00017143242,0.00023407971,0.00022526782,0.00018104477],"domain_scores_gemma":[0.9986919,0.0008344328,0.00006417173,0.00024543307,0.00009530437,0.000068761816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040014795,0.00009012609,0.00007336829,0.000092180395,0.00043899266,0.00024038268,0.00057583314,0.000031328025,0.000017950526],"category_scores_gemma":[0.00008562131,0.00006555172,0.000034227745,0.00043781145,0.00007187997,0.00030757632,0.00019374347,0.000093607225,0.0001800196],"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.000001158105,0.000019495423,0.000042394506,0.0000020304778,0.000009894972,6.133896e-7,0.00011467886,0.0041903043,0.00004289766,0.8834665,0.0008819198,0.111228116],"study_design_scores_gemma":[0.00017910378,0.000015087273,0.01646139,0.000006106538,0.000003302635,0.000037091908,0.00003859487,0.76926017,0.00013373856,0.18781519,0.02591997,0.00013028437],"about_ca_topic_score_codex":6.6405306e-7,"about_ca_topic_score_gemma":5.941742e-7,"teacher_disagreement_score":0.85298383,"about_ca_system_score_codex":0.000021357419,"about_ca_system_score_gemma":0.000040381536,"threshold_uncertainty_score":0.3376421},"labels":[],"label_agreement":null},{"id":"W1968440069","doi":"10.1016/j.comgeo.2015.02.003","title":"Fast algorithms for approximate Fréchet matching queries in geometric trees","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Path (computing); Combinatorics; Matching (statistics); Mathematics; Tree (set theory); Data structure; Algorithm; Line segment; Line (geometry); Computer science; Geometry","score_opus":0.046766080692973964,"score_gpt":0.29378868331542923,"score_spread":0.24702260262245526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968440069","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.06724786,0.000554639,0.92977345,0.0006639265,0.00075045467,0.00037908368,0.000029648658,0.0001746483,0.0004262662],"genre_scores_gemma":[0.5710654,0.0000050174863,0.4277681,0.00033049993,0.00023316777,0.00009040868,0.00021469813,0.000017918574,0.0002747617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976245,0.000085598884,0.0005460653,0.0006197957,0.00069363165,0.00043041172],"domain_scores_gemma":[0.998211,0.000646665,0.00018169479,0.0002732342,0.0004730544,0.00021435042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010195208,0.0002552098,0.00031576867,0.0016902324,0.00016448817,0.0003119145,0.0006397461,0.00010370564,0.000009729718],"category_scores_gemma":[0.00031376627,0.00026968887,0.000112527625,0.0036481577,0.000050563383,0.0009629404,0.00024371935,0.00017042489,0.000046284844],"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.000025618781,0.00018508348,0.0010608729,0.000033939978,0.000027082351,0.000009312955,0.00067556265,0.86746424,0.00003257359,0.05760747,0.0015474394,0.0713308],"study_design_scores_gemma":[0.0016023401,0.00017350742,0.01550892,0.000026064294,0.0000070333513,0.00004662197,0.0002058929,0.8087975,0.00023577776,0.17019033,0.0027728206,0.00043321427],"about_ca_topic_score_codex":0.00003113901,"about_ca_topic_score_gemma":0.000012486178,"teacher_disagreement_score":0.50381756,"about_ca_system_score_codex":0.00017687035,"about_ca_system_score_gemma":0.0003125564,"threshold_uncertainty_score":0.9999755},"labels":[],"label_agreement":null},{"id":"W1968580189","doi":"10.1016/j.comgeo.2009.07.003","title":"Improved algorithms to network p -center location problems","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Center (category theory); Computer science; Algorithm; Chemistry","score_opus":0.01901714682374311,"score_gpt":0.2252630909014266,"score_spread":0.20624594407768349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968580189","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.13159879,0.00012490097,0.83450073,0.013067503,0.0028641736,0.0025065283,0.000007143935,0.00056754804,0.01476266],"genre_scores_gemma":[0.9801307,0.0000016693309,0.0068586916,0.009858434,0.0011441114,0.00019309545,0.00037439293,0.000021918358,0.0014170309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987736,0.000007055363,0.00032339167,0.00031239784,0.00028977287,0.00029380858],"domain_scores_gemma":[0.9991697,0.00001611736,0.000060867682,0.00017860741,0.00054489245,0.000029815861],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023433202,0.0001507036,0.00012234344,0.00029299033,0.0001675579,0.00027120105,0.0002192497,0.000038705064,0.001462081],"category_scores_gemma":[0.00006619789,0.00015092122,0.000048655667,0.0014045861,0.0000213961,0.00073625805,0.00017877587,0.00007389064,0.0067992546],"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.000005968574,0.00015808904,0.0061438084,0.00016516719,0.000038887043,2.9637198e-7,0.000030539435,0.8516229,0.000021381962,0.009467933,0.09708302,0.03526204],"study_design_scores_gemma":[0.00039531544,0.000012735434,0.105029725,0.000030251056,0.000011549755,4.5996512e-7,0.000052456384,0.7774945,9.565957e-7,0.00857609,0.10811682,0.0002791546],"about_ca_topic_score_codex":0.0005951011,"about_ca_topic_score_gemma":0.000033971108,"teacher_disagreement_score":0.84853184,"about_ca_system_score_codex":0.000042233147,"about_ca_system_score_gemma":0.000014459199,"threshold_uncertainty_score":0.99945074},"labels":[],"label_agreement":null},{"id":"W1969149193","doi":"10.1016/j.comgeo.2014.09.001","title":"Guest editorial: Special issue on the 25th Canadian Conference on Computational Geometry (CCCG)","year":2014,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"3D Modeling in Geospatial Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Geometry; Computer science; Mathematics","score_opus":0.012673999205275304,"score_gpt":0.24178915166898413,"score_spread":0.2291151524637088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969149193","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014601118,0.00004579491,0.012860689,0.0007149008,0.96895516,0.00066154153,0.0023440586,0.0003777712,0.013894047],"genre_scores_gemma":[0.0065892297,0.000023746998,0.0017183375,0.00036553555,0.9828911,0.00016751833,0.00759835,0.00020329602,0.00044290043],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948532,0.0001192633,0.00084218435,0.00087344006,0.0025373388,0.0007745455],"domain_scores_gemma":[0.993503,0.0037895176,0.00025280632,0.00073277316,0.0012421639,0.0004797898],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006796214,0.00081712264,0.0006801375,0.0011186352,0.0005784597,0.0003972197,0.0012666675,0.0012185863,0.00084096653],"category_scores_gemma":[0.0010400523,0.00078246626,0.00022654586,0.0010146736,0.00020554656,0.00009916845,0.0001040824,0.002365147,0.004245933],"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.000008249136,0.000029700763,0.0000025820975,0.000037283495,0.00007516017,0.000002068318,0.00003176895,0.4568985,2.8624856e-7,0.0036566753,0.53891176,0.00034593957],"study_design_scores_gemma":[0.00035299227,0.00009618848,0.000094271345,0.00014405935,0.000043429154,0.0000014683549,0.000012253022,0.1650091,0.000002711534,0.0075024404,0.826078,0.0006630995],"about_ca_topic_score_codex":0.0023050907,"about_ca_topic_score_gemma":0.0019205079,"teacher_disagreement_score":0.29188943,"about_ca_system_score_codex":0.000943364,"about_ca_system_score_gemma":0.0011665677,"threshold_uncertainty_score":0.99993646},"labels":[],"label_agreement":null},{"id":"W1973989497","doi":"10.1016/j.comgeo.2012.10.005","title":"Families of polytopal digraphs that do not satisfy the shelling property","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Property (philosophy); Mathematics; Combinatorics; Philosophy","score_opus":0.017847801814345886,"score_gpt":0.20855456157778607,"score_spread":0.19070675976344018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973989497","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.97987086,0.0022442346,0.013493784,0.000029504956,0.0006519374,0.00013618132,0.000022012524,0.000097738164,0.0034537707],"genre_scores_gemma":[0.9992368,0.000021206813,0.00046285207,0.000043788365,0.00013406653,0.0000102720805,0.000010809633,0.000016506217,0.00006367854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9992398,0.00004068573,0.00019369066,0.00008123666,0.00024694117,0.00019764458],"domain_scores_gemma":[0.9994959,0.00024206565,0.00004103613,0.00013517252,0.000036148296,0.000049638315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030224113,0.000114385046,0.00014032835,0.0001540248,0.000082990875,0.000023772094,0.0001537592,0.000046740206,0.000046488116],"category_scores_gemma":[0.00001618939,0.00006882488,0.00007127961,0.00037134497,0.000078893034,0.00013742896,0.000024088955,0.000113518814,0.000035258876],"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.000032624135,0.00010635185,0.30542442,0.00046418316,0.00036490685,0.0000019000003,0.004884464,0.56721723,0.0033614282,0.084174216,0.0014668858,0.03250141],"study_design_scores_gemma":[0.000787501,0.00007253965,0.9037691,0.00022534649,0.00008324221,0.00007516283,0.003247374,0.055230357,0.01050282,0.01431514,0.010879997,0.0008114187],"about_ca_topic_score_codex":0.000009524156,"about_ca_topic_score_gemma":5.7267664e-7,"teacher_disagreement_score":0.5983447,"about_ca_system_score_codex":0.000011316574,"about_ca_system_score_gemma":0.0000075256758,"threshold_uncertainty_score":0.2806597},"labels":[],"label_agreement":null},{"id":"W1974889018","doi":"10.1016/j.comgeo.2013.06.005","title":"Approximating majority depth","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Geology; History; Computer science; Geography","score_opus":0.01508989316017984,"score_gpt":0.23910777834078173,"score_spread":0.2240178851806019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974889018","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.07720525,0.0001563157,0.91558874,0.00094714755,0.00042297904,0.00024331461,0.0000019800839,0.0002712848,0.005163016],"genre_scores_gemma":[0.6440303,0.0000013809354,0.35476917,0.0006689362,0.00014769602,0.00003786847,0.00004431642,0.000007412436,0.00029296687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982277,0.000070856964,0.00039882844,0.00044555176,0.0005558711,0.0003011939],"domain_scores_gemma":[0.99867594,0.0003424968,0.00014375063,0.0002852281,0.00039660474,0.00015599957],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031517918,0.00017340129,0.00017019881,0.00037967024,0.0002626219,0.00039289985,0.0005879441,0.00006596188,0.00018177628],"category_scores_gemma":[0.0001437979,0.0001761513,0.00008649197,0.0014028858,0.00003749921,0.0010945884,0.00024926767,0.0001621606,0.001067396],"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.0000027729648,0.00022970361,0.0038266112,0.000049743874,0.000061353996,0.0000074452378,0.00026369674,0.27207884,0.0004784959,0.36761242,0.0112202,0.34416872],"study_design_scores_gemma":[0.00029327886,0.000038790335,0.07434904,0.000009371601,0.0000033473034,0.00004147252,0.000018619796,0.77173257,0.00023439356,0.15159425,0.0014316189,0.0002532544],"about_ca_topic_score_codex":0.000021564489,"about_ca_topic_score_gemma":9.952568e-7,"teacher_disagreement_score":0.56682503,"about_ca_system_score_codex":0.000058559006,"about_ca_system_score_gemma":0.000106177606,"threshold_uncertainty_score":0.9997104},"labels":[],"label_agreement":null},{"id":"W1976756638","doi":"10.1016/j.comgeo.2006.05.005","title":"On the stabbing number of a random Delaunay triangulation","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Delaunay triangulation; Constrained Delaunay triangulation; Bowyer–Watson algorithm; Point set triangulation; Computer science; Triangulation; Combinatorics; Mathematics; Geometry","score_opus":0.01239512327578408,"score_gpt":0.24906029571117505,"score_spread":0.23666517243539098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976756638","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.26907086,0.00006389506,0.72713435,0.0008152403,0.00023963225,0.0001655845,0.0000058472833,0.000054742424,0.002449848],"genre_scores_gemma":[0.968529,0.0000011617608,0.030606639,0.0003314542,0.00015043838,0.00001547873,0.00006681023,0.000007835392,0.00029117177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983569,0.00013831987,0.0004173127,0.00028018717,0.0006369508,0.00017032697],"domain_scores_gemma":[0.9973557,0.0018458918,0.00021824917,0.0002484722,0.00029488205,0.000036813864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006130221,0.00013696308,0.00016628101,0.000249226,0.00020608121,0.0001003213,0.00038178885,0.00005050443,0.000119792974],"category_scores_gemma":[0.00017719615,0.00010673167,0.00011698309,0.0013620541,0.000047944337,0.00025911603,0.00007980049,0.00011076992,0.00009695394],"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.000022475835,0.000073743264,0.00034558726,0.000005276218,0.000014210292,0.0000012572185,0.000037360816,0.43413886,0.0001301247,0.5584856,0.001783768,0.0049616997],"study_design_scores_gemma":[0.001224959,0.000042879514,0.023291064,0.000021222082,0.000008509338,0.000020000407,0.000009823004,0.501005,0.0011021763,0.47239888,0.00070671155,0.00016879721],"about_ca_topic_score_codex":0.000017501035,"about_ca_topic_score_gemma":0.0000013391482,"teacher_disagreement_score":0.6994581,"about_ca_system_score_codex":0.00004341208,"about_ca_system_score_gemma":0.00009678071,"threshold_uncertainty_score":0.43523914},"labels":[],"label_agreement":null},{"id":"W1977007991","doi":"10.1016/s0925-7721(01)00030-x","title":"Editorial","year":2001,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science","score_opus":0.008356688911675096,"score_gpt":0.26065084619139417,"score_spread":0.2522941572797191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977007991","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000044152016,0.0003539297,0.4307326,0.00013002851,0.56700814,0.00013730522,0.000059557944,0.0002633477,0.0013106974],"genre_scores_gemma":[0.000110523455,0.00008040146,0.038658775,0.0001422299,0.95550174,0.00004228577,0.0025513049,0.000047438294,0.002865302],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99409133,0.00015144596,0.0007315902,0.001181466,0.0033001697,0.00054396753],"domain_scores_gemma":[0.99437827,0.0024680197,0.00043647914,0.00070596626,0.0017500415,0.0002612536],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007640396,0.0005501835,0.00054503995,0.0010756694,0.0003469501,0.00070949376,0.0019011885,0.0010608318,0.00011313456],"category_scores_gemma":[0.0011907002,0.0006040955,0.00028841814,0.0023062127,0.00006915636,0.0007477274,0.00061894616,0.0011554626,0.0008695765],"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.000010652528,0.000094327916,0.0000027906324,0.000034956644,0.00006714059,0.000014215761,0.00002646595,0.044133447,0.0000020037653,0.005235187,0.94134307,0.009035752],"study_design_scores_gemma":[0.00057731854,0.00009941193,0.000026356862,0.00003974134,0.000020837846,0.000009707136,0.000002113462,0.028735448,0.0000037017937,0.029000754,0.9408863,0.0005983132],"about_ca_topic_score_codex":0.000016650609,"about_ca_topic_score_gemma":0.000002224076,"teacher_disagreement_score":0.3920738,"about_ca_system_score_codex":0.0002697232,"about_ca_system_score_gemma":0.0014644285,"threshold_uncertainty_score":0.9999084},"labels":[],"label_agreement":null},{"id":"W1977842117","doi":"10.1016/j.comgeo.2014.09.007","title":"A fractional Helly theorem for boxes","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Mathematics and Applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Magyar Tudományos Akadémia; Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Statement (logic); Mathematics; Point (geometry); Simple (philosophy); Real number; Discrete mathematics; Geometry; Philosophy","score_opus":0.04263429997949208,"score_gpt":0.33764381381362046,"score_spread":0.2950095138341284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977842117","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.021221254,0.000015001711,0.97061306,0.0006672392,0.0000804657,0.00026322904,0.000037910842,0.00007960653,0.0070222407],"genre_scores_gemma":[0.625748,7.3563217e-7,0.3723269,0.00029389726,0.00027199698,0.0001193337,0.00006739253,0.000022400816,0.00114937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992091,0.000018341354,0.00023807536,0.00017099312,0.00022634082,0.0001371346],"domain_scores_gemma":[0.99690723,0.0025788853,0.000120605764,0.00015688177,0.00017984696,0.000056547837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038555602,0.00009892062,0.00014413871,0.00010458554,0.00016474149,0.000040582177,0.0001365688,0.000046590347,0.00021353707],"category_scores_gemma":[0.0005356938,0.00009066952,0.00009237865,0.00017895081,0.00003819224,0.000046205554,0.000028908707,0.000063889616,0.000084985826],"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.0000049404634,0.000118878605,0.00004697719,0.00006902873,0.000024019584,5.541398e-8,0.00004253424,0.0011703295,0.000030447203,0.9600209,0.03662447,0.0018473981],"study_design_scores_gemma":[0.00025805866,0.000024230394,0.00030743354,0.000012361261,0.000014805277,0.000005697965,0.000022057126,0.079330124,0.00005282966,0.88392776,0.035941944,0.0001026688],"about_ca_topic_score_codex":6.3928076e-7,"about_ca_topic_score_gemma":4.9147695e-7,"teacher_disagreement_score":0.6045267,"about_ca_system_score_codex":0.000018193206,"about_ca_system_score_gemma":0.000030414563,"threshold_uncertainty_score":0.36973956},"labels":[],"label_agreement":null},{"id":"W1978331593","doi":"10.1016/j.comgeo.2014.04.001","title":"Computing a visibility polygon using few variables","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ministerio de Ciencia e Innovación; Fundação para a Ciência e a Tecnologia; Ministerio de Economía y Competitividad; Generalitat de Catalunya; European Commission","keywords":"Simple polygon; Polygon (computer graphics); Visibility; Combinatorics; Constant (computer programming); Point in polygon; Mathematics; Randomized algorithm; Variable (mathematics); Computer science; Algorithm; Discrete mathematics; Monotone polygon; Physics; Mathematical analysis; Geometry","score_opus":0.020645412515549497,"score_gpt":0.27438129249126686,"score_spread":0.25373587997571734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978331593","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.2037006,0.00012431321,0.7939386,0.00024356712,0.00063343573,0.00013320081,0.0000033584809,0.00022730444,0.0009956566],"genre_scores_gemma":[0.6690116,8.328426e-7,0.3299806,0.00060729746,0.00029288113,0.000001948611,0.0000380868,0.000010617313,0.000056138768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747646,0.0002325553,0.0005169124,0.0007098612,0.000670171,0.0003940622],"domain_scores_gemma":[0.9979299,0.00084487826,0.00021999511,0.00043422496,0.00038838002,0.0001826276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011513529,0.00024597015,0.00027918082,0.0005295993,0.00046251903,0.000335281,0.0006789076,0.000098134966,0.0000463631],"category_scores_gemma":[0.0003102477,0.00026339845,0.00012439085,0.0019129624,0.00006097255,0.0006262225,0.00037707272,0.00019498025,0.00009817012],"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.000005679172,0.000106471765,0.0012445825,0.000028224014,0.000027299364,0.0000022477602,0.00010209971,0.797415,0.00048149537,0.15673943,0.00026721775,0.04358025],"study_design_scores_gemma":[0.0003965,0.000058173464,0.017411739,0.000023819684,0.000008830397,0.00004583437,0.000008024194,0.9177469,0.00026425198,0.062373012,0.0013794551,0.00028347637],"about_ca_topic_score_codex":0.000026530453,"about_ca_topic_score_gemma":0.0000010241247,"teacher_disagreement_score":0.465311,"about_ca_system_score_codex":0.000118642965,"about_ca_system_score_gemma":0.00020500908,"threshold_uncertainty_score":0.9999818},"labels":[],"label_agreement":null},{"id":"W1982408165","doi":"10.1016/s0925-7721(01)00037-2","title":"Reconfiguring convex polygons","year":2001,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Polygon (computer graphics); Monotone polygon; Rectilinear polygon; Regular polygon; Combinatorics; Star-shaped polygon; Mathematics; Polygon covering; Vertex (graph theory); Point in polygon; Bounded function; Convex polygon; Motion (physics); Simple polygon; Convex set; Geometry; Computer science; Mathematical analysis; Computer vision; Convex optimization; Graph","score_opus":0.057008716175654804,"score_gpt":0.3203182687844139,"score_spread":0.2633095526087591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982408165","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.8577274,0.00026524064,0.10896629,0.0011804065,0.00046833768,0.00012917072,0.000008890124,0.0001981528,0.031056127],"genre_scores_gemma":[0.980046,0.000009117859,0.015141337,0.00041298644,0.00020039197,0.0000068955496,0.00001893363,0.000018473847,0.004145894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894994,0.00003549613,0.00028032495,0.00022637678,0.0002337829,0.00027409493],"domain_scores_gemma":[0.99853814,0.0010022214,0.00009877229,0.00016030855,0.000097777614,0.00010275769],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022103594,0.00012625803,0.00021232257,0.0004681273,0.000121350175,0.000025342715,0.00017281811,0.00008164373,0.0024525982],"category_scores_gemma":[0.0005141012,0.00012574442,0.00008075462,0.0009301315,0.00007554164,0.00007351587,0.00005542192,0.00015216481,0.00045253412],"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.00003727543,0.0004029614,0.032949667,0.00007570569,0.00020792155,0.00012201471,0.00031945028,0.0018302153,0.000054356973,0.8929548,0.02685755,0.044188038],"study_design_scores_gemma":[0.00072053936,0.0000639646,0.040861618,0.000018077424,0.000024901196,0.0003298575,0.00020340118,0.0019018662,0.00006171277,0.938389,0.017134331,0.0002907463],"about_ca_topic_score_codex":0.0000086535765,"about_ca_topic_score_gemma":0.0000013074281,"teacher_disagreement_score":0.12231859,"about_ca_system_score_codex":0.00003460153,"about_ca_system_score_gemma":0.00004881709,"threshold_uncertainty_score":0.9984593},"labels":[],"label_agreement":null},{"id":"W1983682886","doi":"10.1016/j.comgeo.2008.06.005","title":"A vertex-face assignment for plane graphs","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Vertex (graph theory); Combinatorics; Planar graph; Mathematics; Computer science; Graph","score_opus":0.02779556220493067,"score_gpt":0.25260025763125526,"score_spread":0.22480469542632459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983682886","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.056231745,0.0003065966,0.94095194,0.0007506315,0.0007355781,0.00032509962,0.000025457894,0.00017781695,0.0004951286],"genre_scores_gemma":[0.82588696,0.0000123115915,0.17230752,0.0008091565,0.00010313605,0.00006220943,0.00021020198,0.000011570515,0.0005969132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982479,0.00004522349,0.00033335743,0.0004927025,0.0005778518,0.00030293703],"domain_scores_gemma":[0.99857295,0.0006457788,0.000120041965,0.0002530251,0.00025896405,0.00014927228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002585922,0.00018791066,0.00019512343,0.00043675723,0.00043567078,0.000082498096,0.0005084361,0.00007098548,0.000031236596],"category_scores_gemma":[0.00010011013,0.00019645454,0.00013393462,0.0010352072,0.00005558206,0.00040680304,0.000121425284,0.00010244461,0.000108177024],"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.000040507402,0.00032816784,0.0009549864,0.000037977912,0.00010335751,0.000027868255,0.00044033496,0.61948204,0.00032604282,0.31666034,0.032144133,0.029454257],"study_design_scores_gemma":[0.001940751,0.00037905818,0.03516422,0.000021217516,0.0000149793605,0.00033663175,0.000024844128,0.78042126,0.0010535168,0.15743198,0.022591218,0.0006202994],"about_ca_topic_score_codex":0.0000029222144,"about_ca_topic_score_gemma":4.7804326e-7,"teacher_disagreement_score":0.7696552,"about_ca_system_score_codex":0.00006910687,"about_ca_system_score_gemma":0.00020457864,"threshold_uncertainty_score":0.8011184},"labels":[],"label_agreement":null},{"id":"W1983952331","doi":"10.1016/s0925-7721(02)00113-x","title":"The visibility graph of congruent discs is Hamiltonian","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Visibility graph; Disjoint sets; Constructive; Hamiltonian (control theory); Hamiltonian path; Graph; Combinatorics; Visibility; Mathematics; Computer science; Discrete mathematics; Physics; Geometry; Optics; Mathematical optimization","score_opus":0.012161830883547059,"score_gpt":0.25341629767480617,"score_spread":0.24125446679125911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983952331","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.11513085,0.0007695409,0.880047,0.001022134,0.00074530975,0.00020787865,0.000013913595,0.000058457957,0.0020048923],"genre_scores_gemma":[0.9598727,0.00001869062,0.039277617,0.00046341438,0.000038293343,0.000011558784,0.00001684697,0.000006905056,0.00029394045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980519,0.00016325658,0.00047612903,0.00039697936,0.0006605576,0.00025117426],"domain_scores_gemma":[0.99794656,0.0008169261,0.00020168602,0.00045715604,0.00047173921,0.000105911946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084266684,0.0001564202,0.0001717872,0.00022425423,0.0004038142,0.00015239335,0.00058843335,0.000053330303,0.000039291288],"category_scores_gemma":[0.00025345085,0.00012302701,0.00014378953,0.0015922558,0.00014396342,0.0002928132,0.0001136494,0.00012778168,0.0000385026],"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.000010204826,0.00018990612,0.0037200307,0.000024351897,0.00007825488,0.000002497573,0.00031384942,0.08742519,0.00016313684,0.87469894,0.00315136,0.030222308],"study_design_scores_gemma":[0.0010321039,0.0002035206,0.14181417,0.000025827914,0.000020210353,0.000053168667,0.00009708683,0.14249508,0.0050399755,0.66776645,0.04094123,0.00051115337],"about_ca_topic_score_codex":0.0000075069415,"about_ca_topic_score_gemma":0.0000039034517,"teacher_disagreement_score":0.8447419,"about_ca_system_score_codex":0.000045717556,"about_ca_system_score_gemma":0.0002641112,"threshold_uncertainty_score":0.5016896},"labels":[],"label_agreement":null},{"id":"W1986633486","doi":"10.1016/j.comgeo.2007.05.009","title":"Edge-unfolding nested polyhedral bands","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"","keywords":"Polyhedron; Intersection (aeronautics); Regular polygon; Enhanced Data Rates for GSM Evolution; Combinatorics; Geometry; Mathematics; Plane (geometry); Projection (relational algebra); Convex polytope; Space (punctuation); Surface (topology); Convex set; Computer science; Algorithm; Geography; Computer vision","score_opus":0.014532883271346124,"score_gpt":0.2663244123923025,"score_spread":0.25179152912095637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986633486","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.15707828,0.0003209244,0.83784324,0.0004773354,0.0010703367,0.00012573048,0.0000032144305,0.00027483093,0.0028060814],"genre_scores_gemma":[0.8694542,0.0000022429608,0.1284836,0.00092077797,0.00046399428,0.000004802206,0.0000848937,0.000013345016,0.0005721353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977637,0.000048753824,0.0004891578,0.0005165149,0.0007201429,0.00046173966],"domain_scores_gemma":[0.99832445,0.0006303647,0.00015508191,0.00030153454,0.00035692743,0.00023166311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009535814,0.00021891097,0.00019892518,0.00089008035,0.00033598716,0.00024290195,0.00063888775,0.000102152575,0.00008228973],"category_scores_gemma":[0.00014023548,0.00023357029,0.00012233232,0.002582342,0.000051227147,0.0007551904,0.00023154005,0.00019267137,0.00020887733],"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.0000428858,0.00029764397,0.006101055,0.00003829888,0.000093432085,0.00009237259,0.00048480005,0.2703624,0.0020889642,0.4928458,0.0057078847,0.22184446],"study_design_scores_gemma":[0.0017910186,0.00024751044,0.30583823,0.00004787202,0.000022060953,0.00036822757,0.000076503726,0.5942776,0.004704018,0.07237317,0.019182963,0.0010707773],"about_ca_topic_score_codex":0.0000064784617,"about_ca_topic_score_gemma":0.0000023933853,"teacher_disagreement_score":0.71237594,"about_ca_system_score_codex":0.00010540047,"about_ca_system_score_gemma":0.00016572814,"threshold_uncertainty_score":0.952472},"labels":[],"label_agreement":null},{"id":"W1987886060","doi":"10.1016/j.comgeo.2006.09.002","title":"Drawings of planar graphs with few slopes and segments","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Planar graph; Outerplanar graph; Planar; Plane (geometry); 1-planar graph; Graph; Graph drawing","score_opus":0.0054767086491053244,"score_gpt":0.2015230887419834,"score_spread":0.1960463800928781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987886060","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.3248312,0.00030024248,0.67369694,0.00022799244,0.00008046398,0.00009880437,0.000007627169,0.000051150815,0.0007055946],"genre_scores_gemma":[0.79112554,0.0000039365623,0.20845963,0.00015100391,0.00004233559,0.0000055106807,0.00006416604,0.000006215702,0.000141674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987515,0.000033484503,0.00026831322,0.00032356853,0.00045994594,0.00016316275],"domain_scores_gemma":[0.99923474,0.00020506323,0.00014361179,0.00014172091,0.00021380352,0.00006105784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017235147,0.00013797596,0.0001661867,0.00044478217,0.00013469644,0.00009242797,0.00023284114,0.000040272007,0.000009240033],"category_scores_gemma":[0.000013396432,0.00012534202,0.000036629695,0.0011057827,0.00007830473,0.00038319055,0.000071037146,0.00007021612,0.000007796825],"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.00004097704,0.00027873428,0.028178243,0.00009910445,0.000096254036,0.000022280048,0.00020646582,0.24318472,0.00087190355,0.6895898,0.00243951,0.03499204],"study_design_scores_gemma":[0.002074724,0.0004527364,0.5838327,0.000095232026,0.000032966316,0.00019835522,0.000038395563,0.10202166,0.0022175177,0.30506778,0.0033244344,0.0006435534],"about_ca_topic_score_codex":0.00003150385,"about_ca_topic_score_gemma":0.0000038788003,"teacher_disagreement_score":0.5556544,"about_ca_system_score_codex":0.000017585227,"about_ca_system_score_gemma":0.00007888544,"threshold_uncertainty_score":0.5111299},"labels":[],"label_agreement":null},{"id":"W1991522034","doi":"10.1016/j.comgeo.2013.01.001","title":"Approximate proximity drawings","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Combinatorics; Graph drawing; Mathematics; Generalization; Multiplicative function; Planar graph; Delaunay triangulation; Graph","score_opus":0.012304752746413565,"score_gpt":0.23016845296723318,"score_spread":0.2178637002208196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991522034","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.08432342,0.00013219101,0.90997064,0.0016727571,0.00042423746,0.00034737555,0.0000027532253,0.00033184834,0.0027947917],"genre_scores_gemma":[0.7598114,0.000002312404,0.23823231,0.0010795636,0.00014858582,0.000069693386,0.000055101867,0.000010615478,0.00059038686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998139,0.00006432983,0.00035743375,0.00051148405,0.000592343,0.00033538483],"domain_scores_gemma":[0.9986631,0.00024567283,0.00013034667,0.00032474846,0.0004603484,0.00017576727],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002820648,0.00019604506,0.00017926324,0.0004300229,0.0002682403,0.00046184353,0.0006638292,0.000073266376,0.00023082655],"category_scores_gemma":[0.0001025302,0.00019436817,0.00009725178,0.001475549,0.00005315851,0.0017740414,0.00027525963,0.0001619598,0.0010510483],"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.0000057764837,0.0003618533,0.001984255,0.000067324196,0.00007941868,0.0000106997295,0.0003798062,0.21701175,0.00093898835,0.5729606,0.019362563,0.18683696],"study_design_scores_gemma":[0.00036636714,0.00005254313,0.037520155,0.000010468769,0.000004060161,0.00004659278,0.000012478857,0.71266794,0.00042649027,0.24588336,0.00270058,0.00030897514],"about_ca_topic_score_codex":0.000015788775,"about_ca_topic_score_gemma":3.3337832e-7,"teacher_disagreement_score":0.675488,"about_ca_system_score_codex":0.0000608414,"about_ca_system_score_gemma":0.00012701342,"threshold_uncertainty_score":0.9997268},"labels":[],"label_agreement":null},{"id":"W1991758355","doi":"10.1016/j.comgeo.2011.04.001","title":"Efficient view point selection for silhouettes of convex polyhedra","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Silhouette; Polyhedron; Regular polygon; Combinatorics; Point (geometry); Set (abstract data type); Convex polytope; Computer science; Mathematics; Artificial intelligence; Computer vision; Algorithm; Convex set; Convex optimization; Geometry","score_opus":0.02936026092224879,"score_gpt":0.2542745731987156,"score_spread":0.2249143122764668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991758355","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.0979868,0.00031592156,0.9000322,0.00018976789,0.0004439588,0.00032347502,0.00001282865,0.000105297586,0.00058974186],"genre_scores_gemma":[0.74687546,0.0000022074787,0.25263023,0.00026905385,0.0000849021,0.000029774763,0.00003272932,0.000009144507,0.00006649359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984488,0.00005714445,0.0004646199,0.00039874457,0.00039471037,0.0002359919],"domain_scores_gemma":[0.9984523,0.00040330813,0.00023811003,0.00018319028,0.0006286122,0.0000944991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004525872,0.00016505056,0.00023702858,0.000506282,0.00015475358,0.000041510786,0.0003859892,0.0000676058,0.00007818572],"category_scores_gemma":[0.00012563376,0.00016913554,0.00014408212,0.0012764989,0.000055630582,0.00017805511,0.00010348186,0.00008171678,0.000031671098],"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.00006139811,0.0005806249,0.001431435,0.00015508111,0.00011655814,0.0000015006112,0.00093056663,0.47860694,0.0014910931,0.46216753,0.0013822322,0.053075038],"study_design_scores_gemma":[0.0006459469,0.00028637116,0.020930788,0.000028451197,0.000018393479,0.000029988252,0.000024743378,0.9236867,0.007243678,0.04616787,0.0006828038,0.00025426524],"about_ca_topic_score_codex":0.000011875379,"about_ca_topic_score_gemma":0.0000010168051,"teacher_disagreement_score":0.64888865,"about_ca_system_score_codex":0.000047837326,"about_ca_system_score_gemma":0.00016390809,"threshold_uncertainty_score":0.6897147},"labels":[],"label_agreement":null},{"id":"W1992151444","doi":"10.1016/j.comgeo.2013.07.002","title":"Minimum-area enclosing triangle with a fixed angle","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Regular polygon; Mathematics; Plane (geometry); Computation; Tree (set theory); Set (abstract data type); Algebraic number; Geometry; Computer science; Mathematical analysis; Algorithm","score_opus":0.016229417830585194,"score_gpt":0.2245372966945672,"score_spread":0.208307878863982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992151444","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.23664224,0.00020594723,0.7593552,0.0008389116,0.00025043197,0.0003081296,0.0000044494273,0.00019754191,0.0021971478],"genre_scores_gemma":[0.81074184,0.000002035314,0.18736853,0.0007953126,0.00014478863,0.000058756606,0.00008723509,0.000014074871,0.0007874538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804026,0.000078749006,0.00035789964,0.00052941893,0.0006487451,0.00034490967],"domain_scores_gemma":[0.9983164,0.00050701195,0.00016037504,0.0003205248,0.0005067857,0.0001889116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020093007,0.00022661034,0.00024020932,0.0005455514,0.0002723957,0.0004355025,0.00053418305,0.00007268916,0.0003324886],"category_scores_gemma":[0.00009330924,0.00020118356,0.000091376445,0.0019246041,0.00005925395,0.0010947098,0.0001583764,0.00014570936,0.00043080695],"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.00006419698,0.0008669853,0.005410859,0.000085272506,0.00027496967,0.00006453123,0.00089293387,0.6514896,0.0037149522,0.07847916,0.053217366,0.20543918],"study_design_scores_gemma":[0.0020214112,0.00043117828,0.05319028,0.000060843897,0.000019637147,0.0001927602,0.00008509809,0.8985241,0.0010202534,0.039334178,0.004397674,0.00072257186],"about_ca_topic_score_codex":0.000016467251,"about_ca_topic_score_gemma":0.0000016915919,"teacher_disagreement_score":0.57409954,"about_ca_system_score_codex":0.000073802825,"about_ca_system_score_gemma":0.00020921623,"threshold_uncertainty_score":0.82040274},"labels":[],"label_agreement":null},{"id":"W1993585122","doi":"10.1016/j.comgeo.2010.09.009","title":"Almost all Delaunay triangulations have stretch factor greater than <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>π</mml:mi><mml:mo stretchy=\"false\">/</mml:mo><mml:mn>2</mml:mn></mml:math>","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Mathematics; Delaunay triangulation; Combinatorics; Euclidean geometry; General position; Position (finance); Regular polygon; Geometry","score_opus":0.022762528276962974,"score_gpt":0.25401791077051894,"score_spread":0.23125538249355596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993585122","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.93840104,0.00019389017,0.05689917,0.00068817084,0.0019228328,0.00009846698,0.00034554055,0.00025372085,0.0011971922],"genre_scores_gemma":[0.9717915,0.000032485248,0.02390409,0.0010283763,0.0011761958,0.00017702398,0.0015939109,0.00012669485,0.0001697448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496186,0.00017425675,0.0010341762,0.0012149017,0.0016888665,0.0009259699],"domain_scores_gemma":[0.996301,0.0011215887,0.0007705338,0.00090594596,0.00036695393,0.00053399795],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00083432044,0.00053121767,0.00028892668,0.000623508,0.00095806434,0.0010460375,0.0012120164,0.0007101602,0.001008925],"category_scores_gemma":[0.00053214363,0.00074133376,0.00064337277,0.0011949498,0.00032279606,0.0012483601,0.0008272646,0.00084541,0.0011486312],"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.00013198769,0.0002362235,0.00019457113,0.0001071658,0.00044451657,0.00012393028,0.0010865175,0.052501637,0.0008030392,0.9303261,0.0060207183,0.00802361],"study_design_scores_gemma":[0.0013072807,0.00043321552,0.0037774974,0.0001198199,0.0001788267,0.00039631544,0.00016403025,0.9533073,0.0237491,0.011863081,0.0038596157,0.000843933],"about_ca_topic_score_codex":0.0002380544,"about_ca_topic_score_gemma":0.00018836025,"teacher_disagreement_score":0.918463,"about_ca_system_score_codex":0.000032503827,"about_ca_system_score_gemma":0.00074597064,"threshold_uncertainty_score":0.999991},"labels":[],"label_agreement":null},{"id":"W1993674183","doi":"10.1016/j.comgeo.2014.12.002","title":"A simple, faster method for kinetic proximity problems","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Delaunay triangulation; Graph; Complement graph; Equilateral triangle; Line graph; Dense graph; Discrete mathematics; Time complexity; Butterfly graph; Geometric graph theory; Graph power; Voltage graph; Pathwidth; Geometry","score_opus":0.022489723397228482,"score_gpt":0.2877400102182937,"score_spread":0.2652502868210652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993674183","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.004568819,0.00007744011,0.9925087,0.00083974976,0.00041703216,0.00057126215,0.000012401015,0.00019868383,0.0008059208],"genre_scores_gemma":[0.41471326,7.817504e-7,0.58333015,0.0011288086,0.00027202218,0.00010516565,0.00013054155,0.000013711332,0.00030553347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979629,0.00014695799,0.00042287327,0.00062706205,0.0004906213,0.0003495985],"domain_scores_gemma":[0.997785,0.0010728008,0.00017268791,0.0003268824,0.00049437064,0.00014830982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009361135,0.00021684823,0.00024522597,0.00043123696,0.00024953962,0.00024006171,0.0005813081,0.00008449956,0.000027921657],"category_scores_gemma":[0.00028858875,0.00021525745,0.00014178759,0.0011088186,0.000031247226,0.0005339472,0.00018522344,0.00012228492,0.000066366796],"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.000009193819,0.00011091404,0.00023144226,0.00007583561,0.00003160251,4.8524777e-7,0.00010415138,0.6204703,0.00025602893,0.25183627,0.0023547187,0.124519065],"study_design_scores_gemma":[0.00058402604,0.00014571266,0.0061749015,0.000009428341,0.000008502365,0.000017740262,0.0000029445946,0.7542776,0.00019187284,0.2099285,0.028441897,0.00021685565],"about_ca_topic_score_codex":0.0000050950625,"about_ca_topic_score_gemma":0.0000021763778,"teacher_disagreement_score":0.41014445,"about_ca_system_score_codex":0.00004740927,"about_ca_system_score_gemma":0.00010335168,"threshold_uncertainty_score":0.8777944},"labels":[],"label_agreement":null},{"id":"W1995909989","doi":"10.1016/j.comgeo.2006.12.004","title":"On local transformations in plane geometric graphs embedded on small grids","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Grid; Vertex (graph theory); Embedding; Combinatorics; Mathematics; Plane (geometry); Enhanced Data Rates for GSM Evolution; Point (geometry); Transformation (genetics); Line segment; Line (geometry); Discrete mathematics; Geometry; Computer science; Graph; Telecommunications","score_opus":0.016452451601187305,"score_gpt":0.25234425271371724,"score_spread":0.23589180111252994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995909989","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.2389215,0.000089948044,0.75621516,0.0003357606,0.00056785205,0.0002473296,0.000015421227,0.00014097715,0.0034660636],"genre_scores_gemma":[0.9696939,0.0000078063895,0.028280487,0.0015179412,0.00010270722,0.000017563418,0.00024701178,0.00001592425,0.00011666388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718785,0.000087565604,0.0006985145,0.0006004425,0.000899691,0.00052594626],"domain_scores_gemma":[0.9973072,0.0017865452,0.00014327609,0.0003310468,0.00021174751,0.00022018161],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011268965,0.00029686614,0.00027197192,0.00428029,0.00023506349,0.00014334229,0.00063048163,0.00014793081,0.00005582746],"category_scores_gemma":[0.0001578572,0.00030762344,0.0001383296,0.0066673835,0.00006631479,0.00039660814,0.000069517366,0.0004126588,0.00030770735],"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.00005920694,0.00037241096,0.0002707056,0.000016118727,0.000019822,0.000035805446,0.00018741313,0.63596845,0.000020513484,0.27401394,0.0006772518,0.088358365],"study_design_scores_gemma":[0.00414774,0.0013746313,0.27317607,0.0001341315,0.00001675501,0.00014118434,0.000148895,0.4691592,0.00256089,0.24577595,0.00212829,0.0012362732],"about_ca_topic_score_codex":0.0000125532715,"about_ca_topic_score_gemma":0.000023989865,"teacher_disagreement_score":0.7307724,"about_ca_system_score_codex":0.00023265702,"about_ca_system_score_gemma":0.00014799762,"threshold_uncertainty_score":0.9999376},"labels":[],"label_agreement":null},{"id":"W1997248658","doi":"10.1016/j.comgeo.2008.09.006","title":"Morphing polyhedra with parallel faces: Counterexamples","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Combinatorics; Dual polyhedron; Vertex (graph theory); Morphing; Counterexample; Regular polygon; Mathematics; Face (sociological concept); Simple (philosophy); Graph; Computer science; Geometry","score_opus":0.017545550516045373,"score_gpt":0.20056657782476497,"score_spread":0.1830210273087196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997248658","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.48094627,0.00024108996,0.5180575,0.000012735028,0.0001380445,0.00005077783,0.000017585488,0.00017830815,0.00035764865],"genre_scores_gemma":[0.93694854,0.00005077132,0.06269194,0.000075878685,0.000074866824,0.00000770535,0.000051309464,0.000025297099,0.0000737147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943537,0.0000046104537,0.0001245515,0.00011409877,0.00016333835,0.00015803342],"domain_scores_gemma":[0.9997571,0.000048767215,0.0000232304,0.00007684029,0.000042426378,0.000051621853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000031508713,0.00011092422,0.00012281773,0.00007699692,0.00008155334,0.000017076403,0.000076610864,0.00003194394,0.0000792544],"category_scores_gemma":[0.0000064727374,0.00009952987,0.000019464884,0.0001473603,0.000024564219,0.00013142325,0.000016583344,0.00006133156,0.00004721535],"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.000008585551,0.000010291814,0.0001658616,0.000029319808,0.000023948487,0.000020403178,0.00009296035,0.99559414,0.0008274104,0.002439489,0.00037861124,0.0004089776],"study_design_scores_gemma":[0.004617771,0.00041894743,0.03347187,0.00029309458,0.000063214706,0.0016332787,0.00060593267,0.8641015,0.0072694346,0.03732375,0.04776009,0.0024410873],"about_ca_topic_score_codex":0.000003663855,"about_ca_topic_score_gemma":0.0000010435491,"teacher_disagreement_score":0.45600224,"about_ca_system_score_codex":0.000028723993,"about_ca_system_score_gemma":0.00001816125,"threshold_uncertainty_score":0.40587103},"labels":[],"label_agreement":null},{"id":"W1998148652","doi":"10.1016/j.comgeo.2006.08.002","title":"Graph drawings with few slopes","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; 1-planar graph; Discrete mathematics; Upper and lower bounds; Bipartite graph; Pathwidth; Bounded function; Outerplanar graph; Graph; Line graph","score_opus":0.005608382165783317,"score_gpt":0.20257442143106222,"score_spread":0.1969660392652789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998148652","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.082617246,0.0003033072,0.9115639,0.0009181443,0.00024415055,0.00013878362,0.0000049724244,0.00025896743,0.0039505423],"genre_scores_gemma":[0.748691,0.0000020279156,0.24975546,0.00052132516,0.00022219989,0.000015229969,0.00011064314,0.000011910129,0.0006701865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818784,0.000047881495,0.00030353977,0.0004974503,0.0006704483,0.00029281975],"domain_scores_gemma":[0.9989298,0.00025162855,0.00013043091,0.00025407656,0.00034134905,0.00009270106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022838221,0.0002038158,0.00017632317,0.0005893395,0.0002982475,0.0003088168,0.0004910951,0.000057222824,0.000041763502],"category_scores_gemma":[0.000020970312,0.00018450066,0.00007829462,0.002263719,0.00006942,0.0006830987,0.000120782104,0.00012991969,0.00013084333],"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.000012245536,0.00014599798,0.0024674814,0.000016733062,0.000031756288,0.0000256505,0.000050646435,0.6124086,0.00012843359,0.35977116,0.0055877636,0.019353548],"study_design_scores_gemma":[0.0021763016,0.00039510775,0.27996415,0.00006798791,0.000032349606,0.00038221598,0.000028433826,0.24403127,0.0014507069,0.42875597,0.041479234,0.0012362846],"about_ca_topic_score_codex":0.000030474699,"about_ca_topic_score_gemma":0.000006603448,"teacher_disagreement_score":0.6660738,"about_ca_system_score_codex":0.000046717658,"about_ca_system_score_gemma":0.00015496947,"threshold_uncertainty_score":0.7523719},"labels":[],"label_agreement":null},{"id":"W2004207893","doi":"10.1016/j.comgeo.2008.04.003","title":"Geometric spanners with small chromatic number","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Carleton University","funders":"","keywords":"Combinatorics; Chromatic scale; Mathematics; Integer (computer science); Upper and lower bounds; Spanner; Point (geometry); Plane (geometry); Line (geometry); Set (abstract data type); Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.026532671956699474,"score_gpt":0.23014453556167422,"score_spread":0.20361186360497474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004207893","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.30023375,0.00020904596,0.69695395,0.00035623298,0.000247681,0.00016072718,0.000003897507,0.00022845707,0.0016062229],"genre_scores_gemma":[0.6996483,0.000018903705,0.29898283,0.0005432358,0.00014659765,0.000021656126,0.00007093361,0.000016581596,0.0005509457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976756,0.000075984855,0.00039881724,0.0006076116,0.0008346618,0.00040730948],"domain_scores_gemma":[0.9982745,0.00049223186,0.00018471434,0.0003903524,0.00043574927,0.00022244392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002673169,0.0002754574,0.00027639943,0.00086650735,0.00044496328,0.00013624693,0.0006828289,0.00008181435,0.00013471305],"category_scores_gemma":[0.000105767576,0.00025257308,0.000102791426,0.005040682,0.00011552776,0.0006023679,0.00017980693,0.00019941363,0.00071450364],"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.000036902336,0.00051659724,0.01687918,0.00007723704,0.0002060291,0.00028375562,0.0005504848,0.85949814,0.00006284356,0.049326878,0.007383708,0.06517822],"study_design_scores_gemma":[0.0036465002,0.0006073979,0.44977328,0.000091421,0.00004997813,0.0051449807,0.000066036104,0.49548337,0.0008942454,0.025560513,0.016827926,0.001854335],"about_ca_topic_score_codex":0.000012842528,"about_ca_topic_score_gemma":0.0000019542085,"teacher_disagreement_score":0.4328941,"about_ca_system_score_codex":0.00010101788,"about_ca_system_score_gemma":0.00034284862,"threshold_uncertainty_score":0.99999267},"labels":[],"label_agreement":null},{"id":"W2004826883","doi":"10.1016/s0925-7721(01)00070-0","title":"Efficient visibility queries in simple polygons","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Visibility polygon; Simple polygon; Visibility; Polygon (computer graphics); Rectilinear polygon; Point in polygon; Combinatorics; Star-shaped polygon; Polygon covering; Vertex (graph theory); Representation (politics); Mathematics; Line segment; Point (geometry); Preprocessor; Computer science; Regular polygon; Artificial intelligence; Geometry; Graph; Physics","score_opus":0.020824319767382065,"score_gpt":0.2527533371724667,"score_spread":0.23192901740508462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004826883","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.39862084,0.00041421724,0.59824556,0.00083273184,0.0002784161,0.00014972221,0.0000081383105,0.00012892575,0.00132142],"genre_scores_gemma":[0.9584708,0.0000037565355,0.040706314,0.0004937429,0.000086634216,0.000016506629,0.00003198962,0.000007927475,0.0001822778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980943,0.00010242975,0.00042271183,0.0005317263,0.0005290977,0.00031969615],"domain_scores_gemma":[0.99886256,0.00042637112,0.000094823255,0.00032725293,0.00016933224,0.000119681776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038949243,0.00017325836,0.00019045564,0.0006431672,0.0001752585,0.00014714747,0.00046054687,0.00006636647,0.00024072631],"category_scores_gemma":[0.00018178622,0.00018514997,0.00008445505,0.002321129,0.00005973735,0.0002369906,0.00020552518,0.00016635018,0.00025896853],"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.00000366022,0.00027983522,0.0029510506,0.000011722762,0.000008903925,0.000011386258,0.00030548545,0.9142763,0.000048526636,0.05706196,0.0010781805,0.023962965],"study_design_scores_gemma":[0.0003805868,0.000043971755,0.07878365,0.0000072777007,0.0000018303977,0.000019930118,0.000017961645,0.89763963,0.00006823062,0.021437544,0.0013983297,0.00020105325],"about_ca_topic_score_codex":0.000017770717,"about_ca_topic_score_gemma":0.00000783322,"teacher_disagreement_score":0.55985,"about_ca_system_score_codex":0.00011618148,"about_ca_system_score_gemma":0.00005926906,"threshold_uncertainty_score":0.75501966},"labels":[],"label_agreement":null},{"id":"W2005165224","doi":"10.1016/j.comgeo.2013.05.002","title":"Refold rigidity of convex polyhedra","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Dodecahedron; Tetrahedron; Regular polygon; Convex polytope; Combinatorics; Enhanced Data Rates for GSM Evolution; Rigidity (electromagnetism); Planar; Mathematics; Geometry; Computer science; Convex set; Materials science; Artificial intelligence; Convex optimization","score_opus":0.006325705806073779,"score_gpt":0.1950663615003747,"score_spread":0.18874065569430093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005165224","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.7993815,0.00020865479,0.19798774,0.000026727788,0.0005391265,0.00009644581,0.000024326022,0.00012795652,0.0016075165],"genre_scores_gemma":[0.9848991,0.000011578838,0.014880896,0.00003896846,0.000058770962,0.000006501566,0.00002445433,0.000012361826,0.00006735064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995742,0.0000047140225,0.00015142934,0.00006778005,0.000103147686,0.00009872579],"domain_scores_gemma":[0.9997461,0.000044325498,0.000026985535,0.000075278935,0.000066668224,0.000040661693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000036461028,0.00006552031,0.00011361554,0.000065064334,0.000015829048,0.000009261291,0.000065028486,0.00003546301,0.00043835875],"category_scores_gemma":[0.000014086699,0.000064699154,0.000025238774,0.00012493135,0.000014110313,0.000096774755,0.000019913892,0.000040203624,0.00013430597],"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.0000073806177,0.00007370618,0.00031711845,0.0003626556,0.00009130169,0.0000030922247,0.00009804867,0.8070661,0.11180537,0.051876802,0.008209781,0.020088632],"study_design_scores_gemma":[0.0014005845,0.0001407126,0.036201913,0.0000978584,0.000030505738,0.000028261427,0.00012573574,0.46523613,0.1494425,0.33314222,0.013299865,0.00085370924],"about_ca_topic_score_codex":0.0000063251805,"about_ca_topic_score_gemma":1.4297495e-7,"teacher_disagreement_score":0.34182996,"about_ca_system_score_codex":0.000017158914,"about_ca_system_score_gemma":0.000008447466,"threshold_uncertainty_score":0.4799721},"labels":[],"label_agreement":null},{"id":"W2005353392","doi":"10.1016/j.comgeo.2008.11.004","title":"Not being (super)thin or solid is hard: A study of grid Hamiltonicity","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Shahrekord University of Medical Sciences; Academy of Finland; National Science Foundation","keywords":"Hamiltonian path; Combinatorics; Bipartite graph; Mathematics; Planar graph; Hamiltonian (control theory); Hamiltonian path problem; Grid; Discrete mathematics; Regular polygon; Square tiling; Graph; Mathematical optimization; Geometry","score_opus":0.060117465416775547,"score_gpt":0.336238186652695,"score_spread":0.27612072123591946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005353392","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.7078462,0.000039708357,0.2911632,0.00013410771,0.0001957099,0.0002605501,0.000013302132,0.00008883811,0.00025838235],"genre_scores_gemma":[0.95121294,0.000007926496,0.04765898,0.0003283748,0.00007356954,0.000018006165,0.00000623571,0.000015423095,0.0006785391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972449,0.00016446137,0.00046929842,0.0005879225,0.0011552878,0.00037813894],"domain_scores_gemma":[0.9979032,0.00080223044,0.00013787656,0.0005707148,0.00044260806,0.00014337184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053208903,0.00019046065,0.00033800528,0.00061652355,0.00036256027,0.000050518054,0.001182415,0.000057884932,0.00011509608],"category_scores_gemma":[0.00025433637,0.00017148507,0.00010014903,0.0019689964,0.00017915001,0.00053710653,0.00064100453,0.0002986452,0.000076836775],"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.0010572262,0.008970464,0.13041799,0.00031843985,0.0010750918,0.0009740732,0.046270143,0.67142195,0.0031114344,0.10120854,0.011757335,0.023417333],"study_design_scores_gemma":[0.0047316146,0.0028069606,0.4242566,0.00008188199,0.000024001287,0.0004019928,0.00079603825,0.47320536,0.00669578,0.08510584,0.0008757588,0.0010181627],"about_ca_topic_score_codex":0.000023296923,"about_ca_topic_score_gemma":0.000002895152,"teacher_disagreement_score":0.29383862,"about_ca_system_score_codex":0.000062487874,"about_ca_system_score_gemma":0.00023312002,"threshold_uncertainty_score":0.69929576},"labels":[],"label_agreement":null},{"id":"W2005387480","doi":"10.1016/j.comgeo.2004.04.002","title":"Curve-constrained drawings of planar graphs","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Embedding; Book embedding; Planar graph; Combinatorics; Planar; Planar straight-line graph; Mathematics; Bent molecular geometry; Graph; Graph embedding; Jordan curve theorem; Point (geometry); Discrete mathematics; Computer science; Geometry; 1-planar graph; Computer graphics (images); Line graph; Artificial intelligence","score_opus":0.012685559034463188,"score_gpt":0.2415623381176972,"score_spread":0.228876779083234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005387480","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.15480736,0.00016387731,0.8426369,0.00077277556,0.00035694224,0.00012220787,0.000014148052,0.00011613012,0.0010096879],"genre_scores_gemma":[0.7750969,0.0000036865829,0.22438864,0.0003228955,0.000055118257,0.0000058755895,0.00007120673,0.000007015327,0.000048676684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998328,0.00004084525,0.00043521245,0.0003827982,0.0005820276,0.00023115787],"domain_scores_gemma":[0.9988628,0.00024892128,0.00019200356,0.00024660898,0.00033249793,0.00011717394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032351038,0.00016772079,0.00021546906,0.00067232066,0.00014628319,0.00007741983,0.00054403173,0.0000693271,0.000027068172],"category_scores_gemma":[0.000100377256,0.00017748043,0.000131127,0.0018776859,0.000102558406,0.00048628935,0.0000895988,0.00012478571,0.00005800655],"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.0000071111117,0.00012899995,0.0005365561,0.000022155582,0.000038315702,0.000008980579,0.00020468322,0.30691174,0.0005457533,0.68250716,0.00025447435,0.008834069],"study_design_scores_gemma":[0.0016850842,0.00021753559,0.043444615,0.000053309217,0.0000131717725,0.000115474824,0.000032919106,0.034596466,0.0026930124,0.915821,0.0009225216,0.0004049019],"about_ca_topic_score_codex":0.000015290576,"about_ca_topic_score_gemma":0.0000016584813,"teacher_disagreement_score":0.6202895,"about_ca_system_score_codex":0.00004991923,"about_ca_system_score_gemma":0.00029905175,"threshold_uncertainty_score":0.7237442},"labels":[],"label_agreement":null},{"id":"W2005968133","doi":"10.1016/s0925-7721(01)00066-9","title":"Optimizing area and aspect ratio in straight-line orthogonal tree drawings","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Constant (computer programming); Line (geometry); Aspect ratio (aeronautics); Grid; Tree (set theory); Binary tree; Line drawings; Computer science; Mathematics; Combinatorics; Integer (computer science); Line segment; Binary number; Algorithm; Geometry; Engineering drawing; Arithmetic","score_opus":0.031197710417445887,"score_gpt":0.27095102060035486,"score_spread":0.23975331018290896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005968133","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.024088636,0.00094607903,0.97151613,0.0006452063,0.0000607877,0.00012162882,0.000003729542,0.00017771403,0.0024400759],"genre_scores_gemma":[0.6799001,0.00004432362,0.3195546,0.00030377964,0.000041345116,0.0000056538884,0.000008199155,0.000007395514,0.00013457936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987274,0.00003199317,0.00029375343,0.00040066568,0.0003110542,0.00023517452],"domain_scores_gemma":[0.99928594,0.000272319,0.000086356944,0.00017286799,0.00009722797,0.00008529163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001860434,0.00015586342,0.00018766448,0.00040959974,0.0001038326,0.00015356527,0.00030961478,0.000056075376,0.00008756527],"category_scores_gemma":[0.00010043362,0.00015511308,0.000045244877,0.0009840269,0.000063509746,0.000830535,0.0001696405,0.00019772247,0.000015896434],"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.000032104123,0.0005544364,0.007590431,0.00007885202,0.000065820685,0.00040536321,0.0017151315,0.052492138,0.0017327062,0.21126443,0.002516075,0.7215525],"study_design_scores_gemma":[0.00091696525,0.0002213473,0.028908864,0.000071975934,0.000005564581,0.000116499985,0.000024011717,0.8749224,0.001982251,0.09133998,0.0010254694,0.0004646654],"about_ca_topic_score_codex":0.0000021884264,"about_ca_topic_score_gemma":0.0000027430444,"teacher_disagreement_score":0.82243025,"about_ca_system_score_codex":0.00004523355,"about_ca_system_score_gemma":0.000024757279,"threshold_uncertainty_score":0.63253284},"labels":[],"label_agreement":null},{"id":"W2006095056","doi":"10.1016/j.comgeo.2013.04.002","title":"On plane geometric spanners: A survey and open problems","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Spanner; Enhanced Data Rates for GSM Evolution; Graph; Mathematics; Plane (geometry); Path (computing); Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.03540804549230224,"score_gpt":0.2662650854645597,"score_spread":0.23085703997225743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006095056","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.29377705,0.00033482473,0.7016726,0.0009998312,0.00041121794,0.00078579807,0.0000270426,0.00013401652,0.0018576217],"genre_scores_gemma":[0.9551761,0.000012427496,0.042377986,0.0013078556,0.00007436715,0.00007747089,0.0002740451,0.000014771889,0.00068497873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9978756,0.00016866536,0.00037489875,0.0006770325,0.0005757142,0.00032810582],"domain_scores_gemma":[0.99740136,0.0014859802,0.00015933502,0.00032525908,0.00040173836,0.000226309],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00076097826,0.0002326584,0.00026459392,0.0010065985,0.00027159989,0.0011423569,0.0010443216,0.0000833847,0.00017341909],"category_scores_gemma":[0.0003752983,0.0002222036,0.00004180737,0.0029472488,0.000053469827,0.0011891784,0.0006797103,0.00018516027,0.00058294943],"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.000037742244,0.00069880945,0.016547143,0.00007678517,0.00016492882,0.000014334095,0.00026915787,0.56777567,0.000100016674,0.16587813,0.055134475,0.19330283],"study_design_scores_gemma":[0.0010544296,0.00037510865,0.64453346,0.000029978106,0.000003685662,0.00005723823,0.000011466566,0.24776296,0.000052908603,0.104272336,0.0013713614,0.00047506025],"about_ca_topic_score_codex":0.00022538396,"about_ca_topic_score_gemma":0.0000098131895,"teacher_disagreement_score":0.661399,"about_ca_system_score_codex":0.00005611323,"about_ca_system_score_gemma":0.00012692575,"threshold_uncertainty_score":0.99989456},"labels":[],"label_agreement":null},{"id":"W2006707333","doi":"10.1016/s0925-7721(02)00102-5","title":"Fast approximations for sums of distances, clustering and the Fermat–Weber problem","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Fermat's Last Theorem; Mathematics; Cluster analysis; Dimension (graph theory); Combinatorics; Randomized algorithm; Euclidean geometry; Preprocessor; Constant (computer programming); Set (abstract data type); Point (geometry); Approximation algorithm; Discrete mathematics; Algorithm; Computer science; Geometry; Statistics; Artificial intelligence","score_opus":0.01932622633743269,"score_gpt":0.22757928364946964,"score_spread":0.20825305731203694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006707333","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.0011307874,0.0002846087,0.995032,0.0013363035,0.00009521665,0.00030277006,0.00003281012,0.000035502333,0.0017499977],"genre_scores_gemma":[0.519449,0.00002255314,0.47894594,0.00024196839,0.000064930035,0.0000700042,0.00005956727,0.000007748262,0.0011383166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993129,0.000019598177,0.00019169519,0.00017369053,0.00018675582,0.00011539671],"domain_scores_gemma":[0.99939203,0.00025560067,0.00009318488,0.00016279894,0.00007106513,0.000025312536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022409785,0.00007222439,0.000108368215,0.000102214304,0.00013987524,0.00014904044,0.00037423425,0.000015187974,0.000010963822],"category_scores_gemma":[0.000021501175,0.000053333984,0.000038105965,0.0003843162,0.00009836787,0.0004195885,0.0002266164,0.000040412076,0.0000060659017],"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.00001143167,0.00008566021,0.00029520542,0.00028745283,0.00007685941,9.637745e-7,0.00087402505,0.030233808,0.000005990593,0.7811024,0.0059882565,0.18103793],"study_design_scores_gemma":[0.0007646283,0.00001312432,0.0011047577,0.000014917894,0.0000060646166,0.0000035072474,0.000031642663,0.9682326,0.0000051064585,0.026000325,0.0037502716,0.000073109215],"about_ca_topic_score_codex":0.0000022507945,"about_ca_topic_score_gemma":0.000001208733,"teacher_disagreement_score":0.9379987,"about_ca_system_score_codex":0.000008239372,"about_ca_system_score_gemma":0.0000051638112,"threshold_uncertainty_score":0.21748967},"labels":[],"label_agreement":null},{"id":"W2007853611","doi":"10.1016/j.comgeo.2006.03.003","title":"Computing homotopic shortest paths efficiently","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Randomized algorithm; Mathematics; Deterministic algorithm; Combinatorics; Floyd–Warshall algorithm; Point (geometry); Plane (geometry); Running time; Shortest path problem; Algorithm; Discrete mathematics; Computer science; K shortest path routing; Geometry; Graph","score_opus":0.008324284205473856,"score_gpt":0.22607426931660687,"score_spread":0.21774998511113303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007853611","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.06947318,0.00011237807,0.9242555,0.00031059643,0.00053194066,0.000122061436,0.000008995961,0.000278153,0.0049071903],"genre_scores_gemma":[0.87930626,6.399004e-7,0.11949389,0.00030435363,0.0002527004,0.0000027246606,0.00014929316,0.000008341449,0.00048182413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985044,0.000029379618,0.00027755878,0.00042624027,0.0004608551,0.00030157488],"domain_scores_gemma":[0.9992679,0.00016818073,0.00009019071,0.0003191735,0.000097417374,0.000057148798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002496057,0.00014629881,0.00013872002,0.00031151422,0.00020699826,0.00037511156,0.0008393997,0.000034025074,0.000025366777],"category_scores_gemma":[0.000019458173,0.00014914485,0.00006660479,0.0010801797,0.000044039716,0.00042056185,0.00046621956,0.000104570165,0.0002553859],"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.0000016381526,0.00039808956,0.014723581,0.000030273872,0.000032945358,0.00009175216,0.00005852698,0.26366395,0.00003012841,0.5670143,0.015574538,0.13838033],"study_design_scores_gemma":[0.0003318039,0.000034210763,0.15136738,0.000014636598,0.0000052267733,0.000014054438,0.000007586238,0.8223784,0.000028415785,0.017217347,0.008357731,0.00024320971],"about_ca_topic_score_codex":0.000025747908,"about_ca_topic_score_gemma":0.0000011753842,"teacher_disagreement_score":0.80983305,"about_ca_system_score_codex":0.000034771867,"about_ca_system_score_gemma":0.0000338093,"threshold_uncertainty_score":0.608195},"labels":[],"label_agreement":null},{"id":"W2008735761","doi":"10.1016/j.comgeo.2010.09.008","title":"Fréchet distance with speed limits","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Traverse; Tree traversal; Range (aeronautics); Generalization; Mathematics; Speedup; Point (geometry); Algorithm; Geometry; Computational geometry; Computer science; Combinatorics; Mathematical analysis; Geodesy","score_opus":0.011035953684044022,"score_gpt":0.23848588067294868,"score_spread":0.22744992698890465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008735761","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.21613389,0.000060060338,0.77951235,0.0009127236,0.00061932136,0.00012863975,0.000007625263,0.00019048611,0.0024348754],"genre_scores_gemma":[0.78680116,0.0000014387858,0.21184371,0.0005311139,0.00023598863,0.0000067635306,0.00007008819,0.000011422606,0.00049829786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982698,0.000033786837,0.0002607138,0.0005115581,0.0006429612,0.00028118424],"domain_scores_gemma":[0.9986183,0.00032121764,0.00012713068,0.0003753208,0.00038547924,0.0001725399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026210034,0.00019666,0.00016758038,0.00033981647,0.00023920002,0.00025636793,0.0006271511,0.00007604833,0.0000840663],"category_scores_gemma":[0.00008863033,0.00017772449,0.000060906532,0.0015876504,0.000081465914,0.0006319557,0.000097470154,0.00031357433,0.00019228233],"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.000037108195,0.0002899033,0.0053342413,0.000027633769,0.00006772284,0.00004488251,0.00021731631,0.2831259,0.0025997714,0.64949423,0.0033984622,0.0553628],"study_design_scores_gemma":[0.0015500056,0.00027236767,0.15393482,0.000029590981,0.000017809112,0.000339923,0.000021356364,0.727035,0.0029414059,0.073970824,0.038981266,0.0009056183],"about_ca_topic_score_codex":0.0000035448475,"about_ca_topic_score_gemma":0.0000108264485,"teacher_disagreement_score":0.57552344,"about_ca_system_score_codex":0.000026014799,"about_ca_system_score_gemma":0.00019432917,"threshold_uncertainty_score":0.72473943},"labels":[],"label_agreement":null},{"id":"W2010416098","doi":"10.1016/j.comgeo.2005.11.002","title":"Three problems about simple polygons","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Combinatorics; Simple (philosophy); Triangulation; Regular polygon; Simple polygon; Mathematics; Polygon (computer graphics); Convex hull; Series (stratigraphy); Convex polygon; Subroutine; SIMPLE algorithm; Monotone polygon; Discrete mathematics; Computer science; Geometry","score_opus":0.014010556096416268,"score_gpt":0.2378212923940115,"score_spread":0.22381073629759524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010416098","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.047408205,0.000693831,0.9471412,0.0007783267,0.0004266238,0.00021663574,0.000015757492,0.0003219667,0.0029974985],"genre_scores_gemma":[0.8766458,0.000002725004,0.12174759,0.00047752095,0.00044482245,0.000029312523,0.0002887781,0.00001552679,0.00034791123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979457,0.000037893977,0.00044074495,0.00054150156,0.000661144,0.0003729795],"domain_scores_gemma":[0.9987901,0.00029056458,0.0001542028,0.00033906792,0.00031420702,0.000111862915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003000746,0.00021657627,0.00019186153,0.00052802754,0.00033869877,0.00030455526,0.0006307116,0.00008231233,0.00008959552],"category_scores_gemma":[0.00004399652,0.00022608905,0.000120598845,0.0018459253,0.000056624187,0.0005929071,0.00021947455,0.00015539979,0.0003020911],"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.0000028428017,0.00014057285,0.002625125,0.000015856736,0.000019052728,0.000006991804,0.000026057862,0.6141338,0.000186917,0.3492018,0.011651601,0.021989437],"study_design_scores_gemma":[0.00041753252,0.000052494117,0.13832138,0.000010222811,0.0000060024568,0.000043250348,0.0000025768018,0.455629,0.00015023173,0.38996705,0.015106463,0.00029379118],"about_ca_topic_score_codex":0.00008580485,"about_ca_topic_score_gemma":0.00003915193,"teacher_disagreement_score":0.8292376,"about_ca_system_score_codex":0.000072965566,"about_ca_system_score_gemma":0.00017154204,"threshold_uncertainty_score":0.9219644},"labels":[],"label_agreement":null},{"id":"W2010585683","doi":"10.1016/j.comgeo.2006.05.009","title":"Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Contour line; Scalar field; Scalar (mathematics); Tree (set theory); Visualization; Computational topology; Computer science; Topology (electrical circuits); Computer vision; Artificial intelligence; Computer graphics (images); Geometry; Mathematics; Geography; Cartography; Mathematical analysis; Combinatorics","score_opus":0.032246098413128386,"score_gpt":0.29592415510146086,"score_spread":0.2636780566883325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010585683","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.23203689,0.0009498853,0.7635102,0.0028177158,0.00009867886,0.00006643628,0.000006600819,0.000078917124,0.0004346211],"genre_scores_gemma":[0.9463594,0.00001710552,0.051900297,0.0015412365,0.000069098125,0.0000014153384,0.0000120222085,0.0000033652486,0.00009606854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858636,0.00008757342,0.00027574474,0.00041998006,0.00031639138,0.00031394782],"domain_scores_gemma":[0.998753,0.0006389385,0.000116280076,0.00028698664,0.00009760765,0.00010717551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004091449,0.00015277918,0.0002336428,0.00032218834,0.00045934189,0.00025182762,0.0006575559,0.00007114044,0.000035029858],"category_scores_gemma":[0.00017986735,0.00010416725,0.00007855899,0.001912034,0.00012988612,0.00038293414,0.00027191074,0.00016355056,0.00001640338],"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.00002098023,0.00030274593,0.02994794,0.000020730502,0.0001820633,0.00005584378,0.00043403875,0.19081616,0.00041946073,0.4196048,0.0010406375,0.35715458],"study_design_scores_gemma":[0.00057731767,0.00018858736,0.20161127,0.000016911694,0.00004946336,0.00014193937,0.0001828487,0.6560779,0.000117425094,0.13845943,0.0021815435,0.00039532856],"about_ca_topic_score_codex":0.000037023507,"about_ca_topic_score_gemma":0.000002103564,"teacher_disagreement_score":0.7143225,"about_ca_system_score_codex":0.000029982673,"about_ca_system_score_gemma":0.000033607757,"threshold_uncertainty_score":0.4247817},"labels":[],"label_agreement":null},{"id":"W2011903683","doi":"10.1016/s0925-7721(99)00055-3","title":"Queries with segments in Voronoi diagrams","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Killam Trusts; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Disjoint sets; Voronoi diagram; Line segment; Convex hull; Computational geometry; Combinatorics; Plane (geometry); Point (geometry); Hausdorff distance; Regular polygon; Computer science; Set (abstract data type); Line (geometry); Hausdorff space; Mathematics; Algorithm; Artificial intelligence; Geometry","score_opus":0.00620114208630814,"score_gpt":0.21263248440813912,"score_spread":0.20643134232183097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011903683","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.44735792,0.00017776308,0.54901093,0.0005468454,0.00012383996,0.0001552201,0.0000039039355,0.00011005466,0.002513531],"genre_scores_gemma":[0.9119033,0.000012487303,0.086382985,0.0005725286,0.00008228395,0.000028407816,0.0000767209,0.000009816287,0.000931425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845135,0.000065471264,0.00028537068,0.00043187133,0.0004940567,0.00027189855],"domain_scores_gemma":[0.9993296,0.00018428506,0.000059469286,0.00022220917,0.00010677976,0.00009761964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022063837,0.00016988837,0.00016607661,0.000367335,0.00012571081,0.00016439227,0.0003942328,0.000050730632,0.00028651787],"category_scores_gemma":[0.000018808589,0.0001586384,0.000041522835,0.0017123397,0.00005141766,0.0006977753,0.00006160308,0.00013111498,0.00023128782],"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.000028456396,0.00017889592,0.007110578,0.000011569425,0.000021155087,0.000028156957,0.0002478779,0.73820436,0.000014380982,0.027161917,0.00042495911,0.2265677],"study_design_scores_gemma":[0.0019334767,0.00031210395,0.42565024,0.00006245298,0.00000767683,0.000113802984,0.000036392812,0.5258941,0.00023412528,0.033199135,0.011886908,0.00066959107],"about_ca_topic_score_codex":0.00001929206,"about_ca_topic_score_gemma":0.00001884305,"teacher_disagreement_score":0.46454543,"about_ca_system_score_codex":0.000073210205,"about_ca_system_score_gemma":0.00013121664,"threshold_uncertainty_score":0.64690864},"labels":[],"label_agreement":null},{"id":"W2012691739","doi":"10.1016/j.comgeo.2014.02.004","title":"A note on the unsolvability of the weighted region shortest path problem","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Shortest path problem; Combinatorics; Subdivision; Euclidean shortest path; Euclidean geometry; Integer (computer science); Path (computing); Algebraic number; Rational number; Computation; Discrete mathematics; K shortest path routing; Algorithm; Computer science; Geometry; Mathematical analysis","score_opus":0.01533708331655553,"score_gpt":0.23211046436807528,"score_spread":0.21677338105151975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012691739","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.12638731,0.000032012333,0.86502624,0.0059134257,0.00039997333,0.00033589802,0.0000047060335,0.00006656525,0.0018338583],"genre_scores_gemma":[0.97733754,0.0000015345034,0.021062246,0.0012895097,0.00013545882,0.00002054279,0.000014838072,0.000007929288,0.00013038439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796015,0.00031623524,0.00039164096,0.00040191086,0.00073148747,0.00019857705],"domain_scores_gemma":[0.997058,0.0016403856,0.0002469032,0.00061737787,0.0003777766,0.000059555492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008078402,0.000166261,0.00016657574,0.00015976082,0.00033570427,0.00008667102,0.0009505489,0.00006490869,0.000015058264],"category_scores_gemma":[0.0003098442,0.00010043416,0.00014430456,0.0017185543,0.00012845627,0.00017797895,0.00024288356,0.00021450529,0.000030786097],"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.000014275598,0.00021834846,0.0020412551,0.00001939559,0.000023653673,7.968511e-7,0.0002562477,0.27251658,0.00013172867,0.6862564,0.0026587537,0.03586256],"study_design_scores_gemma":[0.0002735353,0.00013285686,0.081360266,0.000045665874,0.000008703559,0.000016876744,0.000007099947,0.7114539,0.0007072083,0.20150518,0.004320555,0.00016810918],"about_ca_topic_score_codex":0.0000067920123,"about_ca_topic_score_gemma":0.000002194328,"teacher_disagreement_score":0.85095024,"about_ca_system_score_codex":0.000055592544,"about_ca_system_score_gemma":0.00015082872,"threshold_uncertainty_score":0.40955862},"labels":[],"label_agreement":null},{"id":"W2013115769","doi":"10.1016/j.comgeo.2007.05.006","title":"Encompassing colored planar straight line graphs","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Planar graph; Vertex (graph theory); Connected component; Colored; Mathematics; Planar; Graph; Enhanced Data Rates for GSM Evolution; Spanning tree; Matching (statistics); Computer science; Artificial intelligence; Computer graphics (images)","score_opus":0.01876496356272188,"score_gpt":0.2701962851754623,"score_spread":0.2514313216127404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013115769","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.09951873,0.00028565704,0.8952054,0.00060141407,0.000859495,0.0001599994,0.000009662204,0.00026568575,0.003093981],"genre_scores_gemma":[0.7686251,0.0000033004258,0.22998825,0.00072035025,0.00023972504,0.0000049219652,0.00014628853,0.000011362282,0.00026073426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976202,0.000057912315,0.0005490034,0.00054542406,0.00078223366,0.00044520042],"domain_scores_gemma":[0.99823266,0.0006929352,0.0001907561,0.0002849722,0.0003617958,0.00023689296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089426094,0.00023249895,0.00022775776,0.000957824,0.00036889952,0.00023424727,0.0006458327,0.000106432446,0.00007977401],"category_scores_gemma":[0.00009322875,0.00024309874,0.00012597864,0.002427889,0.0000749315,0.00060147094,0.00011847719,0.00022187443,0.00013160873],"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.000042608986,0.00030811015,0.0015849228,0.000029230543,0.00008881333,0.00009221723,0.00029750937,0.23411109,0.0014413625,0.6482683,0.0046816817,0.10905419],"study_design_scores_gemma":[0.001793385,0.00037788667,0.22900768,0.00005203797,0.000025016823,0.00028107504,0.00006877361,0.4953956,0.0029975192,0.25139123,0.017608225,0.0010015822],"about_ca_topic_score_codex":0.0000054079396,"about_ca_topic_score_gemma":0.000006650776,"teacher_disagreement_score":0.66910636,"about_ca_system_score_codex":0.0000927127,"about_ca_system_score_gemma":0.00017881837,"threshold_uncertainty_score":0.9913278},"labels":[],"label_agreement":null},{"id":"W2016064056","doi":"10.1016/j.comgeo.2007.07.007","title":"I/O-efficient algorithms for computing planar geometric spanners","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Bioethics Society; Carleton University","funders":"","keywords":"Planar; Planar graph; Point (geometry); Plane (geometry); Computer science; Algorithm; Combinatorics; Mathematics; Theoretical computer science; Geometry; Computer graphics (images); Graph","score_opus":0.028308479776054888,"score_gpt":0.29417224396095326,"score_spread":0.2658637641848984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016064056","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.06542243,0.00043606746,0.9308497,0.00046052889,0.0014242226,0.0004562218,0.000022492512,0.00029882207,0.0006295683],"genre_scores_gemma":[0.5776478,0.0000013441675,0.42108297,0.0005421672,0.00042456025,0.000008102092,0.00013339017,0.00001651233,0.00014311414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969346,0.00004498454,0.000686247,0.00076832646,0.0008760669,0.0006897559],"domain_scores_gemma":[0.9965648,0.0019063179,0.00027087907,0.00032748166,0.00065401965,0.0002764858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001898798,0.00029335992,0.00029648357,0.0018960938,0.00052043004,0.0002074692,0.00077057787,0.00012538196,0.000015249546],"category_scores_gemma":[0.00033157118,0.00031519373,0.00020555788,0.004264759,0.00008200592,0.00020027968,0.00016956788,0.00019481377,0.000089053],"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.00001992825,0.0001660732,0.00022942104,0.000029292789,0.00004982905,0.000012422496,0.00016738102,0.80160844,0.00008677839,0.07089377,0.0018474254,0.124889255],"study_design_scores_gemma":[0.000977596,0.0001557115,0.019534314,0.000017792658,0.000012814892,0.000072606425,0.000077995224,0.9629518,0.00041800714,0.009851672,0.0054904004,0.0004392973],"about_ca_topic_score_codex":0.00000705725,"about_ca_topic_score_gemma":0.0000012393358,"teacher_disagreement_score":0.5122254,"about_ca_system_score_codex":0.00018126803,"about_ca_system_score_gemma":0.00018586092,"threshold_uncertainty_score":0.99993},"labels":[],"label_agreement":null},{"id":"W2016199536","doi":"10.1016/j.comgeo.2004.06.001","title":"Grid drawings of k-colourable graphs","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Grid; Graph; Combinatorics; Upper and lower bounds; Computer science; Mathematics; Geometry","score_opus":0.010242047303097624,"score_gpt":0.233897297309779,"score_spread":0.22365525000668138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016199536","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.2814443,0.00025052868,0.71567076,0.00073083973,0.00062028825,0.00012122767,0.000008277759,0.000110710644,0.0010430777],"genre_scores_gemma":[0.834747,0.000006161172,0.16469583,0.00036540543,0.000047344398,0.000008215464,0.000048181817,0.0000075483945,0.000074286756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983924,0.000034303346,0.00039685014,0.00036358056,0.0005821613,0.00023068617],"domain_scores_gemma":[0.9988732,0.00020338235,0.00018056891,0.00025251432,0.00038347108,0.000106903455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031472478,0.00015172355,0.00020350466,0.00060836703,0.0001647684,0.00008311095,0.0005504944,0.00006411661,0.00003208464],"category_scores_gemma":[0.00008947443,0.00015931258,0.00012790175,0.0020776554,0.00006881586,0.000564904,0.00015621506,0.000120162505,0.00007773636],"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.00000440971,0.000101702346,0.0002874186,0.000015817466,0.00002309117,0.0000045921065,0.00011851727,0.53949225,0.00038059833,0.45429078,0.0004107867,0.004870058],"study_design_scores_gemma":[0.0012354206,0.00019561041,0.0347789,0.000040526396,0.00001146133,0.00007450129,0.000021849217,0.040323026,0.005395468,0.9162034,0.0013873228,0.00033253702],"about_ca_topic_score_codex":0.000018078701,"about_ca_topic_score_gemma":0.0000011575847,"teacher_disagreement_score":0.5533027,"about_ca_system_score_codex":0.00006206982,"about_ca_system_score_gemma":0.00026353518,"threshold_uncertainty_score":0.64965785},"labels":[],"label_agreement":null},{"id":"W2016887255","doi":"10.1016/j.comgeo.2010.03.005","title":"Matched drawability of graph pairs and of graph triples","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Planarity testing; Planar graph; Combinatorics; Planar; Graph; Graph drawing; Mathematics; Computer science","score_opus":0.010929146220656228,"score_gpt":0.24201357825907532,"score_spread":0.2310844320384191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016887255","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.58913,0.00012208002,0.4099414,0.00019666861,0.0002882638,0.0001102679,0.0000169736,0.000033637727,0.00016070531],"genre_scores_gemma":[0.86930984,0.000006951297,0.13050856,0.000060051698,0.00004454295,0.0000061083997,0.000031762556,0.0000055950304,0.000026575954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984156,0.000068104775,0.0005116496,0.00036605124,0.0004783738,0.00016022884],"domain_scores_gemma":[0.9982104,0.0006641029,0.00026529958,0.00030174074,0.00045559715,0.00010290581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063662056,0.00014693731,0.000279338,0.0006068793,0.00009612994,0.000042742693,0.00038667783,0.000088096946,0.00003660727],"category_scores_gemma":[0.00020761462,0.00014697776,0.00011624844,0.0015560316,0.00022826932,0.00032238525,0.00016802581,0.00016573723,0.0000034599368],"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.000078937206,0.00095830753,0.067561045,0.00044670046,0.00020983389,0.000005516096,0.0012804162,0.11939163,0.034832172,0.66410226,0.0010194442,0.11011373],"study_design_scores_gemma":[0.0009156731,0.0001758399,0.5389563,0.000022696198,0.000018879833,0.000034778514,0.000054913606,0.08095767,0.009139141,0.3691221,0.00030522095,0.00029683573],"about_ca_topic_score_codex":0.000020113217,"about_ca_topic_score_gemma":0.000007938799,"teacher_disagreement_score":0.47139522,"about_ca_system_score_codex":0.000007738432,"about_ca_system_score_gemma":0.0001321565,"threshold_uncertainty_score":0.5993579},"labels":[],"label_agreement":null},{"id":"W2022056727","doi":"10.1016/j.comgeo.2012.01.006","title":"The union of colorful simplices spanned by a colored point set","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Colored; Mathematics; Simplex; Hyperplane; Upper and lower bounds; Ackermann function; Point (geometry); Euclidean space; Inverse; Geometry","score_opus":0.01367412419404745,"score_gpt":0.25875668846029914,"score_spread":0.2450825642662517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022056727","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.24943595,0.0014562592,0.74542516,0.0019570927,0.0007463037,0.00025074068,0.00003531968,0.00008952644,0.000603641],"genre_scores_gemma":[0.98304373,0.000018838811,0.015997762,0.00037145326,0.0001489163,0.000021557067,0.00015118263,0.000009302029,0.00023726202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814874,0.00018919636,0.0004349467,0.00026079084,0.00060022634,0.00036608524],"domain_scores_gemma":[0.99767923,0.0012613994,0.0002770182,0.00027973767,0.0003503714,0.00015226706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010708589,0.00016474901,0.0001825983,0.00021054017,0.00037177926,0.00012487997,0.000634115,0.000071356466,0.00002223134],"category_scores_gemma":[0.00017147107,0.00013395946,0.000092150636,0.0013927587,0.000104688006,0.00065516244,0.00024310943,0.0001231969,0.00005686633],"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.000113870854,0.00084837835,0.009440283,0.00008768319,0.00030938245,0.000002803276,0.0016771385,0.21330763,0.004837551,0.54691803,0.11980166,0.10265556],"study_design_scores_gemma":[0.00236994,0.0007289331,0.15310207,0.0000523053,0.000054842243,0.00012545768,0.0005016331,0.58792806,0.012152077,0.08264245,0.15924099,0.0011012376],"about_ca_topic_score_codex":0.000011545659,"about_ca_topic_score_gemma":0.0000018600019,"teacher_disagreement_score":0.73360777,"about_ca_system_score_codex":0.00006181851,"about_ca_system_score_gemma":0.00011254944,"threshold_uncertainty_score":0.54627085},"labels":[],"label_agreement":null},{"id":"W2022093184","doi":"10.1016/j.comgeo.2009.01.007","title":"A (slightly) faster algorithm for Klee's measure problem","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Measure (data warehouse); Computer science; Algorithm; Mathematics; Data mining","score_opus":0.01586173538029706,"score_gpt":0.2540035963032679,"score_spread":0.23814186092297085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022093184","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.001386974,0.00036236257,0.9929077,0.0026022529,0.00043781835,0.00049696513,0.000021048578,0.00024329971,0.0015415688],"genre_scores_gemma":[0.21260744,0.0000026970633,0.7842053,0.0018503976,0.0004135906,0.00004340771,0.00015006232,0.000011866327,0.00071524025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788666,0.000059187514,0.0004168082,0.00060678803,0.000653187,0.00037739653],"domain_scores_gemma":[0.9984536,0.0003077512,0.00014990314,0.00028099166,0.0006441161,0.00016360825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004727866,0.00023839009,0.000233886,0.0005333967,0.00030274547,0.00029527163,0.0006069815,0.00010173065,0.000021876347],"category_scores_gemma":[0.00005753026,0.0002387615,0.00016542818,0.0013721527,0.000027419741,0.0006787892,0.00007958698,0.0001379477,0.000084418636],"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.000010158841,0.0001833786,0.00002072832,0.000012326684,0.0000364336,0.000004912124,0.00013976042,0.08944208,0.00016767885,0.1015038,0.006643728,0.801835],"study_design_scores_gemma":[0.0010094607,0.00032203682,0.0033526307,0.000025004845,0.0000125146635,0.000051410698,0.000009511789,0.80644804,0.00041088523,0.17157581,0.016400967,0.00038169292],"about_ca_topic_score_codex":0.000001270861,"about_ca_topic_score_gemma":3.4638072e-7,"teacher_disagreement_score":0.8014533,"about_ca_system_score_codex":0.00007381383,"about_ca_system_score_gemma":0.0001969565,"threshold_uncertainty_score":0.97364116},"labels":[],"label_agreement":null},{"id":"W2022832678","doi":"10.1016/s0925-7721(01)00058-x","title":"Optimally computing a shortest weakly visible line segment inside a simple polygon","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Simon Fraser University","funders":"","keywords":"Simple polygon; Polygon covering; Polygon (computer graphics); Visibility polygon; Star-shaped polygon; Point in polygon; Rectilinear polygon; Algorithm; Line segment; Mathematics; Line (geometry); Combinatorics; Vertex (graph theory); Simple (philosophy); Computer science; Monotone polygon; Regular polygon; Geometry; Graph","score_opus":0.02784048829496428,"score_gpt":0.26236245067230884,"score_spread":0.23452196237734457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022832678","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.09229874,0.0008040998,0.9020555,0.001434824,0.0005209087,0.00029016734,0.000014779111,0.00039486343,0.0021861256],"genre_scores_gemma":[0.75224876,0.00001152949,0.24546792,0.0013714064,0.00037120268,0.00001111367,0.00012707085,0.000021326348,0.00036968983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968133,0.0001138643,0.0007107995,0.00083236414,0.00097323745,0.0005564597],"domain_scores_gemma":[0.9979672,0.00058828783,0.00024759333,0.00046061748,0.00045277053,0.0002835476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047783868,0.00035396835,0.0003442209,0.00081786374,0.00048285406,0.00045186796,0.0008156168,0.00011376406,0.0002590907],"category_scores_gemma":[0.00015128146,0.00038467188,0.00017305587,0.0025315222,0.00006283766,0.00077079283,0.0004939723,0.00029218433,0.00048662449],"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.0000066496286,0.0003347887,0.00057614956,0.000020459718,0.000059161317,0.000033966502,0.00027010456,0.8881962,0.00047071907,0.032507367,0.0044838577,0.07304058],"study_design_scores_gemma":[0.0005954227,0.00022409175,0.008486535,0.000028487053,0.00001266638,0.0001248394,0.000021707418,0.9740917,0.00045397077,0.011602814,0.003916633,0.0004410967],"about_ca_topic_score_codex":0.000015466745,"about_ca_topic_score_gemma":0.0000034999325,"teacher_disagreement_score":0.65995,"about_ca_system_score_codex":0.0001522774,"about_ca_system_score_gemma":0.00012188373,"threshold_uncertainty_score":0.9998605},"labels":[],"label_agreement":null},{"id":"W2023271676","doi":"10.1016/j.comgeo.2012.09.004","title":"Drawing planar 3-trees with given face areas","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planar graph; Combinatorics; Outerplanar graph; Vertex (graph theory); Planar; Planar straight-line graph; Mathematics; Book embedding; Face (sociological concept); Graph; Geometry; Computer science; 1-planar graph; Line graph; Pathwidth; Computer graphics (images); Sociology","score_opus":0.01695545357795257,"score_gpt":0.24508462542624443,"score_spread":0.22812917184829185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023271676","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.10620799,0.00055501173,0.8902922,0.0006926388,0.0004007503,0.00014251148,0.000007822522,0.00019678973,0.0015042555],"genre_scores_gemma":[0.8729943,0.0000028410382,0.12570043,0.00052052824,0.00033162016,0.000014298746,0.000102726786,0.000013109388,0.00032013134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99821234,0.00007028568,0.00025809286,0.0003637494,0.0006718408,0.00042368297],"domain_scores_gemma":[0.99883634,0.0003722708,0.00012806192,0.00022935678,0.00019789964,0.00023605523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033230227,0.00021103752,0.00018431162,0.00042878938,0.00028445548,0.00018153079,0.00043335548,0.00006307526,0.000043336684],"category_scores_gemma":[0.00005266152,0.0001912504,0.00006616982,0.0013503558,0.000050860686,0.0011993202,0.000116912655,0.00015561283,0.00023177011],"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.00004439974,0.0004944231,0.05454519,0.00004415983,0.00019639773,0.00002591676,0.0013871161,0.70454997,0.0002846636,0.17381367,0.007360845,0.057253223],"study_design_scores_gemma":[0.0014963138,0.00029460207,0.63973385,0.00007706464,0.000038395778,0.0004453622,0.00021577692,0.31131253,0.00093567994,0.016451975,0.027879747,0.0011187186],"about_ca_topic_score_codex":0.0000063048506,"about_ca_topic_score_gemma":0.000002343474,"teacher_disagreement_score":0.76678634,"about_ca_system_score_codex":0.000070572045,"about_ca_system_score_gemma":0.000115751376,"threshold_uncertainty_score":0.7798965},"labels":[],"label_agreement":null},{"id":"W2023414931","doi":"10.1016/j.comgeo.2005.06.003","title":"Equitable subdivisions within polygonal regions","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Combinatorics; Geodesic; Regular polygon; Partition (number theory); Mathematics; Generalization; Simple (philosophy); Geometry; Mathematical analysis","score_opus":0.023731384641348472,"score_gpt":0.27273030432527884,"score_spread":0.24899891968393037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023414931","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.034699704,0.00046972756,0.9550444,0.0050844117,0.0006210774,0.00015628182,0.000014081963,0.00031653824,0.0035938006],"genre_scores_gemma":[0.7274204,0.0000048182983,0.26902646,0.0015253015,0.00041117478,0.000016204667,0.000100552454,0.000012182422,0.0014829141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976373,0.0000797003,0.00048820444,0.00056798966,0.0007768729,0.00044995238],"domain_scores_gemma":[0.99842876,0.00042843033,0.00016805992,0.00039148814,0.0003445662,0.00023871343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056274823,0.00022032003,0.00019913832,0.00065006147,0.0005422681,0.0002809294,0.00069906825,0.00008825082,0.00015924628],"category_scores_gemma":[0.00014720055,0.00022921573,0.00013493208,0.0019528732,0.00006428962,0.0011089207,0.00039783012,0.00022584181,0.0007158387],"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.000004176264,0.00012580836,0.00016854412,0.0000047240237,0.000023806868,0.000004350397,0.00013586473,0.506437,0.00011359263,0.4714687,0.008564387,0.012949026],"study_design_scores_gemma":[0.0006130062,0.000084971776,0.009726965,0.000020145411,0.000010995183,0.00013622863,0.00002197768,0.86684126,0.0005581067,0.09296434,0.028597489,0.00042455384],"about_ca_topic_score_codex":0.000006079555,"about_ca_topic_score_gemma":0.000005498966,"teacher_disagreement_score":0.6927207,"about_ca_system_score_codex":0.000114501134,"about_ca_system_score_gemma":0.00030651875,"threshold_uncertainty_score":0.9347146},"labels":[],"label_agreement":null},{"id":"W2024874686","doi":"10.1016/j.comgeo.2012.02.001","title":"Watchman tours for polygons with holes","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Polygon (computer graphics); Combinatorics; Mathematics; Multiplicative function; Point (geometry); Domain (mathematical analysis); Rectilinear polygon; Star-shaped polygon; Perimeter; Point in polygon; Simple polygon; Upper and lower bounds; Geometry; Monotone polygon; Regular polygon; Computer science; Mathematical analysis","score_opus":0.01853593308062232,"score_gpt":0.25912884925260504,"score_spread":0.24059291617198272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024874686","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.06759578,0.00037540388,0.9294591,0.001054288,0.00049251656,0.00024825978,0.000012134058,0.00015192445,0.0006105973],"genre_scores_gemma":[0.72350395,0.0000015671516,0.2750641,0.00055726117,0.0003814136,0.000043193933,0.00010997725,0.000011338393,0.0003271512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860585,0.00003650878,0.0002226814,0.00030995824,0.0004159045,0.00040910748],"domain_scores_gemma":[0.99876934,0.0004350775,0.000103704355,0.00022397746,0.00026699534,0.00020089839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034401182,0.0001728723,0.00015693491,0.00034665433,0.00027456586,0.00013182063,0.00038286106,0.000054517168,0.000020889347],"category_scores_gemma":[0.00005396246,0.00015401466,0.00008082074,0.0009444564,0.000059594564,0.000837011,0.00009624883,0.00008915451,0.00006272148],"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.00004358709,0.0004071875,0.007278982,0.000039565068,0.000115370516,0.000002593369,0.0006912038,0.2373542,0.0001878194,0.6827123,0.009968113,0.061199024],"study_design_scores_gemma":[0.0048206206,0.0010177374,0.24957313,0.000092780705,0.000103246704,0.00043001655,0.00030287646,0.51950073,0.003956065,0.12985289,0.08819328,0.0021566134],"about_ca_topic_score_codex":0.0000021299809,"about_ca_topic_score_gemma":9.5134345e-7,"teacher_disagreement_score":0.65590817,"about_ca_system_score_codex":0.000050731924,"about_ca_system_score_gemma":0.00011870498,"threshold_uncertainty_score":0.62805355},"labels":[],"label_agreement":null},{"id":"W2030723399","doi":"10.1016/j.comgeo.2008.06.004","title":"A linear-space algorithm for distance preserving graph embedding","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Carleton University","funders":"National Research Council Canada; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Mitacs; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Scaling; Embedding; Combinatorics; Euclidean distance; Algorithm; Diagonal; Multidimensional scaling; Discrete mathematics; Computer science; Statistics; Geometry","score_opus":0.026321080000358724,"score_gpt":0.28478862768333224,"score_spread":0.25846754768297353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030723399","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.009690645,0.0003618994,0.9885824,0.00037770212,0.00033648626,0.00022838745,0.000022365486,0.00016451252,0.00023560492],"genre_scores_gemma":[0.11643839,0.00002969864,0.8824446,0.00032661716,0.00015791519,0.00008995509,0.00006501364,0.000012312639,0.00043549095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883044,0.000027089913,0.00019949398,0.0003601316,0.0003364742,0.00024635528],"domain_scores_gemma":[0.9989835,0.00038569295,0.000090019974,0.00020206692,0.00024436868,0.00009436411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014991227,0.00012356813,0.0001365927,0.00020309197,0.00036127493,0.00006168902,0.00043774908,0.00005453399,0.000019595114],"category_scores_gemma":[0.000052569172,0.0001236408,0.00009740376,0.00067306496,0.00004097709,0.000522893,0.00015400845,0.00009817669,0.00004654734],"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.000047235804,0.0004866176,0.0015676034,0.00015391828,0.00012091833,0.00007842071,0.0013199971,0.43830803,0.00061960367,0.024035282,0.102201216,0.43106118],"study_design_scores_gemma":[0.00045033116,0.0000468944,0.0011381194,0.000042261654,0.000002120071,0.00003463393,0.000020313451,0.9683598,0.0003938254,0.018346785,0.010979058,0.00018581566],"about_ca_topic_score_codex":0.0000033652684,"about_ca_topic_score_gemma":2.202632e-7,"teacher_disagreement_score":0.5300518,"about_ca_system_score_codex":0.000024133216,"about_ca_system_score_gemma":0.00005156497,"threshold_uncertainty_score":0.50419253},"labels":[],"label_agreement":null},{"id":"W2030839304","doi":"10.1016/j.comgeo.2012.09.009","title":"Localized geometric query problems","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ministerio de Economía y Competitividad","keywords":"Query optimization; Computer science; Query expansion; Sargable; Information retrieval; Web search query; Search engine","score_opus":0.023343211738097377,"score_gpt":0.2562217752583361,"score_spread":0.23287856352023872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030839304","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.02904711,0.0023498966,0.96331686,0.00049464585,0.0010957485,0.00024126464,0.000006548076,0.00033614034,0.0031118048],"genre_scores_gemma":[0.84742475,0.000016303306,0.15028527,0.00091689767,0.0004953811,0.000036270903,0.000107292326,0.000017362987,0.00070049544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975001,0.000121384226,0.00047711143,0.00044200895,0.00085666217,0.0006027287],"domain_scores_gemma":[0.99824774,0.0005411607,0.00018027135,0.00037012453,0.00032393768,0.00033674506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085407076,0.00025092205,0.0002503283,0.0012974363,0.00027728328,0.00020707022,0.00065620744,0.00010875533,0.00023402898],"category_scores_gemma":[0.00021066895,0.00025394984,0.00014209935,0.0046740416,0.00005412575,0.0014719923,0.0002983629,0.0002069027,0.00075204484],"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.000011587411,0.0006673339,0.010158546,0.00007327529,0.0001083941,0.000006123052,0.00036238384,0.5550575,0.00011197693,0.2719365,0.010103336,0.15140302],"study_design_scores_gemma":[0.0020763066,0.00022069126,0.15894033,0.00005176732,0.00003829445,0.0003374956,0.00004397648,0.58084977,0.00056456745,0.060815096,0.19465335,0.0014083501],"about_ca_topic_score_codex":0.000008654971,"about_ca_topic_score_gemma":4.6112038e-7,"teacher_disagreement_score":0.8183776,"about_ca_system_score_codex":0.000118536474,"about_ca_system_score_gemma":0.00014362593,"threshold_uncertainty_score":0.9999913},"labels":[],"label_agreement":null},{"id":"W2030923360","doi":"10.1016/j.comgeo.2005.11.001","title":"Progress on maximum weight triangulation","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"","keywords":"Minimum-weight triangulation; Triangulation; Pitteway triangulation; Point set triangulation; Mathematics; Combinatorics; Polygon (computer graphics); Point (geometry); Regular polygon; Set (abstract data type); Delaunay triangulation; Plane (geometry); Constant (computer programming); Bounded function; Geometry; Bowyer–Watson algorithm; Mathematical analysis; Computer science","score_opus":0.010383288233911473,"score_gpt":0.24154325011322852,"score_spread":0.23115996187931706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030923360","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.07067182,0.00033078526,0.92183125,0.0018691731,0.0008332832,0.0002493862,0.000008440764,0.00031284796,0.003893001],"genre_scores_gemma":[0.89951473,0.0000014571895,0.09842301,0.00046936565,0.0006106213,0.000028315766,0.00026226987,0.000013454995,0.0006767926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979814,0.00008190334,0.0003922095,0.0005148906,0.0007508836,0.00027867738],"domain_scores_gemma":[0.99890983,0.0002834517,0.00016269623,0.00029014694,0.00026948578,0.00008437222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003013482,0.00020262215,0.00017095031,0.0006617783,0.00025697408,0.00024026805,0.00043691715,0.00008372201,0.000061066734],"category_scores_gemma":[0.000035545163,0.00020240647,0.000107269574,0.0016257344,0.000050557308,0.00048182625,0.00009812931,0.00013265591,0.00033348813],"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.000022257327,0.00027355447,0.0013574569,0.000011978472,0.000019197669,0.000014657435,0.0000272469,0.42074904,0.000053518284,0.48648447,0.007902297,0.08308434],"study_design_scores_gemma":[0.0012605308,0.00017639658,0.15993027,0.000022908916,0.000008846541,0.00004147265,0.000003407752,0.45930457,0.00079364,0.35968575,0.018338446,0.0004337763],"about_ca_topic_score_codex":0.0000049930013,"about_ca_topic_score_gemma":9.496038e-7,"teacher_disagreement_score":0.8288429,"about_ca_system_score_codex":0.00009018432,"about_ca_system_score_gemma":0.000106339234,"threshold_uncertainty_score":0.8253896},"labels":[],"label_agreement":null},{"id":"W2031858761","doi":"10.1016/s0925-7721(02)00173-6","title":"Algorithms for bivariate medians and a Fermat–Torricelli problem for lines","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Bivariate analysis; Combinatorics; Fermat's Last Theorem; Mathematics; Point (geometry); Median; Algorithm; Set (abstract data type); Statistics; Computer science; Geometry","score_opus":0.14887541764238982,"score_gpt":0.43265042127336056,"score_spread":0.28377500363097075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031858761","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.0011602473,0.00015997296,0.9970993,0.00017538542,0.0001643587,0.000693592,0.0002442088,0.000046172398,0.00025677404],"genre_scores_gemma":[0.009448184,0.000007259998,0.9896677,0.0001471885,0.000103640676,0.00019290428,0.000041865773,0.000029268807,0.00036197389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906814,0.000037724727,0.0002847344,0.00024889174,0.0001394343,0.00022105576],"domain_scores_gemma":[0.9948647,0.004618291,0.00009577729,0.00007846142,0.00024031285,0.0001024364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043011463,0.0001339531,0.000233489,0.00010020885,0.00013494247,0.00003069575,0.00005907649,0.000063170046,0.000013276516],"category_scores_gemma":[0.0015148463,0.00011991574,0.00005760031,0.0001542978,0.000046447985,0.00006703534,0.000016088752,0.00005851634,0.0000017882242],"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.00001997741,0.00008713291,0.000021024744,0.00033751462,0.000040079147,9.2269136e-7,0.0001368677,0.002622235,0.000039477687,0.9750844,0.00092324504,0.020687109],"study_design_scores_gemma":[0.00073517254,0.00007740997,0.000035836034,0.000020077961,0.000034017085,0.00000838211,0.000035523335,0.103677094,0.000055638535,0.89105445,0.004123769,0.00014264652],"about_ca_topic_score_codex":7.171811e-7,"about_ca_topic_score_gemma":4.847954e-7,"teacher_disagreement_score":0.101054855,"about_ca_system_score_codex":0.000018366705,"about_ca_system_score_gemma":0.000045094275,"threshold_uncertainty_score":0.4890022},"labels":[],"label_agreement":null},{"id":"W2032620872","doi":"10.1016/j.comgeo.2007.05.007","title":"Algorithms for bivariate zonoid depth","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bivariate analysis; Computational statistics; Computation; Point (geometry); Algorithm; Computer science; Bivariate data; Depth map; Mathematics; Artificial intelligence; Geometry; Image (mathematics); Machine learning","score_opus":0.17155065013434237,"score_gpt":0.4674411748070844,"score_spread":0.295890524672742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032620872","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.0030652778,0.00004927401,0.99462885,0.000076477394,0.0002540747,0.00025037237,0.00006601,0.00007780274,0.0015318701],"genre_scores_gemma":[0.07819956,0.000001016432,0.920944,0.0001974685,0.00019895931,0.00001452283,0.000035992223,0.00002415022,0.00038432938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989313,0.000021424039,0.00031761403,0.00023073363,0.0002188765,0.00028006683],"domain_scores_gemma":[0.99497557,0.00450648,0.00009486959,0.000111249145,0.00019835377,0.000113474445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008148074,0.00011887705,0.00019072618,0.0001421809,0.0001104923,0.00001873268,0.00010424003,0.000061147504,0.000037833062],"category_scores_gemma":[0.0012047498,0.000111250934,0.000074781645,0.00024156648,0.00004240045,0.000065085624,0.00003542305,0.000090245376,0.000014738984],"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.000037132617,0.00008827581,0.000041875373,0.000056575944,0.000031245185,0.000004964681,0.000050917246,0.003073672,0.000045921435,0.8491998,0.000707409,0.1466622],"study_design_scores_gemma":[0.0004800366,0.000060512917,0.0013480474,0.000010361304,0.000017483419,0.000007260194,0.000027222095,0.050637558,0.00014084693,0.9452426,0.0018846384,0.00014344015],"about_ca_topic_score_codex":0.0000014706314,"about_ca_topic_score_gemma":0.000001355488,"teacher_disagreement_score":0.14651877,"about_ca_system_score_codex":0.00003921121,"about_ca_system_score_gemma":0.000030965828,"threshold_uncertainty_score":0.45366815},"labels":[],"label_agreement":null},{"id":"W2038474686","doi":"10.1016/j.comgeo.2008.06.006","title":"The projection median of a set of points","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Manitoba","funders":"","keywords":"Multiset; Mathematics; Projection (relational algebra); Euclidean geometry; Combinatorics; Euclidean distance; Point (geometry); Position (finance); Set (abstract data type); Euclidean distance matrix; Stability (learning theory); Degree (music); Euclidean space; Geometry; Algorithm; Computer science; Physics","score_opus":0.027997817368769874,"score_gpt":0.2614873178029804,"score_spread":0.23348950043421052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038474686","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.26856825,0.0002539703,0.72909766,0.0009197883,0.00044277337,0.00016096642,0.000009143855,0.00003975773,0.0005077029],"genre_scores_gemma":[0.9397646,0.000026717738,0.059873853,0.000068017434,0.000095427706,0.000008579883,0.000028314025,0.0000047858484,0.00012965959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985757,0.00008203856,0.00040931103,0.00020492161,0.0005874989,0.00014055667],"domain_scores_gemma":[0.99830365,0.0006629756,0.00025489103,0.00022127005,0.0005060341,0.000051157225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042681248,0.000094710806,0.00014445734,0.00031109984,0.00024101061,0.000019354238,0.0004329035,0.00004224859,0.000009310787],"category_scores_gemma":[0.00020303462,0.00007628532,0.00008527975,0.0014867757,0.00014009913,0.00024434994,0.00011521523,0.00008366234,0.000014035818],"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.0001088167,0.00042178365,0.011151362,0.00014657067,0.00027015977,0.000018690544,0.0036911678,0.25401568,0.0016358941,0.49652335,0.009810898,0.22220562],"study_design_scores_gemma":[0.0011365216,0.00039247656,0.16988553,0.00004288416,0.000014429542,0.00027577794,0.00011295771,0.6908232,0.008800701,0.122339554,0.0058309473,0.0003449944],"about_ca_topic_score_codex":0.00001104813,"about_ca_topic_score_gemma":0.0000021944052,"teacher_disagreement_score":0.6711964,"about_ca_system_score_codex":0.000025208697,"about_ca_system_score_gemma":0.00025094638,"threshold_uncertainty_score":0.3110825},"labels":[],"label_agreement":null},{"id":"W2042670297","doi":"10.1016/j.comgeo.2014.01.002","title":"Similarity of polygonal curves in the presence of outliers","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Outlier; Similarity (geometry); Mathematics; Measure (data warehouse); Time complexity; Degree (music); Polygonal chain; Polynomial; Combinatorics; Algorithm; Geometry; Computer science; Mathematical analysis; Image (mathematics); Artificial intelligence; Statistics; Data mining; Regular polygon","score_opus":0.008529345386340686,"score_gpt":0.24711355288605213,"score_spread":0.23858420749971146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042670297","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.24034299,0.0006748056,0.7572582,0.00020056509,0.0000319084,0.00009608081,0.000014530696,0.00006120654,0.0013197527],"genre_scores_gemma":[0.98564124,0.00002266079,0.014203578,0.00009682595,0.000011477201,0.0000041881817,0.000011622418,0.0000047634167,0.0000036554889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993654,0.00003722415,0.00021317069,0.00007077748,0.00023735584,0.00007606096],"domain_scores_gemma":[0.999273,0.00051329273,0.000044577228,0.00010371429,0.000050238406,0.000015146263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022837843,0.000057555277,0.00014441338,0.00012527761,0.000009709373,0.0000022009872,0.00018963922,0.000022985427,0.000016689486],"category_scores_gemma":[0.0001861218,0.00004587511,0.000046119985,0.0005896262,0.00007226923,0.000052827225,0.000021917176,0.000094451774,0.000001271965],"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.000004004495,0.00006039353,0.013185814,0.0002014239,0.000024214018,4.2080558e-7,0.000090463276,0.9752354,0.00035914735,0.0036981874,0.0008348885,0.006305627],"study_design_scores_gemma":[0.00020212897,0.00006405789,0.25844526,0.00014726468,0.000020134143,0.0000027148708,0.000063746564,0.67803496,0.0026136215,0.05956353,0.0006629765,0.00017963882],"about_ca_topic_score_codex":0.0000073627125,"about_ca_topic_score_gemma":0.0000012523287,"teacher_disagreement_score":0.7452982,"about_ca_system_score_codex":0.0000099365825,"about_ca_system_score_gemma":0.000005835909,"threshold_uncertainty_score":0.18707326},"labels":[],"label_agreement":null},{"id":"W2044633855","doi":"10.1016/j.comgeo.2010.04.005","title":"Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Combinatorics; Convex hull; Voronoi diagram; Output-sensitive algorithm; Regular polygon; Mathematics; Randomized algorithm; Line segment; Point (geometry); Computational geometry; Algorithm; Computer science; Convex combination; Convex optimization; Geometry","score_opus":0.012891150938118528,"score_gpt":0.2642578783970998,"score_spread":0.25136672745898125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044633855","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.47022694,0.000099665674,0.5284214,0.00046355242,0.00048063314,0.00021119058,0.000007695025,0.000039007627,0.00004989157],"genre_scores_gemma":[0.77237976,0.000007510811,0.22701134,0.00026245887,0.00013522469,0.000037813625,0.00004779764,0.00000810239,0.00011002042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987336,0.00003619391,0.00028230104,0.00048236782,0.00024667557,0.00021890293],"domain_scores_gemma":[0.99898046,0.0004938573,0.000093216935,0.00013156128,0.00018064973,0.00012027289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049520546,0.00016092675,0.00017587698,0.0005065214,0.00016084244,0.00020558888,0.0001768229,0.000091316084,0.000011377765],"category_scores_gemma":[0.00009919471,0.0001730458,0.000037737387,0.0005438649,0.0000702712,0.00042813885,0.00016001616,0.00020362929,0.000005977767],"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.00012581666,0.00054898113,0.0069778003,0.0001981788,0.000131024,0.00002534091,0.0034451876,0.44337642,0.006080793,0.13812329,0.0022124432,0.39875475],"study_design_scores_gemma":[0.0011889217,0.00018086548,0.034979988,0.000014360386,0.0000074984355,0.0001402958,0.000074354124,0.95045274,0.0005199083,0.0106585035,0.0015270067,0.00025552907],"about_ca_topic_score_codex":0.00001304018,"about_ca_topic_score_gemma":0.000016609785,"teacher_disagreement_score":0.5070764,"about_ca_system_score_codex":0.00003905407,"about_ca_system_score_gemma":0.00009161729,"threshold_uncertainty_score":0.70566034},"labels":[],"label_agreement":null},{"id":"W2044936698","doi":"10.1016/j.comgeo.2012.09.007","title":"An in-place min–max priority search tree","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Optimal binary search tree; Heap (data structure); Range tree; Binary search tree; Interval tree; Self-balancing binary search tree; K-ary tree; Binary tree; Tree (set theory); Combinatorics; Search tree; Segment tree; Mathematics; Tree traversal; Data structure; Ternary search tree; Set (abstract data type); Point (geometry); Computer science; Depth-first search; Algorithm; Search algorithm; Tree structure","score_opus":0.02506329569885934,"score_gpt":0.302463652275976,"score_spread":0.27740035657711665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044936698","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.4508454,0.00033662093,0.5469641,0.00033938355,0.00047205188,0.00013568762,0.000004398149,0.00009668355,0.0008056907],"genre_scores_gemma":[0.8737637,0.000004856591,0.12522164,0.00038076847,0.0003617254,0.000012802936,0.00009127455,0.000010824215,0.00015244332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771047,0.00022114988,0.00036685218,0.0004489684,0.00073524634,0.00051732967],"domain_scores_gemma":[0.9986111,0.00041498907,0.000077980345,0.00036314016,0.00023293786,0.00029984413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011664449,0.00019289489,0.00019838117,0.00076568616,0.00017000863,0.00017133454,0.0005356358,0.00009576832,0.000063732754],"category_scores_gemma":[0.00008181017,0.00020936319,0.00006884699,0.002110407,0.000044606004,0.0016784817,0.00017743024,0.00024346399,0.00022431591],"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.000032603017,0.0012854488,0.05928289,0.000047034293,0.00003591485,0.000022823755,0.0019124851,0.5679345,0.0010497591,0.20769885,0.0013403668,0.15935731],"study_design_scores_gemma":[0.0006426681,0.00009054099,0.4796374,0.000012599689,0.000004341832,0.00006959516,0.00004776567,0.50919944,0.00067931775,0.006846777,0.002417031,0.00035252105],"about_ca_topic_score_codex":0.00002033467,"about_ca_topic_score_gemma":0.000008916777,"teacher_disagreement_score":0.42291826,"about_ca_system_score_codex":0.00014179181,"about_ca_system_score_gemma":0.00020913905,"threshold_uncertainty_score":0.85375834},"labels":[],"label_agreement":null},{"id":"W2048246906","doi":"10.1016/s0925-7721(00)00012-2","title":"Reporting curve segment intersections using restricted predicates","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Monotone polygon; Combinatorics; Logarithm; Mathematics; Tree (set theory); Point (geometry); Plane (geometry); Colored; Binary logarithm; Algorithm; Computer science; Geometry; Mathematical analysis; Cartography","score_opus":0.0383713826338252,"score_gpt":0.29601546139881735,"score_spread":0.2576440787649921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048246906","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.38105154,0.00013124637,0.61679965,0.00027652874,0.00034759226,0.00013070727,0.000005738025,0.00021113174,0.0010458584],"genre_scores_gemma":[0.84307736,0.000008733875,0.15569277,0.00031707264,0.00023858542,0.000013602022,0.00010430733,0.000011789303,0.00053574785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749297,0.000094407784,0.0010048203,0.00053528475,0.0005787135,0.00029382308],"domain_scores_gemma":[0.9984963,0.0002480932,0.0005204505,0.0002993951,0.00028771043,0.00014807229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045947699,0.00018456379,0.00020560963,0.0005284756,0.00040430177,0.00022624592,0.0004117141,0.000074048665,0.00035039044],"category_scores_gemma":[0.00027667586,0.00019777626,0.00011907297,0.0022510372,0.000047446785,0.0006308906,0.00012736997,0.00018962874,0.00012364358],"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.000008713964,0.00013133328,0.0017187551,0.000012342923,0.000050420505,0.00002051117,0.00018389273,0.9347217,0.00034965403,0.004279631,0.0011441238,0.057378884],"study_design_scores_gemma":[0.00032861336,0.000068493944,0.039297882,0.000032046668,0.000012756317,0.00023074275,0.000023043605,0.9460429,0.00031420498,0.010820932,0.0025681988,0.00026020012],"about_ca_topic_score_codex":0.00003464353,"about_ca_topic_score_gemma":0.0000017075408,"teacher_disagreement_score":0.46202582,"about_ca_system_score_codex":0.00013585364,"about_ca_system_score_gemma":0.00022353647,"threshold_uncertainty_score":0.8065082},"labels":[],"label_agreement":null},{"id":"W2048913517","doi":"10.1016/j.comgeo.2009.01.001","title":"Point-set embeddings of trees with given partial drawings","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Set (abstract data type); Point (geometry); Mathematics; Combinatorics; Computer science; Geometry; Programming language","score_opus":0.01201913034766168,"score_gpt":0.25304297422726724,"score_spread":0.24102384387960557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048913517","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.21848707,0.00010336229,0.77877843,0.0015069908,0.00013605776,0.0001317365,0.000008774885,0.00010920702,0.0007383473],"genre_scores_gemma":[0.888383,0.0000021625688,0.110656895,0.00059496594,0.00012308122,0.0000048309694,0.000068625835,0.0000070296164,0.00015946716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981963,0.000052284675,0.0003918431,0.00042936023,0.0006723268,0.0002579108],"domain_scores_gemma":[0.99876887,0.00025097866,0.00022649406,0.000255435,0.00037562818,0.00012257333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029375538,0.0001910722,0.0002498902,0.0004904116,0.00014776738,0.000121634606,0.0005067635,0.00006119188,0.00004236303],"category_scores_gemma":[0.000067379304,0.00017561442,0.00009339268,0.0015481698,0.00006752354,0.0007089081,0.00008099173,0.0001245134,0.000033691525],"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.00008862963,0.000322997,0.0015061605,0.000025623236,0.000082077895,0.000035972324,0.000897414,0.7213347,0.0013216805,0.21272613,0.004419376,0.057239268],"study_design_scores_gemma":[0.002381375,0.0016788683,0.15758705,0.000113908274,0.000041530195,0.00027158327,0.00009498442,0.7050607,0.0088789575,0.11796475,0.0050735385,0.00085274415],"about_ca_topic_score_codex":0.000004924688,"about_ca_topic_score_gemma":0.0000013135353,"teacher_disagreement_score":0.6698959,"about_ca_system_score_codex":0.000038869155,"about_ca_system_score_gemma":0.00015713602,"threshold_uncertainty_score":0.7161348},"labels":[],"label_agreement":null},{"id":"W2049284557","doi":"10.1016/s0925-7721(01)00069-4","title":"On embedding an outer-planar graph in a point set","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Embedding; Mathematics; Time complexity; Planar graph; Disjoint sets; Vertex (graph theory); Line segment; Regular polygon; General position; Graph; Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.0317632476759565,"score_gpt":0.27932713611558885,"score_spread":0.24756388843963234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049284557","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.2626858,0.00015030337,0.73429763,0.00086417457,0.00045011318,0.0001599295,0.000012751617,0.00015902673,0.0012202776],"genre_scores_gemma":[0.9347706,0.000006470198,0.063301794,0.0015021354,0.00012355854,0.000017100852,0.000101920756,0.000012562767,0.00016385203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795306,0.00012898036,0.00039400478,0.00059947115,0.00059759856,0.00032690182],"domain_scores_gemma":[0.99884295,0.0004221232,0.000110267625,0.0003314949,0.00013006243,0.00016310425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039409357,0.00021082208,0.00020107039,0.0012425674,0.00016900389,0.00021370217,0.00055602763,0.0000798598,0.00015733924],"category_scores_gemma":[0.000092645634,0.00022495224,0.000080752565,0.0019420722,0.000031501735,0.00082143425,0.0000782042,0.00022127357,0.0003085804],"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.000009249118,0.00030680152,0.00041782,0.0000113357055,0.000016042293,0.00006928652,0.00065174693,0.82900465,0.000038468075,0.13792886,0.0032284423,0.028317295],"study_design_scores_gemma":[0.0006092576,0.0002085904,0.009273011,0.00002526112,0.0000024973328,0.00006446323,0.000028082113,0.8827949,0.00004492256,0.10609277,0.00057601905,0.0002801978],"about_ca_topic_score_codex":0.000009315338,"about_ca_topic_score_gemma":0.0000057575894,"teacher_disagreement_score":0.6720848,"about_ca_system_score_codex":0.00009090303,"about_ca_system_score_gemma":0.000034327863,"threshold_uncertainty_score":0.9173286},"labels":[],"label_agreement":null},{"id":"W2049364904","doi":"10.1016/s0925-7721(01)00044-x","title":"Packing two disks in a polygon","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polygon (computer graphics); Computer science; Combinatorics; Mathematics; Computer network","score_opus":0.028570814928890326,"score_gpt":0.26355514852086215,"score_spread":0.23498433359197182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049364904","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.19890116,0.00069012895,0.7949995,0.0012382991,0.000473529,0.00014113686,0.0000037135692,0.00014931906,0.0034032296],"genre_scores_gemma":[0.94456697,0.000009702458,0.05426027,0.00062463386,0.00016109803,0.000014402867,0.000026437549,0.0000095411115,0.00032695362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982937,0.000082103536,0.00036060112,0.0004557102,0.00049885217,0.0003090219],"domain_scores_gemma":[0.99909496,0.0003352718,0.000097622535,0.000245214,0.000119524484,0.00010737743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002941352,0.0001651744,0.00017005159,0.00078326627,0.00013816169,0.00018392374,0.00047596684,0.000050984047,0.0001613763],"category_scores_gemma":[0.000095905445,0.000179349,0.00007458532,0.0022785065,0.00003203644,0.00063710817,0.00017313533,0.00018239107,0.00031008772],"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.0000048471497,0.00027650932,0.005718912,0.000015345238,0.00001975141,0.00004572086,0.00052782334,0.65719527,0.00018513913,0.15344904,0.0017176509,0.180844],"study_design_scores_gemma":[0.0007576858,0.000041762563,0.035555232,0.000020682004,0.0000023952434,0.000048719005,0.00001215424,0.92672586,0.00014821385,0.03467148,0.0017666748,0.00024911365],"about_ca_topic_score_codex":0.000015277039,"about_ca_topic_score_gemma":0.0000069635694,"teacher_disagreement_score":0.7456658,"about_ca_system_score_codex":0.000091461916,"about_ca_system_score_gemma":0.000037916132,"threshold_uncertainty_score":0.731364},"labels":[],"label_agreement":null},{"id":"W2049799129","doi":"10.1016/j.comgeo.2007.11.002","title":"On the degree of standard geometric predicates for line transversals in 3D","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Transversal (combinatorics); Line (geometry); Point (geometry); Degree (music); Computer science; Line segment; Algorithm; Mathematics; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.06713992550154395,"score_gpt":0.27276929928670535,"score_spread":0.20562937378516138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049799129","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.22007677,0.00027579375,0.7776728,0.0011011184,0.00019568455,0.00035775296,0.000049582988,0.000040026964,0.00023042332],"genre_scores_gemma":[0.93057513,0.000021685357,0.06872513,0.00039768478,0.00007619107,0.00004696812,0.00006044092,0.000009457795,0.00008729141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815935,0.00007779484,0.00048205964,0.0003590717,0.00068488496,0.00023682653],"domain_scores_gemma":[0.9960932,0.0030409098,0.00017089394,0.00025305725,0.0003754676,0.00006646438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140323,0.00015944493,0.00024646372,0.001071804,0.00018806136,0.000032458687,0.0005967258,0.000068328256,0.00003925357],"category_scores_gemma":[0.00057861145,0.00012830482,0.00011823685,0.0031790496,0.00009762952,0.0002242868,0.000067320354,0.00014099355,0.000013622322],"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.00011039197,0.00026395376,0.0009579201,0.000043213942,0.000049238155,0.0000069656357,0.00032000305,0.8703381,0.00007740594,0.09025363,0.003269886,0.034309335],"study_design_scores_gemma":[0.0030650855,0.0012856515,0.085018285,0.00008102511,0.000017618608,0.000055931476,0.000033599583,0.7892112,0.0054753935,0.11284776,0.002433472,0.0004749779],"about_ca_topic_score_codex":0.0000051922366,"about_ca_topic_score_gemma":0.0000019621907,"teacher_disagreement_score":0.7104984,"about_ca_system_score_codex":0.000063257794,"about_ca_system_score_gemma":0.00023948512,"threshold_uncertainty_score":0.52321184},"labels":[],"label_agreement":null},{"id":"W2050004894","doi":"10.1016/s0925-7721(00)00009-2","title":"Planar segment visibility graphs","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Combinatorics; Visibility graph; Planar graph; Line segment; Mathematics; Visibility; Disjoint sets; Discrete mathematics; Computer science; Graph; Regular polygon; Geometry; Physics; Optics","score_opus":0.012774974049465955,"score_gpt":0.24702420002455105,"score_spread":0.2342492259750851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050004894","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.22371635,0.00030325743,0.7693902,0.00086900033,0.00035549546,0.00019392582,0.0000139497715,0.00027680944,0.0048809634],"genre_scores_gemma":[0.87365085,0.000013361402,0.12365764,0.0013190258,0.00012530445,0.000017489803,0.0001379563,0.000009646253,0.0010687131],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800235,0.00009115945,0.00037839936,0.00057838793,0.0006561981,0.0002935052],"domain_scores_gemma":[0.9989508,0.00025631167,0.00007336819,0.00037847928,0.00017324771,0.00016781467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039437765,0.0001901739,0.0001775754,0.00035330793,0.0002664927,0.00018830334,0.0005876274,0.00006765755,0.00072230905],"category_scores_gemma":[0.000032170836,0.00019611485,0.00011970995,0.001579245,0.00004953493,0.0005545862,0.0000648416,0.00014444606,0.0007278543],"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.000022394046,0.00029367115,0.0011935043,0.000019538717,0.000054370455,0.000018085208,0.00016866223,0.38620457,0.00010421135,0.2018357,0.005796612,0.40428868],"study_design_scores_gemma":[0.0009259762,0.00017773552,0.11518694,0.000018726249,0.0000114024415,0.00009716153,0.000011454988,0.41791275,0.00026996303,0.4421356,0.022692403,0.0005598846],"about_ca_topic_score_codex":0.000008375965,"about_ca_topic_score_gemma":0.0000012959911,"teacher_disagreement_score":0.64993453,"about_ca_system_score_codex":0.00006941614,"about_ca_system_score_gemma":0.00012244139,"threshold_uncertainty_score":0.93553376},"labels":[],"label_agreement":null},{"id":"W2053814689","doi":"10.1016/s0925-7721(01)00036-0","title":"Polygons cuttable by a circular saw","year":2001,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Circular saw; Polygon (computer graphics); Regular polygon; Mathematics; Geometry; Rest (music); Projection (relational algebra); Combinatorics; Computer science; Algorithm; Physics; Acoustics; Telecommunications","score_opus":0.011290610468569318,"score_gpt":0.2387709060715044,"score_spread":0.22748029560293506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053814689","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.052525192,0.0012382251,0.94011754,0.0017492664,0.00049948646,0.00015060454,0.000014886757,0.00026303314,0.003441749],"genre_scores_gemma":[0.9290631,0.000032255266,0.0663484,0.0019326194,0.00021372475,0.00002314965,0.00024770686,0.00001711787,0.0021219284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796885,0.00007403529,0.00035052578,0.00055331487,0.0006676562,0.0003856374],"domain_scores_gemma":[0.9988144,0.0002609875,0.000115758034,0.00034726143,0.00026102888,0.0002005645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031333623,0.00020727837,0.00019416667,0.0004472575,0.00032504354,0.00027193967,0.00066249084,0.000084323525,0.0001798338],"category_scores_gemma":[0.00008136859,0.00022727909,0.0001121039,0.0022972906,0.000046820463,0.00073610584,0.00019350728,0.00016434412,0.0004345592],"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.000025826339,0.0007530666,0.005433383,0.00004046138,0.00018162487,0.00009752669,0.00030366675,0.5173308,0.003107168,0.22519961,0.13563743,0.11188944],"study_design_scores_gemma":[0.0011092367,0.00014004244,0.013378512,0.000021061063,0.000017207216,0.00041722786,0.000027506469,0.665841,0.0007042871,0.07961089,0.23800628,0.0007267654],"about_ca_topic_score_codex":0.000017399758,"about_ca_topic_score_gemma":8.32475e-7,"teacher_disagreement_score":0.8765379,"about_ca_system_score_codex":0.00008622147,"about_ca_system_score_gemma":0.00016520162,"threshold_uncertainty_score":0.9268172},"labels":[],"label_agreement":null},{"id":"W2054389590","doi":"10.1016/j.comgeo.2006.12.002","title":"An optimal randomized algorithm for d-variate zonoid depth","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Random variate; Algorithm; Multivariate statistics; Computation; Mathematics; Randomized algorithm; Lift (data mining); Computer science; Statistics; Random variable; Data mining","score_opus":0.07423469883466306,"score_gpt":0.43871450110572796,"score_spread":0.3644798022710649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054389590","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.0028350363,0.000059552087,0.9955,0.00003313067,0.0002274694,0.0005927102,0.000089729896,0.00009751144,0.0005648293],"genre_scores_gemma":[0.03650035,0.0000016983699,0.96277636,0.00016761644,0.00023656411,0.00004460808,0.000094855895,0.00003306841,0.00014490499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985107,0.000105690255,0.0004921129,0.00030026637,0.0002690698,0.00032213237],"domain_scores_gemma":[0.99063516,0.008617675,0.00015311014,0.00014850397,0.000273926,0.00017162468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023455464,0.00016494779,0.00046631688,0.00016580295,0.00013236328,0.000034854722,0.00013990712,0.000081638034,0.000061515326],"category_scores_gemma":[0.0014194578,0.0001459665,0.00014591691,0.00020110798,0.00009931683,0.0001280335,0.000028136707,0.00011385152,0.000007760338],"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.0032384356,0.00021622764,0.000003751527,0.000040281542,0.000086084234,0.000007903365,0.00012108879,0.018308276,0.000025763366,0.55287355,0.0001499443,0.4249287],"study_design_scores_gemma":[0.015307809,0.000054406846,0.000058460406,0.0000063800017,0.000034603458,0.0000060407287,0.000027316057,0.43228328,0.000078045014,0.5518951,0.0001239018,0.00012467305],"about_ca_topic_score_codex":0.0000017795298,"about_ca_topic_score_gemma":6.8217673e-7,"teacher_disagreement_score":0.42480403,"about_ca_system_score_codex":0.00003791336,"about_ca_system_score_gemma":0.000042468524,"threshold_uncertainty_score":0.59523416},"labels":[],"label_agreement":null},{"id":"W2054701324","doi":"10.1016/j.comgeo.2008.12.004","title":"Editorial CCCG 2006","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science","score_opus":0.0349643125316501,"score_gpt":0.20588758683607455,"score_spread":0.17092327430442444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054701324","genre_codex":"other","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.08629193,0.0018391608,0.009194955,0.00033783013,0.27298725,0.00019295143,0.001111481,0.00014694993,0.6278975],"genre_scores_gemma":[0.7525951,0.00011549343,0.004842275,0.0006300587,0.04324461,0.000019859486,0.00012800342,0.000031125663,0.19839342],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991138,0.0000036543531,0.00032158638,0.00031211323,0.00005527382,0.00019354932],"domain_scores_gemma":[0.9995666,0.0000657128,0.00013197528,0.00012307128,0.000050577266,0.00006204187],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022607626,0.00009215643,0.00020973287,0.00024285003,0.00022957295,0.000033102027,0.00015624127,0.000053529096,0.0042598997],"category_scores_gemma":[0.000087455075,0.00011256596,0.00008857074,0.00027842802,0.00012217158,0.00017040153,0.00007440764,0.00007750082,0.032633673],"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.0000044441276,0.000038006074,0.010866795,0.0000028309116,0.00003066048,0.0000016408575,0.00012837522,0.0035682076,2.2636253e-7,0.040537197,0.94476026,0.00006133142],"study_design_scores_gemma":[0.00049278664,0.000016367698,0.018651025,0.0000019736074,0.0000016795814,0.000006145567,0.00004533595,0.0016556733,0.00000152184,0.023053454,0.9558956,0.00017842223],"about_ca_topic_score_codex":0.000034358807,"about_ca_topic_score_gemma":3.8356444e-7,"teacher_disagreement_score":0.6663032,"about_ca_system_score_codex":0.000057503163,"about_ca_system_score_gemma":0.000022560458,"threshold_uncertainty_score":0.99665034},"labels":[],"label_agreement":null},{"id":"W2054932997","doi":"10.1016/j.comgeo.2004.11.003","title":"Computing straight-line 3D grid drawings of graphs in linear volume","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Grid; Volume (thermodynamics); Computer science; Constant (computer programming); Line (geometry); Queue; Focus (optics); Relevance (law); Graph drawing; Line segment; Mathematics; Theoretical computer science; Geometry; Graph; Artificial intelligence","score_opus":0.014323910653175915,"score_gpt":0.2790448373949305,"score_spread":0.2647209267417546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054932997","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.088681966,0.00021882323,0.9081303,0.00054933614,0.00016725321,0.00010617455,0.000008531182,0.0003191111,0.0018185055],"genre_scores_gemma":[0.54652905,0.0000012626068,0.4531101,0.00020233732,0.000060835628,0.0000015221435,0.000014266571,0.000008210247,0.00007237624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982661,0.000031661402,0.0005522616,0.00039830475,0.0004700087,0.0002816359],"domain_scores_gemma":[0.9989836,0.00018403352,0.00021786476,0.00025330804,0.0002857616,0.000075416014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040365534,0.00017058042,0.00025499953,0.0007200969,0.00006115951,0.00015488759,0.0008492308,0.000067007066,0.000018380906],"category_scores_gemma":[0.00011832119,0.00018359731,0.00007653361,0.001677838,0.00011451675,0.0011392464,0.00036833814,0.00019986535,0.00003582399],"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.000015486816,0.0008666275,0.0121639175,0.00018476407,0.000044110562,0.000039456307,0.00084918644,0.32489157,0.000542224,0.038495906,0.0034407694,0.618466],"study_design_scores_gemma":[0.00034467713,0.00008194905,0.016175065,0.00011013151,0.0000029874288,0.000026559908,0.000006281743,0.9551926,0.0013973297,0.025284203,0.0011253728,0.00025283947],"about_ca_topic_score_codex":0.000010221342,"about_ca_topic_score_gemma":0.000001740157,"teacher_disagreement_score":0.63030106,"about_ca_system_score_codex":0.00005340769,"about_ca_system_score_gemma":0.000117942356,"threshold_uncertainty_score":0.74868804},"labels":[],"label_agreement":null},{"id":"W2055614976","doi":"10.1016/j.comgeo.2013.11.001","title":"Reprint of: Refold rigidity of convex polyhedra","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Dodecahedron; Tetrahedron; Regular polygon; Convex polytope; Combinatorics; Enhanced Data Rates for GSM Evolution; Rigidity (electromagnetism); Mathematics; Geometry; Computer science; Materials science; Convex set; Artificial intelligence; Convex optimization","score_opus":0.006906742510965632,"score_gpt":0.19990528573536054,"score_spread":0.19299854322439491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055614976","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.83184636,0.000112302936,0.16680865,0.000014419162,0.0002922128,0.00007880632,0.000017932705,0.000053179985,0.0007761182],"genre_scores_gemma":[0.9773961,0.00001340403,0.022485713,0.000014605776,0.000031529802,0.0000047483504,0.000014080373,0.000009977276,0.000029886714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995013,0.000005810481,0.00022619823,0.00007535441,0.00011018709,0.00008116632],"domain_scores_gemma":[0.9996536,0.00005286346,0.00005479212,0.000108336804,0.000097404816,0.00003300163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006041531,0.000061261584,0.00014378599,0.00007014357,0.000009829038,0.000004299588,0.00007090855,0.000035467914,0.00029114287],"category_scores_gemma":[0.000026949263,0.000060848284,0.000031813117,0.0001249474,0.000018893934,0.000067093875,0.000031188432,0.00003903557,0.000039823284],"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.000008220748,0.0000662053,0.0004330394,0.00041804128,0.0000713462,0.0000013787035,0.00009437514,0.73432934,0.20650823,0.045964874,0.0009825099,0.011122437],"study_design_scores_gemma":[0.0008932565,0.00010946792,0.050614595,0.000115013834,0.000023012602,0.000014830989,0.00011043967,0.21767542,0.5030735,0.22469825,0.0022056513,0.00046653522],"about_ca_topic_score_codex":0.000011445827,"about_ca_topic_score_gemma":1.3576613e-7,"teacher_disagreement_score":0.5166539,"about_ca_system_score_codex":0.000015256946,"about_ca_system_score_gemma":0.000010597817,"threshold_uncertainty_score":0.31878105},"labels":[],"label_agreement":null},{"id":"W2055900608","doi":"10.1016/j.comgeo.2013.05.007","title":"Streaming and dynamic algorithms for minimum enclosing balls in high dimensions","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ball (mathematics); Combinatorics; Mathematics; Euclidean space; Upper and lower bounds; Amortized analysis; Space (punctuation); Algorithm; Computer science; Discrete mathematics; Data structure; Geometry; Mathematical analysis","score_opus":0.01305817402274844,"score_gpt":0.26005150553927714,"score_spread":0.2469933315165287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055900608","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.41488558,0.0002390018,0.5836765,0.0005692116,0.00024113352,0.00029403233,0.000008048285,0.000046851674,0.000039617098],"genre_scores_gemma":[0.69908667,0.0000075462144,0.30034196,0.00026806048,0.000048698876,0.000055182576,0.00008173433,0.000008182049,0.00010192912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855137,0.000046719142,0.00035005805,0.0004830789,0.0002844417,0.00028432152],"domain_scores_gemma":[0.9985115,0.0008792733,0.00009900388,0.00015873778,0.00023836667,0.00011314048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025303598,0.00016603738,0.00018922344,0.0005909658,0.0001943058,0.00022385271,0.00024676885,0.00007008992,0.00002270512],"category_scores_gemma":[0.00011147194,0.0001759595,0.000048495956,0.00088938646,0.00004131322,0.00067391864,0.00017249802,0.000105066596,0.00002710375],"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.000011447184,0.0003387695,0.0027754302,0.000091099224,0.0000667938,0.000010832765,0.00051123236,0.4775511,0.0029562435,0.09758825,0.0013080684,0.41679072],"study_design_scores_gemma":[0.0005793627,0.00006286735,0.08414388,0.000026251118,0.000004129054,0.000017438124,0.0000307763,0.8345898,0.00007487795,0.08013679,0.00014337712,0.00019045429],"about_ca_topic_score_codex":0.00003534248,"about_ca_topic_score_gemma":0.0000046496875,"teacher_disagreement_score":0.4166003,"about_ca_system_score_codex":0.000073290226,"about_ca_system_score_gemma":0.000089961475,"threshold_uncertainty_score":0.71754205},"labels":[],"label_agreement":null},{"id":"W2056371677","doi":"10.1016/j.comgeo.2012.04.004","title":"Oja centers and centers of gravity","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Center of gravity; Geodesy; Geology; Economics; Management","score_opus":0.09178950654666629,"score_gpt":0.40664649508715517,"score_spread":0.3148569885404889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056371677","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.2261037,0.00010305634,0.7732133,0.000037678594,0.00010961256,0.000061902,0.000044399185,0.000013552575,0.00031280646],"genre_scores_gemma":[0.5779082,0.00000290164,0.4219808,0.000045717083,0.000023073922,0.0000014066644,0.0000066225984,0.0000056898475,0.000025608355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934345,0.00004479013,0.00018616988,0.00009917775,0.00016582898,0.00016054904],"domain_scores_gemma":[0.998737,0.000947676,0.000080778045,0.00007078346,0.00005878347,0.000104973966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023573282,0.00007608973,0.0001569073,0.00007333755,0.0000362873,0.0000049752034,0.00004680025,0.000027943504,0.00002849798],"category_scores_gemma":[0.00035459702,0.000069573005,0.000033280234,0.00010936303,0.00007975626,0.00008726989,0.000048537473,0.00006322551,0.0000026779715],"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.000035428646,0.0002998242,0.02150116,0.00023271846,0.000057667567,0.0000012809259,0.00032883257,0.00064064283,0.0002541746,0.9502891,0.00065392174,0.025705284],"study_design_scores_gemma":[0.00040728415,0.000037165886,0.04317273,0.00003264932,0.00002552573,0.000010045415,0.000081137834,0.0036543114,0.00015879133,0.9519339,0.0003592063,0.00012720826],"about_ca_topic_score_codex":0.0000028004388,"about_ca_topic_score_gemma":1.5205714e-7,"teacher_disagreement_score":0.3518045,"about_ca_system_score_codex":0.000014875036,"about_ca_system_score_gemma":0.0000074691357,"threshold_uncertainty_score":0.28371048},"labels":[],"label_agreement":null},{"id":"W2058031318","doi":"10.1016/j.comgeo.2015.01.004","title":"Reprint of: Weighted straight skeletons in the plane","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Skeleton (computer programming); Polygon (computer graphics); Regular polygon; Combinatorics; Mathematics; Convex polygon; Point (geometry); Ambiguity; Computer science; Geometry","score_opus":0.03373641393220492,"score_gpt":0.27276727658897404,"score_spread":0.23903086265676912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058031318","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.22867474,0.0002318303,0.7645862,0.0018016616,0.00033716316,0.00018656076,0.00000829699,0.000049646478,0.0041238884],"genre_scores_gemma":[0.92465645,0.0000024847525,0.074694455,0.00038313196,0.00008945218,0.000011514134,0.00007148988,0.000004277783,0.000086765685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830294,0.00015298842,0.00039785812,0.00029747433,0.00067214033,0.00017662303],"domain_scores_gemma":[0.99870825,0.0004997492,0.00013566672,0.0003190677,0.00025657378,0.0000806674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009454072,0.00011707731,0.00015253543,0.00044252328,0.00006081704,0.0000728528,0.0007343458,0.00005073454,0.000023924475],"category_scores_gemma":[0.00013696992,0.00009346366,0.000056753808,0.0019050514,0.000048863727,0.00026973453,0.00013274583,0.00015485291,0.000051914587],"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.000017733479,0.00035212646,0.0025823698,0.000019106332,0.000027850418,0.00003280424,0.0016099621,0.3985497,0.000095230236,0.564511,0.005050495,0.027151594],"study_design_scores_gemma":[0.001610693,0.00025641173,0.17449786,0.000035369412,0.0000102918875,0.00018617771,0.00025085133,0.53397655,0.0006482947,0.2763271,0.011798197,0.00040222122],"about_ca_topic_score_codex":0.000015412714,"about_ca_topic_score_gemma":0.000005361838,"teacher_disagreement_score":0.6959817,"about_ca_system_score_codex":0.000044758708,"about_ca_system_score_gemma":0.00025020482,"threshold_uncertainty_score":0.38113376},"labels":[],"label_agreement":null},{"id":"W2059932006","doi":"10.1016/j.comgeo.2009.03.004","title":"On the dilation spectrum of paths, cycles, and trees","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Combinatorics; Dilation (metric space); Mathematics; Vertex (graph theory); Euclidean space; Shortest path problem; Distance; Graph; Discrete mathematics","score_opus":0.013089864428806676,"score_gpt":0.2360567726727568,"score_spread":0.22296690824395013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059932006","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.3905353,0.00023430797,0.6028824,0.0050430205,0.00013828413,0.0001337594,0.000005415303,0.00005305794,0.00097445527],"genre_scores_gemma":[0.98852426,0.0000094108655,0.01037535,0.00091922155,0.00007506003,0.0000028201841,0.000023206643,0.0000034598356,0.00006720312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988917,0.00006506674,0.0002449989,0.00025786992,0.0004090152,0.00013132984],"domain_scores_gemma":[0.998871,0.0006580377,0.00012718241,0.0001992991,0.00009315087,0.000051276274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003083101,0.00011483641,0.00012152979,0.00027107916,0.00016123235,0.00008303211,0.00027581851,0.00003843543,0.000019474346],"category_scores_gemma":[0.00010863086,0.00008881818,0.000049139755,0.00080789503,0.00004313398,0.0002241196,0.00005449728,0.0000972272,0.000015285359],"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.0000084359235,0.00007750299,0.00023466541,0.00000324168,0.000010279025,0.0000013769229,0.00010608305,0.14768592,0.00016372574,0.8073848,0.0007769904,0.04354699],"study_design_scores_gemma":[0.00021668203,0.00019274783,0.27727845,0.000015527672,0.000003984103,0.000012913898,0.000009285474,0.27140296,0.00048678962,0.4500146,0.00025333525,0.000112711576],"about_ca_topic_score_codex":0.0000023571347,"about_ca_topic_score_gemma":8.5011624e-7,"teacher_disagreement_score":0.59798896,"about_ca_system_score_codex":0.000021254958,"about_ca_system_score_gemma":0.000049127368,"threshold_uncertainty_score":0.36219004},"labels":[],"label_agreement":null},{"id":"W2061541114","doi":"10.1016/s0925-7721(03)00027-0","title":"Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Combinatorics; Quadrilateral; Planar graph; Vertex (graph theory); Mathematics; Diagonal; Monochromatic color; Graph; Vertex cover; Plane (geometry); Time complexity; Algorithm; Geometry; Physics","score_opus":0.02691526093557751,"score_gpt":0.27247619229613457,"score_spread":0.24556093136055707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061541114","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.19632323,0.0007550025,0.8016069,0.00025270617,0.00050932594,0.00023582304,0.00002481315,0.00012328466,0.00016889993],"genre_scores_gemma":[0.5686304,0.0000049764067,0.43091336,0.00022071815,0.000054831027,0.000019740059,0.000048474787,0.000010366354,0.000097125136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982998,0.000072708506,0.0003465494,0.0005685548,0.0003636389,0.00034874247],"domain_scores_gemma":[0.99845695,0.0008152421,0.00012695167,0.00018522683,0.00024909878,0.00016650892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000590833,0.00022261003,0.00022404199,0.00052213727,0.0004937786,0.00029985714,0.00023881641,0.000085548185,0.000010880179],"category_scores_gemma":[0.00015981439,0.00023485014,0.00010516113,0.0010566965,0.00006545999,0.00057076255,0.000064064945,0.000120189725,0.000013349759],"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.000015182785,0.00009326908,0.0011457967,0.000039593117,0.00009404077,0.000080013946,0.00028256845,0.26880068,0.00012024989,0.697609,0.001160104,0.030559484],"study_design_scores_gemma":[0.0010953046,0.00019236359,0.0046355445,0.000015715166,0.000021884658,0.0018400231,0.000115208764,0.817685,0.0003295464,0.1700687,0.0035170957,0.00048361378],"about_ca_topic_score_codex":0.000007419782,"about_ca_topic_score_gemma":0.0000018266275,"teacher_disagreement_score":0.54888433,"about_ca_system_score_codex":0.000038075323,"about_ca_system_score_gemma":0.00011183863,"threshold_uncertainty_score":0.9576911},"labels":[],"label_agreement":null},{"id":"W2063175732","doi":"10.1016/j.comgeo.2007.02.004","title":"Rotationally monotone polygons","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Monotone polygon; Polygon (computer graphics); Combinatorics; Regular polygon; Mathematics; Rotation (mathematics); Monotonic function; Polygon covering; Vertex (graph theory); Boundary (topology); Simple polygon; Plane (geometry); Geometry; Point (geometry); Rectilinear polygon; Mathematical analysis; Computer science","score_opus":0.011147498080292442,"score_gpt":0.2599381773873148,"score_spread":0.24879067930702234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063175732","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.064106405,0.00026720908,0.92913014,0.0009816298,0.00063017634,0.00017548213,0.0000066829707,0.00026419564,0.004438114],"genre_scores_gemma":[0.75117135,0.0000029433563,0.2467815,0.0011128755,0.00024983173,0.000008797882,0.00010185238,0.000010947769,0.00055990217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978182,0.00004319659,0.00047732683,0.0004886402,0.0007863008,0.00038636912],"domain_scores_gemma":[0.9982096,0.0006923954,0.0001511166,0.0002906482,0.00044202193,0.00021422672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008683627,0.00019466558,0.00016709606,0.0007950535,0.0002963311,0.00017784648,0.00060994644,0.00008307726,0.00008219477],"category_scores_gemma":[0.00014585166,0.00021235541,0.0001110237,0.0020811518,0.000052210053,0.0006723824,0.00018281561,0.00017055555,0.00036190185],"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.000019157751,0.00019304895,0.0014059969,0.00001147185,0.000052234245,0.000031435276,0.00019076029,0.20477512,0.0006427174,0.70511746,0.0025803673,0.08498021],"study_design_scores_gemma":[0.0012822696,0.00017313815,0.3661807,0.000022452949,0.000014708453,0.00021595536,0.000050818297,0.3698164,0.0022612642,0.23953341,0.019652031,0.00079689146],"about_ca_topic_score_codex":0.000006736874,"about_ca_topic_score_gemma":0.0000039279594,"teacher_disagreement_score":0.68706495,"about_ca_system_score_codex":0.00009516677,"about_ca_system_score_gemma":0.00020430503,"threshold_uncertainty_score":0.8659603},"labels":[],"label_agreement":null},{"id":"W2064761790","doi":"10.1016/j.comgeo.2013.03.004","title":"Efficient reconfiguration of lattice-based modular robots","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Control reconfiguration; Self-reconfiguring modular robot; Modular design; Robot; Lattice (music); Computer science; Class (philosophy); Topology (electrical circuits); Algorithm; Mathematics; Mobile robot; Combinatorics; Embedded system; Artificial intelligence; Robot control; Programming language; Physics","score_opus":0.012773948867572308,"score_gpt":0.212029483056795,"score_spread":0.1992555341892227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064761790","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.43449888,0.00012918666,0.5643639,0.000036540674,0.00014414843,0.00010252299,0.0000035727833,0.000055849632,0.00066540285],"genre_scores_gemma":[0.9802025,0.0000016202517,0.019619703,0.000044973014,0.000033349617,0.00001264218,0.000036045854,0.00001399452,0.000035153633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993082,0.00001307067,0.00023866487,0.000114043825,0.00020384588,0.00012214769],"domain_scores_gemma":[0.9995493,0.00009021051,0.00003720831,0.000116385476,0.00015706857,0.000049819842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007794177,0.00009119952,0.00011645857,0.00016314606,0.000029143635,0.000022289221,0.0000938991,0.00004633948,0.00054806034],"category_scores_gemma":[0.000025500432,0.00009155025,0.00004633397,0.00027052534,0.00002567039,0.00003927185,0.000008263204,0.000069442314,0.00021377775],"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":[9.58487e-7,0.000024349254,0.0001648604,0.000044661097,0.000013825379,4.867804e-7,0.000026318823,0.98882115,0.0011186094,0.00094445696,0.00019544597,0.008644884],"study_design_scores_gemma":[0.00009524576,0.000016674196,0.014238566,0.00001913372,0.0000042410143,0.0000013389124,0.000009687879,0.9804048,0.003846575,0.001217956,0.000047254933,0.000098554985],"about_ca_topic_score_codex":0.000013177427,"about_ca_topic_score_gemma":3.299344e-7,"teacher_disagreement_score":0.54570365,"about_ca_system_score_codex":0.00002821359,"about_ca_system_score_gemma":0.000017129365,"threshold_uncertainty_score":0.60008764},"labels":[],"label_agreement":null},{"id":"W2065425028","doi":"10.1016/j.comgeo.2008.11.002","title":"Guarding curvilinear art galleries with vertex or point guards","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Polygon (computer graphics); Regular polygon; Vertex (graph theory); Curvilinear coordinates; Point in polygon; Piecewise; Mathematics; Combinatorics; Rectilinear polygon; Convex polygon; Upper and lower bounds; Point (geometry); Piecewise linear function; Simple polygon; Geometry; Computer science; Graph; Mathematical analysis","score_opus":0.024139722392521393,"score_gpt":0.24335944716401192,"score_spread":0.21921972477149054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065425028","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.083951876,0.00016896836,0.91064286,0.0009401399,0.0004621858,0.00019404503,0.000008551237,0.00029148188,0.0033398669],"genre_scores_gemma":[0.7563374,0.000024819217,0.23945506,0.0009877646,0.00022652793,0.000025112535,0.00012551175,0.000021638847,0.0027961393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765885,0.00007611885,0.0003988878,0.00059315807,0.0009158869,0.00035710653],"domain_scores_gemma":[0.99838525,0.0004452754,0.00014770965,0.00036044288,0.00049066474,0.00017067963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002980401,0.0002671486,0.00028083025,0.00051546557,0.00050798967,0.00015899964,0.00055059785,0.000074092226,0.00021117412],"category_scores_gemma":[0.00014298793,0.00021845108,0.00009669381,0.0019646937,0.00012771352,0.000926448,0.00020801589,0.00019409526,0.00040378395],"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.000232706,0.00039668477,0.0035985745,0.000064754575,0.00021965626,0.00039532257,0.0009888129,0.8523734,0.00013583394,0.0637045,0.054818828,0.02307093],"study_design_scores_gemma":[0.002741774,0.0009990638,0.071244165,0.00010379536,0.000027878841,0.0029217002,0.000119154174,0.8374581,0.0008449316,0.014807768,0.06745624,0.0012754347],"about_ca_topic_score_codex":0.000004289582,"about_ca_topic_score_gemma":0.0000036125962,"teacher_disagreement_score":0.6723856,"about_ca_system_score_codex":0.00008365877,"about_ca_system_score_gemma":0.00050152314,"threshold_uncertainty_score":0.89081764},"labels":[],"label_agreement":null},{"id":"W2065822517","doi":"10.1016/j.comgeo.2005.11.005","title":"Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partition (number theory); Convex hull; Simple (philosophy); Extreme point; Regular polygon; Combinatorics; SIMPLE algorithm; Mathematics; Algorithm; Line segment; Space (punctuation); Time complexity; Convex combination; Line (geometry); Computer science; Convex optimization; Geometry; Physics","score_opus":0.01676834318866831,"score_gpt":0.2747161326910761,"score_spread":0.25794778950240776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065822517","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.18343599,0.00026966867,0.81439227,0.0009782658,0.0002974721,0.0003866849,0.00003961551,0.000056574914,0.00014344254],"genre_scores_gemma":[0.85049886,8.4491336e-7,0.14841758,0.00024423795,0.0003740252,0.000014958402,0.0002419287,0.000012761335,0.00019483564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978971,0.00009213942,0.0006529056,0.00044155974,0.00057818944,0.00033813075],"domain_scores_gemma":[0.9974861,0.0014736363,0.0002769346,0.0002465003,0.00045754368,0.000059296897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008746436,0.00019861064,0.0002913738,0.0005142676,0.00020622148,0.00007642484,0.00055551715,0.00007648916,0.000022855596],"category_scores_gemma":[0.00012989034,0.00017352773,0.000147003,0.0017922826,0.00009337096,0.00013391078,0.00020805257,0.00015322576,0.00003037585],"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.000015874397,0.00021109241,0.00033334008,0.000021778676,0.000015749589,0.0000022277432,0.00009224722,0.958491,0.00035110523,0.033742003,0.0009439766,0.0057795728],"study_design_scores_gemma":[0.0008575613,0.000104316416,0.016352998,0.000018751562,0.0000068347463,0.000017243687,0.000014665136,0.9620961,0.0007124654,0.018494636,0.0011397923,0.00018462527],"about_ca_topic_score_codex":0.000047310146,"about_ca_topic_score_gemma":0.0000040079144,"teacher_disagreement_score":0.6670628,"about_ca_system_score_codex":0.000068166526,"about_ca_system_score_gemma":0.00021462973,"threshold_uncertainty_score":0.7076255},"labels":[],"label_agreement":null},{"id":"W2066852991","doi":"10.1016/s0925-7721(02)00129-3","title":"Optimal and suboptimal robust algorithms for proximity graphs","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Algorithm; Computer science","score_opus":0.03161828217742704,"score_gpt":0.263764278235717,"score_spread":0.23214599605828998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066852991","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.073432915,0.00043477918,0.9245224,0.0003195509,0.0004183381,0.0003636028,0.00001656329,0.000120102464,0.00037174887],"genre_scores_gemma":[0.36074784,0.000006367554,0.6386557,0.00024550507,0.00006415885,0.000047158628,0.000056725905,0.000010177212,0.00016636554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832934,0.00007246085,0.00031553232,0.0005809633,0.00038249907,0.00031917618],"domain_scores_gemma":[0.99866223,0.000485188,0.00011414757,0.00019842855,0.00037402974,0.0001659911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005821673,0.00020322618,0.00019832827,0.00041174723,0.0003520109,0.00024058095,0.0002848403,0.00008361978,0.000020914402],"category_scores_gemma":[0.00020740557,0.0002139181,0.00009835516,0.0009929196,0.00007137944,0.0006907921,0.00009340502,0.00011992929,0.0000131029665],"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.000009912233,0.0001036243,0.00040996177,0.000027092221,0.000034756875,0.0000030010808,0.00007887045,0.5612539,0.00004029587,0.42170098,0.0008064753,0.015531107],"study_design_scores_gemma":[0.0010773257,0.0001974859,0.009345306,0.0000096957265,0.000014043774,0.00012053666,0.000023310107,0.8926813,0.00040578496,0.091096774,0.004652058,0.00037638063],"about_ca_topic_score_codex":0.0000016883498,"about_ca_topic_score_gemma":5.09016e-7,"teacher_disagreement_score":0.33142737,"about_ca_system_score_codex":0.000037666538,"about_ca_system_score_gemma":0.00016504082,"threshold_uncertainty_score":0.8723327},"labels":[],"label_agreement":null},{"id":"W2068598660","doi":"10.1016/j.comgeo.2013.10.001","title":"An optimal algorithm for the Euclidean bottleneck full Steiner tree problem","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Mathematics; Disjoint sets; Logarithm; K-ary tree; Gomory–Hu tree; Matching (statistics); Tree (set theory); Discrete mathematics; Euclidean minimum spanning tree; Upper and lower bounds; Spanning tree; Tree structure; Minimum degree spanning tree; Binary tree","score_opus":0.01036784220015194,"score_gpt":0.23104368802641279,"score_spread":0.22067584582626085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068598660","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.0118631255,0.00038965567,0.985803,0.00011154152,0.0001242412,0.00053915003,0.000032347205,0.0004930445,0.00064389256],"genre_scores_gemma":[0.4609056,0.000010793813,0.5380896,0.00012518305,0.0002936437,0.00026854125,0.00010395359,0.00004695188,0.00015573826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922633,0.000013604987,0.00020409084,0.00016044642,0.00017270075,0.00022281475],"domain_scores_gemma":[0.99936557,0.00023831322,0.000028538076,0.00016302438,0.00013183594,0.00007272774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014853588,0.00014434385,0.00012445281,0.00012354301,0.00009896351,0.00010491596,0.00023911645,0.0000691288,0.00015828702],"category_scores_gemma":[0.000008664744,0.000111461544,0.00006929616,0.00022303485,0.000034001554,0.00022796848,0.0000206542,0.000110854315,0.00007713789],"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.000002906207,0.00003899218,0.00004570784,0.000028744744,0.00006269783,8.823445e-7,0.00006987864,0.27996778,0.0007301494,0.00056407665,0.019598186,0.69889],"study_design_scores_gemma":[0.00022109589,0.00013018124,0.0022889317,0.000008739801,0.000013175104,0.000009645112,0.00004195236,0.9886578,0.00054639706,0.0046782102,0.0032260928,0.00017779377],"about_ca_topic_score_codex":0.000006332267,"about_ca_topic_score_gemma":6.740404e-7,"teacher_disagreement_score":0.70869,"about_ca_system_score_codex":0.000031442778,"about_ca_system_score_gemma":0.000014999072,"threshold_uncertainty_score":0.454527},"labels":[],"label_agreement":null},{"id":"W2075729213","doi":"10.1016/j.comgeo.2015.01.002","title":"Reprint of: Theta-3 is connected","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Austrian Science Fund","keywords":"Reprint; Graph; Computer science; Combinatorics; Connectivity; Mathematics; Physics","score_opus":0.0636802617194288,"score_gpt":0.3320432321922343,"score_spread":0.2683629704728055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075729213","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.14045861,0.00016719408,0.85498345,0.0006665093,0.00015390293,0.00010369868,0.0000062535846,0.00009613302,0.0033642284],"genre_scores_gemma":[0.8978684,0.0000014409842,0.10162482,0.00021960541,0.00002266004,0.0000050857902,0.000005642479,0.0000063127272,0.00024606413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985862,0.0000860534,0.0002385269,0.00031058068,0.00059128215,0.0001874019],"domain_scores_gemma":[0.99832386,0.00038729992,0.0000990397,0.00044630768,0.0005972407,0.00014625047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005749986,0.00008939046,0.0001492201,0.00032023355,0.000044344808,0.000036450077,0.0007642368,0.000036771835,0.00004576204],"category_scores_gemma":[0.00035918324,0.000084155916,0.00006241013,0.0012905515,0.000107680054,0.00024950376,0.00039458435,0.00011981911,0.00016105312],"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.000029384124,0.0001362511,0.0030125284,0.000017291637,0.000057242098,0.000031759937,0.0008755587,0.05992469,0.00021345369,0.9155505,0.0020053422,0.018146059],"study_design_scores_gemma":[0.00048766268,0.000088270186,0.008841949,0.000009615074,0.0000020416508,0.000052326577,0.0000567211,0.117582284,0.0016521915,0.86988,0.0012096443,0.00013727024],"about_ca_topic_score_codex":0.0000037733428,"about_ca_topic_score_gemma":1.6322231e-7,"teacher_disagreement_score":0.75740975,"about_ca_system_score_codex":0.00003520298,"about_ca_system_score_gemma":0.00015544692,"threshold_uncertainty_score":0.34317786},"labels":[],"label_agreement":null},{"id":"W2077123238","doi":"10.1016/j.comgeo.2007.07.008","title":"Local overlaps in special unfoldings of convex polyhedra","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Enhanced Data Rates for GSM Evolution; Convex polytope; Combinatorics; Construct (python library); Path (computing); Mathematics; Class (philosophy); Computer science; Convex set; Geometry; Convex optimization; Artificial intelligence","score_opus":0.004075308654719689,"score_gpt":0.19678165630970307,"score_spread":0.19270634765498337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077123238","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.8757649,0.0002035524,0.12069861,0.00006788003,0.00018580459,0.000047602065,0.0000070572505,0.000042977583,0.0029816164],"genre_scores_gemma":[0.996862,0.000008339529,0.0028601843,0.00006241571,0.00014253735,3.690044e-7,0.000040892355,0.000004672617,0.000018609015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944323,0.0000055388373,0.00021438592,0.00008292426,0.00015911154,0.00009482904],"domain_scores_gemma":[0.9998192,0.00003745832,0.000029022578,0.000043932996,0.000042403382,0.00002794841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000039941096,0.00007224292,0.0001458608,0.00024495745,0.000013412978,0.000010308646,0.000062442814,0.000041335737,0.00025295705],"category_scores_gemma":[0.000011696015,0.00007274635,0.000045664332,0.0006046898,0.000021626014,0.00008211389,0.000006736443,0.000061863626,0.000009858726],"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.00000466287,0.000008376504,0.0013898351,0.0000070900087,0.0000100056195,0.0000016101178,0.000043259526,0.9791368,0.00011059162,0.0039376365,0.0003480047,0.015002078],"study_design_scores_gemma":[0.0002869929,0.000021377093,0.270749,0.000013112312,0.000006522644,0.0000031261936,0.000031284166,0.7212041,0.000474967,0.006948258,0.0001577174,0.00010351462],"about_ca_topic_score_codex":0.000004929523,"about_ca_topic_score_gemma":0.0000015236253,"teacher_disagreement_score":0.26935917,"about_ca_system_score_codex":0.00004290686,"about_ca_system_score_gemma":0.000009205435,"threshold_uncertainty_score":0.296651},"labels":[],"label_agreement":null},{"id":"W2078707782","doi":"10.1016/j.comgeo.2004.02.002","title":"Expected time analysis for Delaunay point location","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Delaunay triangulation; Simple (philosophy); Tree (set theory); Point (geometry); Jump; Mathematics; Point location; Combinatorics; k-d tree; Random walk; Computer science; Algorithm; Statistics; Geometry; Tree traversal","score_opus":0.01292080864408373,"score_gpt":0.25074940548757013,"score_spread":0.2378285968434864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078707782","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.037993517,0.00020317499,0.95953345,0.0012498186,0.00023977949,0.00031200354,0.00001620614,0.00024254725,0.00020947406],"genre_scores_gemma":[0.7184201,0.0000013872072,0.28016275,0.00048796122,0.00013620139,0.00005181035,0.0005217211,0.000009726558,0.00020833952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998185,0.000044676784,0.0004243981,0.0005672243,0.0004994447,0.0002792476],"domain_scores_gemma":[0.9981371,0.0003824759,0.00017518202,0.0003189497,0.00084913586,0.00013716558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038069967,0.00019311384,0.00025256394,0.0011966126,0.00028041203,0.00020454946,0.00048174217,0.00008192373,0.000049296057],"category_scores_gemma":[0.0001902711,0.00020791219,0.00022068188,0.0054630022,0.000035804343,0.0006062069,0.00010482394,0.00008649336,0.00020126086],"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.0000098209375,0.00011281949,0.000120224155,0.000009719545,0.00021009307,0.0000017075592,0.00014152021,0.91576385,0.0001852241,0.07889206,0.00037024944,0.0041827257],"study_design_scores_gemma":[0.0011376413,0.00013574399,0.023130303,0.000011430947,0.000103680635,0.000018481947,0.00001539603,0.8373767,0.00083224295,0.13612857,0.00074605824,0.00036372154],"about_ca_topic_score_codex":0.00000896225,"about_ca_topic_score_gemma":0.0000029443563,"teacher_disagreement_score":0.6804266,"about_ca_system_score_codex":0.0001746034,"about_ca_system_score_gemma":0.00027670906,"threshold_uncertainty_score":0.8478413},"labels":[],"label_agreement":null},{"id":"W2079124625","doi":"10.1016/j.comgeo.2007.10.011","title":"Shortest descending paths through given faces","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Shortest path problem; Path (computing); Yen's algorithm; K shortest path routing; Face (sociological concept); Terrain; Combinatorics; Sequence (biology); Regular polygon; Point (geometry); Mathematics; Constrained Shortest Path First; Algorithm; Computer science; Euclidean shortest path; Dijkstra's algorithm; Geography; Geometry; Cartography","score_opus":0.04140129129438375,"score_gpt":0.2666796259368927,"score_spread":0.22527833464250896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079124625","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.13025315,0.00051496254,0.86523306,0.0007035873,0.0006323929,0.00015139504,0.000009770496,0.00027399184,0.0022276863],"genre_scores_gemma":[0.8078619,0.00003148025,0.19079271,0.00061244017,0.00022455958,0.000014240633,0.000090861,0.000012107988,0.00035967524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790436,0.00007685325,0.00039026496,0.0005630687,0.0007207432,0.00034468257],"domain_scores_gemma":[0.9987246,0.0004176735,0.00014092754,0.00029169035,0.00029615924,0.0001289599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022566166,0.00022371503,0.00022925682,0.00035929453,0.00058614044,0.00013923462,0.0006765846,0.000080868616,0.0000738108],"category_scores_gemma":[0.00011356977,0.00023415148,0.00011881966,0.0017000458,0.000092250186,0.0011407704,0.0002520017,0.00018173057,0.00029247164],"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.000013364924,0.0003515885,0.010119957,0.00002802372,0.00010045997,0.00015723304,0.0017044599,0.7916942,0.000497819,0.14802086,0.016106164,0.03120586],"study_design_scores_gemma":[0.0012568648,0.00027180338,0.16586979,0.000054079024,0.000019150362,0.0010339004,0.00009200049,0.69805574,0.0019287909,0.09649298,0.033796858,0.0011280328],"about_ca_topic_score_codex":0.0000098003275,"about_ca_topic_score_gemma":9.3321916e-7,"teacher_disagreement_score":0.6776088,"about_ca_system_score_codex":0.000084285166,"about_ca_system_score_gemma":0.00021205258,"threshold_uncertainty_score":0.95484203},"labels":[],"label_agreement":null},{"id":"W2079518702","doi":"10.1016/j.comgeo.2012.07.001","title":"Stable Roommates Spanner","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Generalization; Combinatorics; Set (abstract data type); Mathematics; Computer science","score_opus":0.01894526290248786,"score_gpt":0.2530591957806455,"score_spread":0.23411393287815765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079518702","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.07723053,0.0011046483,0.9160766,0.0006019291,0.0010675737,0.00011338244,0.000006257968,0.00023920239,0.0035599011],"genre_scores_gemma":[0.8462411,0.000004809121,0.15176155,0.00068778323,0.00042661707,0.000014098521,0.000078112935,0.000010436566,0.0007754667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984104,0.00006440461,0.00028074833,0.00028622904,0.0005206978,0.00043750714],"domain_scores_gemma":[0.9988957,0.0003090409,0.00009931071,0.00026140345,0.00021572322,0.00021881632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047844186,0.00016703863,0.0001529641,0.0003982914,0.00023365956,0.00017324304,0.00045388303,0.00006190945,0.00016062164],"category_scores_gemma":[0.00008706431,0.00016690262,0.00007904269,0.0013331107,0.000030491323,0.0014050958,0.00022333607,0.00012280318,0.00070106797],"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.000008033581,0.00038344768,0.013391794,0.000029975241,0.000065597036,0.0000042120714,0.0004129104,0.3087742,0.00032425832,0.6144231,0.017296027,0.044886474],"study_design_scores_gemma":[0.0009814769,0.000111109606,0.26742697,0.00002760104,0.000022250106,0.000186743,0.000061964485,0.52400607,0.0027466351,0.09050286,0.112933084,0.0009932106],"about_ca_topic_score_codex":0.0000047047565,"about_ca_topic_score_gemma":3.433185e-7,"teacher_disagreement_score":0.7690106,"about_ca_system_score_codex":0.00006194205,"about_ca_system_score_gemma":0.00008406193,"threshold_uncertainty_score":0.9011044},"labels":[],"label_agreement":null},{"id":"W2083101719","doi":"10.1016/j.comgeo.2013.08.007","title":"Space efficient data structures for dynamic orthogonal range counting","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"Canada Research Chairs","keywords":"Range (aeronautics); Space (punctuation); Computer science; Dynamic range; Data structure; Mathematics; Algorithm; Computer vision; Engineering; Aerospace engineering","score_opus":0.021831948257065168,"score_gpt":0.2821673451106919,"score_spread":0.2603353968536267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083101719","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.06690363,0.00033162136,0.93092644,0.0005861706,0.00053667097,0.00033472475,0.00018451858,0.00011398234,0.00008222083],"genre_scores_gemma":[0.5712059,0.0000019161482,0.42766538,0.00025206505,0.000115898336,0.000019489175,0.00066852383,0.000011010693,0.000059797374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983439,0.000028139675,0.00025113137,0.0005931872,0.00048680778,0.00029686722],"domain_scores_gemma":[0.9983157,0.00047610834,0.0001357419,0.000704014,0.00026758338,0.00010086264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028300742,0.0001579293,0.00016159577,0.00018459573,0.00027189052,0.00035677623,0.0015170813,0.000055742614,0.00007550536],"category_scores_gemma":[0.00011600363,0.00013821789,0.00004752417,0.00043515387,0.00004619528,0.0006421472,0.0010675093,0.00011536926,0.00008636568],"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.000023283052,0.00027906237,0.0029429842,0.0001738871,0.000121181176,0.000011125543,0.00024764,0.52487975,0.00034530112,0.17512965,0.048165955,0.2476802],"study_design_scores_gemma":[0.00037089284,0.000021159496,0.051198523,0.000014432119,0.000004582414,0.000014848,0.0000134595575,0.92676085,0.000006996238,0.018843101,0.002579883,0.00017129416],"about_ca_topic_score_codex":0.000021335583,"about_ca_topic_score_gemma":0.0000011849266,"teacher_disagreement_score":0.50430226,"about_ca_system_score_codex":0.000035130026,"about_ca_system_score_gemma":0.00009918288,"threshold_uncertainty_score":0.5636362},"labels":[],"label_agreement":null},{"id":"W2083123226","doi":"10.1016/j.comgeo.2004.01.006","title":"Constructing convex 3-polytopes from two triangulations of a polygon","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Convexity; Polytope; Convex polytope; Triangulation; Convex polygon; Polygon (computer graphics); Regular polygon; Convex set; Linear inequality; Discrete mathematics; Convex optimization; Geometry; Computer science; Inequality; Mathematical analysis","score_opus":0.01620979012889884,"score_gpt":0.26497187066690653,"score_spread":0.2487620805380077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083123226","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.29387638,0.00030673068,0.7037917,0.00064260786,0.00041792812,0.00011868574,0.00004051181,0.00009174763,0.00071370415],"genre_scores_gemma":[0.7268426,0.00000198641,0.27259973,0.00018092032,0.00017617593,0.000004664379,0.0001584457,0.0000071714435,0.000028341561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982928,0.00006112054,0.00052185875,0.00040426763,0.00051354803,0.00020638118],"domain_scores_gemma":[0.9984285,0.0005785394,0.00027338648,0.00027134878,0.00033895628,0.0001092309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022865192,0.00016702131,0.0002622339,0.0005035411,0.00016364349,0.000104694016,0.00044727707,0.000060269907,0.000086085645],"category_scores_gemma":[0.00016610761,0.00018137392,0.0001224835,0.0014875456,0.0000961902,0.00050375087,0.00015694532,0.00012732096,0.000055029275],"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.000010443347,0.00007187721,0.0016799753,0.000008006835,0.000059144786,0.000004915241,0.00026006286,0.5002986,0.00070101593,0.4607988,0.00005461977,0.03605253],"study_design_scores_gemma":[0.0049533127,0.0001537266,0.045870595,0.0000947031,0.000040502055,0.00008218123,0.00027458454,0.31070662,0.0139113525,0.62281984,0.0004819727,0.0006105988],"about_ca_topic_score_codex":0.0001279182,"about_ca_topic_score_gemma":0.000010322033,"teacher_disagreement_score":0.4329662,"about_ca_system_score_codex":0.00009823553,"about_ca_system_score_gemma":0.00032543726,"threshold_uncertainty_score":0.7396214},"labels":[],"label_agreement":null},{"id":"W2083269131","doi":"10.1016/j.comgeo.2011.04.002","title":"Reconstructing orthogonal polyhedra from putative vertex sets","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Vertex (graph theory); Combinatorics; Regular polygon; Set (abstract data type); Convex polytope; Dual polyhedron; Mathematics; Focus (optics); Convex set; Computer science; Geometry; Convex optimization; Physics; Graph","score_opus":0.041778665691416215,"score_gpt":0.2480936186266364,"score_spread":0.20631495293522017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083269131","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.2961356,0.00022065206,0.6979895,0.0001668728,0.0010765224,0.00013485427,0.000048791415,0.00022408417,0.0040031197],"genre_scores_gemma":[0.67510456,0.0000030856859,0.32398382,0.0005062975,0.00011044737,0.000011773808,0.00019480725,0.0000129209275,0.000072254225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976117,0.000137344,0.0005187095,0.00073825516,0.0006253816,0.00036861718],"domain_scores_gemma":[0.99815786,0.00066880794,0.0002517422,0.00032365922,0.00038393735,0.00021399594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033067193,0.00027138484,0.00026347872,0.00053229247,0.00032530192,0.00016397946,0.0007073413,0.00010932968,0.00041727093],"category_scores_gemma":[0.00017113725,0.00029158127,0.00014109543,0.0014489148,0.000094153256,0.0010095198,0.00029859334,0.00024914023,0.00039683137],"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.00008735243,0.0005077222,0.025242994,0.00002895722,0.00043235987,0.00013573689,0.004886304,0.051335458,0.0004996587,0.43954924,0.002152669,0.47514156],"study_design_scores_gemma":[0.000806523,0.000118073614,0.12509228,0.000029827961,0.000020389503,0.00011891558,0.00013931196,0.44737062,0.0013032616,0.42391768,0.0005107073,0.0005724173],"about_ca_topic_score_codex":0.00004780607,"about_ca_topic_score_gemma":0.0000027275905,"teacher_disagreement_score":0.47456914,"about_ca_system_score_codex":0.00007951352,"about_ca_system_score_gemma":0.00027439854,"threshold_uncertainty_score":0.9999536},"labels":[],"label_agreement":null},{"id":"W2083594480","doi":"10.1016/j.comgeo.2015.01.003","title":"Reprint of: Face-guarding polyhedra","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Polyhedron; Combinatorics; Face (sociological concept); Regular polygon; Mathematics; Geometry","score_opus":0.045283510249131305,"score_gpt":0.28275017162805144,"score_spread":0.23746666137892014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083594480","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.11946056,0.00030417906,0.8759588,0.00059492385,0.000590709,0.000108276974,0.000004583676,0.00011938093,0.0028585568],"genre_scores_gemma":[0.8269963,0.0000020941227,0.17244048,0.00020318678,0.00011272577,0.0000058502324,0.000030437457,0.0000068632494,0.0002020401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982173,0.00007411229,0.00042062544,0.00038644733,0.0006995292,0.0002020238],"domain_scores_gemma":[0.9985441,0.0002440006,0.00019019602,0.00032656037,0.00051100785,0.00018411099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065090216,0.00014002337,0.0001994644,0.0004912461,0.000080663,0.00008774153,0.0005433202,0.000058568534,0.00001762412],"category_scores_gemma":[0.0002789025,0.00014688866,0.00009430639,0.0014721677,0.000046148656,0.0004812751,0.00030638633,0.00011226246,0.00011779038],"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.000010211565,0.00009639112,0.0014223136,0.000015040612,0.000035004043,0.0000072682305,0.00046776244,0.77062327,0.00023922785,0.19022311,0.0019112985,0.034949128],"study_design_scores_gemma":[0.0011107444,0.00018934709,0.027189655,0.000032443706,0.000011524161,0.00011149543,0.00016370062,0.8115458,0.0035456372,0.14968853,0.005975946,0.00043516196],"about_ca_topic_score_codex":0.00000916056,"about_ca_topic_score_gemma":3.4885971e-7,"teacher_disagreement_score":0.70753574,"about_ca_system_score_codex":0.0000729342,"about_ca_system_score_gemma":0.00029597615,"threshold_uncertainty_score":0.5989946},"labels":[],"label_agreement":null},{"id":"W2084142581","doi":"10.1016/j.comgeo.2012.09.008","title":"Establishing strong connectivity using optimal radius half-disk antennas","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Fields Institute for Research in Mathematical Sciences","keywords":"RADIUS; Euclidean geometry; Combinatorics; Wireless network; Minimum spanning tree; Wireless; Directional antenna; Point (geometry); Graph; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Antenna (radio); Topology (electrical circuits); Geometry; Telecommunications; Computer network","score_opus":0.02632251882082546,"score_gpt":0.25086610465936793,"score_spread":0.22454358583854248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084142581","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.42913297,0.000781353,0.5693949,0.000012165229,0.00023299892,0.00003664728,0.000009719872,0.0001441656,0.00025511737],"genre_scores_gemma":[0.97651994,0.000006655285,0.02293564,0.000036417212,0.00037657903,0.000002378259,0.000044987984,0.000031320567,0.000046076722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892026,0.000033427124,0.00021733608,0.00016107778,0.00025998897,0.00040788355],"domain_scores_gemma":[0.9993552,0.00024631422,0.000045102646,0.00011713646,0.000073840005,0.00016242103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028494096,0.00017460436,0.00022328686,0.00031251519,0.00013757513,0.00009893842,0.00012951718,0.00006998563,0.000156828],"category_scores_gemma":[0.000079527425,0.00018664871,0.00011373589,0.0006682673,0.000044324508,0.0007122741,0.000042375646,0.00019524306,0.000041953197],"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.000005637703,0.000057166817,0.020559166,0.00003160156,0.00016931652,0.00000733004,0.0001772658,0.9730039,0.002972395,0.0011793079,0.00023257047,0.0016043491],"study_design_scores_gemma":[0.00019613678,0.000007551908,0.014931148,0.000020521504,0.00004599672,0.000030715346,0.00020936433,0.98393464,0.000079798476,0.00013596455,0.00017773654,0.00023042],"about_ca_topic_score_codex":0.000025672052,"about_ca_topic_score_gemma":8.169769e-7,"teacher_disagreement_score":0.547387,"about_ca_system_score_codex":0.00011236807,"about_ca_system_score_gemma":0.000022313172,"threshold_uncertainty_score":0.7611314},"labels":[],"label_agreement":null},{"id":"W2084143237","doi":"10.1016/j.comgeo.2008.05.004","title":"Improved upper bounds on the reflexivity of point sets","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Point (geometry); Set (abstract data type); Extension (predicate logic); Plane (geometry); Order type; Reflexivity; Simple (philosophy); Order (exchange); Type (biology); Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.037868623467320624,"score_gpt":0.2876858346914462,"score_spread":0.2498172112241256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084143237","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.4425888,0.00010450106,0.55227286,0.0025921725,0.0004075139,0.00018095144,0.000011478519,0.000082190694,0.0017595179],"genre_scores_gemma":[0.96157664,0.0000071101636,0.03647909,0.0014760301,0.00009977358,0.000014450388,0.0000352854,0.000008850928,0.00030274675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829245,0.000121010395,0.00036819905,0.00037910172,0.00061890384,0.00022031409],"domain_scores_gemma":[0.9980629,0.0008897943,0.00019033192,0.00041654016,0.000357272,0.000083168205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052194216,0.00016803743,0.00018585828,0.00033325094,0.00037969896,0.000057491263,0.00061291736,0.0000617107,0.00006817934],"category_scores_gemma":[0.00021335467,0.00012954205,0.00013587973,0.0012944612,0.0001331202,0.00031319095,0.0001917271,0.00018487271,0.000072068215],"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.00008236935,0.0007248285,0.0019250028,0.00004180166,0.00015166335,0.000022772976,0.0011045075,0.25319752,0.0020845635,0.69483024,0.015309411,0.030525353],"study_design_scores_gemma":[0.0008546072,0.00046597392,0.13344508,0.00003369244,0.0000103190105,0.00017613206,0.000033634107,0.76259845,0.0055086417,0.09283655,0.0035860895,0.0004508389],"about_ca_topic_score_codex":0.000008130092,"about_ca_topic_score_gemma":7.1807557e-7,"teacher_disagreement_score":0.6019937,"about_ca_system_score_codex":0.000056577755,"about_ca_system_score_gemma":0.00022027145,"threshold_uncertainty_score":0.5282572},"labels":[],"label_agreement":null},{"id":"W2085756291","doi":"10.1016/j.comgeo.2012.03.001","title":"Absolute approximation of Tukey depth: Theory and experiments","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Monte Carlo method; Generalization; Algorithm; Mathematics; Applied mathematics; Mathematical analysis; Statistics","score_opus":0.1291732036448525,"score_gpt":0.4355757829917782,"score_spread":0.3064025793469257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085756291","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.12927975,0.00034021126,0.86893636,0.0000086394475,0.00007736386,0.00012612659,0.000014048606,0.000018832734,0.0011986728],"genre_scores_gemma":[0.5141013,0.0000020803889,0.4857615,0.000025774743,0.000029006773,0.000009096399,0.0000070957353,0.0000070730316,0.00005705593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992574,0.00009711765,0.00021980426,0.00010301171,0.00018096033,0.00014171482],"domain_scores_gemma":[0.9979046,0.001768326,0.000102497295,0.00008033446,0.00006823188,0.00007603445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005839642,0.00008069559,0.00015115525,0.00008060324,0.000042860047,0.0000061743485,0.00004570959,0.000036622085,0.000047702502],"category_scores_gemma":[0.0006708685,0.00007279993,0.00002591378,0.00010915358,0.000067597226,0.00013476165,0.000045754532,0.00005354967,0.000004851793],"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.000021755535,0.000106226675,0.00031567295,0.000071861796,0.00002324644,2.0426444e-7,0.00038940946,0.00024958086,0.00027293997,0.9750972,0.00007612689,0.023375783],"study_design_scores_gemma":[0.00024351834,0.000022380707,0.0078320205,0.000017891267,0.000016052618,0.0000051953334,0.00011395574,0.005337941,0.00071266916,0.9855296,0.0000808213,0.00008795428],"about_ca_topic_score_codex":5.4884583e-7,"about_ca_topic_score_gemma":4.304415e-8,"teacher_disagreement_score":0.38482156,"about_ca_system_score_codex":0.000014642857,"about_ca_system_score_gemma":0.000009308303,"threshold_uncertainty_score":0.2968695},"labels":[],"label_agreement":null},{"id":"W2086070368","doi":"10.1016/j.comgeo.2015.02.004","title":"On full Steiner trees in unit disk graphs","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; Mathematics; Gomory–Hu tree; k-minimum spanning tree; K-ary tree; Tree (set theory); Unit disk; Graph; Approximation algorithm; Discrete mathematics; Tree structure; Binary tree","score_opus":0.04795850184395449,"score_gpt":0.28200055814693564,"score_spread":0.23404205630298114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086070368","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.45819914,0.0002374774,0.5351335,0.0009961776,0.00077584165,0.00014864186,0.000013878313,0.00019370634,0.0043016495],"genre_scores_gemma":[0.9601241,0.0000021146993,0.039103568,0.00051678496,0.000052562555,0.000008996541,0.000026173617,0.000008213688,0.00015750469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984786,0.00008178556,0.00025086515,0.00037195015,0.000560707,0.00025609366],"domain_scores_gemma":[0.99892354,0.00040334638,0.00006517048,0.0003130068,0.00013549854,0.00015946613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034575467,0.0001538877,0.0001688417,0.00078361714,0.00007448826,0.00011897146,0.0007253351,0.00005220086,0.000024184834],"category_scores_gemma":[0.00010675118,0.00014818496,0.00007171154,0.0020769816,0.00007734434,0.000302187,0.00022467985,0.00020265064,0.00015070033],"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.000023022632,0.00026738548,0.0037152332,0.000005191102,0.000016605405,0.000039219554,0.00029470958,0.19203901,0.000005615332,0.7757293,0.0020099431,0.025854768],"study_design_scores_gemma":[0.0008159732,0.00021054319,0.051583927,0.000024626352,0.0000018406963,0.000016903456,0.000042244188,0.27869847,0.000010985198,0.667039,0.0013359571,0.00021952615],"about_ca_topic_score_codex":0.000024431307,"about_ca_topic_score_gemma":0.000024739371,"teacher_disagreement_score":0.50192493,"about_ca_system_score_codex":0.00004203895,"about_ca_system_score_gemma":0.00009499367,"threshold_uncertainty_score":0.60428077},"labels":[],"label_agreement":null},{"id":"W2086607663","doi":"10.1016/j.comgeo.2013.03.005","title":"Triangulating and guarding realistic polygons","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Boundary (topology); Constant (computer programming); Simple (philosophy); Computer science; Regular polygon; Object (grammar); Algorithm; Combinatorics; Polygon (computer graphics); Mathematics; Theoretical computer science; Geometry; Artificial intelligence; Mathematical analysis; Programming language","score_opus":0.011846774291486974,"score_gpt":0.2333190862042003,"score_spread":0.22147231191271333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086607663","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.15766828,0.0002888778,0.838447,0.0012717391,0.0002688974,0.00018235021,0.000002665515,0.00015010219,0.0017201237],"genre_scores_gemma":[0.85246575,0.0000033783929,0.14648204,0.0005270653,0.00015318395,0.000020918498,0.000036913396,0.000007886319,0.00030286942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986792,0.000063311796,0.00029883563,0.00037932317,0.00034680244,0.00023252031],"domain_scores_gemma":[0.9988012,0.0005462853,0.00010427547,0.00018550408,0.00022126739,0.00014146997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025511833,0.00014287575,0.00015443475,0.00039820466,0.00027437895,0.0003761843,0.0002618663,0.00005211026,0.000071581715],"category_scores_gemma":[0.00020587113,0.00014627646,0.000050529332,0.0009478,0.000040802573,0.0007106323,0.00019846574,0.00010916973,0.00013226084],"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.0000047439958,0.00008861813,0.002853392,0.000045680164,0.000070409595,0.000010405848,0.00045035937,0.24681522,0.0008666114,0.41950336,0.0064267186,0.3228645],"study_design_scores_gemma":[0.00039289598,0.000042773565,0.10562033,0.000016146938,0.0000061835776,0.00007224041,0.000031498577,0.7825576,0.000060683396,0.11042797,0.0005438648,0.00022782573],"about_ca_topic_score_codex":0.000041908315,"about_ca_topic_score_gemma":8.295769e-7,"teacher_disagreement_score":0.69479746,"about_ca_system_score_codex":0.000035652145,"about_ca_system_score_gemma":0.0000650368,"threshold_uncertainty_score":0.5964981},"labels":[],"label_agreement":null},{"id":"W2087832808","doi":"10.1016/j.comgeo.2008.12.001","title":"Editorial CCCG 2005","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Carleton University","funders":"","keywords":"History","score_opus":0.03659711870412601,"score_gpt":0.208185652841079,"score_spread":0.171588534136953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087832808","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07842472,0.0021992559,0.009655096,0.0005152941,0.30586866,0.00021892771,0.000858148,0.00016628478,0.60209364],"genre_scores_gemma":[0.6672762,0.00020190446,0.006251792,0.0007458818,0.055156637,0.000023421102,0.00013517699,0.000037106565,0.27017188],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908173,0.0000036605543,0.00032171264,0.0003133581,0.00005533498,0.0002241737],"domain_scores_gemma":[0.999564,0.00006597294,0.00013114851,0.00012398067,0.000041237305,0.00007365945],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002608191,0.00009257249,0.00021069791,0.00024530862,0.00022947279,0.000032816486,0.00015910738,0.00005384786,0.0062087164],"category_scores_gemma":[0.00008461316,0.00011317673,0.00008853064,0.00021727219,0.00012161171,0.00017719276,0.000075644864,0.0000792682,0.03572063],"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.0000046306563,0.00003780007,0.006462339,0.00000262504,0.000033077205,0.0000015783237,0.00011504175,0.0035352698,2.3541465e-7,0.038478255,0.9512749,0.000054253476],"study_design_scores_gemma":[0.0004559457,0.0000119039205,0.011333567,0.000001793888,0.0000015388642,0.000005894952,0.000044847635,0.0018742448,0.000001353938,0.01776454,0.96834177,0.00016259108],"about_ca_topic_score_codex":0.000022998822,"about_ca_topic_score_gemma":5.239818e-7,"teacher_disagreement_score":0.58885145,"about_ca_system_score_codex":0.00006815379,"about_ca_system_score_gemma":0.000026121908,"threshold_uncertainty_score":0.9946997},"labels":[],"label_agreement":null},{"id":"W2088133390","doi":"10.1016/j.comgeo.2013.08.005","title":"Orthogonal cartograms with at most 12 corners per face","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Face (sociological concept); Enhanced Data Rates for GSM Evolution; Geometry; Combinatorics; Graph; Mathematics; Plane (geometry); Computer science; Artificial intelligence; Computer vision; Sociology","score_opus":0.010952583299292612,"score_gpt":0.2141261595870823,"score_spread":0.2031735762877897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088133390","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.29197574,0.00015559998,0.70329183,0.0008145342,0.00032185123,0.0003204744,0.000010211217,0.00019850835,0.002911283],"genre_scores_gemma":[0.8827568,0.0000037671812,0.113392666,0.0012719752,0.00015506372,0.000066509994,0.00027772356,0.000019663785,0.0020558096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761313,0.00007240059,0.00034954614,0.0006526512,0.00089053967,0.0004217165],"domain_scores_gemma":[0.99839973,0.00032712947,0.00015618012,0.00034700023,0.00050457026,0.00026536454],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018809589,0.00027935737,0.00022564484,0.0003885936,0.00038782175,0.00033936868,0.0005686622,0.000087124725,0.00040610982],"category_scores_gemma":[0.000037021862,0.0002471927,0.000087272376,0.0012996205,0.00010922757,0.0008601739,0.0003022881,0.00018215853,0.0012002753],"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.00002510527,0.00020082919,0.010201709,0.000028244667,0.000118169424,0.00001837172,0.00042157804,0.85264164,0.00043781704,0.04668449,0.010992073,0.078229986],"study_design_scores_gemma":[0.0015984804,0.00042702284,0.24606217,0.000036112044,0.000025907933,0.00042155886,0.000118244476,0.7101922,0.00034117515,0.012063946,0.027644206,0.0010689836],"about_ca_topic_score_codex":0.000030142688,"about_ca_topic_score_gemma":0.000014129804,"teacher_disagreement_score":0.5907811,"about_ca_system_score_codex":0.00013364335,"about_ca_system_score_gemma":0.00021533325,"threshold_uncertainty_score":0.99999803},"labels":[],"label_agreement":null},{"id":"W2088816968","doi":"10.1016/j.comgeo.2005.05.001","title":"A linear time algorithm to remove winding of a simple polygon","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Simple polygon; Simple (philosophy); Polygon (computer graphics); Stack (abstract data type); Algorithm; Sequence (biology); SIMPLE algorithm; Point (geometry); Time complexity; Polygon covering; Point in polygon; Mathematics; Computer science; Monotone polygon; Combinatorics; Geometry; Physics","score_opus":0.010627487721599764,"score_gpt":0.26261754626947964,"score_spread":0.25199005854787987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088816968","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.09327973,0.00011547888,0.904439,0.0011146454,0.00016396584,0.00018067978,0.00002446661,0.00011256484,0.00056950975],"genre_scores_gemma":[0.41523084,0.0000011555634,0.5830687,0.0008318939,0.00033698778,0.0000062355093,0.00007360561,0.000010465358,0.00044007937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981374,0.000056812485,0.0004562536,0.00043526207,0.0006374715,0.00027676424],"domain_scores_gemma":[0.9986903,0.00033109702,0.00015459454,0.0002773436,0.00036332634,0.0001833535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040232914,0.00017323063,0.0002347191,0.0007722739,0.00013739517,0.0000705929,0.00053533015,0.000066009015,0.00010743604],"category_scores_gemma":[0.00012840547,0.00018921225,0.00010621063,0.0021292353,0.000027532982,0.00047009738,0.00026443144,0.00011300389,0.0005435421],"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.000008652102,0.0001327481,0.00009872365,0.000010184673,0.000033312364,0.000003718692,0.00027361128,0.668473,0.0015339829,0.008480816,0.002392294,0.31855896],"study_design_scores_gemma":[0.00036784992,0.00013103483,0.005498577,0.000018172686,0.00000641818,0.00003483541,0.000008752587,0.9734206,0.0032007985,0.007108401,0.009964296,0.00024022376],"about_ca_topic_score_codex":0.000006651049,"about_ca_topic_score_gemma":7.250846e-7,"teacher_disagreement_score":0.32195112,"about_ca_system_score_codex":0.00008771573,"about_ca_system_score_gemma":0.00015722834,"threshold_uncertainty_score":0.77158517},"labels":[],"label_agreement":null},{"id":"W2089645963","doi":"10.1016/j.comgeo.2008.04.001","title":"Flips in planar graphs","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Planar graph; Book embedding; Embedding; Combinatorics; Planar straight-line graph; 1-planar graph; Pathwidth; Outerplanar graph; Perspective (graphical); Computer science; Line graph; Mathematics; Graph; Discrete mathematics; Artificial intelligence","score_opus":0.023790178785209063,"score_gpt":0.24061003229846303,"score_spread":0.21681985351325397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089645963","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.33849558,0.00032963493,0.65789264,0.0005653022,0.00041227628,0.000121940255,0.0000044992885,0.00013650437,0.0020415974],"genre_scores_gemma":[0.9026082,0.000018966944,0.09627854,0.0006772454,0.00008022547,0.000013861537,0.00006699926,0.000007717325,0.00024821787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99837285,0.00006868546,0.00034676233,0.00042363026,0.0005207077,0.0002673672],"domain_scores_gemma":[0.9991383,0.00029770975,0.000081999024,0.00022860659,0.00014514284,0.000108221895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002569694,0.00015358654,0.00017263941,0.0009414827,0.00019919108,0.000053800915,0.00049422495,0.00006586757,0.00003408162],"category_scores_gemma":[0.000072271185,0.00016685038,0.0000759717,0.0024300525,0.000055456574,0.00052669714,0.00009072852,0.00016692988,0.0001936407],"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.00001600798,0.00029427916,0.017250257,0.000017333095,0.00002845586,0.00019467298,0.00056701957,0.47910962,0.00014553397,0.47932786,0.005625219,0.017423749],"study_design_scores_gemma":[0.0010350554,0.000093075985,0.44986632,0.000018223143,0.000002637072,0.00040096013,0.000016378966,0.3873247,0.0001769618,0.155838,0.004800023,0.0004276682],"about_ca_topic_score_codex":0.00001281826,"about_ca_topic_score_gemma":0.000004008792,"teacher_disagreement_score":0.56411266,"about_ca_system_score_codex":0.000059934522,"about_ca_system_score_gemma":0.00017449801,"threshold_uncertainty_score":0.6803961},"labels":[],"label_agreement":null},{"id":"W2089984367","doi":"10.1016/j.comgeo.2012.10.010","title":"Closest pair and the post office problem for stochastic points","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Euclidean space; Mathematics; Point (geometry); Stochastic geometry; Set (abstract data type); Combinatorics; Euclidean geometry; Space (punctuation); Discrete mathematics; Stochastic process; Computational geometry; Algorithm; Computer science; Geometry; Statistics","score_opus":0.014340819491794474,"score_gpt":0.24804920726053245,"score_spread":0.23370838776873798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089984367","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.038815673,0.00077108206,0.95459324,0.004470889,0.0004834545,0.00055220973,0.000016995462,0.00009278594,0.000203689],"genre_scores_gemma":[0.84276336,0.0000018357663,0.15498798,0.0015432832,0.00035024044,0.00007469462,0.00008427225,0.000010306973,0.0001840296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986156,0.000101860336,0.00029245886,0.0002977785,0.0003711679,0.00032108786],"domain_scores_gemma":[0.99708337,0.0020600448,0.00013552462,0.00019505402,0.00038810712,0.00013791578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010346005,0.00016318388,0.00017459683,0.00022526113,0.00038767897,0.00017698148,0.00035561054,0.00005305413,0.000011852826],"category_scores_gemma":[0.000324609,0.00012456598,0.00008634062,0.00066601497,0.00011426503,0.0006251916,0.0001903991,0.000111735106,0.000052962165],"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.00011584584,0.00017462454,0.0004034503,0.000052081567,0.000060752365,4.9421936e-7,0.0007153263,0.17484589,0.000024274594,0.7882373,0.0025999937,0.032770015],"study_design_scores_gemma":[0.0038277172,0.00016970081,0.049073655,0.0000303178,0.000045375626,0.00016142127,0.000069831534,0.8231261,0.000053565014,0.11516937,0.0077908463,0.00048213353],"about_ca_topic_score_codex":0.000005461514,"about_ca_topic_score_gemma":6.9650446e-7,"teacher_disagreement_score":0.8039477,"about_ca_system_score_codex":0.000032780597,"about_ca_system_score_gemma":0.000096316806,"threshold_uncertainty_score":0.5079653},"labels":[],"label_agreement":null},{"id":"W2090529709","doi":"10.1016/s0925-7721(02)00111-6","title":"An efficient algorithm for enumeration of triangulations","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Enumeration; Triangulation; Combinatorics; Position (finance); Mathematics; Tree (set theory); Plane (geometry); Point set triangulation; Algorithm; General position; Discrete mathematics; Computer science; Delaunay triangulation; Geometry","score_opus":0.025775814371855645,"score_gpt":0.27469945162803916,"score_spread":0.24892363725618352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090529709","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.0194625,0.00023059649,0.97896844,0.00027214177,0.00041328013,0.00032766964,0.000042338816,0.00009634783,0.00018667022],"genre_scores_gemma":[0.5457956,0.0000016163536,0.45371312,0.000099433666,0.00013296494,0.000026623597,0.00013466107,0.00000637678,0.00008957626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985738,0.00006374784,0.00041214676,0.00035525547,0.00041768164,0.00017737578],"domain_scores_gemma":[0.9985318,0.0003959785,0.00018004254,0.00026081782,0.00053386897,0.00009747222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032767348,0.00012865613,0.00016845427,0.00049667293,0.0002123164,0.00009519395,0.00035277568,0.000061198196,0.000072890725],"category_scores_gemma":[0.00007714894,0.00013949028,0.000105002284,0.0011216956,0.000034331188,0.0003795154,0.000039125793,0.00005844785,0.000026015145],"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.000002162357,0.0002368699,0.000023935821,0.000008007768,0.000015890342,4.0148484e-7,0.00017469634,0.71222866,0.0001875015,0.051975094,0.00043089956,0.23471591],"study_design_scores_gemma":[0.00064318854,0.00016337626,0.0026964168,0.0000059481945,0.000008620959,0.000008881946,0.000010967878,0.9852158,0.00059101067,0.0096922545,0.00081471604,0.00014884853],"about_ca_topic_score_codex":0.0000022077286,"about_ca_topic_score_gemma":3.4924523e-7,"teacher_disagreement_score":0.5263331,"about_ca_system_score_codex":0.000039044397,"about_ca_system_score_gemma":0.000049744183,"threshold_uncertainty_score":0.5688248},"labels":[],"label_agreement":null},{"id":"W2096616111","doi":"10.1016/j.comgeo.2004.12.004","title":"When can a net fold to a polyhedron?","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Dihedral angle; Net (polyhedron); Fold (higher-order function); Folding (DSP implementation); Combinatorics; Time complexity; Mathematics; Computer science; Geometry; Algorithm; Physics; Structural engineering; Engineering","score_opus":0.01190106065325264,"score_gpt":0.2493156393802527,"score_spread":0.23741457872700006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096616111","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.043011595,0.00010953072,0.9380273,0.016659833,0.000088683846,0.0001681579,0.0000148754,0.00023740511,0.0016826207],"genre_scores_gemma":[0.7443259,5.2798254e-7,0.25150967,0.0031933244,0.00013385843,0.000028129527,0.000029895664,0.0000074415248,0.00077130104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892503,0.000017334714,0.00018894995,0.00033664817,0.00030491568,0.00022713543],"domain_scores_gemma":[0.9992499,0.00009761063,0.000043899123,0.0003547065,0.000075173375,0.0001787129],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000111466106,0.00010709698,0.000104869054,0.0002464568,0.00012677285,0.00014968471,0.00068310945,0.00003299217,0.000085732965],"category_scores_gemma":[0.000019324521,0.000113675604,0.000053635573,0.0007459419,0.00001768088,0.0001784803,0.00024917547,0.00007514434,0.00079300953],"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.000004309565,0.00036311193,0.0011177686,0.000013693698,0.00005116825,0.000010640327,0.0017032735,0.13267912,0.00076888717,0.47085413,0.08031153,0.31212237],"study_design_scores_gemma":[0.0005304171,0.00008260184,0.03603939,0.000016120175,0.000009293984,0.000069651265,0.00002398768,0.6177335,0.0006309271,0.045616228,0.29874834,0.00049953343],"about_ca_topic_score_codex":0.000026855794,"about_ca_topic_score_gemma":0.00001445515,"teacher_disagreement_score":0.7013143,"about_ca_system_score_codex":0.000062780826,"about_ca_system_score_gemma":0.000091519556,"threshold_uncertainty_score":0.999985},"labels":[],"label_agreement":null},{"id":"W2097923493","doi":"10.1016/s0925-7721(02)00126-8","title":"Tight degree bounds for pseudo-triangulations of points","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Degree (music); Triangulation; Combinatorics; Point set triangulation; Vertex (graph theory); Mathematics; Pitteway triangulation; General position; Face (sociological concept); Position (finance); Set (abstract data type); Point (geometry); Minimum-weight triangulation; Delaunay triangulation; Computer science; Geometry; Bowyer–Watson algorithm; Physics; Graph","score_opus":0.0390161392047745,"score_gpt":0.2814012461207045,"score_spread":0.24238510691593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097923493","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.03834271,0.00020482304,0.95813406,0.000457392,0.0006027347,0.00029499325,0.000026879556,0.0000737575,0.0018626457],"genre_scores_gemma":[0.5753141,0.0000018353651,0.42402256,0.0001513548,0.00006778996,0.000024075765,0.00008018118,0.000008513884,0.00032958406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983799,0.00008447772,0.00046640454,0.00038225815,0.00044854148,0.0002384411],"domain_scores_gemma":[0.9979635,0.00081155705,0.00021003663,0.00028431846,0.0006244588,0.00010614154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053641887,0.0001592301,0.00021416598,0.000563701,0.00022811342,0.00009184807,0.0003827871,0.0000765189,0.000063508836],"category_scores_gemma":[0.00035186915,0.00016953179,0.00015625142,0.0015003055,0.000053324184,0.00040925827,0.000060005477,0.00007768101,0.00003344925],"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.000008921512,0.00014445759,0.00052181905,0.000031496635,0.000048114787,0.0000010268772,0.00011209358,0.088714205,0.00018853275,0.89419514,0.0021574646,0.013876755],"study_design_scores_gemma":[0.0016868509,0.0001918547,0.023040839,0.000025312987,0.000025955696,0.000073439456,0.000024253586,0.34631255,0.0029380787,0.61198485,0.013279779,0.00041623123],"about_ca_topic_score_codex":0.0000018799492,"about_ca_topic_score_gemma":0.0000012401464,"teacher_disagreement_score":0.5369714,"about_ca_system_score_codex":0.00005110784,"about_ca_system_score_gemma":0.00029326108,"threshold_uncertainty_score":0.6913306},"labels":[],"label_agreement":null},{"id":"W2099217816","doi":"10.1016/j.comgeo.2003.07.005","title":"On simplifying dot maps","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Mathematics; Set (abstract data type); Combinatorics; Distribution (mathematics); Point (geometry); Approximation algorithm; Simple (philosophy); Unit (ring theory); Algorithm; Discrete mathematics; Mathematical optimization; Computer science; Geometry; Mathematical analysis","score_opus":0.020312816278730432,"score_gpt":0.2606426524941045,"score_spread":0.24032983621537407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099217816","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.034267783,0.00016764255,0.9504312,0.00044040877,0.000818232,0.00014113344,0.0000064817655,0.00019730639,0.013529807],"genre_scores_gemma":[0.88410425,0.000002792732,0.11349883,0.0017388654,0.00008875849,0.000013903933,0.00005413041,0.000011768478,0.00048668837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817044,0.00011810705,0.00030238435,0.0004998537,0.00061399466,0.00029520725],"domain_scores_gemma":[0.99852663,0.0007031193,0.00010441085,0.0003119737,0.00020761156,0.00014622898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043185966,0.00018952804,0.00015875131,0.00053364574,0.00029242772,0.00020737493,0.000420886,0.00006691676,0.00010899712],"category_scores_gemma":[0.00031098377,0.00019548547,0.000095688774,0.0015065448,0.000030484265,0.00037601206,0.000077948534,0.000173152,0.000568083],"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.0000029938185,0.00007307711,0.00010380095,0.00000599777,0.000013731367,0.0000068499003,0.000035194,0.3128599,0.00004939706,0.6742677,0.0035776482,0.009003719],"study_design_scores_gemma":[0.0009564802,0.00019560965,0.006454943,0.000024708528,0.0000071994536,0.000107836735,0.00001778457,0.11844764,0.0010728347,0.8398019,0.03237744,0.0005356235],"about_ca_topic_score_codex":0.0000011785905,"about_ca_topic_score_gemma":2.9601824e-7,"teacher_disagreement_score":0.84983647,"about_ca_system_score_codex":0.000075995325,"about_ca_system_score_gemma":0.00015301308,"threshold_uncertainty_score":0.7971666},"labels":[],"label_agreement":null},{"id":"W2099361645","doi":"10.1016/j.comgeo.2008.11.003","title":"Linear reconfiguration of cube-style modular robots","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ministerio de Economía y Competitividad; Fonds De La Recherche Scientifique - FNRS; Departament d'Universitats, Recerca i Societat de la Informació; McGill University; National Science Foundation","keywords":"Self-reconfiguring modular robot; Control reconfiguration; Robot; Modular design; Robotics; Computer science; Automation; Cube (algebra); Bounding overwatch; Algorithm; Artificial intelligence; Mobile robot; Embedded system; Engineering; Robot control; Mathematics; Combinatorics; Programming language","score_opus":0.024819053864394515,"score_gpt":0.22681311362628667,"score_spread":0.20199405976189216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099361645","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.4256242,0.00027470867,0.57243633,0.000018754588,0.00019972168,0.00006303007,0.00000832765,0.00008040179,0.0012945221],"genre_scores_gemma":[0.98043495,0.000053083222,0.019159606,0.000028251505,0.00008574932,0.000003885401,0.00006355236,0.00001704015,0.00015385015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992788,0.000011525167,0.0002577051,0.00012249903,0.0002102729,0.0001192],"domain_scores_gemma":[0.99961954,0.000056124038,0.000036978483,0.000120066026,0.0001193034,0.00004798045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000070134665,0.00009643315,0.0001409804,0.0001565207,0.000052821877,0.0000055768137,0.000103374216,0.000055978613,0.00020133161],"category_scores_gemma":[0.000029096293,0.000102638776,0.00005398403,0.0003019256,0.000039234626,0.00009912652,0.000012545362,0.00009015628,0.00009886309],"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.0000022913948,0.000019023037,0.000414119,0.00002758132,0.000021736965,0.0000047664907,0.00010987108,0.9938207,0.0007870414,0.00063443783,0.0004847581,0.0036736624],"study_design_scores_gemma":[0.000118087184,0.000027460432,0.01671104,0.00001600514,0.0000045982247,0.000033441807,0.000013596881,0.97408247,0.007286492,0.0009404275,0.00062258873,0.00014381412],"about_ca_topic_score_codex":0.000008120262,"about_ca_topic_score_gemma":5.808226e-7,"teacher_disagreement_score":0.5548108,"about_ca_system_score_codex":0.000022719816,"about_ca_system_score_gemma":0.000019286537,"threshold_uncertainty_score":0.41854876},"labels":[],"label_agreement":null},{"id":"W2102958968","doi":"10.1016/j.comgeo.2013.02.003","title":"On the power of the semi-separated pair decomposition","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Rectangle; Time complexity; Context (archaeology); Linear space; Computational geometry; Data structure; Line segment; Plane (geometry); Binary logarithm; Discrete mathematics; Algorithm; Geometry; Computer science","score_opus":0.010882962751342998,"score_gpt":0.24527482463467473,"score_spread":0.23439186188333172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102958968","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.60860616,0.000062421044,0.38381538,0.005238836,0.00048674468,0.00033092033,0.0000054841034,0.000058124297,0.0013959592],"genre_scores_gemma":[0.9930758,7.983262e-7,0.004325887,0.0022056329,0.000047100613,0.00003282015,0.000019567313,0.000007136483,0.00028525377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984349,0.00017373092,0.00032315787,0.0002751063,0.00061399845,0.00017909973],"domain_scores_gemma":[0.99788785,0.0010307021,0.00019140562,0.0004043683,0.00043037423,0.000055286942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030124493,0.00014387257,0.00012485271,0.00018259701,0.00029590185,0.00013439448,0.0007723495,0.000054872577,0.00026106887],"category_scores_gemma":[0.00014227934,0.00008781493,0.00012223725,0.0015944074,0.000080223355,0.00030260353,0.00019136936,0.00016413379,0.000286333],"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.0000060868556,0.00015419067,0.0005673352,0.0000075411494,0.000043643267,6.321554e-7,0.00020338224,0.6361552,0.00089310267,0.32991844,0.028798861,0.0032516015],"study_design_scores_gemma":[0.00033743193,0.00012802023,0.16277683,0.00003813339,0.000007076602,0.00002192724,0.000027242198,0.64046276,0.0036607324,0.19123346,0.0010922009,0.00021419987],"about_ca_topic_score_codex":0.000009158954,"about_ca_topic_score_gemma":4.2678488e-7,"teacher_disagreement_score":0.3844697,"about_ca_system_score_codex":0.000044574605,"about_ca_system_score_gemma":0.00010460967,"threshold_uncertainty_score":0.36803266},"labels":[],"label_agreement":null},{"id":"W2110762325","doi":"10.1016/j.comgeo.2014.11.001","title":"Flip distance between two triangulations of a point set is NP-complete","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polygon (computer graphics); Combinatorics; Regular polygon; Mathematics; Convex polygon; Set (abstract data type); Plane (geometry); Point (geometry); Polygon covering; Discrete mathematics; Computer science; Geometry","score_opus":0.03363412871043522,"score_gpt":0.2903187787358435,"score_spread":0.2566846500254083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110762325","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.049352784,0.00010710452,0.9467529,0.0016739912,0.00032183624,0.00019429527,0.00013236784,0.000114332484,0.0013503784],"genre_scores_gemma":[0.86746424,0.0000014220387,0.13100655,0.00070385827,0.00031396773,0.000011958933,0.00029109308,0.000012641025,0.00019425851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976043,0.00016507047,0.00066478667,0.00053387147,0.0007464002,0.00028554353],"domain_scores_gemma":[0.9974888,0.001086646,0.00033322783,0.00045988098,0.0004747401,0.00015672315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070010585,0.00021925589,0.00035626607,0.0005876826,0.00023004961,0.00012123593,0.000674534,0.00006544276,0.00008879714],"category_scores_gemma":[0.00020570625,0.00023321935,0.0001733869,0.0019395644,0.00008483828,0.0004959236,0.00020537445,0.00015058875,0.000116714415],"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.000022358892,0.00015927719,0.009071202,0.00006755329,0.00015001524,0.0000026153432,0.00091417105,0.35094833,0.0003218496,0.53378797,0.008083634,0.09647105],"study_design_scores_gemma":[0.0015660754,0.00015207156,0.08446227,0.000035583904,0.00002779538,0.000015499318,0.000014835021,0.6935659,0.0004836382,0.19359785,0.025637794,0.00044066523],"about_ca_topic_score_codex":0.000014559497,"about_ca_topic_score_gemma":0.0000021121573,"teacher_disagreement_score":0.8181115,"about_ca_system_score_codex":0.000057373618,"about_ca_system_score_gemma":0.0001232164,"threshold_uncertainty_score":0.9510409},"labels":[],"label_agreement":null},{"id":"W2111097990","doi":"10.1016/j.comgeo.2012.01.002","title":"Fast local searches and updates in bounded universes","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bounded function; Binary logarithm; Universe; Hash function; Range (aeronautics); Computer science; Data structure; Range query (database); Combinatorics; Discrete mathematics; Element (criminal law); Amortized analysis; Theoretical computer science; Mathematics; Information retrieval; Search engine; Physics; Astrophysics","score_opus":0.021308189288534653,"score_gpt":0.28789648519996724,"score_spread":0.26658829591143257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111097990","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.06832889,0.0006964644,0.93000954,0.00023394036,0.000051126324,0.00006389003,0.000002192086,0.00009867905,0.00051528995],"genre_scores_gemma":[0.8585222,0.000028828203,0.14116202,0.00018256406,0.000028421011,0.000002069055,0.0000067772685,0.00000434867,0.00006278287],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992438,0.000036836773,0.00011867817,0.00017594053,0.000190056,0.00023467396],"domain_scores_gemma":[0.9994867,0.00022053091,0.00003267869,0.00011027607,0.000058019825,0.00009183922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021133554,0.00008669596,0.000101309495,0.0002742045,0.000066279215,0.00006447756,0.00021695104,0.00003651103,0.0000118638445],"category_scores_gemma":[0.000046877733,0.00008528391,0.000019851308,0.0006715042,0.000117878226,0.0010425969,0.00023199436,0.00011336099,0.00002237459],"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.000022418775,0.00025875994,0.067732885,0.000052125743,0.000024747129,0.00003067105,0.0009256603,0.0033683965,0.00015834782,0.3219739,0.0010289032,0.6044232],"study_design_scores_gemma":[0.0013033709,0.00023555577,0.56490225,0.000099297424,0.000008361385,0.00016302119,0.00077748165,0.1490981,0.009029602,0.25382072,0.019680437,0.0008817868],"about_ca_topic_score_codex":0.000010527521,"about_ca_topic_score_gemma":0.00000101242,"teacher_disagreement_score":0.7901933,"about_ca_system_score_codex":0.00005082656,"about_ca_system_score_gemma":0.00003771846,"threshold_uncertainty_score":0.3477777},"labels":[],"label_agreement":null},{"id":"W2112198514","doi":"10.1016/j.comgeo.2009.01.004","title":"Bounds for point recolouring in geometric graphs","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Graph; Mathematics; Point (geometry); Sequence (biology); Discrete mathematics; Geometry","score_opus":0.01728302891155168,"score_gpt":0.26761283168904354,"score_spread":0.25032980277749184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112198514","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.11869749,0.00040468914,0.87735546,0.0018319398,0.0005108053,0.0003568293,0.0000069012362,0.00013857314,0.0006973206],"genre_scores_gemma":[0.81064934,0.000008925755,0.18785016,0.0011129247,0.00011089125,0.00003152664,0.00007619392,0.000007866016,0.00015216052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980367,0.000053023625,0.0004949823,0.0005610759,0.0004476859,0.00040655865],"domain_scores_gemma":[0.99854493,0.000650408,0.00014355664,0.0002509159,0.00028535118,0.00012484989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007408247,0.00019913809,0.0002419063,0.0022989884,0.00020734251,0.00023287881,0.0005612218,0.00009080234,0.000018900711],"category_scores_gemma":[0.0002920203,0.0002214819,0.00014223416,0.004702615,0.00002319856,0.00071089953,0.00008065752,0.00015925561,0.000034939454],"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.000032055115,0.00036715384,0.0013333141,0.0000261592,0.000023693356,0.000013573007,0.00016682142,0.48158625,0.00014279723,0.29121876,0.0031809795,0.22190845],"study_design_scores_gemma":[0.0012583712,0.00033160133,0.16045974,0.000023926603,0.000005407512,0.00003743257,0.000014181426,0.35581195,0.00028109536,0.47896582,0.0024360004,0.0003744789],"about_ca_topic_score_codex":0.000003794014,"about_ca_topic_score_gemma":0.0000025952618,"teacher_disagreement_score":0.6919519,"about_ca_system_score_codex":0.00014239825,"about_ca_system_score_gemma":0.00015693133,"threshold_uncertainty_score":0.90317696},"labels":[],"label_agreement":null},{"id":"W2114400222","doi":"10.1016/j.comgeo.2006.03.006","title":"Space-efficient geometric divide-and-conquer algorithms","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Divide and conquer algorithms; Space (punctuation); Computer science; Algorithm; Theoretical computer science","score_opus":0.010695216191917826,"score_gpt":0.23222283243992714,"score_spread":0.22152761624800932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114400222","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.09912542,0.0012882475,0.89537674,0.0013298845,0.00058951654,0.00019894759,0.0000127632065,0.00023476654,0.0018436818],"genre_scores_gemma":[0.87111944,0.00000839479,0.12725544,0.00035944473,0.00038418357,0.000020439205,0.000105807,0.000015284484,0.00073153403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754673,0.000078042875,0.0004560556,0.0006930858,0.000821767,0.00040429368],"domain_scores_gemma":[0.99843794,0.0005826795,0.00016844492,0.00029875623,0.0003535892,0.00015857375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050404976,0.00026262156,0.00024774042,0.0013507763,0.00034423172,0.00035566557,0.00045388032,0.00009733727,0.00005466555],"category_scores_gemma":[0.00010501273,0.0002685748,0.00010264538,0.0033835298,0.000087642504,0.00038052516,0.0003425466,0.00018135487,0.00018181746],"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.0000040192654,0.00018094663,0.0012887727,0.000017589207,0.000025205145,0.00001588018,0.000038248825,0.7008623,0.00008856783,0.24831432,0.0038110898,0.045353062],"study_design_scores_gemma":[0.0007504395,0.00008105051,0.13368894,0.000014595178,0.0000139596905,0.000121354016,0.000007781299,0.7830782,0.00045364504,0.07068724,0.010628449,0.00047434194],"about_ca_topic_score_codex":0.000044963814,"about_ca_topic_score_gemma":0.0000015355818,"teacher_disagreement_score":0.77199405,"about_ca_system_score_codex":0.00008991502,"about_ca_system_score_gemma":0.00012694563,"threshold_uncertainty_score":0.99997663},"labels":[],"label_agreement":null},{"id":"W2115964316","doi":"10.1016/j.comgeo.2007.05.008","title":"Approximate range searching in higher dimension","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Curse of dimensionality; Range (aeronautics); Dimension (graph theory); Dimensionality reduction; Polytope; Mathematics; Ball (mathematics); Range query (database); Unit sphere; Boundary (topology); Exponential function; Combinatorics; Applied mathematics; Mathematical optimization; Computer science; Mathematical analysis; Search engine; Statistics; Web search query; Sargable; Artificial intelligence; Information retrieval","score_opus":0.033773508413437056,"score_gpt":0.2848348428959546,"score_spread":0.25106133448251755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115964316","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.20262003,0.00023589924,0.7933033,0.000655852,0.00058829697,0.00015434957,0.0000017270902,0.00012548412,0.002315058],"genre_scores_gemma":[0.8717011,0.0000029486273,0.12713431,0.00060686766,0.00016782229,0.0000058748506,0.00004070066,0.000010143299,0.00033023919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980378,0.0000721144,0.00040503166,0.0004531793,0.00064039195,0.0003914737],"domain_scores_gemma":[0.9988401,0.00055250054,0.00009442108,0.00022320377,0.0001588334,0.00013093025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013411777,0.00016070332,0.00016861137,0.0009723276,0.00015082369,0.00012549826,0.0004120386,0.00007360438,0.00005794379],"category_scores_gemma":[0.00006332097,0.00016735093,0.00006528505,0.002143689,0.00003410548,0.00056034734,0.00022749612,0.00022113114,0.00010309166],"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.00005466173,0.00035862712,0.011582111,0.000052849224,0.000029733843,0.00013676802,0.0006163725,0.46463418,0.000998857,0.37465796,0.000878942,0.14599895],"study_design_scores_gemma":[0.0012368468,0.00007662272,0.45658565,0.000041170442,0.0000036510305,0.000047253525,0.000025540496,0.47485346,0.0005015256,0.06343426,0.0027761336,0.00041789215],"about_ca_topic_score_codex":0.00000982903,"about_ca_topic_score_gemma":0.0000045423967,"teacher_disagreement_score":0.6690811,"about_ca_system_score_codex":0.000111634654,"about_ca_system_score_gemma":0.000076557095,"threshold_uncertainty_score":0.68243724},"labels":[],"label_agreement":null},{"id":"W2116417064","doi":"10.1016/j.comgeo.2007.01.003","title":"Computational geometric aspects of rhythm, melody, and voice-leading","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Rhythm; Music theory; Computer science; Musicology; Field (mathematics); Perception; Computer music; Computational model; Music perception; Mathematics; Algorithm; Psychology; Musical; Visual arts; Pure mathematics; Aesthetics; Art","score_opus":0.015255898013499422,"score_gpt":0.25595322470666765,"score_spread":0.24069732669316823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116417064","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.22359055,0.0014100756,0.7678225,0.0016770579,0.0002098152,0.00010999046,0.000006314731,0.0001903381,0.004983348],"genre_scores_gemma":[0.917292,0.000014258124,0.0820801,0.00048840686,0.00004495229,0.0000025120007,0.000009490914,0.0000042716842,0.00006397955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986015,0.00003387024,0.00033183646,0.00038083448,0.00041446547,0.00023749202],"domain_scores_gemma":[0.9987796,0.0005677978,0.0001608263,0.00019586425,0.00022650046,0.00006943318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002783223,0.0001583991,0.00028962354,0.0009446514,0.00022308042,0.000057148896,0.0003769571,0.000093301656,0.000012377411],"category_scores_gemma":[0.00018280608,0.0001590599,0.00006132809,0.00202164,0.00015096292,0.00028319773,0.00018813802,0.00017257828,0.000031640808],"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.0000065167847,0.00012410642,0.002304997,0.0000286024,0.00007442487,0.00001907869,0.0004125783,0.029963704,0.000024726723,0.9033331,0.0014707235,0.062237386],"study_design_scores_gemma":[0.0005616719,0.00019890608,0.3045212,0.000027190623,0.000011071192,0.0001435369,0.00003906136,0.07529344,0.000060605147,0.61801773,0.00087697495,0.00024860154],"about_ca_topic_score_codex":0.0000029044406,"about_ca_topic_score_gemma":6.352152e-7,"teacher_disagreement_score":0.69370145,"about_ca_system_score_codex":0.000033744305,"about_ca_system_score_gemma":0.00007112497,"threshold_uncertainty_score":0.64862746},"labels":[],"label_agreement":null},{"id":"W2122684646","doi":"10.1016/j.comgeo.2011.12.005","title":"Memoryless routing in convex subdivisions: Random walks are optimal","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Combinatorics; Neighbourhood (mathematics); Vertex (graph theory); Subdivision; Regular polygon; Mathematics; Routing (electronic design automation); Discrete mathematics; Computer science; Graph","score_opus":0.04721833308990548,"score_gpt":0.26880988363864333,"score_spread":0.22159155054873786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122684646","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.03974634,0.000069650516,0.95591927,0.0002680955,0.00024352057,0.00022614452,0.0000037474626,0.00013075685,0.003392488],"genre_scores_gemma":[0.8483044,0.000007255152,0.15106368,0.00037382837,0.00002627995,0.000015818136,0.0000142315275,0.000009421355,0.00018507901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983384,0.00014110946,0.00037329018,0.00040397278,0.0004269841,0.0003162139],"domain_scores_gemma":[0.99891233,0.00035353124,0.00013305683,0.00025189886,0.00021908335,0.0001300939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007448742,0.00013724917,0.00022215582,0.00047714554,0.00013841834,0.00012415198,0.00067042495,0.00006890113,0.0002972569],"category_scores_gemma":[0.0002041141,0.0001373306,0.00006443457,0.0011439563,0.00006211683,0.00049658417,0.00029908115,0.00021803794,0.00023952944],"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.00010507415,0.00083411136,0.05966558,0.000072404684,0.000076777396,0.00019729607,0.0064680306,0.70671225,0.00002707428,0.19387388,0.0021409185,0.02982659],"study_design_scores_gemma":[0.0017391273,0.00002907687,0.069939405,0.000046527264,0.0000020397504,0.000014715153,0.00017117122,0.9220565,0.000048361297,0.005637407,0.00011006943,0.00020557766],"about_ca_topic_score_codex":0.000022332433,"about_ca_topic_score_gemma":0.0000031139323,"teacher_disagreement_score":0.80855805,"about_ca_system_score_codex":0.00004878152,"about_ca_system_score_gemma":0.0001029969,"threshold_uncertainty_score":0.56001794},"labels":[],"label_agreement":null},{"id":"W2124120807","doi":"10.1016/j.comgeo.2009.08.001","title":"Data structures for range-aggregate extent queries","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Rectangle; Aggregate (composite); Range (aeronautics); Set (abstract data type); Point (geometry); Partition (number theory); Computational geometry; Mathematics; Function (biology); Plane (geometry); Data structure; Set function; Computer science; Line segment; Combinatorics; Algorithm; Discrete mathematics; Geometry","score_opus":0.04191183951615511,"score_gpt":0.290789303862651,"score_spread":0.24887746434649588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124120807","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.034465287,0.0007098006,0.96095186,0.002007455,0.000810269,0.0005401135,0.00011086263,0.00017980112,0.00022452415],"genre_scores_gemma":[0.5398745,0.000009714531,0.4572629,0.0010147073,0.00036760428,0.000090709684,0.0009031316,0.00001521258,0.00046149487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981223,0.00005350092,0.00037340177,0.0006608225,0.0004827351,0.00030724294],"domain_scores_gemma":[0.99793565,0.00056764967,0.00015775036,0.000680617,0.0005201836,0.00013816394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000316228,0.00020150845,0.00019893624,0.00034419072,0.00029994186,0.0004597957,0.0013403498,0.00006818233,0.00012737418],"category_scores_gemma":[0.00022815508,0.00019239509,0.000076290904,0.0007738673,0.000060418355,0.0014610349,0.000537334,0.00010198813,0.00014673488],"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.000021540054,0.00015388963,0.0008497113,0.00009565194,0.00013837391,0.000004405642,0.00019688193,0.23388904,0.0003427863,0.41176847,0.07829317,0.2742461],"study_design_scores_gemma":[0.000605937,0.00007401535,0.03789869,0.000011393383,0.000010313607,0.000031232124,0.000020557733,0.68138224,0.00016859359,0.25735357,0.022135908,0.00030756008],"about_ca_topic_score_codex":0.000016862343,"about_ca_topic_score_gemma":0.0000028016498,"teacher_disagreement_score":0.50540924,"about_ca_system_score_codex":0.000039011225,"about_ca_system_score_gemma":0.00016084325,"threshold_uncertainty_score":0.78456444},"labels":[],"label_agreement":null},{"id":"W2124937241","doi":"10.1016/j.comgeo.2012.04.001","title":"Exact algorithms and APX-hardness results for geometric packing and covering problems","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Packing problems; Mathematics; Combinatorics; Set packing; Monotone polygon; Cover (algebra); Unit square; Rectangle; Set (abstract data type); Polygon (computer graphics); Vertex cover; Algorithm; Plane (geometry); Set cover problem; Approximation algorithm; Square (algebra); Polyhedron; Vertex (graph theory); Geometry; Computer science; Graph","score_opus":0.03282671474468887,"score_gpt":0.27425363355803745,"score_spread":0.24142691881334857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124937241","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.085220136,0.0027600874,0.91016275,0.00040439755,0.0007452713,0.00036691027,0.000040758077,0.00011033024,0.00018936892],"genre_scores_gemma":[0.8374514,0.000053116346,0.16157503,0.00022328294,0.0003734224,0.00004073932,0.00011825786,0.000014233254,0.00015052542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982004,0.000051966003,0.0004011487,0.0004998164,0.00041973192,0.00042690962],"domain_scores_gemma":[0.9981867,0.0009509098,0.00018241665,0.00018369267,0.00025594872,0.00024031727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010191663,0.00021515848,0.00022996427,0.00078476267,0.00035632993,0.0003038391,0.00022563385,0.00008425541,0.0000033828464],"category_scores_gemma":[0.00034462337,0.00022171496,0.000055885623,0.0015153163,0.000054311036,0.0011426442,0.00026462143,0.00012267847,0.000009107913],"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.00007802766,0.00038281453,0.009525032,0.00044342323,0.00018812565,0.0000047640547,0.0017578864,0.17871593,0.0003930629,0.07147086,0.00326906,0.733771],"study_design_scores_gemma":[0.0028660705,0.00026483118,0.15759341,0.00007821234,0.00003471432,0.00021971916,0.000066686815,0.79056966,0.0004935617,0.018510252,0.028511072,0.0007918082],"about_ca_topic_score_codex":0.000006215826,"about_ca_topic_score_gemma":3.852273e-7,"teacher_disagreement_score":0.75223124,"about_ca_system_score_codex":0.000054888573,"about_ca_system_score_gemma":0.000061374165,"threshold_uncertainty_score":0.9041274},"labels":[],"label_agreement":null},{"id":"W2126473895","doi":"10.1016/j.comgeo.2014.05.001","title":"Theta-3 is connected","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Austrian Science Fund","keywords":"Graph; Graph theory; Context (archaeology); Path (computing); Set (abstract data type)","score_opus":0.011925380737211073,"score_gpt":0.22918335958953945,"score_spread":0.21725797885232837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126473895","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.022448808,0.000055058124,0.96232593,0.0010887417,0.001014047,0.00006757694,0.0000018803671,0.00018824216,0.01280971],"genre_scores_gemma":[0.98545784,7.329871e-7,0.011014538,0.0022769046,0.0002511443,0.000006376426,0.000007793416,0.000007004925,0.0009776897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892,0.00008578366,0.00023006123,0.00029529186,0.00028535846,0.00018349205],"domain_scores_gemma":[0.9990299,0.00033725737,0.000083141225,0.00027226662,0.00020314984,0.00007428076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032601273,0.000104926046,0.00014423687,0.00017498396,0.00013834049,0.00016072935,0.00045865835,0.000053520078,0.00014133725],"category_scores_gemma":[0.00005790387,0.000094324125,0.00008055528,0.000583012,0.000024208195,0.00020914098,0.00010271668,0.0000965107,0.00049676426],"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.00000386348,0.000057647852,0.0008261653,0.000014439086,0.000052588053,0.0000064369297,0.00039495318,0.04840941,0.000030260258,0.89040846,0.034925066,0.024870686],"study_design_scores_gemma":[0.00025601703,0.000053970212,0.005085697,0.000012342674,0.0000022185081,0.00008282048,0.000011187125,0.9023747,0.00004523207,0.057295658,0.03462591,0.0001542639],"about_ca_topic_score_codex":0.0000068311806,"about_ca_topic_score_gemma":7.798276e-7,"teacher_disagreement_score":0.963009,"about_ca_system_score_codex":0.000022860562,"about_ca_system_score_gemma":0.000025184014,"threshold_uncertainty_score":0.6385065},"labels":[],"label_agreement":null},{"id":"W2127927089","doi":"10.1016/s0925-7721(02)00128-1","title":"Translating a regular grid over a point set","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Cover (algebra); Order (exchange); Mathematics; Function (biology); Value (mathematics); Grid; Square (algebra); Finite set; Interval (graph theory); Set (abstract data type); Plane (geometry); Discrete mathematics; Geometry; Computer science; Mathematical analysis; Statistics","score_opus":0.01862488068393825,"score_gpt":0.25799336989335125,"score_spread":0.239368489209413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127927089","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.049410384,0.00044117554,0.9452302,0.0007190195,0.00078964786,0.00018396041,0.000012379364,0.00019722062,0.0030160467],"genre_scores_gemma":[0.7865547,0.0000029640275,0.21204823,0.0008673067,0.00017252742,0.000016216598,0.00007981788,0.000014192553,0.00024405206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997856,0.00016249511,0.00042092035,0.00055042445,0.0006700521,0.00034006644],"domain_scores_gemma":[0.99883384,0.0003195857,0.00013597317,0.0003210064,0.00022813033,0.00016148126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065465015,0.00021706805,0.00020631331,0.00048164948,0.00027949206,0.00022142734,0.00040846627,0.000081550344,0.00017316427],"category_scores_gemma":[0.00018621265,0.0002307196,0.00014259142,0.0017944127,0.000041169937,0.00068241026,0.00007267764,0.00018099886,0.00012549757],"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.000007892407,0.00013198366,0.0008374674,0.0000317087,0.00006399188,0.000026206595,0.00056819513,0.4081018,0.00039029747,0.56419456,0.004179854,0.021466043],"study_design_scores_gemma":[0.001858558,0.00017608886,0.016949832,0.00004755666,0.000022170614,0.00032197917,0.00007748575,0.6685194,0.0011396728,0.26968178,0.040337954,0.00086755387],"about_ca_topic_score_codex":0.0000039215884,"about_ca_topic_score_gemma":0.0000014049003,"teacher_disagreement_score":0.7371443,"about_ca_system_score_codex":0.00007573604,"about_ca_system_score_gemma":0.00023481261,"threshold_uncertainty_score":0.9408472},"labels":[],"label_agreement":null},{"id":"W2131625432","doi":"10.1016/j.comgeo.2010.12.003","title":"Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Waterloo; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Combinatorics; Vertex (graph theory); Unit disk graph; Approximation algorithm; Mathematics; Graph; Plane (geometry); Dimension (graph theory); Discrete mathematics; Wireless network; Geometry; Computer science; Wireless; Telecommunications","score_opus":0.017453222491086783,"score_gpt":0.24480263431444432,"score_spread":0.22734941182335755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131625432","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.41954178,0.00013866824,0.5793048,0.000084511405,0.00050816085,0.00014142472,0.000005741527,0.000044931145,0.00022996418],"genre_scores_gemma":[0.9414039,0.000027375172,0.05814412,0.0000944844,0.00009842232,0.0000166182,0.00011904434,0.000013741802,0.00008226314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763227,0.000083919804,0.0006624578,0.00052257394,0.0007141031,0.0003846751],"domain_scores_gemma":[0.9982297,0.0006721584,0.0002589909,0.000343742,0.0003491273,0.0001463057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006435013,0.00023393946,0.00030028805,0.0019581371,0.00013607446,0.00011851956,0.00071191665,0.00011926104,0.000069237394],"category_scores_gemma":[0.000063872685,0.00024363764,0.00011444337,0.0054568634,0.00008124756,0.00050551613,0.00024686565,0.0003784673,0.000018851508],"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.000013054526,0.00021231976,0.0056766155,0.00002095912,0.000021973441,0.0000052097,0.00008708852,0.88573736,0.00011834524,0.099736854,0.00010845175,0.008261746],"study_design_scores_gemma":[0.0006741052,0.00005710963,0.013189721,0.000027132795,0.0000063155203,0.00001241524,0.000025653222,0.96762973,0.00031265593,0.017593483,0.00022009051,0.00025159292],"about_ca_topic_score_codex":0.00004840077,"about_ca_topic_score_gemma":0.000018602494,"teacher_disagreement_score":0.52186215,"about_ca_system_score_codex":0.00003667818,"about_ca_system_score_gemma":0.00015764115,"threshold_uncertainty_score":0.99352545},"labels":[],"label_agreement":null},{"id":"W2138168865","doi":"10.1016/j.comgeo.2014.08.006","title":"Weighted straight skeletons in the plane","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polygon (computer graphics); Skeleton (computer programming); Regular polygon; Combinatorics; Mathematics; Ambiguity; Convex polygon; Point (geometry); Planar; Computer science; Topology (electrical circuits); Geometry; Computer graphics (images)","score_opus":0.010443610985783884,"score_gpt":0.23664905553857915,"score_spread":0.22620544455279526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138168865","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.06738982,0.000110719884,0.92226756,0.003044824,0.0003557974,0.00015912695,0.000005006449,0.00008838168,0.0065787635],"genre_scores_gemma":[0.9404129,0.0000026430657,0.05716325,0.0018786531,0.00022608363,0.000018518027,0.000118250005,0.000006176359,0.00017355848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827456,0.00021658913,0.0003116523,0.00035902025,0.0005854748,0.00025268205],"domain_scores_gemma":[0.9984225,0.0010040307,0.000086578955,0.00030958033,0.0001122321,0.000065103064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007856114,0.00014747544,0.00014172278,0.00046021328,0.00018785323,0.0001960684,0.0008553146,0.000058680373,0.00006156863],"category_scores_gemma":[0.00009406786,0.0001165033,0.00006288842,0.0018544341,0.00004105119,0.00033000283,0.00009639748,0.00020076774,0.00016151335],"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.000004969647,0.00017460235,0.00080775144,0.000012441361,0.000014682844,0.00001091579,0.0003851502,0.14022057,0.000053926273,0.7879309,0.004862676,0.06552139],"study_design_scores_gemma":[0.0006646492,0.000107783715,0.12677749,0.000014171148,0.000004949387,0.00008377097,0.0000244864,0.68961084,0.000075717144,0.14754099,0.03482006,0.00027508484],"about_ca_topic_score_codex":0.0000068395993,"about_ca_topic_score_gemma":0.0000074251416,"teacher_disagreement_score":0.87302303,"about_ca_system_score_codex":0.000033223212,"about_ca_system_score_gemma":0.00008295704,"threshold_uncertainty_score":0.47508666},"labels":[],"label_agreement":null},{"id":"W2138849026","doi":"10.1016/j.comgeo.2008.12.005","title":"Compatible geometric matchings","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Conjecture; Perfect power; Matching (statistics); Disjoint union (topology); Sequence (biology); Trivially perfect graph; Vertex (graph theory); Perfect graph theorem; Discrete mathematics; Graph; Chordal graph; Line graph","score_opus":0.012942487928348389,"score_gpt":0.25176984118123863,"score_spread":0.23882735325289023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138849026","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.066229776,0.00046176728,0.9263818,0.0022653374,0.00047545484,0.00016589867,0.000005020496,0.00038854702,0.0036263668],"genre_scores_gemma":[0.806404,0.000008422849,0.19042067,0.00254052,0.00017787759,0.000005548917,0.000081401464,0.000007727336,0.0003538557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977415,0.000066490145,0.00043777766,0.0005607918,0.00081470195,0.00037870355],"domain_scores_gemma":[0.9984905,0.00043636648,0.00016512365,0.0003697774,0.00034079218,0.0001974002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043020226,0.00022250816,0.00024626343,0.0013378183,0.00031326548,0.00033567054,0.00083834445,0.00008018426,0.00007296986],"category_scores_gemma":[0.00015821318,0.00024562448,0.00012875961,0.004500223,0.000030549836,0.0009111742,0.00013348744,0.00020545791,0.00042794173],"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.000009459513,0.00028355772,0.0004067296,0.0000117115505,0.000028564195,0.00001851425,0.000133767,0.3354217,0.00021156334,0.30696198,0.008693534,0.3478189],"study_design_scores_gemma":[0.0009778185,0.00034390241,0.17945293,0.000023642737,0.0000117138325,0.00014934414,0.000014205864,0.5033266,0.00063651585,0.30015725,0.014244748,0.0006613524],"about_ca_topic_score_codex":0.000004883228,"about_ca_topic_score_gemma":3.0796386e-7,"teacher_disagreement_score":0.7401742,"about_ca_system_score_codex":0.00008651272,"about_ca_system_score_gemma":0.00013988593,"threshold_uncertainty_score":0.9999996},"labels":[],"label_agreement":null},{"id":"W2141906371","doi":"10.1016/j.comgeo.2008.02.005","title":"Small weak epsilon-nets","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Mathematics; Set (abstract data type); Plane (geometry); Regular polygon; Point (geometry); Net (polyhedron); Discrete mathematics; Geometry; Computer science","score_opus":0.026139969051359662,"score_gpt":0.25126125309546166,"score_spread":0.225121284044102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141906371","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.04852897,0.00034069232,0.93899196,0.0037906743,0.00058282685,0.00015670572,0.000003259445,0.00031241734,0.00729251],"genre_scores_gemma":[0.6995953,0.0000063597686,0.29672828,0.0026850489,0.0001567512,0.0000059895847,0.000063171516,0.0000071765357,0.0007519237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981697,0.000065309236,0.00037088303,0.00053285994,0.00052706234,0.00033416235],"domain_scores_gemma":[0.99879104,0.0002616663,0.00012732511,0.00033817106,0.00029959687,0.00018222831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032945524,0.00021081761,0.00019420576,0.0005462325,0.0002473132,0.00025152956,0.00071493315,0.00008327763,0.000049068753],"category_scores_gemma":[0.00009823301,0.00022240209,0.000116299016,0.0016681484,0.000030336016,0.0004904887,0.00011785799,0.00017277528,0.00029421976],"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.000008540311,0.00022115483,0.00049108226,0.0000074016048,0.000025711633,0.000012241913,0.000108720706,0.38771263,0.00026500912,0.4360079,0.008221773,0.16691786],"study_design_scores_gemma":[0.0007881072,0.00030045127,0.16817033,0.0000223724,0.000009248386,0.0001366817,0.000012468117,0.52844137,0.00047567053,0.27460697,0.026482062,0.000554236],"about_ca_topic_score_codex":0.0000027045137,"about_ca_topic_score_gemma":7.0275075e-7,"teacher_disagreement_score":0.6510663,"about_ca_system_score_codex":0.00006427225,"about_ca_system_score_gemma":0.00015957371,"threshold_uncertainty_score":0.90692943},"labels":[],"label_agreement":null},{"id":"W2144232842","doi":"10.1016/j.comgeo.2004.05.005","title":"The one-round Voronoi game replayed","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Voronoi diagram; Computer science; Computer graphics (images); Mathematics; Geometry","score_opus":0.034548568441611374,"score_gpt":0.2907720741755746,"score_spread":0.25622350573396324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144232842","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.07057081,0.00036995774,0.9219786,0.0046616183,0.0006820547,0.00013190077,0.0000017623186,0.0001840065,0.0014192903],"genre_scores_gemma":[0.9458516,0.000009846099,0.052936707,0.00068322185,0.00016538127,0.000012689963,0.000004689751,0.000010006843,0.0003258583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983687,0.00004473411,0.0003424011,0.0003752711,0.00055055064,0.00031834687],"domain_scores_gemma":[0.9983864,0.00067726173,0.00012132319,0.00050037913,0.00021949735,0.00009514124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042173275,0.00013061023,0.00011873982,0.00012288122,0.0003794095,0.00041633568,0.0011665187,0.000053824624,0.000021464852],"category_scores_gemma":[0.00025473314,0.00010766335,0.00008111285,0.00078604475,0.00017639353,0.00041944598,0.00027560553,0.00017734728,0.0007692456],"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.000007728339,0.00008553718,0.00019489226,0.0000037666282,0.00003342766,0.000009877804,0.00045339923,0.24688636,0.00005114146,0.67953026,0.0005048067,0.07223882],"study_design_scores_gemma":[0.0001871579,0.000106739855,0.01010408,0.000022610815,0.0000057075517,0.00003877521,0.00009024702,0.08562648,0.0021075534,0.89143735,0.0099814525,0.00029184378],"about_ca_topic_score_codex":0.000039635786,"about_ca_topic_score_gemma":0.000014233123,"teacher_disagreement_score":0.8752808,"about_ca_system_score_codex":0.00013085542,"about_ca_system_score_gemma":0.0001916259,"threshold_uncertainty_score":0.98873526},"labels":[],"label_agreement":null},{"id":"W2144614313","doi":"10.1016/j.comgeo.2014.12.005","title":"Geometric red–blue set cover for unit squares and related problems","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cover (algebra); Set cover problem; Set (abstract data type); Mathematics; Square (algebra); Point (geometry); Combinatorics; Algorithm; Unit (ring theory); Computer science; Geometry","score_opus":0.02210877508890676,"score_gpt":0.2567454458011689,"score_spread":0.23463667071226216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144614313","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.08865814,0.00040505696,0.907958,0.0010252009,0.00053309824,0.0004045927,0.000023945657,0.000188057,0.00080394564],"genre_scores_gemma":[0.92711574,0.000012630128,0.070572756,0.0005251927,0.00016213623,0.00005272186,0.00031802373,0.00002021497,0.0012206127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979499,0.00011038107,0.00046997485,0.00063175755,0.0005000335,0.00033798377],"domain_scores_gemma":[0.9974789,0.0013812166,0.00020567524,0.00028495275,0.00047326396,0.00017601781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000843254,0.00023360799,0.0002591234,0.001100564,0.0003542091,0.0002754403,0.0004384109,0.00012564841,0.000047193294],"category_scores_gemma":[0.00048229823,0.00024114142,0.00009762944,0.002689374,0.00006644903,0.00056193926,0.00020582693,0.00015857417,0.000077687735],"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.000011678089,0.00009382992,0.0012338333,0.00010091364,0.00007351208,0.0000014759918,0.00022514044,0.8010125,0.000099431185,0.13602658,0.0060995836,0.05502149],"study_design_scores_gemma":[0.0011991896,0.00027847415,0.03848129,0.000026679809,0.00001730704,0.00006565678,0.000011785443,0.82316166,0.000112108464,0.10094096,0.035344336,0.0003605293],"about_ca_topic_score_codex":0.000004234598,"about_ca_topic_score_gemma":5.637136e-7,"teacher_disagreement_score":0.8384576,"about_ca_system_score_codex":0.000042020303,"about_ca_system_score_gemma":0.00010137214,"threshold_uncertainty_score":0.98334616},"labels":[],"label_agreement":null},{"id":"W2148125855","doi":"10.1016/s0925-7721(02)00091-3","title":"Ununfoldable polyhedra with convex faces","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Combinatorics; Polygon (computer graphics); Mathematics; Integer points in convex polyhedra; Convex set; Geometry; Computer science; Algorithm; Convex optimization; Linear programming","score_opus":0.016896247971182672,"score_gpt":0.20738663426013443,"score_spread":0.19049038628895176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148125855","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.050157204,0.0005197992,0.93996865,0.0017756892,0.0002854428,0.00016412845,0.0000058463893,0.0002621275,0.006861143],"genre_scores_gemma":[0.86252385,0.000009353226,0.13411285,0.0010950523,0.00011522787,0.000016003112,0.000029635466,0.000012658603,0.002085392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824595,0.000051434577,0.00026573514,0.00047900487,0.0006549572,0.00030292754],"domain_scores_gemma":[0.998962,0.0002553164,0.00012010273,0.00029210592,0.00021608628,0.00015442584],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016438791,0.00020033597,0.00019127922,0.0003719754,0.000257732,0.00024551057,0.000521614,0.000061773004,0.0006958646],"category_scores_gemma":[0.000038684964,0.00018131328,0.000059791204,0.0019262015,0.00006758456,0.0007654993,0.00015953745,0.00013868346,0.00091629365],"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.000011844117,0.00027391553,0.0027566287,0.000024243021,0.00008938272,0.000041655843,0.0003562704,0.77684957,0.000120668075,0.12276776,0.023702295,0.073005766],"study_design_scores_gemma":[0.00090553326,0.000236626,0.014304221,0.000018872013,0.000011795201,0.00017308429,0.000019995667,0.9376878,0.00043552154,0.01922693,0.02649515,0.00048448736],"about_ca_topic_score_codex":0.000007564393,"about_ca_topic_score_gemma":0.000001566974,"teacher_disagreement_score":0.8123666,"about_ca_system_score_codex":0.0000532291,"about_ca_system_score_gemma":0.000049185965,"threshold_uncertainty_score":0.9998616},"labels":[],"label_agreement":null},{"id":"W2152588767","doi":"10.1016/j.comgeo.2006.05.002","title":"Distance-preserving approximations of polygonal paths","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Path (computing); Mathematics; Line (geometry); Line segment; Enhanced Data Rates for GSM Evolution; Approximation algorithm; Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.009945846924860217,"score_gpt":0.22954590258253937,"score_spread":0.21960005565767915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152588767","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.053930078,0.00044148252,0.94046795,0.0004603912,0.0002987449,0.00013322289,0.000022367345,0.00011387776,0.0041318764],"genre_scores_gemma":[0.79569453,0.0000017970766,0.20350558,0.0000961184,0.0001582385,0.000013349351,0.00016636886,0.000007758777,0.00035628333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820244,0.000060441405,0.0004975781,0.00036055065,0.00065186265,0.00022713373],"domain_scores_gemma":[0.99864703,0.0003736608,0.00022064004,0.0002967532,0.00039506875,0.00006685957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002815308,0.00015430995,0.00019028343,0.0004760429,0.00018476804,0.000104129365,0.000584095,0.0000579946,0.00006395872],"category_scores_gemma":[0.000073745025,0.00016435579,0.000112624344,0.001694984,0.00006220003,0.0005775462,0.00020537028,0.00010492022,0.000035581397],"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.0000045305424,0.00015439373,0.0016526858,0.000028839333,0.000015583297,0.0000026672378,0.000046109137,0.42739064,0.0003659887,0.5610128,0.0021987238,0.007127048],"study_design_scores_gemma":[0.00042350654,0.000043143802,0.07769679,0.000023274695,0.000007434529,0.000022035163,0.000013466959,0.6676307,0.00084816624,0.25020626,0.0028457118,0.00023951233],"about_ca_topic_score_codex":0.000031147432,"about_ca_topic_score_gemma":0.000004314324,"teacher_disagreement_score":0.7417644,"about_ca_system_score_codex":0.00004934216,"about_ca_system_score_gemma":0.00015236915,"threshold_uncertainty_score":0.6702235},"labels":[],"label_agreement":null},{"id":"W2155081398","doi":"10.1016/j.comgeo.2004.08.003","title":"Geometric permutations of disjoint unit spheres","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Disjoint sets; Unit (ring theory); Combinatorics; SPHERES; Mathematics; Computer science; Physics; Mathematics education","score_opus":0.022113234651374533,"score_gpt":0.2633978648622475,"score_spread":0.24128463021087293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155081398","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.2147847,0.00037482753,0.7827282,0.0004907758,0.000324912,0.00014853253,0.000016743084,0.000118210344,0.0010130896],"genre_scores_gemma":[0.826049,0.000007948738,0.17341277,0.00021197801,0.00008752313,0.000012686484,0.00009991226,0.000011117467,0.00010707029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793595,0.000055051743,0.0005459932,0.00043501944,0.0007547087,0.00027330194],"domain_scores_gemma":[0.9982822,0.00040130905,0.0002393625,0.00034043376,0.00058795616,0.00014874018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025696086,0.00019938994,0.0002496836,0.0011806651,0.00020534797,0.00010994345,0.0006347981,0.00007536803,0.00011676012],"category_scores_gemma":[0.0002493264,0.00020781736,0.00014939079,0.004945814,0.00009227391,0.00062527537,0.0002109115,0.00015243863,0.00014325812],"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.0000043008404,0.0001794006,0.0009529458,0.000022387998,0.000034370303,0.000005587992,0.0001196341,0.70255125,0.000182594,0.28398916,0.00018882628,0.0117695695],"study_design_scores_gemma":[0.0027170996,0.00045106254,0.26132938,0.00008707433,0.000040453055,0.00016563834,0.00022272406,0.11451845,0.0060686963,0.61135143,0.0022217077,0.00082630373],"about_ca_topic_score_codex":0.000032632375,"about_ca_topic_score_gemma":0.000006929507,"teacher_disagreement_score":0.6112643,"about_ca_system_score_codex":0.00008279518,"about_ca_system_score_gemma":0.00039027494,"threshold_uncertainty_score":0.8474546},"labels":[],"label_agreement":null},{"id":"W2161217328","doi":"10.1016/j.comgeo.2012.10.012","title":"Making triangulations 4-connected using flips","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Triangulation; Upper and lower bounds; Mathematics; Matching (statistics); Enhanced Data Rates for GSM Evolution; Graph; Connectivity; Discrete mathematics; Computer science; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.12301935982546466,"score_gpt":0.3872212644220547,"score_spread":0.26420190459659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161217328","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.14219287,0.000316179,0.8560379,0.00011766333,0.00034582533,0.000118522235,0.000004186662,0.00015648238,0.00071035407],"genre_scores_gemma":[0.71490806,3.9883025e-7,0.2847418,0.00012921852,0.00014585098,0.0000046981263,0.000008906557,0.000009571528,0.000051504772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850655,0.00012637943,0.0002273863,0.00024478856,0.0004523533,0.00044255343],"domain_scores_gemma":[0.99864256,0.0006396051,0.000092135146,0.00030133172,0.00018961784,0.00013472587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051774806,0.00011929796,0.00013122882,0.00058263756,0.00029564384,0.00010194859,0.00051707076,0.000050374652,0.00008619341],"category_scores_gemma":[0.00027276255,0.00012548688,0.00007233339,0.0020335757,0.0000626308,0.0010220691,0.00026788918,0.00016046817,0.00012518515],"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.000010992853,0.00012342191,0.01094814,0.000013779352,0.00004382638,0.000005066891,0.0004114487,0.18093392,0.0005306661,0.78920174,0.00014380002,0.017633192],"study_design_scores_gemma":[0.00055496243,0.000025213807,0.07613393,0.000024864286,0.0000079774,0.00009656153,0.00005443267,0.72874266,0.00019867088,0.192611,0.001214743,0.00033501597],"about_ca_topic_score_codex":0.0000014869483,"about_ca_topic_score_gemma":1.9114705e-7,"teacher_disagreement_score":0.59659076,"about_ca_system_score_codex":0.00008795911,"about_ca_system_score_gemma":0.00007445452,"threshold_uncertainty_score":0.51172066},"labels":[],"label_agreement":null},{"id":"W2164869170","doi":"10.1016/j.comgeo.2012.02.008","title":"Bounded-degree polyhedronization of point sets","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo; Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Combinatorics; Bounded function; Polyhedron; Mathematics; Degree (music); Tetrahedron; Point (geometry); Set (abstract data type); Discrete mathematics; Computer science; Geometry; Physics","score_opus":0.03113578831950992,"score_gpt":0.27255014424967516,"score_spread":0.24141435593016525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164869170","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.11778032,0.00059614284,0.8782092,0.00039929664,0.0007596608,0.00013398612,0.000009222548,0.00010875479,0.0020034618],"genre_scores_gemma":[0.8423414,0.00000539606,0.15692782,0.00030601982,0.00017328125,0.0000069865637,0.000102766724,0.000009937321,0.00012638196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982705,0.00008309383,0.00042861386,0.0002725714,0.00062459713,0.00032060465],"domain_scores_gemma":[0.99867934,0.00029150458,0.00022244423,0.00028447216,0.00035910946,0.0001631592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053343724,0.00016295919,0.00019161489,0.0005352774,0.0001494951,0.00007475294,0.0004221852,0.00007525218,0.000087819826],"category_scores_gemma":[0.00013387304,0.00017115034,0.0000958235,0.0016133715,0.00005383295,0.0011583291,0.0001977993,0.00010612666,0.00012193216],"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.000013978908,0.00053615926,0.010875467,0.00006783102,0.0000886591,0.000002438348,0.0010056719,0.1274764,0.00056550116,0.75284845,0.0031196715,0.10339978],"study_design_scores_gemma":[0.0013734109,0.00023077628,0.3967391,0.000054401524,0.00003472604,0.00019074978,0.00009271002,0.44718808,0.0050504776,0.14233121,0.0058958414,0.0008185143],"about_ca_topic_score_codex":0.0000066793846,"about_ca_topic_score_gemma":5.778304e-7,"teacher_disagreement_score":0.7245611,"about_ca_system_score_codex":0.000073474985,"about_ca_system_score_gemma":0.00014637479,"threshold_uncertainty_score":0.6979308},"labels":[],"label_agreement":null},{"id":"W2165136719","doi":"10.1016/j.comgeo.2014.08.005","title":"The <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>θ</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-graph is a spanner","year":2014,"lang":"lv","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Spanner; Upper and lower bounds; Constant (computer programming); Path (computing); Constructive; Euclidean geometry","score_opus":0.017426892930790052,"score_gpt":0.24076703444921374,"score_spread":0.22334014151842368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165136719","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.5530301,0.00265759,0.065355554,0.002927672,0.0069000735,0.00007862505,0.0003388138,0.00033618152,0.36837545],"genre_scores_gemma":[0.9789071,0.0004949456,0.010156755,0.0042639906,0.0031319382,0.00049723673,0.0013897036,0.00037602024,0.00078227354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9902274,0.0005681549,0.0017914395,0.0019656902,0.003421342,0.0020259973],"domain_scores_gemma":[0.9914405,0.0033671104,0.0017790102,0.0019525915,0.0004499971,0.0010108256],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0027111233,0.0008168026,0.00032673642,0.00094763417,0.0025051637,0.0024829905,0.0026833946,0.0014238382,0.20032132],"category_scores_gemma":[0.0016834267,0.0014241455,0.001582581,0.0029098475,0.0012685183,0.0016954758,0.0021296102,0.0014107215,0.0035862997],"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.0004590069,0.00026951986,0.000023066545,0.00042127655,0.00095130224,0.00028134626,0.0013092372,0.050926954,0.00039704362,0.56311977,0.37244895,0.009392568],"study_design_scores_gemma":[0.0017786433,0.0012888662,0.0008278519,0.00057560235,0.0005899868,0.0009703355,0.00057726837,0.5511392,0.42398673,0.001503517,0.015254172,0.0015078379],"about_ca_topic_score_codex":0.0005233343,"about_ca_topic_score_gemma":0.00032002886,"teacher_disagreement_score":0.56161624,"about_ca_system_score_codex":0.00002335018,"about_ca_system_score_gemma":0.0019186755,"threshold_uncertainty_score":0.9998725},"labels":[],"label_agreement":null},{"id":"W2166510145","doi":"10.1016/j.comgeo.2011.10.003","title":"The ordinary line problem revisited","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Windsor","funders":"","keywords":"Line (geometry); Combinatorics; Plane (geometry); Mathematics; Set (abstract data type); Line segment; Geometry; Computer science","score_opus":0.03206935846472095,"score_gpt":0.2505453540429038,"score_spread":0.21847599557818284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166510145","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.0074178744,0.0010467598,0.9789048,0.00094835006,0.0004666186,0.00025089443,0.000005831651,0.00024421077,0.010714701],"genre_scores_gemma":[0.65360385,0.00004137314,0.3435494,0.00083964557,0.00026511223,0.00003747892,0.000086526605,0.000015274722,0.0015613441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835354,0.00010326277,0.00038615396,0.00039529765,0.0004759965,0.00028572165],"domain_scores_gemma":[0.99835384,0.00060000113,0.00015395289,0.00036799084,0.00040834097,0.000115846335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060589536,0.00016499219,0.00013552255,0.0002571907,0.0005661715,0.00018913925,0.00085054233,0.00005641715,0.000054649652],"category_scores_gemma":[0.00013914268,0.00012729166,0.00009406042,0.0017378317,0.00007152312,0.0004666948,0.00029170184,0.00016695821,0.00017313621],"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.000029717401,0.00017266329,0.00052430393,0.000020440266,0.00007184063,0.000020742955,0.000297695,0.026597902,0.000045164223,0.8222308,0.00963838,0.14035033],"study_design_scores_gemma":[0.0006136157,0.00029352267,0.035072364,0.000031305543,0.00001504566,0.00014380651,0.000020645108,0.33626553,0.00040132538,0.58145386,0.045232728,0.00045620973],"about_ca_topic_score_codex":0.000004264935,"about_ca_topic_score_gemma":7.589591e-7,"teacher_disagreement_score":0.646186,"about_ca_system_score_codex":0.00004108433,"about_ca_system_score_gemma":0.00013169179,"threshold_uncertainty_score":0.5190803},"labels":[],"label_agreement":null},{"id":"W2168580558","doi":"10.1016/j.comgeo.2012.03.003","title":"On point-sets that support planar graphs","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Queen's University; University of British Columbia; Carleton University","funders":"","keywords":"Combinatorics; Planar; Planar graph; Mathematics; Point (geometry); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Geometry; Computer science","score_opus":0.026485703198645155,"score_gpt":0.2677572371555159,"score_spread":0.24127153395687076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168580558","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.11973725,0.00025535183,0.870619,0.0010573445,0.0018271024,0.00021185014,0.000024059538,0.0002851892,0.00598284],"genre_scores_gemma":[0.9423553,0.00000518354,0.05391753,0.0029172054,0.00018535118,0.00001767477,0.00024094386,0.000015512114,0.00034533144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978234,0.00009187504,0.00030667675,0.0004245171,0.0008578072,0.000495717],"domain_scores_gemma":[0.9984299,0.000629671,0.00014622147,0.00034856072,0.00014868684,0.00029695],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057904713,0.00024095832,0.00020127109,0.0007591364,0.00026837646,0.0001563922,0.00056187715,0.00009165142,0.0002284756],"category_scores_gemma":[0.00009489528,0.00024038112,0.00013607412,0.0012522185,0.000046119236,0.0010554967,0.0001226681,0.00019906813,0.0010507177],"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.00002068979,0.00039150368,0.004750688,0.000019147015,0.00006276184,0.000012849877,0.00034143098,0.047331527,0.000050324223,0.8804524,0.03793189,0.028634774],"study_design_scores_gemma":[0.0019451663,0.0005946716,0.31626794,0.000048500602,0.000033046043,0.0004187455,0.00006971439,0.10248102,0.0013684316,0.54902446,0.02634534,0.0014029713],"about_ca_topic_score_codex":0.0000028691434,"about_ca_topic_score_gemma":4.0422304e-7,"teacher_disagreement_score":0.822618,"about_ca_system_score_codex":0.000073667594,"about_ca_system_score_gemma":0.00010245911,"threshold_uncertainty_score":0.9997271},"labels":[],"label_agreement":null},{"id":"W2171133375","doi":"10.1016/j.comgeo.2012.04.006","title":"Some properties of k-Delaunay and k-Gabriel graphs","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Universitatea \"Lucian Blaga\" din Sibiu","keywords":"Combinatorics; Mathematics; Delaunay triangulation; Chordal graph; Partition (number theory); 1-planar graph; Chromatic scale; Discrete mathematics; Graph","score_opus":0.023881423688665235,"score_gpt":0.23435551287742218,"score_spread":0.21047408918875693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171133375","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.6662847,0.0068336944,0.3255824,0.00038766637,0.00051682873,0.00013008762,0.0000044064727,0.00007860198,0.00018159478],"genre_scores_gemma":[0.95800924,0.00003118778,0.041352127,0.00031244644,0.00017363077,0.000009154191,0.000013499544,0.0000071297313,0.00009158845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987811,0.00005597389,0.00029853944,0.0002275283,0.0003995988,0.00023729293],"domain_scores_gemma":[0.9992333,0.00014408358,0.00012268068,0.00017096616,0.00019225097,0.0001367239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003666496,0.00013307044,0.00016842817,0.00042255982,0.000124788,0.00005862366,0.00025166076,0.000053218475,0.000008860549],"category_scores_gemma":[0.00007691738,0.00012403491,0.000058487745,0.0007651503,0.0000868837,0.0011166063,0.00019245855,0.000087835506,0.000021182243],"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.000012061985,0.00022821168,0.0065909303,0.000088754845,0.0000619258,0.0000010519728,0.0006996724,0.02172291,0.0036397974,0.94154716,0.0006584438,0.024749096],"study_design_scores_gemma":[0.0017980736,0.00030947136,0.33942157,0.00014122704,0.000052394884,0.00024768166,0.00014557313,0.30843973,0.029124107,0.31413484,0.0050225295,0.0011628298],"about_ca_topic_score_codex":0.000005406813,"about_ca_topic_score_gemma":1.6118346e-7,"teacher_disagreement_score":0.6274123,"about_ca_system_score_codex":0.000016929169,"about_ca_system_score_gemma":0.00006538429,"threshold_uncertainty_score":0.5057997},"labels":[],"label_agreement":null},{"id":"W2172263801","doi":"10.1016/j.comgeo.2016.06.001","title":"Probing convex polygons with a wedge","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Omega; Wedge (geometry); Regular polygon; Combinatorics; Polygon (computer graphics); Orientation (vector space); Physics; Geometry; Convex polygon; Mathematics; Computer science","score_opus":0.01447344354937682,"score_gpt":0.24694983642336288,"score_spread":0.23247639287398605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172263801","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.007506943,0.00007813409,0.98462963,0.0017332023,0.00006176484,0.000103608254,0.000003985838,0.00068312325,0.005199624],"genre_scores_gemma":[0.69893444,6.615842e-7,0.30002555,0.00033791285,0.000023331286,0.000015145686,0.0000020550206,0.00000957668,0.0006513388],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989575,0.000016959408,0.00015423034,0.0003332767,0.00031435068,0.00022365],"domain_scores_gemma":[0.9991752,0.00020200263,0.0000840306,0.00024401754,0.00020882409,0.000085909705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012797193,0.00012333346,0.00011693532,0.00024796542,0.00008513126,0.00026594513,0.0006108166,0.000031915257,0.000014625224],"category_scores_gemma":[0.000061357234,0.000079691075,0.000030885527,0.0006980886,0.00011865674,0.001168445,0.00022912578,0.000058092468,0.00014767493],"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.000025204548,0.00028072644,0.0046362253,0.00006771785,0.00007696253,0.00008582148,0.0003075048,0.00036576236,0.0022144443,0.3507881,0.008440273,0.6327113],"study_design_scores_gemma":[0.003362471,0.0008484786,0.028847128,0.0012519881,0.00002729495,0.0009751271,0.00003779926,0.060573146,0.02964513,0.8529101,0.019313186,0.002208122],"about_ca_topic_score_codex":0.0000013187079,"about_ca_topic_score_gemma":2.1511022e-7,"teacher_disagreement_score":0.69142747,"about_ca_system_score_codex":0.00004747619,"about_ca_system_score_gemma":0.00015612583,"threshold_uncertainty_score":0.32497075},"labels":[],"label_agreement":null},{"id":"W2172997417","doi":"10.1016/s0925-7721(00)00021-3","title":"Chromatic nearest neighbor searching: A query sensitive approach☆☆A preliminary version of this paper appeared in the Proceedings of the 7th Canadian Conference on Computational Geometry, 1995, pp. 261–266.","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"k-nearest neighbors algorithm; Nearest neighbor graph; Preprocessor; Nearest-neighbor chain algorithm; Nearest neighbor search; Best bin first; Computer science; Context (archaeology); Point (geometry); Fixed-radius near neighbors; Chromatic scale; Pattern recognition (psychology); Set (abstract data type); Algorithm; Mathematics; Artificial intelligence; Data mining; Combinatorics; Cluster analysis; Geography; Geometry","score_opus":0.015749243285038423,"score_gpt":0.22757780571054984,"score_spread":0.2118285624255114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172997417","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.95967346,0.0001909714,0.023358924,0.0033325197,0.0002407656,0.0012160115,0.00014551214,0.00006016484,0.011781654],"genre_scores_gemma":[0.9853006,0.000011547742,0.013188717,0.0010209181,0.00008864938,0.000028021499,0.00018593433,0.00001726021,0.00015833913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965403,0.00024042466,0.000685211,0.00061349955,0.0014854505,0.00043510454],"domain_scores_gemma":[0.99766475,0.00093259936,0.00031642758,0.00030723726,0.00061534764,0.0001636464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010182975,0.00031099017,0.0003714338,0.0007552983,0.00040760855,0.00017821843,0.0011859263,0.00013725141,0.00014097022],"category_scores_gemma":[0.00018590165,0.00023826984,0.00017853065,0.0034339519,0.00026524332,0.0005675133,0.00018097364,0.0004683801,0.000050003506],"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.00014368292,0.0005890613,0.0015469512,0.00019590987,0.000088312576,0.000011425441,0.0039949813,0.90834826,0.00026867847,0.06784681,0.004507126,0.012458818],"study_design_scores_gemma":[0.0008155772,0.00033381893,0.25960436,0.00020975534,0.000019964398,0.00008537887,0.00042464744,0.72787595,0.00018133617,0.009725319,0.00043067554,0.00029323137],"about_ca_topic_score_codex":0.00185338,"about_ca_topic_score_gemma":0.00012279085,"teacher_disagreement_score":0.25805742,"about_ca_system_score_codex":0.00019633299,"about_ca_system_score_gemma":0.00083450094,"threshold_uncertainty_score":0.9716362},"labels":[],"label_agreement":null},{"id":"W2184436935","doi":"10.1016/j.comgeo.2022.101859","title":"Edge guards for polyhedra in three-space","year":2022,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Universidad Nacional Autónoma de México; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Polyhedron; Dual polyhedron; Guard (computer science); Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Artificial intelligence","score_opus":0.0211046398829006,"score_gpt":0.26661800213189873,"score_spread":0.24551336224899814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184436935","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.06432572,0.00045338908,0.9306988,0.0024049242,0.0009383945,0.00039396362,0.00005047037,0.00011509477,0.00061924016],"genre_scores_gemma":[0.87260175,0.0000015530277,0.12547624,0.0008975634,0.0001758809,0.00022687894,0.00021777565,0.0000143473835,0.0003880101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980902,0.00008520743,0.00035185926,0.0005219352,0.00062805746,0.00032275895],"domain_scores_gemma":[0.9986486,0.000718235,0.0001233643,0.000257124,0.00016824485,0.00008445123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007258874,0.00016067644,0.00018968787,0.00083270564,0.00043369178,0.00014768442,0.0007243951,0.000038643124,0.00012040404],"category_scores_gemma":[0.00012908973,0.00019324406,0.000114387854,0.0022947788,0.000027183278,0.00046753895,0.00045535172,0.00020332751,0.000024631754],"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.00001983582,0.00013996409,0.000769538,0.000012167093,0.000013710006,0.000006526403,0.00014444186,0.7089552,0.000068401176,0.2541241,0.0026352059,0.03311089],"study_design_scores_gemma":[0.0010272027,0.00018727347,0.029014567,0.000004941812,0.0000040406703,0.00004217391,0.000042218373,0.7911959,0.00007918176,0.1527254,0.02538837,0.000288724],"about_ca_topic_score_codex":0.000011615553,"about_ca_topic_score_gemma":0.0000077291215,"teacher_disagreement_score":0.80827606,"about_ca_system_score_codex":0.00020779199,"about_ca_system_score_gemma":0.00030682856,"threshold_uncertainty_score":0.78802645},"labels":[],"label_agreement":null},{"id":"W2196668152","doi":"10.1016/s0925-7721(99)00056-5","title":"Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"STRIPS; Polyhedron; Silhouette; Folding (DSP implementation); Geometry; Computer science; Planar; Constructive; Topology (electrical circuits); Algorithm; Mathematics; Computer graphics (images); Combinatorics; Computer vision; Structural engineering; Engineering; Process (computing)","score_opus":0.010353722151738014,"score_gpt":0.2256887576563461,"score_spread":0.21533503550460809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196668152","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.91873634,0.00069365447,0.07908503,0.0002036037,0.0002838824,0.00012420572,0.000041997202,0.00020491338,0.0006263975],"genre_scores_gemma":[0.96391463,0.00006880985,0.035403088,0.00012552,0.00018368369,0.000003697125,0.00012356123,0.000028014518,0.00014900333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990085,0.000014357695,0.000332621,0.00022173573,0.00018262576,0.00024020784],"domain_scores_gemma":[0.99956787,0.0002018467,0.000031886833,0.00007291888,0.000025598589,0.000099911835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117528165,0.00015952674,0.0001877962,0.00020675237,0.000061690764,0.000058262318,0.00007654528,0.000068080626,0.000118937656],"category_scores_gemma":[0.000031165087,0.0001785224,0.000029081628,0.0003508011,0.000019528885,0.00021420428,0.000023662638,0.000115492425,0.000038571263],"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.000022373444,0.000007673254,0.0001061612,0.00003139236,0.000014833799,0.000009440223,0.00015927787,0.9664261,0.0007798261,0.0018345958,0.00048228077,0.030126078],"study_design_scores_gemma":[0.0026558083,0.000061866725,0.024186587,0.00019385073,0.000013559986,0.000054152886,0.00010065924,0.8782087,0.0009510346,0.08871499,0.0042579114,0.0006008869],"about_ca_topic_score_codex":0.000011197771,"about_ca_topic_score_gemma":0.0000032359912,"teacher_disagreement_score":0.08821737,"about_ca_system_score_codex":0.000055500346,"about_ca_system_score_gemma":0.000030037523,"threshold_uncertainty_score":0.72799325},"labels":[],"label_agreement":null},{"id":"W2202662702","doi":"10.1016/j.comgeo.2012.11.007","title":"Dynamic well-spaced point sets","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Autodesk (Canada)","funders":"","keywords":"Voronoi diagram; Bounded function; Point (geometry); Mathematics; Constant (computer programming); Upper and lower bounds; Set (abstract data type); Computation; Measure (data warehouse); Computational geometry; Polygon mesh; Combinatorics; Amortized analysis; Dynamic programming; Algorithm; Discrete mathematics; Computer science; Data structure; Geometry; Mathematical analysis; Data mining","score_opus":0.01212228442157507,"score_gpt":0.26535760411197173,"score_spread":0.25323531969039664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202662702","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.089543566,0.00080483255,0.9036118,0.0014096082,0.0013001953,0.00017025805,0.000006674804,0.00026151058,0.0028915717],"genre_scores_gemma":[0.80914134,0.0000067169435,0.18910961,0.0009513485,0.00013319553,0.000014763644,0.00011471549,0.000013239652,0.0005150432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980596,0.00009509777,0.0003409753,0.00038988492,0.0006319462,0.00048254643],"domain_scores_gemma":[0.99866974,0.00035621127,0.00013946711,0.00033636336,0.00022356666,0.00027466015],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000557959,0.00021727993,0.00019032511,0.00054289115,0.00024925073,0.00015921771,0.0005157427,0.00008487674,0.00017302597],"category_scores_gemma":[0.00008959032,0.00022587835,0.00011739951,0.0015114154,0.000041817115,0.0012015008,0.00026719633,0.00017560477,0.0011383151],"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.000025621486,0.00077861,0.0053806906,0.00006754773,0.00015932314,0.00001644387,0.0010849464,0.50613016,0.0006821715,0.36396804,0.022829285,0.09887715],"study_design_scores_gemma":[0.0007446649,0.00008457304,0.12349925,0.000018987816,0.000014813533,0.00018261657,0.00004462518,0.8174827,0.0003268907,0.039433148,0.017583003,0.00058469543],"about_ca_topic_score_codex":0.0000032474977,"about_ca_topic_score_gemma":7.80704e-7,"teacher_disagreement_score":0.7195978,"about_ca_system_score_codex":0.000120601966,"about_ca_system_score_gemma":0.00011081454,"threshold_uncertainty_score":0.9996394},"labels":[],"label_agreement":null},{"id":"W2207300025","doi":"10.1016/j.comgeo.2010.04.003","title":"A general approach for cache-oblivious range reporting and approximate range counting","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Range (aeronautics); Range query (database); Cache; Upper and lower bounds; Computer science; Mathematics; Linear space; Corollary; Data structure; Block (permutation group theory); Combinatorics; Web search query; Parallel computing; Sargable; Search engine; Information retrieval","score_opus":0.03599642114052546,"score_gpt":0.29118629184087824,"score_spread":0.25518987070035276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207300025","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.06707317,0.000067373,0.93030417,0.00029328314,0.0002064605,0.00042319094,0.000007870522,0.00015675717,0.0014677107],"genre_scores_gemma":[0.34975424,0.000002565845,0.64937323,0.00029608395,0.00013603845,0.00006217244,0.000053995587,0.0000136748085,0.00030796183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982571,0.00003739467,0.0005383534,0.0004849113,0.0003596574,0.00032258482],"domain_scores_gemma":[0.9986352,0.00024536494,0.00042058804,0.00023468942,0.0003336458,0.00013052355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001590919,0.00014349801,0.00020941274,0.00026356196,0.0003121657,0.00037192728,0.00033591926,0.00008469745,0.000015654912],"category_scores_gemma":[0.0005675862,0.00013988189,0.000067908084,0.0005452997,0.000071932984,0.00040228857,0.00019709242,0.0002286131,0.00000572029],"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.00005022906,0.00062268175,0.06284695,0.00078017334,0.0001778752,0.000033550747,0.0031533996,0.54437953,0.0014767977,0.28919223,0.004864408,0.09242217],"study_design_scores_gemma":[0.00063792133,0.000020408923,0.0054488787,0.000005343919,0.0000047470803,0.00007999277,0.000018464565,0.9883607,0.000019480925,0.004668746,0.00055908796,0.00017625022],"about_ca_topic_score_codex":0.000012156219,"about_ca_topic_score_gemma":0.0000015942129,"teacher_disagreement_score":0.44398114,"about_ca_system_score_codex":0.000017163757,"about_ca_system_score_gemma":0.00009109616,"threshold_uncertainty_score":0.57042176},"labels":[],"label_agreement":null},{"id":"W2209009633","doi":"10.1016/j.comgeo.2014.08.009","title":"Bichromatic compatible matchings","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Science Foundation","keywords":"Combinatorics; Matching (statistics); Graph; Mathematics; Set (abstract data type); Sequence (biology); Discrete mathematics; Computer science; Chemistry","score_opus":0.008411945056672835,"score_gpt":0.22723710643036282,"score_spread":0.21882516137368999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209009633","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.08409654,0.00008908025,0.90972704,0.0010233357,0.00053729804,0.00011821631,0.000002330309,0.00029910184,0.004107059],"genre_scores_gemma":[0.76033056,0.0000013839782,0.23790006,0.0012351514,0.00016833648,0.000010842783,0.000057318466,0.000009882117,0.0002864891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816704,0.00011635635,0.00037813387,0.00043810168,0.0006232962,0.0002770649],"domain_scores_gemma":[0.99853384,0.0006059089,0.00014803906,0.0003408861,0.00022157363,0.000149775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055468536,0.0001859274,0.00021505251,0.00049644377,0.00027110323,0.00025557028,0.00066791184,0.00005855603,0.00008153749],"category_scores_gemma":[0.00015086576,0.00018961706,0.00009078662,0.0014170079,0.000042526688,0.00057781563,0.00020676735,0.00013857658,0.0005942115],"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.0000034384339,0.0001218093,0.0006798086,0.000040142848,0.000031393312,0.000002961506,0.00019925555,0.37373903,0.00018971207,0.5568358,0.0051721795,0.0629845],"study_design_scores_gemma":[0.00038428447,0.000071594695,0.020807154,0.000017200025,0.0000049970745,0.000041221796,0.0000065307004,0.80244374,0.00016540675,0.1678261,0.007997037,0.00023470049],"about_ca_topic_score_codex":0.0000075139765,"about_ca_topic_score_gemma":8.9318405e-7,"teacher_disagreement_score":0.676234,"about_ca_system_score_codex":0.000049881728,"about_ca_system_score_gemma":0.000090094,"threshold_uncertainty_score":0.7732359},"labels":[],"label_agreement":null},{"id":"W2218835040","doi":"10.1016/j.comgeo.2005.10.002","title":"Faster core-set constructions and data-stream algorithms in fixed dimensions","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Dimension (graph theory); Cylinder; RADIUS; Constant (computer programming); Annulus (botany); Set (abstract data type); Core (optical fiber); Algorithm; Fixed point; Space (punctuation); Geometry; Combinatorics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.05293009317713095,"score_gpt":0.3119878267126572,"score_spread":0.25905773353552625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218835040","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.24522284,0.00057455426,0.75108916,0.00174399,0.00046176088,0.00021392887,0.000116768504,0.00012295446,0.0004540806],"genre_scores_gemma":[0.6993304,0.000018969526,0.29925996,0.00058122847,0.00018217735,0.000010107496,0.0004598638,0.000007923828,0.00014941224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823684,0.000057830417,0.00040418233,0.00065265433,0.00039088904,0.00025758788],"domain_scores_gemma":[0.99867505,0.00045658904,0.00010398535,0.0004651807,0.00015746515,0.00014175667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035284032,0.00017821869,0.00019390474,0.0006185721,0.00020472129,0.00016489155,0.0005488716,0.00007425792,0.0000524754],"category_scores_gemma":[0.000104484025,0.0001875357,0.00003318575,0.0012624824,0.00009678354,0.0009780825,0.0005814008,0.00018656536,0.00008744856],"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.0000146325165,0.00031732713,0.009051899,0.00002288484,0.000070629445,0.000025339437,0.00055565586,0.5106943,0.00019216628,0.09941574,0.0075465133,0.3720929],"study_design_scores_gemma":[0.0007161441,0.00003735191,0.03921047,0.000017643366,0.00000794101,0.00016684108,0.00004478721,0.9398227,0.00004100757,0.010350881,0.009338612,0.00024564902],"about_ca_topic_score_codex":0.000013821127,"about_ca_topic_score_gemma":0.000023141722,"teacher_disagreement_score":0.45410755,"about_ca_system_score_codex":0.000056566183,"about_ca_system_score_gemma":0.0001473215,"threshold_uncertainty_score":0.76474833},"labels":[],"label_agreement":null},{"id":"W2230440109","doi":"10.1016/j.comgeo.2017.07.001","title":"Visibility graphs, dismantlability, and the cops and robbers game","year":2017,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Visibility; Visibility graph; Polygon (computer graphics); Mathematics; Euclidean geometry; Combinatorics; Planar graph; Graph; Computer science; Regular polygon; Geometry; Geography; Telecommunications","score_opus":0.018402030543946356,"score_gpt":0.2750719726672118,"score_spread":0.25666994212326544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230440109","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.31421742,0.0043597897,0.6727135,0.0061283763,0.0010386185,0.0008368464,0.00005885044,0.0001519351,0.0004946366],"genre_scores_gemma":[0.97243905,0.00020088062,0.026261287,0.00051033235,0.00018083681,0.000056452453,0.00014829534,0.00001497822,0.00018789372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689925,0.00033098526,0.00055401603,0.0012002836,0.0007159565,0.00029950842],"domain_scores_gemma":[0.9963841,0.001472513,0.0004763433,0.0010728069,0.00040662166,0.00018761524],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018347179,0.000398281,0.0005282139,0.0003637665,0.00067220215,0.0013567677,0.0012046056,0.00022516605,0.000011542452],"category_scores_gemma":[0.00056281144,0.00031652933,0.0001764271,0.0003552859,0.0008822455,0.00043039385,0.003383623,0.0006385666,0.000010674807],"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.00013632211,0.00022435677,0.007920718,0.00055998424,0.0003641832,0.000016956552,0.0016598357,0.21063177,0.00001096827,0.68089706,0.0022219087,0.09535591],"study_design_scores_gemma":[0.00081389665,0.00002334053,0.095584564,0.000039646504,0.000027868871,0.000034604873,0.000009864566,0.3724421,0.0000053691338,0.5302194,0.0005376886,0.0002616705],"about_ca_topic_score_codex":0.000072173054,"about_ca_topic_score_gemma":0.000011118145,"teacher_disagreement_score":0.65822166,"about_ca_system_score_codex":0.000062246734,"about_ca_system_score_gemma":0.00029435763,"threshold_uncertainty_score":0.99992865},"labels":[],"label_agreement":null},{"id":"W2263302607","doi":"10.1016/j.comgeo.2016.08.001","title":"Flips in edge-labelled pseudo-triangulations","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Geometry; Mathematics; Artificial intelligence","score_opus":0.016934603221633298,"score_gpt":0.25284887389228683,"score_spread":0.23591427067065354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263302607","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.13609385,0.00014745338,0.85820436,0.003334375,0.00059370586,0.00019149989,0.000009781022,0.0001550518,0.0012699368],"genre_scores_gemma":[0.90236086,0.000009760418,0.095972404,0.00032477768,0.00019942963,0.000028433495,0.000032926415,0.000011567738,0.0010598127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980322,0.000114243274,0.00047536183,0.0005302462,0.00052167755,0.00032626846],"domain_scores_gemma":[0.9982859,0.0008677583,0.00012513291,0.00032759155,0.0002612444,0.00013239618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044737043,0.0001856705,0.00020217043,0.000976171,0.00015999611,0.000108624285,0.0005529571,0.000087405126,0.00014282529],"category_scores_gemma":[0.0002118344,0.00015343289,0.00008888014,0.002312118,0.00005154103,0.0007639276,0.00020075613,0.00010562126,0.00046585218],"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.0000257141,0.00035187005,0.005669976,0.000017491644,0.0000452858,0.000030851235,0.00027614925,0.1713436,0.0017055135,0.55921805,0.0038633116,0.25745216],"study_design_scores_gemma":[0.0038596145,0.00012736628,0.20310326,0.00009792019,0.000009942427,0.00012047259,0.000020747246,0.45376545,0.0008873151,0.33034065,0.0069073676,0.0007598958],"about_ca_topic_score_codex":0.0000053886442,"about_ca_topic_score_gemma":0.000006458953,"teacher_disagreement_score":0.766267,"about_ca_system_score_codex":0.00013856975,"about_ca_system_score_gemma":0.00021371632,"threshold_uncertainty_score":0.6256812},"labels":[],"label_agreement":null},{"id":"W2280312297","doi":"10.1016/j.comgeo.2013.03.006","title":"Guest Editorʼs Introduction","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Global Security and Public Health","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Environmental science","score_opus":0.013683358873875132,"score_gpt":0.29993973664904616,"score_spread":0.28625637777517104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280312297","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.59757215,0.0004758405,0.009100965,0.19466838,0.039521698,0.00095542375,0.000028502784,0.00059724087,0.15707983],"genre_scores_gemma":[0.9672455,0.00001556694,0.0014602079,0.0010213169,0.029080959,0.000012045643,0.000064326545,0.0000043765676,0.0010956806],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989749,0.00010448092,0.0001314421,0.00014668934,0.0004138786,0.00022861824],"domain_scores_gemma":[0.9992972,0.00013874633,0.000044641158,0.00006278658,0.00028647698,0.00017017635],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004468159,0.000051245584,0.00006807304,0.00009713107,0.00039831133,0.00012110174,0.00013110015,0.00007195374,0.0024734763],"category_scores_gemma":[0.00038710362,0.000054160395,0.000028048145,0.0005697899,0.000117072836,0.000373997,0.000022146165,0.0001061495,0.0016690658],"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.0000011428712,0.000056151766,0.0017111223,0.0000069780085,0.000006664461,3.6490337e-7,0.0009711087,0.00047589463,0.0000016982174,0.16888046,0.8153534,0.012535002],"study_design_scores_gemma":[0.00007479482,0.000015389605,0.025896737,0.0000019440624,0.0000014261667,0.0000010033343,0.0008488496,0.0002506099,9.0342604e-7,0.030232506,0.94260305,0.00007279441],"about_ca_topic_score_codex":0.0028802129,"about_ca_topic_score_gemma":0.00008496145,"teacher_disagreement_score":0.3696734,"about_ca_system_score_codex":0.00009569823,"about_ca_system_score_gemma":0.00019720731,"threshold_uncertainty_score":0.99910825},"labels":[],"label_agreement":null},{"id":"W2292472667","doi":"10.1016/j.comgeo.2020.101626","title":"Shortest paths and convex hulls in 2D complexes with non-positive curvature","year":2020,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Convex hull; Shortest path problem; Polyhedron; Mathematics; Euclidean shortest path; Combinatorics; Convex polytope; Convex set; Regular polygon; Vertex (graph theory); Subderivative; K shortest path routing; Convex optimization; Geometry; Graph","score_opus":0.016153870670597283,"score_gpt":0.2523741191691435,"score_spread":0.2362202484985462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292472667","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.14098097,0.0009701423,0.8531742,0.0027592124,0.0004985906,0.0007185299,0.00015236264,0.00014980762,0.0005961589],"genre_scores_gemma":[0.8867137,0.000028225828,0.110412955,0.0014167125,0.0002663496,0.00005530819,0.0010216846,0.000028419696,0.00005666148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678516,0.0001379061,0.0005767668,0.0013117207,0.0008148763,0.0003735831],"domain_scores_gemma":[0.99792856,0.0006558042,0.00032209506,0.00037844342,0.00046225797,0.0002528113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031659543,0.00051772135,0.0006491125,0.0007531752,0.00017435929,0.00050640374,0.00077100005,0.00028043354,0.000018654804],"category_scores_gemma":[0.00008015744,0.0005160104,0.0000997015,0.0015580185,0.0001439795,0.00040422467,0.0012827412,0.0009876549,0.00003124516],"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.00008939668,0.00033047656,0.010087989,0.00032269242,0.00027651127,0.00029444203,0.0019726637,0.91955644,0.00020612481,0.045080308,0.0026466697,0.019136298],"study_design_scores_gemma":[0.000993536,0.00024326373,0.26633883,0.0003160159,0.00003661914,0.00009377608,0.000051420542,0.6790921,0.000166154,0.051407013,0.0004582204,0.00080305984],"about_ca_topic_score_codex":0.000035044977,"about_ca_topic_score_gemma":0.000016629101,"teacher_disagreement_score":0.7457327,"about_ca_system_score_codex":0.00011658795,"about_ca_system_score_gemma":0.0005663017,"threshold_uncertainty_score":0.99972916},"labels":[],"label_agreement":null},{"id":"W2293771546","doi":"10.1016/j.comgeo.2017.05.005","title":"Routing in a polygonal terrain with the shortest beacon watchtower","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Simple polygon; Monotone polygon; Kernel (algebra); Polygon (computer graphics); Shortest path problem; Computer science; Algorithm; Mathematics; Combinatorics; Computer network; Graph","score_opus":0.015077597366991638,"score_gpt":0.2597317922029669,"score_spread":0.24465419483597525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293771546","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.3221809,0.00007621392,0.6660074,0.009309801,0.00027370395,0.00020113503,0.000004894491,0.00006394008,0.0018820087],"genre_scores_gemma":[0.9756297,0.0000014397401,0.022911888,0.0008340391,0.00020260275,0.000023318118,0.00003060715,0.000010545806,0.00035584997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9983071,0.000067348716,0.00026742768,0.000455763,0.00058626826,0.000316106],"domain_scores_gemma":[0.99860775,0.0003784933,0.00021362194,0.0005433118,0.00017333827,0.00008348878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065815233,0.0001844307,0.00016859024,0.00026082565,0.00080816244,0.0006915149,0.0012097486,0.000055958066,0.00002592571],"category_scores_gemma":[0.00013108691,0.00013402409,0.00006134136,0.00052793673,0.00013102399,0.00078861695,0.0003438835,0.00024832576,0.000039729755],"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.00006520718,0.00035631756,0.04463453,0.000018933459,0.00010866889,0.00012331313,0.0021263624,0.5549847,0.0002852916,0.23772924,0.0032985082,0.15626895],"study_design_scores_gemma":[0.00071630144,0.000086769796,0.5436508,0.000035893718,0.0000062661793,0.00007844425,0.00006721612,0.4440861,0.00008961476,0.009305251,0.0015980036,0.00027934514],"about_ca_topic_score_codex":0.000053443953,"about_ca_topic_score_gemma":0.00006851929,"teacher_disagreement_score":0.6534488,"about_ca_system_score_codex":0.00006496356,"about_ca_system_score_gemma":0.00019607623,"threshold_uncertainty_score":0.66682947},"labels":[],"label_agreement":null},{"id":"W2294705153","doi":"10.1016/j.comgeo.2014.04.009","title":"Face-guarding polyhedra","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Polyhedron; Face (sociological concept); Combinatorics; Regular polygon; Mathematics; Guard (computer science); Computer science; Geometry","score_opus":0.012009306876004204,"score_gpt":0.24129800752443378,"score_spread":0.22928870064842957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294705153","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.026786564,0.00014515521,0.96492374,0.0011875592,0.0007444127,0.00010503177,0.0000029620162,0.0002885787,0.0058159693],"genre_scores_gemma":[0.8519248,0.0000021741398,0.14615333,0.0011034776,0.00030667565,0.000009524117,0.000050471972,0.000010358036,0.0004392197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982234,0.000102144346,0.00031631868,0.00047796825,0.0005860714,0.00029409755],"domain_scores_gemma":[0.99871343,0.0004887427,0.00011559458,0.000321105,0.00021036681,0.0001507278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005103353,0.00017816048,0.00018210596,0.0005003661,0.0002760206,0.0002549127,0.0006271317,0.0000676363,0.000049973714],"category_scores_gemma":[0.00019134217,0.00018725455,0.00010522224,0.001369686,0.000037101036,0.0005996178,0.0002245608,0.00014387234,0.00042620598],"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.000003017247,0.000052229403,0.0004107928,0.000011180254,0.00002198235,0.0000024474957,0.00010974218,0.5085559,0.00014606773,0.3790874,0.0022312196,0.10936803],"study_design_scores_gemma":[0.00041186882,0.000071239156,0.017484037,0.000011518919,0.0000050740505,0.000045264886,0.000011976514,0.88327783,0.00037711413,0.0786921,0.019324169,0.0002877821],"about_ca_topic_score_codex":0.000003362266,"about_ca_topic_score_gemma":4.1019908e-7,"teacher_disagreement_score":0.8251382,"about_ca_system_score_codex":0.00005261255,"about_ca_system_score_gemma":0.000086414395,"threshold_uncertainty_score":0.7636019},"labels":[],"label_agreement":null},{"id":"W2299848644","doi":"10.1016/j.comgeo.2016.03.002","title":"Connectivity with directional antennas in the symmetric communication model","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Directional antenna; Telecommunications; Antenna (radio)","score_opus":0.01741006633043694,"score_gpt":0.2419086116873564,"score_spread":0.22449854535691946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299848644","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.07038305,0.00019961137,0.9247165,0.0025414492,0.00005888531,0.00018106504,0.0000040803793,0.00007730464,0.0018380664],"genre_scores_gemma":[0.9533097,0.000015635092,0.04595195,0.000553191,0.00003314761,0.00005280283,0.0000065288186,0.0000072784505,0.000069775546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985748,0.0001939786,0.00020080313,0.00031579487,0.0005006132,0.00021401825],"domain_scores_gemma":[0.99713916,0.0020194033,0.000104381776,0.0005215944,0.0001716721,0.000043773452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073608634,0.00012160431,0.00012731682,0.000331007,0.00015648262,0.00009353401,0.0009741317,0.00004762895,0.000009743477],"category_scores_gemma":[0.00010357317,0.00006892147,0.000038877974,0.002076855,0.00009906076,0.0005266189,0.00017225753,0.00016172879,0.000032931643],"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.000023894949,0.00026395358,0.013765018,0.0000064983774,0.000027453862,0.000008727142,0.00023817318,0.3886486,0.000029348468,0.54070115,0.0011607048,0.055126477],"study_design_scores_gemma":[0.00054610585,0.000048413985,0.11997332,0.000037242866,0.0000029186556,0.00005244582,0.000013392875,0.81285304,0.000012861372,0.066131555,0.00018524757,0.00014348874],"about_ca_topic_score_codex":0.000014508187,"about_ca_topic_score_gemma":0.000021120428,"teacher_disagreement_score":0.88292664,"about_ca_system_score_codex":0.00009792098,"about_ca_system_score_gemma":0.00010741918,"threshold_uncertainty_score":0.2810536},"labels":[],"label_agreement":null},{"id":"W2302259827","doi":"10.1016/j.comgeo.2016.03.003","title":"Thickness and colorability of geometric graphs","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Partition (number theory); Graph; Planar graph; Geometric graph theory; Line graph; Graph power","score_opus":0.014367720495956228,"score_gpt":0.2422522013164673,"score_spread":0.22788448082051108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2302259827","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.33781844,0.00030643473,0.66059667,0.0006960576,0.00020240241,0.000100602396,0.000011435907,0.0000578118,0.00021017391],"genre_scores_gemma":[0.9364746,0.0000247341,0.06319053,0.00014819072,0.000034666424,0.000009410588,0.000008422632,0.000005877264,0.00010352093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984014,0.00009077542,0.00038368665,0.00043107301,0.00049782504,0.0001952522],"domain_scores_gemma":[0.9976949,0.0012892748,0.00017269612,0.0002656902,0.00046137345,0.00011606577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006079787,0.0001419486,0.00021459832,0.0008744577,0.000113769696,0.000049824408,0.00038260862,0.00007095436,0.000039821334],"category_scores_gemma":[0.0003713695,0.00010811428,0.000071743896,0.0025231927,0.0001509659,0.00052325457,0.00023864508,0.000066001994,0.000022708125],"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.000030295992,0.00025684168,0.026244702,0.000085614025,0.00007363481,0.000005052824,0.00012980374,0.0111588035,0.0023676646,0.5940056,0.00083421066,0.3648078],"study_design_scores_gemma":[0.0013083671,0.00025478023,0.56856614,0.000049422375,0.000014296751,0.00007941965,0.00001418585,0.024823265,0.0025941927,0.40039626,0.0015090689,0.00039061476],"about_ca_topic_score_codex":0.0000048041784,"about_ca_topic_score_gemma":7.717043e-7,"teacher_disagreement_score":0.59865624,"about_ca_system_score_codex":0.000035962672,"about_ca_system_score_gemma":0.00012031867,"threshold_uncertainty_score":0.44087723},"labels":[],"label_agreement":null},{"id":"W2339879713","doi":"10.1016/j.comgeo.2016.04.001","title":"Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"k-nearest neighbors algorithm; Mathematics; Nearest-neighbor chain algorithm; Combinatorics; Computer science; Artificial intelligence; Statistics","score_opus":0.012163030968006422,"score_gpt":0.23291681465981093,"score_spread":0.2207537836918045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339879713","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.21171081,0.00051939435,0.7845389,0.0026152434,0.0002203973,0.00013862665,0.000023290262,0.000055333352,0.00017795709],"genre_scores_gemma":[0.91754663,0.000012315502,0.08183907,0.00022557432,0.00014617908,0.00001330477,0.000012477275,0.000009199251,0.000195262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982754,0.00010177323,0.00047286082,0.00040539372,0.00051793415,0.00022661698],"domain_scores_gemma":[0.99740964,0.0016508024,0.00029680194,0.0002741119,0.0002835658,0.0000850743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005490861,0.00016731906,0.00019767162,0.00017296216,0.00026978058,0.00015429474,0.00049963937,0.000046780537,0.000013521904],"category_scores_gemma":[0.0003829754,0.000106978,0.000066499124,0.0008781488,0.00018627856,0.000605787,0.00023215331,0.00009072899,0.000012686861],"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.000050790124,0.00021065735,0.022730002,0.00015768973,0.00009868119,0.000010260185,0.00092555664,0.032751497,0.0015678586,0.5775143,0.0009926597,0.36299008],"study_design_scores_gemma":[0.0012853397,0.00020702333,0.16049941,0.00025775438,0.00002015653,0.000053165724,0.000114691495,0.72295934,0.0014478153,0.10753841,0.0050770245,0.0005398825],"about_ca_topic_score_codex":0.000005208044,"about_ca_topic_score_gemma":0.0000032813184,"teacher_disagreement_score":0.7058358,"about_ca_system_score_codex":0.00003395103,"about_ca_system_score_gemma":0.000103504215,"threshold_uncertainty_score":0.43624362},"labels":[],"label_agreement":null},{"id":"W2341114440","doi":"10.1016/j.comgeo.2016.04.002","title":"Approximation algorithms for the unit disk cover problem in 2D and 3D","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Unit disk; Simple (philosophy); Set cover problem; Unit (ring theory); Plane (geometry); Set (abstract data type); Unit disk graph; Approximation algorithm; Combinatorics; Algorithm; Mathematics; Computer science; Geometry","score_opus":0.027193469274430324,"score_gpt":0.2694651527910792,"score_spread":0.24227168351664885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341114440","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.014200265,0.00032806967,0.98148006,0.0030529452,0.00022615853,0.00047409863,0.000019573534,0.000054719974,0.00016410158],"genre_scores_gemma":[0.70604557,0.000029183751,0.29263023,0.00043402822,0.00016600835,0.00013211688,0.000041593332,0.000010866471,0.0005103906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998751,0.000055505738,0.00029186945,0.0003666805,0.00032451068,0.00021044155],"domain_scores_gemma":[0.99782556,0.0016369821,0.00010768982,0.00017590924,0.00019533891,0.000058534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057561015,0.00013431493,0.00012563531,0.00030171574,0.0001970761,0.0001417352,0.00031847606,0.000053411426,0.000016465488],"category_scores_gemma":[0.000119402364,0.00008646442,0.000042553642,0.00078177307,0.00006321666,0.00056957424,0.00013784066,0.00006750447,0.000027637554],"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.000023799894,0.00010158413,0.0019130936,0.000038561346,0.000035965862,0.0000016526411,0.00024956348,0.22076571,0.00014594552,0.18853524,0.0009729422,0.58721596],"study_design_scores_gemma":[0.0010599676,0.000069055015,0.043389957,0.00003050294,0.0000068250565,0.000017583927,0.000013096517,0.85418016,0.000091425085,0.09419864,0.006764076,0.00017871689],"about_ca_topic_score_codex":0.000004987409,"about_ca_topic_score_gemma":0.0000022136608,"teacher_disagreement_score":0.6918453,"about_ca_system_score_codex":0.00004690492,"about_ca_system_score_gemma":0.00009538756,"threshold_uncertainty_score":0.35259166},"labels":[],"label_agreement":null},{"id":"W2362274435","doi":"10.1016/j.comgeo.2016.05.004","title":"Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Simple polygon; Geodesic; Mathematics; Hamiltonian path; Spanning tree; Vertex (graph theory); Graph; Geometry; Monotone polygon","score_opus":0.011699851910867549,"score_gpt":0.23998151874138365,"score_spread":0.2282816668305161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2362274435","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.5425934,0.00031953322,0.45547494,0.0011101816,0.00013182346,0.0001130704,0.000010880197,0.00009253384,0.00015362211],"genre_scores_gemma":[0.96143734,0.000020188578,0.037685446,0.0004579883,0.00011890299,0.000013985672,0.000047693797,0.000014436429,0.00020400753],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9981118,0.000101687634,0.00037918848,0.0005954194,0.00044356263,0.00036834768],"domain_scores_gemma":[0.9987012,0.0007098661,0.000121353245,0.00022609104,0.00008991853,0.00015155534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000483527,0.000220968,0.00023515875,0.00077377795,0.0001817616,0.00017187565,0.00036622072,0.00008255933,0.00003483124],"category_scores_gemma":[0.000114991846,0.00018700228,0.000055505305,0.0010065229,0.00006314391,0.0007069565,0.00023027069,0.0001352964,0.00006109365],"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.00007474309,0.00027618575,0.06549445,0.00006846061,0.00007399782,0.00008725696,0.0010193662,0.11664435,0.007403733,0.101390965,0.0021382389,0.7053282],"study_design_scores_gemma":[0.001711859,0.00015686515,0.7540842,0.000107599306,0.000007704864,0.00014148076,0.000028794128,0.16725296,0.00058281486,0.073061116,0.0023347288,0.00052984327],"about_ca_topic_score_codex":0.00006275,"about_ca_topic_score_gemma":0.000032941483,"teacher_disagreement_score":0.7047984,"about_ca_system_score_codex":0.0001064304,"about_ca_system_score_gemma":0.00012926718,"threshold_uncertainty_score":0.7625732},"labels":[],"label_agreement":null},{"id":"W2382079786","doi":"10.1016/j.comgeo.2016.05.001","title":"An algorithm for the maximum weight independent set problem on outerstring graphs","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Intersection graph; Independent set; Indifference graph; Chordal graph; Split graph; Block graph; Maximal independent set; Circle graph; Discrete mathematics; Time complexity; 1-planar graph; Pathwidth; Cograph; Graph; Line graph","score_opus":0.020954567187221936,"score_gpt":0.26717333492641593,"score_spread":0.246218767739194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2382079786","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.007072503,0.00010549928,0.98886555,0.002250865,0.00087530335,0.00048026937,0.00006429858,0.00016032484,0.00012539972],"genre_scores_gemma":[0.6920705,0.0000136608305,0.30589417,0.0010788217,0.00044182813,0.00013365647,0.00008917142,0.000021110061,0.00025710525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794436,0.00008031024,0.00034659324,0.000602031,0.0006872851,0.00033941265],"domain_scores_gemma":[0.997706,0.0012575921,0.00015638632,0.00041496538,0.0003230675,0.0001420171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062827935,0.0002184484,0.0001594484,0.00044719505,0.00045003952,0.00024473012,0.0009087477,0.00007805012,0.000028117605],"category_scores_gemma":[0.000040669307,0.00013739236,0.00013378607,0.0008436881,0.000056209694,0.00063460524,0.00013002432,0.00011476921,0.00007206236],"study_design_candidate":"design_other","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.000015532061,0.00012170545,0.00016834242,0.000007926062,0.00006375227,0.0000036539268,0.00011078412,0.070845276,0.00014554105,0.118727446,0.0015943653,0.80819565],"study_design_scores_gemma":[0.001658783,0.00049730454,0.011201132,0.000045147706,0.000018917852,0.00004454148,0.000028648868,0.7134241,0.0011693293,0.26018992,0.011275887,0.00044628265],"about_ca_topic_score_codex":0.0000036973622,"about_ca_topic_score_gemma":0.0000013765859,"teacher_disagreement_score":0.8077494,"about_ca_system_score_codex":0.000090287285,"about_ca_system_score_gemma":0.00012864708,"threshold_uncertainty_score":0.56026983},"labels":[],"label_agreement":null},{"id":"W2399075275","doi":"10.1016/j.comgeo.2017.10.006","title":"A note on interference in random networks","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"","keywords":"Combinatorics; Unit cube; Vertex (graph theory); Interference (communication); Mathematics; Graph; Unit disk graph; Binary logarithm; Discrete mathematics; Connectivity; Cube (algebra); Topology (electrical circuits); Computer science; Telecommunications","score_opus":0.01828418869697818,"score_gpt":0.2794516056992861,"score_spread":0.26116741700230794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399075275","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.014209697,0.00008600969,0.9792432,0.00064458844,0.0008340314,0.00016773073,0.0000011670356,0.00007177767,0.0047417977],"genre_scores_gemma":[0.98260367,0.000007950847,0.016459137,0.0005991643,0.00017751177,0.000022932341,0.0000060472175,0.000008830145,0.00011476849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986575,0.000063196894,0.00026617048,0.000443099,0.0002703368,0.00029967946],"domain_scores_gemma":[0.9982685,0.0006080687,0.00017991314,0.0007757915,0.00007724595,0.000090520734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041142027,0.00015131327,0.00020842091,0.00020882112,0.00023992945,0.0004275559,0.0016973466,0.00008348332,0.000026897967],"category_scores_gemma":[0.00018598394,0.00014849033,0.00006459816,0.00029023187,0.00007903189,0.0004299404,0.00050302537,0.00032352156,0.00012785789],"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.000043509248,0.000073543444,0.003631832,0.000004459876,0.00000860912,0.000045013632,0.00007550995,0.8362833,0.000001730818,0.051443078,0.0008630151,0.10752636],"study_design_scores_gemma":[0.0011485036,0.000057902354,0.08824924,0.00006818495,0.0000012406425,0.000008037263,0.0000014057732,0.8966461,0.000006736759,0.013313837,0.00034256183,0.00015629183],"about_ca_topic_score_codex":0.00001876187,"about_ca_topic_score_gemma":0.0000158737,"teacher_disagreement_score":0.968394,"about_ca_system_score_codex":0.00006623347,"about_ca_system_score_gemma":0.00007393737,"threshold_uncertainty_score":0.605526},"labels":[],"label_agreement":null},{"id":"W2479238111","doi":"10.1016/j.comgeo.2016.07.005","title":"Alternating paths and cycles of minimum length","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Combinatorics; Mathematics; Integer (computer science); Plane (geometry); Point (geometry); Euclidean geometry; Constant (computer programming); Set (abstract data type); Planar; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Geometry; Computer science","score_opus":0.014885976568507105,"score_gpt":0.2510746711408361,"score_spread":0.236188694572329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479238111","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.42978248,0.00021007835,0.568924,0.00056768087,0.00016653571,0.000051495324,0.0000073172782,0.000040677758,0.000249717],"genre_scores_gemma":[0.91265327,0.000019610488,0.08696965,0.00013137546,0.00009410522,0.000004512931,0.0000067325727,0.0000060159437,0.00011470236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877924,0.000049802435,0.00031327512,0.00031972068,0.00037887832,0.00015907953],"domain_scores_gemma":[0.99864334,0.00073446706,0.00015989432,0.00016513263,0.00021550596,0.00008168677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028400336,0.00011586092,0.00014911946,0.00033118896,0.00008858378,0.00004929161,0.00029205738,0.000040234445,0.000019926425],"category_scores_gemma":[0.00016007516,0.00009054582,0.0000482503,0.00049413904,0.00006673418,0.00042666539,0.0001995311,0.00004513116,0.000019230216],"study_design_candidate":"design_other","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.00001307572,0.00012351222,0.009185644,0.000047144564,0.00006421138,0.000008606376,0.00027387092,0.01897234,0.0074540614,0.26995984,0.00051827746,0.6933794],"study_design_scores_gemma":[0.0025902865,0.00036589088,0.30071056,0.00021509686,0.000020906267,0.00015225771,0.000054697844,0.40573618,0.01245766,0.27420816,0.0027257362,0.00076258334],"about_ca_topic_score_codex":0.000002948811,"about_ca_topic_score_gemma":5.2095095e-7,"teacher_disagreement_score":0.6926168,"about_ca_system_score_codex":0.000021727721,"about_ca_system_score_gemma":0.000066398374,"threshold_uncertainty_score":0.36923516},"labels":[],"label_agreement":null},{"id":"W2508006611","doi":"10.1016/j.comgeo.2016.08.002","title":"Dynamic data structures for approximate Hausdorff distance in the word RAM","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Hausdorff distance; Computer science; Arithmetic; Mathematics; Artificial intelligence; Geometry","score_opus":0.03126099954488066,"score_gpt":0.2988654522923044,"score_spread":0.2676044527474237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508006611","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.021296032,0.0003710591,0.97313255,0.0040474134,0.00044625573,0.00042334272,0.00012696082,0.000070299415,0.00008605737],"genre_scores_gemma":[0.8224801,0.000010358685,0.17625803,0.00061547186,0.000103821,0.000051441686,0.00031788385,0.00000960812,0.00015331521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998109,0.0001010098,0.00036033642,0.00062924885,0.00050078187,0.0002996613],"domain_scores_gemma":[0.99743485,0.0014620883,0.00013824749,0.00075616705,0.00015507494,0.00005359291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082724896,0.00017417152,0.00016573914,0.00030116068,0.00019891335,0.00021077802,0.001981813,0.00005592672,0.000014298643],"category_scores_gemma":[0.00028203818,0.000110070396,0.000055957258,0.0011134201,0.00007095226,0.0007647355,0.0003235582,0.00009426977,0.00001792943],"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.000054831085,0.00016301409,0.0007140176,0.00005644669,0.000042195803,0.000009600479,0.00028865575,0.12103328,0.00018729921,0.4489876,0.0064375326,0.4220255],"study_design_scores_gemma":[0.0009582064,0.000042960495,0.03843413,0.000027575752,0.000006291612,0.000028232356,0.000023912095,0.65503055,0.000026993235,0.29320872,0.011970953,0.00024146771],"about_ca_topic_score_codex":0.0000023822574,"about_ca_topic_score_gemma":0.000011999072,"teacher_disagreement_score":0.80118406,"about_ca_system_score_codex":0.000064815256,"about_ca_system_score_gemma":0.00012950895,"threshold_uncertainty_score":0.44885406},"labels":[],"label_agreement":null},{"id":"W2528068670","doi":"10.1016/j.comgeo.2020.101630","title":"Fast and compact planar embeddings","year":2020,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Horizon 2020 Framework Programme; H2020 Marie Skłodowska-Curie Actions; Universidade da Coruña; Fondo Nacional de Desarrollo Científico y Tecnológico; Helsingin Yliopisto; Núcleo Milenio Información y Coordinación en Redes, ICR; Corporación de Fomento de la Producción; Academy of Finland; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Sublinear function; Embedding; Simplicity; Computer science; Planar; Speedup; Representation (politics); Book embedding; Planar graph; Simple (philosophy); Enhanced Data Rates for GSM Evolution; Theoretical computer science; Graph embedding; Graph; Encoding (memory); Algorithm; Parallel computing; Topology (electrical circuits); Mathematics; Discrete mathematics; Combinatorics; Line graph; Computer graphics (images); 1-planar graph; Artificial intelligence; Physics","score_opus":0.019587141123473296,"score_gpt":0.25156464930427624,"score_spread":0.23197750818080295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528068670","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.01959473,0.00024122374,0.97583467,0.0033432997,0.000106817235,0.000060517945,0.000024193225,0.00014485761,0.0006496832],"genre_scores_gemma":[0.8508733,0.0000068981817,0.14600964,0.0028622148,0.00014867297,0.0000010883871,0.000057991045,0.000007756921,0.000032435244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908555,0.000020894962,0.000147188,0.0003212817,0.00027559136,0.00014947371],"domain_scores_gemma":[0.999425,0.00013822113,0.000057689635,0.00012697316,0.000053424836,0.00019872171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000070876464,0.00010582494,0.0001306653,0.00008284172,0.00012738965,0.00017279906,0.00039588177,0.00003212205,0.000026716572],"category_scores_gemma":[0.00003407691,0.000097028154,0.000028048727,0.0004167801,0.000036508696,0.0004313963,0.00019414918,0.000110549096,0.00008890865],"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.00006877663,0.0002602852,0.019173522,0.00018944209,0.00016328042,0.00019929018,0.0039822264,0.14096397,0.00091824704,0.29218778,0.17926279,0.36263037],"study_design_scores_gemma":[0.00033533014,0.00007431047,0.03528772,0.000013463329,0.0000027602437,0.00003066453,0.000029211917,0.9497036,0.00004365532,0.0062925634,0.008017562,0.0001691995],"about_ca_topic_score_codex":0.0000061712467,"about_ca_topic_score_gemma":7.859145e-8,"teacher_disagreement_score":0.83127856,"about_ca_system_score_codex":0.000010342816,"about_ca_system_score_gemma":0.000031246433,"threshold_uncertainty_score":0.3956693},"labels":[],"label_agreement":null},{"id":"W2551288033","doi":"10.1016/j.comgeo.2011.01.002","title":"On a family of strong geometric spanners that admit local routing strategies","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Spanner; Euclidean geometry; Mathematics; Graph; Unit disk graph; Path (computing); Euclidean distance; Discrete mathematics; Computer science; Geometry","score_opus":0.054577399380405456,"score_gpt":0.26155586164725364,"score_spread":0.20697846226684818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551288033","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.18505324,0.00020313115,0.8074781,0.000043542615,0.00042655875,0.00014531946,0.000010539885,0.000117981726,0.006521627],"genre_scores_gemma":[0.93308324,0.000005033134,0.06646356,0.00023519872,0.000068121175,0.00001071342,0.00004569473,0.0000151616705,0.00007330821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975443,0.000097859025,0.0004963212,0.000562242,0.00092339265,0.000375892],"domain_scores_gemma":[0.99821,0.00060639915,0.00031548267,0.00034932868,0.00036098834,0.0001577641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048835116,0.00026467594,0.0003015394,0.0014466705,0.00019451989,0.00012276962,0.00075301394,0.00010402066,0.00007562357],"category_scores_gemma":[0.000110718465,0.00026839532,0.00015798151,0.0029809293,0.0001183085,0.0008099699,0.00022003209,0.0002240052,0.00008629224],"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.00003228257,0.00022559798,0.0005864271,0.000026622278,0.00006648315,0.000013135336,0.00037945926,0.45575073,0.000048183825,0.49510497,0.0003813597,0.047384735],"study_design_scores_gemma":[0.0014843869,0.0009460142,0.16763383,0.0001093715,0.00003502914,0.000049563223,0.0012512441,0.6844767,0.0028630877,0.14003666,0.00027310703,0.000841046],"about_ca_topic_score_codex":0.000044109107,"about_ca_topic_score_gemma":0.0000016141273,"teacher_disagreement_score":0.74802995,"about_ca_system_score_codex":0.00008754949,"about_ca_system_score_gemma":0.0003426144,"threshold_uncertainty_score":0.9999768},"labels":[],"label_agreement":null},{"id":"W2564729024","doi":"10.1016/j.comgeo.2004.04.003","title":"Approximating geometric bottleneck shortest paths","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Carleton University","funders":"","keywords":"Delaunay triangulation; Shortest path problem; Bottleneck; Computer science; Combinatorics; Point set triangulation; Path (computing); Graph; Discrete mathematics; Mathematics","score_opus":0.01591962100472446,"score_gpt":0.24352237571317073,"score_spread":0.22760275470844626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564729024","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.09180779,0.0005089622,0.90390676,0.0008159937,0.00064073224,0.00022056597,0.000009322579,0.00036408324,0.0017257673],"genre_scores_gemma":[0.67503095,0.000007114507,0.3238964,0.0006191636,0.00021357521,0.000022452265,0.00009455499,0.00001504722,0.00010075091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723536,0.000055358556,0.00061350403,0.0007025454,0.0009374625,0.00045576988],"domain_scores_gemma":[0.9983411,0.00039490353,0.0002253325,0.00041553617,0.00040057965,0.00022258279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005901386,0.00028058985,0.0002760069,0.0012539175,0.00039460827,0.0003518205,0.0008305873,0.000106771855,0.000047264573],"category_scores_gemma":[0.00033876422,0.0002974957,0.00015094172,0.004883576,0.000058117177,0.00091394206,0.0003196707,0.00024549555,0.0003842341],"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.000003244999,0.00019431682,0.00059377396,0.000018447996,0.00003241246,0.000020457563,0.00012300014,0.79701215,0.00013272588,0.1518475,0.0003896099,0.04963236],"study_design_scores_gemma":[0.0027175508,0.00039297823,0.082735434,0.00009209522,0.000030921776,0.00042659315,0.000074264564,0.52801293,0.0023060525,0.3768863,0.004946263,0.0013786356],"about_ca_topic_score_codex":0.000011921439,"about_ca_topic_score_gemma":0.00000130319,"teacher_disagreement_score":0.58322316,"about_ca_system_score_codex":0.00019037833,"about_ca_system_score_gemma":0.0003221807,"threshold_uncertainty_score":0.9999477},"labels":[],"label_agreement":null},{"id":"W2568903863","doi":"10.1016/j.comgeo.2010.05.001","title":"Distance k-sectors exist","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics; Metric space; Dimension (graph theory); Integer (computer science); Euclidean space; Uniqueness; Euclidean distance; Geodesic; Discrete mathematics; Fixed point; Mathematical analysis; Geometry","score_opus":0.009670648628013008,"score_gpt":0.24645513223049748,"score_spread":0.23678448360248447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568903863","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.13452207,0.000086300606,0.8581366,0.0006667087,0.001742756,0.00010776883,0.000006467615,0.00023848911,0.0044928775],"genre_scores_gemma":[0.8328235,0.000001669912,0.1657622,0.00049448165,0.0003151006,0.00001284762,0.00006303222,0.00000987507,0.00051724777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983853,0.00003564981,0.00029582393,0.0004736967,0.0005451136,0.0002644033],"domain_scores_gemma":[0.998758,0.00032371635,0.00011227112,0.00036727372,0.00027574337,0.00016298804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030503375,0.00017226205,0.00014674755,0.0003630287,0.00026824832,0.00025033494,0.00069792446,0.00007902268,0.000112593705],"category_scores_gemma":[0.0001480624,0.0001784339,0.00009088399,0.0014447506,0.00007127925,0.00057458604,0.00016765129,0.00029317194,0.00028402067],"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.000005582909,0.00012171216,0.0027570887,0.000012959543,0.000021612352,0.0000116384035,0.00009962209,0.051019803,0.0013179714,0.9064729,0.0033822907,0.034776803],"study_design_scores_gemma":[0.0007788533,0.00008946886,0.110633135,0.000012686379,0.00000830518,0.00014231175,0.000012987629,0.5283859,0.0013568682,0.27944934,0.07842839,0.0007017955],"about_ca_topic_score_codex":0.0000059438153,"about_ca_topic_score_gemma":0.000007313412,"teacher_disagreement_score":0.6983015,"about_ca_system_score_codex":0.000030226867,"about_ca_system_score_gemma":0.00015005427,"threshold_uncertainty_score":0.7276323},"labels":[],"label_agreement":null},{"id":"W2585554627","doi":"10.1016/j.comgeo.2017.07.002","title":"On the existence of ordinary triangles","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Magyar Tudományos Akadémia; École Polytechnique Fédérale de Lausanne; Fédération Wallonie-Bruxelles; Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; European Commission; Seventh Framework Programme; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Research, Development and Innovation Office; European Research Council; National Science Foundation","keywords":"Mathematics; Combinatorics; Plane (geometry); Point (geometry); Constant (computer programming); Set (abstract data type); Geometry; Computer science","score_opus":0.04400786237647168,"score_gpt":0.28849129949318436,"score_spread":0.24448343711671267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585554627","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.268843,0.00014028639,0.7174982,0.004835614,0.0006536429,0.00018571556,0.0000099629615,0.000053720323,0.007779896],"genre_scores_gemma":[0.96615034,0.0000040436316,0.032899678,0.00047016007,0.000100480844,0.000010917435,0.000010051103,0.000005253608,0.00034907702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998733,0.00006937847,0.00025814856,0.0002826739,0.00050856906,0.00014827325],"domain_scores_gemma":[0.99762905,0.0010594488,0.00031038845,0.0006958208,0.00025168888,0.000053607946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050851,0.000118014854,0.0001445678,0.00019430257,0.0006594301,0.00022795859,0.001398226,0.000040412433,0.00004937613],"category_scores_gemma":[0.00065849547,0.000087861146,0.00009766173,0.00034550868,0.00013738239,0.00038182968,0.00029459328,0.00011313009,0.00007693263],"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.000014139909,0.00008241258,0.0002227804,0.00000918223,0.000023459406,0.000005176993,0.00006097217,0.041463286,0.00008373083,0.9234111,0.0024649873,0.032158785],"study_design_scores_gemma":[0.00065028097,0.00024863382,0.12242678,0.000057538484,0.000008587118,0.0000288021,0.000020306328,0.2617499,0.0011252183,0.61101806,0.0024071536,0.00025872068],"about_ca_topic_score_codex":0.0000058733226,"about_ca_topic_score_gemma":6.242126e-7,"teacher_disagreement_score":0.69730735,"about_ca_system_score_codex":0.000022260672,"about_ca_system_score_gemma":0.00010731177,"threshold_uncertainty_score":0.50718695},"labels":[],"label_agreement":null},{"id":"W2590962680","doi":"10.1016/j.comgeo.2017.02.004","title":"An optimal algorithm for plane matchings in multipartite geometric graphs","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multipartite; Algorithm; Plane (geometry); Combinatorics; Computer science; Mathematics; Geometry; Physics; Quantum entanglement","score_opus":0.021304111577191753,"score_gpt":0.298856879699042,"score_spread":0.27755276812185026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590962680","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.16639337,0.00015038774,0.831879,0.00034232173,0.0006330202,0.00033308263,0.000049211274,0.0001049198,0.000114673116],"genre_scores_gemma":[0.5537035,0.0000054463344,0.44561863,0.00020242712,0.0001442872,0.000049504917,0.0001905761,0.000012514066,0.00007314692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780124,0.000058042173,0.00046024582,0.0007096501,0.0005376151,0.0004332188],"domain_scores_gemma":[0.9980858,0.00046905602,0.0003027409,0.0006362951,0.00030996941,0.00019612268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079079316,0.00024138275,0.00028067685,0.0013905992,0.0007125101,0.00081446336,0.0014210574,0.000111541405,0.000022616243],"category_scores_gemma":[0.00021277355,0.00026492446,0.000119254044,0.0010048443,0.000074698524,0.0017701789,0.00021971216,0.00018329067,0.0000432518],"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.000026188582,0.00034256154,0.002544901,0.000023872317,0.000033232296,0.00002105691,0.0001860611,0.44682923,0.00009721964,0.020884544,0.00052767474,0.52848345],"study_design_scores_gemma":[0.0012081931,0.00016454715,0.11771666,0.000015694419,0.000005525746,0.000026979013,0.000013468349,0.8573143,0.00030482185,0.021841299,0.0010790635,0.00030947308],"about_ca_topic_score_codex":0.000035241515,"about_ca_topic_score_gemma":0.000007009172,"teacher_disagreement_score":0.528174,"about_ca_system_score_codex":0.00007066037,"about_ca_system_score_gemma":0.00013665031,"threshold_uncertainty_score":0.9999803},"labels":[],"label_agreement":null},{"id":"W2594681883","doi":"10.1016/j.comgeo.2017.02.005","title":"Orthogonal layout with optimal face complexity","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rectangle; Combinatorics; Mathematics; Embedding; Planar graph; Face (sociological concept); Graph; Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.042101302020788135,"score_gpt":0.28781533972991136,"score_spread":0.24571403770912323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594681883","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.20780854,0.00007079252,0.7871039,0.0014565568,0.00033931152,0.00015371571,0.000019866897,0.00014559316,0.0029017495],"genre_scores_gemma":[0.7417017,0.0000014908213,0.25725383,0.00033765266,0.00017434331,0.000011892832,0.0000855838,0.0000109198645,0.00042256148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979001,0.000054043478,0.00029309906,0.0006080742,0.000799344,0.00034528208],"domain_scores_gemma":[0.9981803,0.000188008,0.00030294323,0.0007315747,0.00040237463,0.00019476068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034055387,0.00024107461,0.00023608914,0.00027440788,0.0012606131,0.0008868775,0.0013955937,0.00007096981,0.000062863684],"category_scores_gemma":[0.00010370027,0.00022154507,0.00009087747,0.00040644011,0.0002460028,0.0012056135,0.0004768029,0.00021127028,0.00019399943],"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.000037203587,0.00015342238,0.0054361597,0.000017860742,0.000076272954,0.000042967924,0.0001657565,0.6104435,0.000031192274,0.35823494,0.0010638356,0.024296949],"study_design_scores_gemma":[0.0010744571,0.00018327303,0.3683717,0.000026007861,0.000012436951,0.00016280837,0.000023854573,0.60409194,0.00012820703,0.021308763,0.004144007,0.00047256224],"about_ca_topic_score_codex":0.000012817262,"about_ca_topic_score_gemma":0.000008129605,"teacher_disagreement_score":0.53389317,"about_ca_system_score_codex":0.000055057088,"about_ca_system_score_gemma":0.00025931865,"threshold_uncertainty_score":0.9695744},"labels":[],"label_agreement":null},{"id":"W2607258329","doi":"10.1016/j.comgeo.2017.04.001","title":"Guarding orthogonal art galleries with sliding cameras","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Massachusetts Life Sciences Center","keywords":"Computer science; Computer vision; Artificial intelligence; Computer graphics (images); Art","score_opus":0.018310067170356867,"score_gpt":0.2589105703895724,"score_spread":0.2406005032192155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607258329","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.11374878,0.00010398428,0.8755,0.0014940246,0.00054569275,0.00013767226,0.000006708494,0.00016071161,0.0083024055],"genre_scores_gemma":[0.8592633,0.000005660451,0.13894309,0.00038397242,0.00027950126,0.00001724587,0.000059288384,0.000014462347,0.0010334527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980011,0.00004802231,0.0002988194,0.00056272926,0.0007543497,0.0003349555],"domain_scores_gemma":[0.99830806,0.000256301,0.00030345566,0.00059035444,0.00038894004,0.00015288751],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003950947,0.00023110272,0.00023124747,0.0003612414,0.0014296203,0.0011052471,0.0009911481,0.000063490304,0.00007482908],"category_scores_gemma":[0.00017325403,0.00021616563,0.000091193295,0.0004445121,0.00010293297,0.0015048427,0.00036890432,0.00018690967,0.00022372196],"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.00005441385,0.00015628204,0.019535515,0.000046424186,0.00019794745,0.00011162028,0.00032478827,0.39161178,0.0002945578,0.51795274,0.0077519924,0.06196194],"study_design_scores_gemma":[0.0019463482,0.000336946,0.4334345,0.00013926988,0.000034264023,0.0004556315,0.00007110759,0.4763294,0.00086034904,0.05004831,0.035144843,0.0011990534],"about_ca_topic_score_codex":0.000004723455,"about_ca_topic_score_gemma":0.0000054626917,"teacher_disagreement_score":0.7455146,"about_ca_system_score_codex":0.00005952702,"about_ca_system_score_gemma":0.00024244905,"threshold_uncertainty_score":0.9999317},"labels":[],"label_agreement":null},{"id":"W2623275761","doi":"10.1016/j.comgeo.2017.06.002","title":"Connecting a set of circles with minimum sum of radii","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Sandia National Laboratories; University of Victoria; McGill University; United States-Israel Binational Science Foundation; National Science Foundation","keywords":"Mathematics; Combinatorics; Bounded function; Constant (computer programming); Upper and lower bounds; Plane (geometry); Steiner tree problem; Set (abstract data type); Planar; Tree (set theory); Planar graph; Point (geometry); Approximation algorithm; Discrete mathematics; Mathematical analysis; Geometry; Graph; Computer science","score_opus":0.02824305924596995,"score_gpt":0.28004641244014455,"score_spread":0.25180335319417463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623275761","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.48814493,0.000094397714,0.5107493,0.00031193643,0.00015578262,0.00008027156,0.000013725198,0.000024281992,0.0004253778],"genre_scores_gemma":[0.8988423,0.0000021012495,0.10095355,0.00004016833,0.00008318742,0.000003351616,0.000030434798,0.0000075367775,0.00003736987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986229,0.000042843865,0.00036640826,0.0003081585,0.00049522775,0.00016447564],"domain_scores_gemma":[0.9979319,0.00043791364,0.0005979908,0.00046693257,0.00049480604,0.00007045582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036255462,0.0001288919,0.00025389413,0.0003351387,0.00037040722,0.00015126946,0.00078947196,0.000049029124,0.000018681776],"category_scores_gemma":[0.00022770502,0.00012454539,0.00007530602,0.00042015032,0.00013414412,0.0005142865,0.00022697238,0.00008561283,0.0000071172876],"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.0000998227,0.00028992168,0.015401035,0.00028665573,0.00028842507,0.000023932369,0.0016801117,0.644306,0.0038868675,0.19405583,0.00051524566,0.13916616],"study_design_scores_gemma":[0.002516588,0.00061051355,0.26906642,0.0002169206,0.000040451792,0.00013983871,0.00018524053,0.6700342,0.014768002,0.040581882,0.0012719826,0.0005679426],"about_ca_topic_score_codex":0.000023793513,"about_ca_topic_score_gemma":0.000005582516,"teacher_disagreement_score":0.41069737,"about_ca_system_score_codex":0.00001904091,"about_ca_system_score_gemma":0.00020718794,"threshold_uncertainty_score":0.50788134},"labels":[],"label_agreement":null},{"id":"W2693333471","doi":"10.1016/j.comgeo.2020.101607","title":"Optimal Art Gallery Localization is NP-hard","year":2020,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple polygon; Combinatorics; Reduction (mathematics); Polygon (computer graphics); Visibility polygon; Mathematics; Point (geometry); Simple (philosophy); Boolean satisfiability problem; Time complexity; Euclidean geometry; Computational complexity theory; Visibility; Euclidean distance; Discrete mathematics; Algorithm; Computer science; Monotone polygon; Geometry; Physics; Frame (networking)","score_opus":0.03378414310431869,"score_gpt":0.2723554559817247,"score_spread":0.23857131287740604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2693333471","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.004095008,0.00047670133,0.9829844,0.007508812,0.0021892649,0.0004843398,0.00010627841,0.0005580003,0.0015971902],"genre_scores_gemma":[0.36621976,0.00010352677,0.6098021,0.015346414,0.0019144391,0.00012841287,0.0042064483,0.00009605578,0.0021827894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954132,0.00017585642,0.00089415617,0.0015921841,0.001470232,0.00045441085],"domain_scores_gemma":[0.99723834,0.00034371117,0.0005112964,0.0007193105,0.0008294876,0.00035783098],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004316575,0.0005886971,0.00058058975,0.0008576872,0.00031483968,0.0008088241,0.0015439923,0.0004084481,0.00029163907],"category_scores_gemma":[0.00019044065,0.0006878759,0.00036956108,0.0018488017,0.00008401838,0.00054806296,0.002093789,0.00081175327,0.0014295321],"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.000013612807,0.00010076173,0.00014998928,0.0001235174,0.000121799254,0.000022325019,0.0002839295,0.8434025,0.000021409724,0.009431888,0.14158857,0.0047397143],"study_design_scores_gemma":[0.00041194577,0.00008047527,0.0027417387,0.00006589764,0.000031594376,0.00004067071,0.000009220648,0.89909124,0.00016718144,0.05232227,0.044349227,0.0006885472],"about_ca_topic_score_codex":0.0000047585627,"about_ca_topic_score_gemma":5.5563794e-7,"teacher_disagreement_score":0.37318227,"about_ca_system_score_codex":0.00019564653,"about_ca_system_score_gemma":0.0008026278,"threshold_uncertainty_score":0.99955726},"labels":[],"label_agreement":null},{"id":"W2757769355","doi":"10.1016/j.comgeo.2015.07.003","title":"Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Delaunay triangulation; Mathematics; Combinatorics; Equilateral triangle; Dual graph; Boundary (topology); Discrete mathematics; Graph; Geometry; Line graph; Mathematical analysis","score_opus":0.03251423969451171,"score_gpt":0.25445439621640353,"score_spread":0.2219401565218918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757769355","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.03264293,0.001658766,0.95867026,0.0026744637,0.0013998416,0.00026607706,0.00000963693,0.00033806227,0.0023399622],"genre_scores_gemma":[0.8700095,0.000007770071,0.12780926,0.0010962643,0.00022970159,0.000039710747,0.000087212466,0.000019619582,0.00070100336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997127,0.00019038921,0.00051042886,0.0006649046,0.0010891851,0.000418073],"domain_scores_gemma":[0.9978055,0.0002411036,0.00015306036,0.0004167767,0.0010156524,0.00036795106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007221035,0.00028872708,0.00028852734,0.00063136156,0.0002605558,0.0003277227,0.00079056784,0.00012126092,0.0000854206],"category_scores_gemma":[0.00028022897,0.0002673156,0.00014089119,0.0031324322,0.0002902423,0.0007438145,0.00024246571,0.00022597301,0.00022163733],"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.000039001814,0.00014856154,0.00022621118,0.000015623766,0.00004559366,0.000016418828,0.00017379002,0.13441236,0.000053850916,0.851402,0.0061608073,0.0073058186],"study_design_scores_gemma":[0.0015529087,0.0002052551,0.0028830417,0.00003259064,0.000018687997,0.00006931869,0.000041996158,0.23969522,0.00037553208,0.7408415,0.013725697,0.00055826624],"about_ca_topic_score_codex":0.000005095118,"about_ca_topic_score_gemma":0.000001024689,"teacher_disagreement_score":0.8373665,"about_ca_system_score_codex":0.00009752039,"about_ca_system_score_gemma":0.00038999936,"threshold_uncertainty_score":0.9999779},"labels":[],"label_agreement":null},{"id":"W2761681115","doi":"10.1016/j.comgeo.2011.11.008","title":"Graphs that admit right angle crossing drawings","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Graph; Geometry; Crossing number (knot theory); Graph drawing; Computer science; Materials science; Artificial intelligence; Knot (papermaking)","score_opus":0.037013744547223906,"score_gpt":0.25032301231445936,"score_spread":0.21330926776723547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761681115","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.1732981,0.0003548052,0.81948805,0.00020044611,0.00080454815,0.00014335317,0.000006926305,0.00029473452,0.005409044],"genre_scores_gemma":[0.8143087,0.0000030056194,0.18435149,0.0007592291,0.00010470377,0.000012753973,0.000052196312,0.000014113065,0.000393803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979155,0.00007522382,0.0003551257,0.0006065589,0.00066397723,0.00038363345],"domain_scores_gemma":[0.9987233,0.00022752484,0.00018352183,0.0003575203,0.00030449725,0.00020363422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038435002,0.00024224415,0.00021248643,0.0007101246,0.0007250913,0.00048007182,0.0007677883,0.00009823676,0.00029461764],"category_scores_gemma":[0.00006251877,0.0002457749,0.00015840892,0.0018127137,0.00013741669,0.0011599498,0.00026321615,0.00018701701,0.00026153182],"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.00005309182,0.0008097666,0.02009496,0.00007780744,0.00021390535,0.00017050681,0.004560038,0.04607085,0.0004410988,0.81359136,0.008668196,0.10524841],"study_design_scores_gemma":[0.0011037751,0.00020430634,0.24368638,0.00005328058,0.000025622869,0.00023388135,0.00005678358,0.17426659,0.004435757,0.5638282,0.011183311,0.0009221678],"about_ca_topic_score_codex":0.000019967903,"about_ca_topic_score_gemma":0.0000024121885,"teacher_disagreement_score":0.6410106,"about_ca_system_score_codex":0.000060111714,"about_ca_system_score_gemma":0.00022894067,"threshold_uncertainty_score":0.99999946},"labels":[],"label_agreement":null},{"id":"W2765198212","doi":"10.1016/j.comgeo.2020.101631","title":"Minimizing the continuous diameter when augmenting a geometric tree with a shortcut","year":2020,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Mathematics; Intersection (aeronautics); Tree (set theory); Point (geometry); Line (geometry); Line segment; Plane (geometry); Euclidean geometry; Euclidean distance; Geometry","score_opus":0.030317217067687027,"score_gpt":0.24530900022898663,"score_spread":0.2149917831612996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765198212","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.026580673,0.0014019369,0.96204406,0.006442885,0.0010758868,0.00086386525,0.00004963217,0.00039470594,0.0011463613],"genre_scores_gemma":[0.6305017,0.000016308342,0.36535323,0.00232113,0.0007600744,0.00015977473,0.00045938967,0.000053668686,0.00037472337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950232,0.0002772765,0.0008841851,0.0015258914,0.0016696885,0.0006197946],"domain_scores_gemma":[0.9958449,0.001578763,0.0007201096,0.00088336313,0.0006964856,0.00027636957],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000820768,0.0006638646,0.00070722145,0.0012577972,0.00052181166,0.0013804128,0.0022494101,0.00025073637,0.0000525559],"category_scores_gemma":[0.0003882655,0.000511677,0.00034747893,0.00311617,0.00014493625,0.00048581517,0.0024287135,0.0011142811,0.00010777218],"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.00008044285,0.00031029654,0.0031032804,0.0003014621,0.0009392786,0.00016203668,0.0020425038,0.7861705,0.000080228725,0.01621453,0.014786804,0.17580865],"study_design_scores_gemma":[0.0013917149,0.00037191232,0.020446163,0.00024667569,0.00021626022,0.00019649944,0.00014460617,0.8951597,0.00034562114,0.070463255,0.009510122,0.0015074683],"about_ca_topic_score_codex":0.000023048486,"about_ca_topic_score_gemma":0.0000066800426,"teacher_disagreement_score":0.60392106,"about_ca_system_score_codex":0.00017856654,"about_ca_system_score_gemma":0.00069207675,"threshold_uncertainty_score":0.9997335},"labels":[],"label_agreement":null},{"id":"W2767104781","doi":"10.1016/j.comgeo.2017.10.001","title":"Editorial: Special issue in memory of Dr. Ferran Hurtado","year":2017,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"Cell Adhesion Molecules Research","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Psychology; Psychoanalysis; Art","score_opus":0.02183707640225067,"score_gpt":0.3503287817273439,"score_spread":0.3284917053250932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767104781","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045593164,0.00029225822,0.000055728226,0.0002515532,0.9791271,0.0005312387,0.0001762832,0.000029267,0.019080635],"genre_scores_gemma":[0.00032808358,0.00008810214,0.00068449904,0.000020782234,0.9806478,0.000019722505,0.0018832774,0.000083062885,0.01624466],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942701,0.000119696,0.0008019734,0.0006637757,0.0037102394,0.0004342377],"domain_scores_gemma":[0.9955211,0.0017093618,0.00045688899,0.0006932347,0.0013747679,0.0002446165],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008622499,0.0003697778,0.0010614991,0.0013881787,0.00010069829,0.00006827077,0.00064313516,0.0011879241,0.0022956822],"category_scores_gemma":[0.005668315,0.0003829647,0.00028375664,0.0005027055,0.00029395975,0.00008627616,0.0003319468,0.001840179,0.00044238643],"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.00047543025,0.00028438552,0.0001500146,0.00062415574,0.00009304667,0.000117672054,0.00007226337,0.00037818635,0.000077186196,0.000012255789,0.99393946,0.0037759547],"study_design_scores_gemma":[0.0027962336,0.00026855193,0.0014686736,0.00043868794,0.000056363635,0.000004265121,0.000031189367,0.00016326718,0.000091671944,0.0006170696,0.9937802,0.00028381383],"about_ca_topic_score_codex":0.00015610608,"about_ca_topic_score_gemma":0.000021675658,"teacher_disagreement_score":0.0048060655,"about_ca_system_score_codex":0.000332749,"about_ca_system_score_gemma":0.002254599,"threshold_uncertainty_score":0.99986225},"labels":[],"label_agreement":null},{"id":"W2789259282","doi":"10.1016/j.comgeo.2018.01.006","title":"Thread-parallel mesh improvement using face and edge swapping and vertex insertion","year":2018,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"U.S. Department of Energy","keywords":"Parallel computing; Computer science; Thread (computing); Shared memory; Threading (protein sequence); Control reconfiguration; Polygon mesh; Embedded system; Operating system","score_opus":0.02640856824943029,"score_gpt":0.27314769270706885,"score_spread":0.24673912445763857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789259282","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.38157475,0.0003095754,0.61718976,0.00027962055,0.00028944307,0.00013043135,0.000002582015,0.000059269405,0.00016456963],"genre_scores_gemma":[0.8444171,0.000018424802,0.15464953,0.00060478225,0.00017661526,0.0000067610586,0.000024001365,0.000008891914,0.00009390129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985237,0.000044989923,0.00029816525,0.0005195707,0.0003702507,0.0002433342],"domain_scores_gemma":[0.99912006,0.00017094714,0.00012241049,0.00017566205,0.00027474557,0.00013620732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003183807,0.0001829356,0.00016805147,0.00036876227,0.00040920617,0.0002577415,0.0002093685,0.000070252165,0.000017878554],"category_scores_gemma":[0.000058483427,0.0001923381,0.00003409992,0.00074292667,0.00011597334,0.0006698929,0.00032322927,0.00010331559,0.00002726338],"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.00009679682,0.00038404996,0.0051302454,0.00020833353,0.00028528922,0.000018353823,0.0031698532,0.14653885,0.018648272,0.51240635,0.0017947558,0.31131884],"study_design_scores_gemma":[0.0007372552,0.00023954485,0.03957751,0.00003560733,0.000014191963,0.00007035817,0.000044814155,0.8915326,0.0006364938,0.06548417,0.001311285,0.00031615462],"about_ca_topic_score_codex":0.000012391484,"about_ca_topic_score_gemma":0.0000026736025,"teacher_disagreement_score":0.74499375,"about_ca_system_score_codex":0.00006167467,"about_ca_system_score_gemma":0.00010238747,"threshold_uncertainty_score":0.78433204},"labels":[],"label_agreement":null},{"id":"W2892927166","doi":"10.1016/j.comgeo.2019.05.003","title":"Closest-pair queries in fat rectangles","year":2019,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Rectangle; Combinatorics; Set (abstract data type); Data structure; Range (aeronautics); Range query (database); Mathematics; Binary logarithm; Plane (geometry); Time complexity; Discrete mathematics; Computer science; Sargable; Geometry; Search engine; Information retrieval","score_opus":0.008811272025600598,"score_gpt":0.23295800508528483,"score_spread":0.22414673305968424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892927166","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.61961424,0.00042801295,0.37472114,0.0010646806,0.00087311555,0.0002493139,0.000005649634,0.00017865266,0.0028651753],"genre_scores_gemma":[0.92466253,0.0000063213206,0.07368839,0.00063621596,0.00012584371,0.000016059488,0.00007018365,0.000010805056,0.0007836643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982368,0.00009327315,0.00036792952,0.0005073745,0.00051084213,0.00028379037],"domain_scores_gemma":[0.9988602,0.0004769958,0.00010610658,0.00029219402,0.00018074167,0.00008380342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003195838,0.00017900804,0.00021411237,0.000721136,0.00008487368,0.0001570419,0.00051096384,0.00008042236,0.00011916082],"category_scores_gemma":[0.00009559782,0.00018971661,0.00008129849,0.0019910093,0.000033411452,0.0007500823,0.00020168061,0.00017300746,0.00059634744],"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.000022289234,0.00019361037,0.0376987,0.000048391415,0.000027099757,0.000022626693,0.0003934627,0.580747,0.00045307633,0.33685973,0.0024874026,0.041046616],"study_design_scores_gemma":[0.0013925162,0.00023128075,0.26017419,0.00007286386,0.0000048718243,0.00006921132,0.00008954665,0.5711295,0.0010217396,0.14692779,0.018191902,0.0006945614],"about_ca_topic_score_codex":0.000014253039,"about_ca_topic_score_gemma":0.000007341277,"teacher_disagreement_score":0.30504826,"about_ca_system_score_codex":0.00009915318,"about_ca_system_score_gemma":0.00013797032,"threshold_uncertainty_score":0.7736419},"labels":[],"label_agreement":null},{"id":"W2900946146","doi":"10.1016/j.comgeo.2018.08.001","title":"Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG)","year":2018,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"3D Modeling in Geospatial Applications","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Geometry; Computer science; Mathematics","score_opus":0.013810860746611772,"score_gpt":0.24794937544599496,"score_spread":0.23413851469938318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900946146","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015681688,0.000051571376,0.011434915,0.0007201996,0.9671766,0.0006735386,0.0030003206,0.00036376747,0.016422251],"genre_scores_gemma":[0.0044364827,0.000025907202,0.0025614188,0.00033551425,0.9858142,0.00015386744,0.005905821,0.00019260179,0.00057419034],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99496496,0.00009431537,0.0007845494,0.0008712835,0.0025147018,0.0007702145],"domain_scores_gemma":[0.99364054,0.0034422204,0.00022862943,0.00071033824,0.001530503,0.0004477451],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005928466,0.0007774727,0.0005952126,0.0011183525,0.00062766986,0.0003903487,0.0012598338,0.0011976005,0.002120799],"category_scores_gemma":[0.000906011,0.000738537,0.00021429981,0.0011463928,0.00027453533,0.00010977559,0.00011163345,0.002045826,0.005366055],"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.000011246127,0.00003214208,0.0000017803163,0.00002964763,0.00009872471,0.0000018878906,0.000047653022,0.41867593,2.915532e-7,0.0025233217,0.5779794,0.0005979956],"study_design_scores_gemma":[0.00032948403,0.00012027627,0.00007811757,0.00013879374,0.000049794882,0.0000012870277,0.000017638586,0.11866607,0.0000030174267,0.01462587,0.8653147,0.00065495446],"about_ca_topic_score_codex":0.002092464,"about_ca_topic_score_gemma":0.0018993219,"teacher_disagreement_score":0.30000985,"about_ca_system_score_codex":0.0009248379,"about_ca_system_score_gemma":0.0015135293,"threshold_uncertainty_score":0.9995066},"labels":[],"label_agreement":null},{"id":"W2911638885","doi":"10.1016/j.comgeo.2013.10.004","title":"α -Visibility","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Visibility; Visibility graph; Vertex (graph theory); Visibility polygon; Graph; Line segment; Combinatorics; Point (geometry); Computer science; Mathematics; Artificial intelligence; Geometry; Physics; Optics; Simple polygon; Regular polygon","score_opus":0.011395331659290377,"score_gpt":0.23543737956601193,"score_spread":0.22404204790672155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911638885","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.12589432,0.00013673751,0.8686923,0.0013894421,0.00039788763,0.00020484367,0.0000020420832,0.00022864428,0.0030538111],"genre_scores_gemma":[0.81631535,0.0000016551894,0.18202108,0.0010001083,0.00011877395,0.000031544372,0.000037454764,0.0000059918248,0.0004680141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850094,0.00006211001,0.00029823676,0.00043064405,0.000467179,0.00024085736],"domain_scores_gemma":[0.9987221,0.0003080017,0.00008253054,0.0003296248,0.00041171996,0.00014607115],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024851842,0.00014001282,0.00013280683,0.00031816988,0.00017622257,0.00029473196,0.00054715486,0.00005382072,0.0004113474],"category_scores_gemma":[0.000111337795,0.0001385552,0.000081019265,0.0012667027,0.00003875135,0.001015183,0.00020391797,0.00011642183,0.0017994896],"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.0000033927145,0.00028113485,0.0038503173,0.000027932752,0.000051270887,0.000006011228,0.00017939643,0.25985244,0.0004882914,0.4283625,0.025942115,0.2809552],"study_design_scores_gemma":[0.0002873807,0.000049284325,0.1779387,0.0000051450506,0.0000024226647,0.000027457016,0.0000094426205,0.54431957,0.00021934543,0.27332363,0.0035794955,0.00023816877],"about_ca_topic_score_codex":0.000015842137,"about_ca_topic_score_gemma":4.3764743e-7,"teacher_disagreement_score":0.69042104,"about_ca_system_score_codex":0.000052121297,"about_ca_system_score_gemma":0.000104446946,"threshold_uncertainty_score":0.9989777},"labels":[],"label_agreement":null},{"id":"W2914419451","doi":"10.1016/j.comgeo.2007.05.002","title":"Equiprojective polyhedra","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Combinatorics; Shadow (psychology); Projection (relational algebra); Mathematics; Computer science; Geometry; Algorithm","score_opus":0.049860324983418865,"score_gpt":0.3743435844501364,"score_spread":0.3244832594667175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914419451","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.2805831,0.000051400544,0.7062791,0.000061391984,0.00057773985,0.00022051172,0.000005232652,0.00021306776,0.012008448],"genre_scores_gemma":[0.8050332,5.0091177e-7,0.1942256,0.00009506515,0.00022364824,0.0000053287727,0.000005709963,0.000029663446,0.00038129895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860674,0.000021858523,0.00036968678,0.00022209849,0.00047461913,0.00030498276],"domain_scores_gemma":[0.9963476,0.0029502958,0.00016289718,0.00020691451,0.00023463219,0.00009768294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006002218,0.00015442148,0.00020919564,0.0002754451,0.00010796144,0.000023934786,0.00019658617,0.00007924883,0.00009286033],"category_scores_gemma":[0.0014449512,0.00015351694,0.000077672805,0.0006929215,0.00006367801,0.00013234647,0.00009934145,0.00017108489,0.00012847806],"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.000023391049,0.00014913756,0.0005687639,0.000049019545,0.000040519233,0.000017683342,0.00025373916,0.00029487337,0.00008091164,0.99458224,0.0008100439,0.0031296732],"study_design_scores_gemma":[0.00041561338,0.000052201653,0.002440202,0.00002152825,0.000013280687,0.00002740864,0.00014759495,0.00053854764,0.0005247316,0.9951106,0.00052711467,0.00018121135],"about_ca_topic_score_codex":0.0000015769774,"about_ca_topic_score_gemma":8.583362e-7,"teacher_disagreement_score":0.52445006,"about_ca_system_score_codex":0.00013169041,"about_ca_system_score_gemma":0.00005461446,"threshold_uncertainty_score":0.62602395},"labels":[],"label_agreement":null},{"id":"W2914514102","doi":"10.1016/j.comgeo.2005.06.005","title":"Moving coins","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada","keywords":"Euclidean geometry; Plane (geometry); Computer science; Combinatorics; Combinatorial explosion; Computational complexity theory; Mathematics; Algorithm; Geometry","score_opus":0.014242192469091754,"score_gpt":0.25314328414030113,"score_spread":0.23890109167120938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914514102","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.0387293,0.00034478158,0.95349944,0.0024721012,0.00036656993,0.000100112644,0.0000039913816,0.00027128676,0.0042124065],"genre_scores_gemma":[0.733292,0.000004095538,0.26419196,0.0014643412,0.00037340538,0.000008395094,0.00003867807,0.000007638921,0.0006195404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998489,0.000046444286,0.00030164246,0.00039492486,0.00051338377,0.00025458875],"domain_scores_gemma":[0.99902004,0.00027216916,0.000095252624,0.00025337143,0.00022770622,0.00013147497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002882196,0.00014872942,0.00013470571,0.00044268288,0.0002311287,0.00019737115,0.0005333144,0.000054830707,0.000114779206],"category_scores_gemma":[0.000081629114,0.00015937931,0.00008350887,0.0012313862,0.000030807187,0.00083887926,0.00019885637,0.00013111344,0.0006569996],"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.0000022734118,0.00007614857,0.00020348473,0.0000052312434,0.00001663792,0.000003753627,0.00009687229,0.6667948,0.00011351764,0.19128497,0.0037951588,0.13760719],"study_design_scores_gemma":[0.00038266391,0.000039351555,0.012799956,0.000008293417,0.0000041092453,0.00006297316,0.000008024441,0.91609985,0.0004078872,0.022757938,0.04717624,0.00025270347],"about_ca_topic_score_codex":0.0000022648098,"about_ca_topic_score_gemma":0.0000017573069,"teacher_disagreement_score":0.6945627,"about_ca_system_score_codex":0.000084915315,"about_ca_system_score_gemma":0.0001428557,"threshold_uncertainty_score":0.844462},"labels":[],"label_agreement":null},{"id":"W2916619961","doi":"10.1016/j.comgeo.2020.101622","title":"Plane hop spanners for unit disk graphs: Simpler and better","year":2020,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanner; Hop (telecommunications); Planarity testing; Unit disk graph; Euclidean geometry; Plane (geometry); Enhanced Data Rates for GSM Evolution; Euclidean distance; Mathematics; Computer science; Topology (electrical circuits); Unit disk; Combinatorics; Planar graph; Graph; Wireless; Geometry; Wireless network; Computer network; Telecommunications; Distributed computing","score_opus":0.04307309791878231,"score_gpt":0.28686293028230964,"score_spread":0.24378983236352733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916619961","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.06737354,0.0005873282,0.92247504,0.0069583845,0.001217253,0.0006719699,0.00031243885,0.0002413719,0.000162703],"genre_scores_gemma":[0.7027855,0.00003926717,0.28940812,0.003719365,0.0006968577,0.00013785069,0.0030206079,0.00004292064,0.00014950588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971497,0.00009353903,0.00056243985,0.0011669582,0.00064526056,0.00038210032],"domain_scores_gemma":[0.99765664,0.00093523134,0.00031661935,0.00039521267,0.00041250818,0.00028380656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034505484,0.00044975057,0.00047426412,0.00071922055,0.00027804385,0.00054112985,0.0008435727,0.00026725643,0.000024214483],"category_scores_gemma":[0.00017492092,0.0004849403,0.0002135704,0.0009017176,0.00009346279,0.00031538788,0.0012232127,0.0004987774,0.000034281435],"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.00008481885,0.00019156434,0.0020446067,0.0007927779,0.0005463341,0.000026452988,0.00077017694,0.66070884,0.00012819366,0.20243551,0.03237021,0.09990051],"study_design_scores_gemma":[0.0008310894,0.0001342999,0.017640376,0.000059894508,0.000052362746,0.000022721551,0.000022496868,0.50643665,0.000081779566,0.46141192,0.012625431,0.0006809746],"about_ca_topic_score_codex":0.000010502703,"about_ca_topic_score_gemma":0.000002646172,"teacher_disagreement_score":0.635412,"about_ca_system_score_codex":0.000047694593,"about_ca_system_score_gemma":0.00029643966,"threshold_uncertainty_score":0.9997602},"labels":[],"label_agreement":null},{"id":"W2921666111","doi":"10.1016/j.comgeo.2019.01.008","title":"Flip distance to some plane configurations","year":2019,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flip; Plane (geometry); Computer science; Materials science; Geometry; Mathematics; Chemistry","score_opus":0.010150010652917029,"score_gpt":0.24189803784275696,"score_spread":0.23174802718983992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921666111","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.11771129,0.00016279075,0.8755022,0.0023376548,0.0011328985,0.0003543234,0.000028795936,0.0002027844,0.0025672142],"genre_scores_gemma":[0.918072,0.000002682134,0.07652903,0.0028720906,0.00024316461,0.000027325135,0.00020475202,0.00001253329,0.002036439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980914,0.0000528536,0.00035433573,0.0005678135,0.0006313222,0.00030229267],"domain_scores_gemma":[0.99863964,0.000380907,0.00010037952,0.0003942835,0.00027749984,0.00020727518],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002457597,0.00018918123,0.00020317038,0.00051554333,0.00018079038,0.00025174595,0.0006351021,0.00006176313,0.00021783152],"category_scores_gemma":[0.00007779803,0.00020266576,0.00007891563,0.0015403649,0.000021996295,0.0007977222,0.00017159263,0.00013746899,0.0029539515],"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.000009083212,0.000065923574,0.00047637866,0.000011603722,0.000021052178,0.000004461928,0.00012245402,0.45116797,0.00070912065,0.5319805,0.0043798503,0.011051577],"study_design_scores_gemma":[0.0014134969,0.00038563207,0.107493475,0.00006434984,0.000012390837,0.00008261759,0.000050758386,0.6500785,0.0015604633,0.10790639,0.12986669,0.0010852467],"about_ca_topic_score_codex":0.0000042041856,"about_ca_topic_score_gemma":0.0000013876477,"teacher_disagreement_score":0.8003607,"about_ca_system_score_codex":0.00008145463,"about_ca_system_score_gemma":0.00017221781,"threshold_uncertainty_score":0.99782234},"labels":[],"label_agreement":null},{"id":"W2943003255","doi":"10.1016/j.comgeo.2020.101712","title":"Minimum ply covering of points with disks and squares","year":2020,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Disjoint sets; Mathematics; Bounded function; Dimension (graph theory); Constant (computer programming); Approximation algorithm; Plane (geometry); Time complexity; Point (geometry); Set (abstract data type); Polynomial; Algorithm; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.022729152282311243,"score_gpt":0.2543234763478237,"score_spread":0.23159432406551247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943003255","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.22735089,0.00059718365,0.7697458,0.001271438,0.00032428515,0.000254812,0.000057833342,0.00009749724,0.00030022813],"genre_scores_gemma":[0.8045873,0.000017978979,0.19470918,0.00029115044,0.00013911715,0.000016451813,0.00019171838,0.000016859805,0.000030256282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976711,0.00008086659,0.00049077865,0.00079248985,0.0007503463,0.00021438237],"domain_scores_gemma":[0.99823326,0.00047688946,0.00039886098,0.00033551626,0.0003817507,0.00017370531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022532437,0.00031883974,0.0004449796,0.0004785856,0.000110071705,0.00021848951,0.0006201784,0.00013846785,0.000014124693],"category_scores_gemma":[0.00011225837,0.0003124321,0.00009712324,0.00081518723,0.000106948435,0.00027668857,0.0012532449,0.00036483427,0.000011169729],"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.000111573056,0.0002065427,0.0034431645,0.00097131706,0.00035404038,0.000049521634,0.0016903433,0.860952,0.0002646857,0.1022678,0.00093315536,0.028755864],"study_design_scores_gemma":[0.00095349725,0.00033961522,0.06347609,0.00029350343,0.000050201124,0.00006064425,0.00004028477,0.7856534,0.00067044527,0.14713936,0.00065256184,0.00067039253],"about_ca_topic_score_codex":0.000014889462,"about_ca_topic_score_gemma":0.0000017670825,"teacher_disagreement_score":0.5772364,"about_ca_system_score_codex":0.00004554788,"about_ca_system_score_gemma":0.00037269483,"threshold_uncertainty_score":0.99993277},"labels":[],"label_agreement":null},{"id":"W2949103311","doi":"10.1016/j.comgeo.2020.101633","title":"Universal hinge patterns for folding strips efficiently into any grid polyhedron","year":2020,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; STRIPS; Surface (topology); Grid; Unit cube; Stack (abstract data type); Hinge; Folding (DSP implementation); Square (algebra); Geometry; Point (geometry); Cube (algebra); Grid pattern; Computer science; Combinatorics; Mathematics; Topology (electrical circuits); Algorithm; Physics; Structural engineering; Engineering; Classical mechanics","score_opus":0.02030029153345301,"score_gpt":0.22871452974379544,"score_spread":0.20841423821034244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949103311","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.28556794,0.00020120961,0.7133031,0.00017151132,0.000370147,0.00011366592,0.000047132587,0.00013935524,0.00008594334],"genre_scores_gemma":[0.9903641,0.000008238381,0.008944134,0.00020765267,0.0003122768,0.0000049993732,0.000117603544,0.00002627115,0.000014719575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992388,0.000010855087,0.0001754268,0.00019667398,0.00018253991,0.00019573301],"domain_scores_gemma":[0.99958706,0.00013927624,0.000027114542,0.0000708952,0.00005715913,0.00011847244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008023913,0.00012434088,0.00012982331,0.000110738045,0.000098171775,0.000046354104,0.00017077902,0.000048016864,0.00007771269],"category_scores_gemma":[0.000045423294,0.00013770835,0.000069417496,0.0002697369,0.000014644737,0.00009575812,0.00004044775,0.00012795131,0.000034576202],"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.000008181786,0.000011875844,0.001154314,0.00011214671,0.000034016546,0.000004687854,0.00044392943,0.98599416,0.00035472788,0.001321034,0.0012936903,0.0092672305],"study_design_scores_gemma":[0.00027053448,0.000069574446,0.0032023736,0.000024468696,0.000012680818,0.0000021400472,0.00018040603,0.98987424,0.0012530232,0.0003715717,0.0045204996,0.00021848403],"about_ca_topic_score_codex":0.000008446281,"about_ca_topic_score_gemma":0.0000010911762,"teacher_disagreement_score":0.7047962,"about_ca_system_score_codex":0.000065720655,"about_ca_system_score_gemma":0.000018045495,"threshold_uncertainty_score":0.56155837},"labels":[],"label_agreement":null},{"id":"W2951594256","doi":"10.1016/j.comgeo.2019.101595","title":"Self-approaching paths in simple polygons","year":2019,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Fonds De La Recherche Scientifique - FNRS","keywords":"Polygon (computer graphics); Simple polygon; Mathematics; Shortest path problem; Path (computing); Point in polygon; Point (geometry); Polygon covering; Rectilinear polygon; Simple (philosophy); Position (finance); Equiangular polygon; Combinatorics; Monotone polygon; Computer science; Geometry","score_opus":0.020201440422095165,"score_gpt":0.26626515626049124,"score_spread":0.2460637158383961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951594256","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.0878116,0.0010091407,0.90558684,0.00077460625,0.0017667975,0.00068077515,0.000048679874,0.00039192731,0.0019296195],"genre_scores_gemma":[0.7735695,0.00002335181,0.22456966,0.0005455381,0.0002989722,0.000056494646,0.00071905577,0.000029548191,0.0001878789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962197,0.00024302788,0.0007963981,0.001274333,0.0009510793,0.00051545474],"domain_scores_gemma":[0.9977062,0.0006701771,0.00038041873,0.00079474144,0.00028549015,0.00016302636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085157005,0.00047263107,0.0005394567,0.0016450912,0.00015793438,0.00051419454,0.0015026879,0.00036601376,0.000032707678],"category_scores_gemma":[0.00013076953,0.0005414742,0.00024037628,0.0017276853,0.000023629314,0.00049951405,0.0021448287,0.001037077,0.00024346141],"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.000005159585,0.00024260381,0.0022079272,0.00018785712,0.000057451485,0.00001927129,0.00040894607,0.9523929,0.0000074908853,0.031887043,0.00094902585,0.011634375],"study_design_scores_gemma":[0.0004853445,0.000040617375,0.021306738,0.000061679704,0.000011441628,0.000024298199,0.000016808433,0.87529457,0.000024735056,0.099588044,0.0025983658,0.0005473804],"about_ca_topic_score_codex":0.000043725922,"about_ca_topic_score_gemma":0.000007817926,"teacher_disagreement_score":0.68575794,"about_ca_system_score_codex":0.00045632492,"about_ca_system_score_gemma":0.00095226313,"threshold_uncertainty_score":0.9997037},"labels":[],"label_agreement":null},{"id":"W2952609385","doi":"10.1016/j.comgeo.2018.06.006","title":"Constrained generalized Delaunay graphs are plane spanners","year":2018,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Exploratory Research for Advanced Technology; Carleton University","keywords":"Combinatorics; Delaunay triangulation; Mathematics; Rectangle; Regular polygon; Planar graph; Graph; Discrete mathematics; Geometry","score_opus":0.017701356106718167,"score_gpt":0.25561959239396986,"score_spread":0.2379182362872517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952609385","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.18899652,0.00021481136,0.80604166,0.0011881191,0.0011682636,0.00018486437,0.000027135906,0.00031161655,0.0018669793],"genre_scores_gemma":[0.8585162,0.0000059743084,0.13862458,0.0017960608,0.00044379706,0.000015440604,0.00017962816,0.000014857578,0.00040345453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977019,0.000112959526,0.00044651193,0.0006448613,0.00068957545,0.00040418864],"domain_scores_gemma":[0.9982087,0.0003216578,0.00024221705,0.00036069585,0.00064059725,0.00022613083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003985325,0.0002626558,0.00026740166,0.0007358058,0.0004113041,0.0002466553,0.0006915574,0.00010936488,0.00020043683],"category_scores_gemma":[0.00013851418,0.00027050482,0.00013156643,0.002082193,0.00022060511,0.00050160626,0.00019871323,0.00015941018,0.00042911404],"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.00006023996,0.00030511388,0.0034005826,0.000039648374,0.00022793257,0.00007236285,0.00044940738,0.1503311,0.0012104845,0.76954997,0.028579712,0.04577346],"study_design_scores_gemma":[0.0025641243,0.0004102833,0.06485954,0.00005557112,0.00003136002,0.00027606342,0.00007745021,0.6901393,0.0023894093,0.2185996,0.01953146,0.0010658457],"about_ca_topic_score_codex":0.000009227304,"about_ca_topic_score_gemma":0.000006421358,"teacher_disagreement_score":0.66951966,"about_ca_system_score_codex":0.00006105011,"about_ca_system_score_gemma":0.00020438821,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W2953201848","doi":"10.1016/j.comgeo.2021.101820","title":"Minimum rectilinear polygons for given angle sequences","year":2021,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"H2020 European Research Council; European Research Council; Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; Comisión Nacional de Investigación Científica y Tecnológica; National Research Foundation of Korea","keywords":"Monotone polygon; Rectilinear polygon; Polygon (computer graphics); Polygon covering; Minimum bounding box; Equiangular polygon; Bounding overwatch; Combinatorics; Star-shaped polygon; Mathematics; Sequence (biology); Point in polygon; Boundary (topology); Planar; Perimeter; Simple polygon; Regular polygon; Geometry; Computer science; Mathematical analysis; Computer graphics (images)","score_opus":0.0352975961796297,"score_gpt":0.29712759337391725,"score_spread":0.26182999719428757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953201848","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.051109653,0.0021828713,0.93913203,0.0026008505,0.0034466058,0.00064747146,0.00015996484,0.00027625661,0.00044430053],"genre_scores_gemma":[0.48784027,0.000033023458,0.5074126,0.0008205613,0.00091086584,0.00018264684,0.0020285575,0.000031984506,0.0007394906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966471,0.00015756636,0.00068273494,0.0012912839,0.00077752466,0.00044378615],"domain_scores_gemma":[0.99647546,0.0010809805,0.00040039353,0.00064194616,0.0011965444,0.00020467899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005911293,0.00043110477,0.00051476737,0.000751954,0.00036078342,0.0008370978,0.0012217399,0.0003424134,0.00006110958],"category_scores_gemma":[0.00040724676,0.0004893697,0.00042432893,0.0013146454,0.00007993498,0.00044830237,0.0011914964,0.00046995145,0.000034694585],"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.0000211613,0.00026980418,0.00016224703,0.0002781197,0.0002428056,0.000027861543,0.00050674425,0.9368213,0.00025154455,0.016975584,0.010088426,0.034354392],"study_design_scores_gemma":[0.0006046799,0.00014415683,0.0028704351,0.0001435975,0.000047558246,0.00006662402,0.00008528914,0.9064303,0.000954578,0.07995346,0.007924644,0.00077465386],"about_ca_topic_score_codex":0.000022750872,"about_ca_topic_score_gemma":0.000007589737,"teacher_disagreement_score":0.4367306,"about_ca_system_score_codex":0.00017557404,"about_ca_system_score_gemma":0.0013595287,"threshold_uncertainty_score":0.9997558},"labels":[],"label_agreement":null},{"id":"W2953304270","doi":"10.1016/j.comgeo.2004.07.003","title":"Planar minimally rigid graphs and pseudo-triangulations","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":94,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Ministerio de Ciencia y Tecnología; McGill University; National Institutes of Health; National Science Foundation","keywords":"Planar graph; Embedding; Combinatorics; Mathematical proof; Planar; Generalization; Rigidity (electromagnetism); Mathematics; Statement (logic); Plane (geometry); Book embedding; Discrete mathematics; Computer science; Graph; Chordal graph; 1-planar graph; Geometry; Physics; Artificial intelligence; Computer graphics (images); Mathematical analysis","score_opus":0.006361768937535068,"score_gpt":0.20212057447444132,"score_spread":0.19575880553690625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953304270","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.9140737,0.0003020968,0.08457652,0.00013842038,0.00010512347,0.000055012628,0.000018036204,0.00014057154,0.00059051206],"genre_scores_gemma":[0.9589441,0.000016820171,0.040793322,0.000045069024,0.000034975434,0.0000024575018,0.00013158873,0.000009393765,0.000022319857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952775,0.0000043711316,0.00014491117,0.00010679142,0.00012337968,0.00009278332],"domain_scores_gemma":[0.9997906,0.000041842908,0.000020257523,0.000050987885,0.000045024346,0.000051289684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002939479,0.00008342158,0.000092948576,0.00021475715,0.00007509191,0.000037276764,0.00004497236,0.000037532547,0.000049922022],"category_scores_gemma":[0.0000101117585,0.00008080173,0.000037765873,0.0004434531,0.000024691917,0.00009826001,0.000007452546,0.000051184794,0.000017161123],"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.0000016237024,0.000004286586,0.0011233675,0.000008600807,0.000036516878,0.0000015775573,0.000047313428,0.9827936,0.00007751291,0.01436754,0.00013776048,0.0014002629],"study_design_scores_gemma":[0.00084662496,0.000027125407,0.3290935,0.000019011482,0.00004906376,0.000049666363,0.000050576524,0.4488224,0.0000994719,0.22049259,0.00014921099,0.00030077016],"about_ca_topic_score_codex":0.0000062083986,"about_ca_topic_score_gemma":0.0000036390322,"teacher_disagreement_score":0.53397125,"about_ca_system_score_codex":0.000026334623,"about_ca_system_score_gemma":0.000010227649,"threshold_uncertainty_score":0.3294999},"labels":[],"label_agreement":null},{"id":"W2963762723","doi":"10.1016/j.comgeo.2019.04.004","title":"Approximating dominating set on intersection graphs of rectangles and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:mi mathvariant=\"sans-serif\">L</mml:mi></mml:math>-frames","year":2019,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Diagonal; Combinatorics; Intersection (aeronautics); Mathematics; Approximation algorithm; Line (geometry); Logarithm; Line segment; Dominating set; Discrete mathematics; Geometry; Graph; Mathematical analysis","score_opus":0.01817942780823386,"score_gpt":0.2655638147394427,"score_spread":0.24738438693120882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963762723","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.90079975,0.00011430628,0.09707361,0.00009945204,0.00036120642,0.000077839446,0.000024707777,0.00010460212,0.0013445002],"genre_scores_gemma":[0.93607634,0.000015721096,0.06351019,0.00016976877,0.00007081705,0.00004363862,0.00004963029,0.00003884153,0.000025067986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976881,0.0001257833,0.00047888295,0.00057263,0.0007333372,0.00040124138],"domain_scores_gemma":[0.9975835,0.0012773741,0.0004384961,0.00044977522,0.0001322085,0.00011862967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010315627,0.00021079954,0.00019267871,0.00045087535,0.0002916791,0.00022520083,0.00058038527,0.0001818256,0.00002466124],"category_scores_gemma":[0.00044568963,0.0002493987,0.00016591015,0.0008816138,0.00021922155,0.00062352454,0.00053800346,0.0004021888,0.0001288632],"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.00008063077,0.00006351874,0.00010289954,0.0002400981,0.00008329355,0.00002037383,0.0010186093,0.01039008,0.0010785006,0.977034,0.000040921543,0.009847087],"study_design_scores_gemma":[0.00043718392,0.00038635728,0.0006307562,0.00028295023,0.000014542389,0.00013030198,0.00070187426,0.9597592,0.0028545735,0.03453287,0.00005352938,0.00021588957],"about_ca_topic_score_codex":0.00002701476,"about_ca_topic_score_gemma":0.0000039161373,"teacher_disagreement_score":0.9493691,"about_ca_system_score_codex":0.000019537014,"about_ca_system_score_gemma":0.000109484514,"threshold_uncertainty_score":0.9999958},"labels":[],"label_agreement":null},{"id":"W2981662868","doi":"10.1016/j.comgeo.2020.101700","title":"Folding polyominoes with holes into a cube","year":2020,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Austrian Science Fund; National Science Foundation","keywords":"Polyomino; Cube (algebra); Unit cube; Combinatorics; Folding (DSP implementation); Simple (philosophy); Mathematics; Tree (set theory); Computer science; Geometry","score_opus":0.014492423458373245,"score_gpt":0.23359799813320212,"score_spread":0.21910557467482888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981662868","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.17566116,0.0011982461,0.8211212,0.000091757516,0.00090978114,0.00017812816,0.000057823414,0.0004929796,0.00028888634],"genre_scores_gemma":[0.8834842,0.000052218616,0.11563437,0.00009526694,0.0003300836,0.00002832615,0.00029297988,0.00006547931,0.000017102686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990812,0.000009315832,0.00021856677,0.00028966847,0.00022383551,0.00017740286],"domain_scores_gemma":[0.99957,0.00006009272,0.00006370427,0.00014493763,0.00006220714,0.00009904847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00004713531,0.00025557514,0.00030106035,0.00014988804,0.000048875536,0.00007628056,0.00018759641,0.00013048046,0.000038330283],"category_scores_gemma":[0.000020250656,0.00024778565,0.00005788674,0.00017015549,0.00002724128,0.00006288509,0.0002436546,0.0002816576,0.000038685957],"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.00001240387,0.000008838145,0.000019683956,0.00046401072,0.00009177824,0.000017730654,0.0001763722,0.98841256,0.0013954568,0.0042922255,0.00035738936,0.0047515426],"study_design_scores_gemma":[0.0010088801,0.00012301632,0.0007679271,0.00077125547,0.0001350293,0.000039753068,0.0002524782,0.5983663,0.012394945,0.37800384,0.006525762,0.0016107799],"about_ca_topic_score_codex":0.0000032587527,"about_ca_topic_score_gemma":0.0000010800385,"teacher_disagreement_score":0.70782304,"about_ca_system_score_codex":0.00007535831,"about_ca_system_score_gemma":0.00005634259,"threshold_uncertainty_score":0.99999744},"labels":[],"label_agreement":null},{"id":"W2987656947","doi":"10.1016/j.comgeo.2019.101592","title":"Colored anchored visibility representations in 2D and 3D space","year":2019,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Università degli Studi di Perugia; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Visibility; Vertex (graph theory); Combinatorics; Visibility graph; Graph; Representation (politics); Mathematics; Geometry; Physics","score_opus":0.010727061834654588,"score_gpt":0.2637610059200685,"score_spread":0.2530339440854139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987656947","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.6544902,0.00021768239,0.34258527,0.0007240072,0.0003229115,0.00031507472,0.000006774537,0.00007698181,0.0012611344],"genre_scores_gemma":[0.904518,0.000008269471,0.09468153,0.00030622722,0.000055872475,0.000018163782,0.00007042864,0.000007624974,0.00033386366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981692,0.00011707165,0.0003706207,0.0006601684,0.0004373896,0.00024559302],"domain_scores_gemma":[0.998631,0.0006153521,0.00011395114,0.00033738714,0.00019174707,0.00011054211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048541828,0.00015908915,0.00021275641,0.0005895093,0.000102922764,0.00017478426,0.00031824008,0.000075128024,0.000072615694],"category_scores_gemma":[0.00014410153,0.00017485365,0.000048700662,0.0016804602,0.00005079915,0.00068937516,0.00024164657,0.00016568485,0.00012583956],"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.000035463785,0.00024135564,0.107876025,0.000053329168,0.000032615993,0.000013465625,0.0006122885,0.75715894,0.00055745774,0.11334791,0.0008481756,0.019222992],"study_design_scores_gemma":[0.000680624,0.00005969156,0.4816666,0.000012477938,0.0000026268162,0.000017670664,0.00003594728,0.4901291,0.00008285872,0.026519172,0.00062340306,0.0001698124],"about_ca_topic_score_codex":0.000027003287,"about_ca_topic_score_gemma":0.000010485169,"teacher_disagreement_score":0.37379056,"about_ca_system_score_codex":0.00008196009,"about_ca_system_score_gemma":0.00014452632,"threshold_uncertainty_score":0.7130324},"labels":[],"label_agreement":null},{"id":"W2992950813","doi":"10.1016/j.comgeo.2021.101809","title":"A linear optimization oracle for zonotope computation","year":2021,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Polytope; Hyperplane; Oracle; Vertex (graph theory); Enumeration; Mathematics; Set (abstract data type); Computation; Combinatorics; Algorithm; Computer science; Graph","score_opus":0.03192042919016951,"score_gpt":0.29942144909575796,"score_spread":0.26750101990558844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992950813","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.007408781,0.0010868552,0.985532,0.0013188329,0.0027519541,0.0011225675,0.00009856461,0.0004402358,0.00024021803],"genre_scores_gemma":[0.19849253,0.00003400809,0.7939159,0.0007131867,0.00064754026,0.00022968258,0.0057281284,0.000047417427,0.00019158555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961199,0.0001900137,0.0009305973,0.0014174316,0.0008905796,0.00045145664],"domain_scores_gemma":[0.9955687,0.0008571577,0.0006143189,0.0005781086,0.0021691313,0.00021257141],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006826761,0.0005194035,0.0005950929,0.00090540707,0.00041696074,0.000954678,0.0009713922,0.00042616998,0.000048476333],"category_scores_gemma":[0.00037971203,0.00062359584,0.0004094234,0.0015367554,0.000057593086,0.00072579127,0.0012058237,0.0004970074,0.000029263827],"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.00001577089,0.00019987233,0.00004038495,0.00020282628,0.00011428954,0.000008157722,0.00018460033,0.96902925,0.000016923203,0.0071433284,0.0014215612,0.021623023],"study_design_scores_gemma":[0.0007712724,0.00009262887,0.000806147,0.000110772424,0.000043387314,0.000027865395,0.000027503029,0.9733913,0.00015615165,0.022918688,0.0010221764,0.0006320897],"about_ca_topic_score_codex":0.0000117561085,"about_ca_topic_score_gemma":0.000002621853,"teacher_disagreement_score":0.19161607,"about_ca_system_score_codex":0.00024034039,"about_ca_system_score_gemma":0.001148382,"threshold_uncertainty_score":0.9996215},"labels":[],"label_agreement":null},{"id":"W2996115425","doi":"10.1016/j.comgeo.2023.102020","title":"Colouring bottomless rectangles and arborescences","year":2023,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Corollary; Vertex (graph theory); Monochromatic color; Point (geometry); Order (exchange); Line (geometry); Plane (geometry); Discrete mathematics; Geometry; Graph; Optics; Physics","score_opus":0.024630486044784995,"score_gpt":0.3022855409761604,"score_spread":0.2776550549313754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996115425","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.6876874,0.0003815424,0.30933636,0.0010150899,0.00021579128,0.00012859372,0.0000053796034,0.00049037905,0.00073946826],"genre_scores_gemma":[0.9614574,0.000033081018,0.038150605,0.00009600157,0.00004357397,0.000012328052,0.0000073517526,0.00000775447,0.0001919523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883014,0.00006205462,0.00013169383,0.00032400282,0.0003850782,0.000267035],"domain_scores_gemma":[0.998852,0.0007516135,0.000039585357,0.00016961733,0.000090441645,0.00009673822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042996192,0.00008802082,0.00010405034,0.0005139055,0.0002017062,0.00013001519,0.0004693686,0.000032370604,0.0000073103843],"category_scores_gemma":[0.00014717468,0.00008638729,0.000027255252,0.002097493,0.000119606164,0.00031292287,0.00039851456,0.000118625154,0.00010317098],"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.000019701429,0.000052280393,0.027942447,0.00007060133,0.000048177968,0.00012979454,0.0005851777,0.043270405,0.0004943073,0.8182119,0.0016860534,0.107489124],"study_design_scores_gemma":[0.00028931847,0.00006099426,0.16425933,0.000031427924,0.0000017241659,0.000029867566,0.00010583177,0.2818934,0.00029089302,0.55206406,0.000756348,0.00021679359],"about_ca_topic_score_codex":0.0000021255673,"about_ca_topic_score_gemma":7.542559e-7,"teacher_disagreement_score":0.27376997,"about_ca_system_score_codex":0.000019008625,"about_ca_system_score_gemma":0.000043540007,"threshold_uncertainty_score":0.35227716},"labels":[],"label_agreement":null},{"id":"W3004391915","doi":"10.1016/j.comgeo.2020.101608","title":"Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword","year":2020,"lang":"en","type":"article","venue":"Computational Geometry","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":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Intersection (aeronautics); Combinatorics; Tree (set theory); Point (geometry); Line (geometry); Line segment; Euclidean geometry; Geometry; Mathematics; Plane (geometry); Computer science; Geography; Cartography","score_opus":0.03324093779524994,"score_gpt":0.251986747020698,"score_spread":0.21874580922544806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004391915","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.020954264,0.00010627176,0.6836844,0.1921127,0.030380944,0.0017371514,0.0004507963,0.00065260386,0.06992085],"genre_scores_gemma":[0.86271876,0.0000066425296,0.017516745,0.029289123,0.08912397,0.00005339053,0.0006838436,0.000047119975,0.0005604175],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959547,0.00021355774,0.00060953957,0.0009910143,0.001595216,0.00063598336],"domain_scores_gemma":[0.9965002,0.0014239163,0.00024638406,0.00043096667,0.0006799881,0.0007185568],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005185954,0.00045786644,0.00035949668,0.0008092557,0.0008688452,0.00065046776,0.0014877343,0.00017363482,0.0011766326],"category_scores_gemma":[0.00053747237,0.00040167978,0.00019134306,0.002918299,0.00015179184,0.0004633945,0.00023837114,0.00062529923,0.0028680956],"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.00002857073,0.0000886393,0.00013229255,0.0000120119985,0.000049303268,0.000023190782,0.00029117335,0.37406307,0.0000037631353,0.21514873,0.3994379,0.010721328],"study_design_scores_gemma":[0.00073806714,0.00055421056,0.009742237,0.000044963428,0.000014210189,0.00002471733,0.00007299958,0.5272083,0.00008527491,0.029425425,0.4314482,0.00064141175],"about_ca_topic_score_codex":0.00030275906,"about_ca_topic_score_gemma":0.00017825917,"teacher_disagreement_score":0.8417645,"about_ca_system_score_codex":0.00025365883,"about_ca_system_score_gemma":0.0010649667,"threshold_uncertainty_score":0.9998435},"labels":[],"label_agreement":null},{"id":"W3023901952","doi":"10.1016/j.comgeo.2020.101629","title":"Hamiltonicity for convex shape Delaunay and Gabriel graphs","year":2020,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"H2020 Marie Skłodowska-Curie Actions; Horizon 2020; Consejo Nacional de Ciencia y Tecnología; Ministerio de Economía y Competitividad; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Regular polygon; Delaunay triangulation; Hamiltonian path; Vertex (graph theory); Upper and lower bounds; Discrete mathematics; Graph; Geometry; Mathematical analysis","score_opus":0.028755503294863937,"score_gpt":0.25226074124532544,"score_spread":0.2235052379504615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023901952","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.107560284,0.0005685236,0.88608885,0.004884301,0.00023501964,0.00028800056,0.000026101792,0.00015967169,0.00018926457],"genre_scores_gemma":[0.83308476,0.000012869088,0.16158035,0.005004961,0.00014653154,0.000021621154,0.00009515195,0.0000107891465,0.00004297916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850756,0.00004230667,0.00030868343,0.00055401993,0.0003472837,0.00024014463],"domain_scores_gemma":[0.99862266,0.00057899085,0.00010991717,0.00013800361,0.00030872747,0.00024167691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023187314,0.0001769889,0.00021161551,0.00020475194,0.00025485855,0.00019730264,0.00037449083,0.00007114908,0.000030646464],"category_scores_gemma":[0.00021147646,0.00018958542,0.000095996445,0.0009752021,0.00006372849,0.00043876885,0.00019931786,0.00011785971,0.000030133542],"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.000061838735,0.000116047966,0.0012297792,0.00014995445,0.00011271212,0.000009397279,0.0008162963,0.12983003,0.00066579075,0.75464386,0.009920708,0.10244359],"study_design_scores_gemma":[0.0007249204,0.00016652897,0.011882375,0.000007999697,0.000010315798,0.000019624293,0.000017846538,0.92399603,0.00027080442,0.056684967,0.005978628,0.00023995867],"about_ca_topic_score_codex":0.00000213871,"about_ca_topic_score_gemma":3.8411858e-7,"teacher_disagreement_score":0.79416597,"about_ca_system_score_codex":0.000020131742,"about_ca_system_score_gemma":0.00012376651,"threshold_uncertainty_score":0.7731069},"labels":[],"label_agreement":null},{"id":"W3040601751","doi":"10.1016/j.comgeo.2020.101682","title":"An improved construction for spanners of disks","year":2020,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanner; Combinatorics; Disjoint sets; Pairwise comparison; Graph; Mathematics; Metric space; Plane (geometry); Metric (unit); Discrete mathematics; Computer science; Geometry","score_opus":0.023646996394319227,"score_gpt":0.2734262103874661,"score_spread":0.2497792139931469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040601751","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.06427536,0.00006566395,0.9335927,0.0012838908,0.00031857405,0.00023914433,0.000033894,0.000104648745,0.000086143766],"genre_scores_gemma":[0.64395726,0.0000012048936,0.35531336,0.0004234798,0.00015936955,0.000011771922,0.00012051446,0.0000060814773,0.000006970833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882036,0.00004026174,0.00033667992,0.00038125113,0.00026406473,0.0001573534],"domain_scores_gemma":[0.99885887,0.0002337815,0.00018193794,0.00016083436,0.00040576328,0.00015878929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017550794,0.0001244185,0.00017859908,0.00019280292,0.00010960042,0.00007322027,0.00040309475,0.000055299544,0.000015362739],"category_scores_gemma":[0.00013318217,0.000132388,0.00009352911,0.0009189392,0.00005631577,0.0005352496,0.00006174368,0.00007012097,0.000007590738],"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.00006797592,0.0001276219,0.0005887197,0.00008726069,0.00005739948,9.607022e-7,0.00044738638,0.6674657,0.007746718,0.2043288,0.0006767016,0.11840475],"study_design_scores_gemma":[0.00060616335,0.00035646127,0.003072163,0.0000048813886,0.000008821823,0.0000073930937,0.000049148093,0.9716323,0.002948116,0.02027854,0.00087522395,0.00016077503],"about_ca_topic_score_codex":0.0000026277469,"about_ca_topic_score_gemma":3.3052387e-7,"teacher_disagreement_score":0.5796819,"about_ca_system_score_codex":0.000020790507,"about_ca_system_score_gemma":0.0001468477,"threshold_uncertainty_score":0.5398626},"labels":[],"label_agreement":null},{"id":"W3138447845","doi":"10.1016/s0925-7721(02)00093-7","title":"Computing contour trees in all dimensions","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":460,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of North Carolina at Chapel Hill; Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Simple (philosophy); Computer science; Contour line; Algorithm; Mathematics; Artificial intelligence; Cartography; Geography","score_opus":0.04481388461551654,"score_gpt":0.2730690683067274,"score_spread":0.22825518369121084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138447845","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.06715496,0.0005112275,0.9234913,0.0021070878,0.00053190487,0.00017583245,0.000008289673,0.00024565458,0.005773721],"genre_scores_gemma":[0.91498333,0.000009772241,0.08348027,0.0009890697,0.000069040965,0.0000024629883,0.000030859566,0.0000064057654,0.00042878574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987751,0.00004161935,0.00025049452,0.00034629725,0.00031916666,0.0002673184],"domain_scores_gemma":[0.99932003,0.00024622967,0.00006861821,0.00024573118,0.00004731237,0.00007208247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021838013,0.00011901566,0.00014215363,0.0004092315,0.00008513018,0.00017178975,0.00064049434,0.00003081738,0.00007584593],"category_scores_gemma":[0.000043206404,0.00012143391,0.000045444373,0.0009000767,0.000029524526,0.00052997936,0.00041024675,0.00011806922,0.00032925274],"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.000003897768,0.00082285743,0.014974647,0.000026706044,0.000111088586,0.00028193384,0.0011836697,0.30019924,0.000058648995,0.2780895,0.055676248,0.34857157],"study_design_scores_gemma":[0.00045472436,0.000023950473,0.04074008,0.000016203163,0.0000025708248,0.0000075980083,0.000020379946,0.9464344,0.0000046255636,0.0060950047,0.006039745,0.00016072659],"about_ca_topic_score_codex":0.000015055578,"about_ca_topic_score_gemma":0.000005472115,"teacher_disagreement_score":0.8478284,"about_ca_system_score_codex":0.00003409707,"about_ca_system_score_gemma":0.0000084549365,"threshold_uncertainty_score":0.49519312},"labels":[],"label_agreement":null},{"id":"W3160363604","doi":"10.1016/j.comgeo.2021.101788","title":"Simultaneous visibility representations of undirected pairs of graphs","year":2021,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Visibility; Combinatorics; Visibility graph; Representation (politics); Vertex (graph theory); Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Undirected graph; Geometry; Computer science; Physics; Artificial intelligence; Optics","score_opus":0.015585531037700577,"score_gpt":0.2782645236419245,"score_spread":0.26267899260422395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160363604","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.3217279,0.00036047606,0.6764435,0.0001941009,0.00027709708,0.000103488164,0.00003145839,0.00006562097,0.0007963702],"genre_scores_gemma":[0.8572685,0.000009338267,0.14231068,0.000079910125,0.000026584492,0.00000456084,0.00015599703,0.000006122664,0.0001383094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979791,0.00017063975,0.0006210565,0.00044400588,0.0006217955,0.00016341341],"domain_scores_gemma":[0.9959701,0.001725908,0.00028363508,0.00043718476,0.0014971502,0.00008604911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032117544,0.00013154796,0.0002687308,0.00042403935,0.000095408854,0.00003811843,0.00036129943,0.00006447478,0.00008935414],"category_scores_gemma":[0.0009182889,0.00014687088,0.00016311674,0.0033068385,0.0000938179,0.00027040305,0.0001930312,0.00010117956,0.000010388743],"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.00001389104,0.00043802493,0.0046804524,0.0000812472,0.000096954,0.000020719011,0.0002667551,0.85774714,0.00370402,0.1135222,0.00033339995,0.019095207],"study_design_scores_gemma":[0.00085424504,0.00013507128,0.13347621,0.00004739465,0.000030626416,0.00006940447,0.00010567182,0.6517391,0.02845387,0.18440852,0.0003615232,0.0003183529],"about_ca_topic_score_codex":0.000014497107,"about_ca_topic_score_gemma":0.000004603719,"teacher_disagreement_score":0.5355406,"about_ca_system_score_codex":0.000031974127,"about_ca_system_score_gemma":0.00037465847,"threshold_uncertainty_score":0.5989221},"labels":[],"label_agreement":null},{"id":"W4205206153","doi":"10.1016/j.comgeo.2014.09.003","title":"Guest Editor's foreword","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Posthumanist Ethics and Activism","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Psychology","score_opus":0.0216056271453652,"score_gpt":0.31674415410414314,"score_spread":0.29513852695877796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205206153","genre_codex":"other","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.20737544,0.00019776257,0.13363265,0.01675208,0.034780916,0.00038967628,0.000028639191,0.0005245209,0.6063183],"genre_scores_gemma":[0.98323655,0.0000035471908,0.0012810769,0.0006718395,0.013784585,0.0000032894352,0.000018199404,0.000006860861,0.0009940551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990943,0.00007851509,0.00009556667,0.00013291802,0.0004243966,0.0001743112],"domain_scores_gemma":[0.9991304,0.00053315295,0.000049355524,0.0000687396,0.00013272118,0.000085584266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066995417,0.000056036926,0.00007384071,0.0000846612,0.000490454,0.00008886591,0.00017208027,0.00007216467,0.00015147148],"category_scores_gemma":[0.00036394867,0.000057634017,0.00004028895,0.00023114996,0.00017736334,0.00011787418,0.000031567764,0.0001298748,0.00023544762],"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.000003118188,0.00005316974,0.0017942457,0.000006433267,0.000011576032,8.3350756e-7,0.0012705849,0.00065376755,0.000006439371,0.94018304,0.048035797,0.0079809865],"study_design_scores_gemma":[0.00010445622,0.000019356943,0.009550006,0.0000072049756,0.0000028685201,3.7804364e-7,0.00013909861,0.0009048883,0.000005340921,0.19187771,0.7972926,0.00009609573],"about_ca_topic_score_codex":0.00011721503,"about_ca_topic_score_gemma":0.000049005677,"teacher_disagreement_score":0.7758611,"about_ca_system_score_codex":0.00003760567,"about_ca_system_score_gemma":0.00009148739,"threshold_uncertainty_score":0.37722254},"labels":[],"label_agreement":null},{"id":"W4205367317","doi":"10.1016/j.comgeo.2012.01.009","title":"Editorial","year":2012,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of New Brunswick","funders":"","keywords":"Political science","score_opus":0.010550432605954918,"score_gpt":0.28645453498467144,"score_spread":0.27590410237871654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205367317","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016746133,0.0008262308,0.0010176427,0.000011628111,0.9912742,0.00024430332,0.003215792,0.00047382427,0.0029196653],"genre_scores_gemma":[0.00021718984,0.000005748388,0.0020531772,0.000017138196,0.9779653,0.000043542303,0.017888665,0.00033582118,0.001473443],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9927546,0.00016125679,0.0006609826,0.0007193676,0.0049138404,0.0007899671],"domain_scores_gemma":[0.9928026,0.0040342896,0.0005606623,0.00046965465,0.0017636075,0.0003691628],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011203759,0.0006337178,0.0006799675,0.0010091909,0.00020479216,0.00019104838,0.000794929,0.0019933975,0.001159754],"category_scores_gemma":[0.0035122493,0.0006925079,0.00031317532,0.0011596376,0.00016851959,0.00034323998,0.00033461803,0.0020254885,0.04497034],"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.00007152265,0.00016008863,0.00002869515,0.00007726421,0.00017483636,0.0000027789213,0.000028954666,0.0026974808,0.0000029482476,0.00020172652,0.99620473,0.0003489505],"study_design_scores_gemma":[0.00086146884,0.00004325981,0.00009274418,0.00005215598,0.00012367155,0.0000018911242,0.0000048800334,0.00014417627,0.0000010481142,0.002612827,0.9953544,0.0007074375],"about_ca_topic_score_codex":0.000028034887,"about_ca_topic_score_gemma":0.0000015570774,"teacher_disagreement_score":0.043810587,"about_ca_system_score_codex":0.0006235658,"about_ca_system_score_gemma":0.0012068269,"threshold_uncertainty_score":0.9997533},"labels":[],"label_agreement":null},{"id":"W4205404903","doi":"10.1016/j.comgeo.2012.07.002","title":"Foreword","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Philosophy","score_opus":0.027905482584484134,"score_gpt":0.29332429425982853,"score_spread":0.2654188116753444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205404903","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.94112736,0.00062412303,0.047505595,0.00009391029,0.0005013397,0.00010632824,0.00009619004,0.00025576208,0.009689383],"genre_scores_gemma":[0.9804648,2.3127974e-7,0.018110776,0.0002975807,0.00042108202,0.000007684582,0.0001266601,0.000035459158,0.0005357066],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99902564,0.000028356442,0.00014726755,0.00011515762,0.00035933385,0.00032425113],"domain_scores_gemma":[0.9993808,0.00020204099,0.000056207922,0.00011056831,0.00009332167,0.00015703245],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028237223,0.000094939474,0.00009242717,0.00026861776,0.000079343874,0.000014294732,0.00011610732,0.000038763745,0.00088960666],"category_scores_gemma":[0.00011187092,0.00009613519,0.00005473662,0.0007409384,0.00004769164,0.0002984967,0.000057671143,0.00009198177,0.021058703],"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.000048914007,0.0006113328,0.57969755,0.00003355479,0.00013567758,0.000004147253,0.0004503541,0.04975177,0.00034043432,0.20173188,0.14688128,0.020313086],"study_design_scores_gemma":[0.00039186724,0.000017123846,0.9425002,0.0000067469737,0.000013327845,0.000040154555,0.00004179068,0.010002071,0.00010129367,0.012001055,0.034665164,0.0002192152],"about_ca_topic_score_codex":0.0000023150255,"about_ca_topic_score_gemma":1.975905e-7,"teacher_disagreement_score":0.36280262,"about_ca_system_score_codex":0.000067093446,"about_ca_system_score_gemma":0.000026569842,"threshold_uncertainty_score":0.97970355},"labels":[],"label_agreement":null},{"id":"W4205468123","doi":"10.1016/j.comgeo.2012.01.010","title":"Editorial","year":2012,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","score_opus":0.010550432605954918,"score_gpt":0.28645453498467144,"score_spread":0.27590410237871654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205468123","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016746133,0.0008262308,0.0010176427,0.000011628111,0.9912742,0.00024430332,0.003215792,0.00047382427,0.0029196653],"genre_scores_gemma":[0.00021718984,0.000005748388,0.0020531772,0.000017138196,0.9779653,0.000043542303,0.017888665,0.00033582118,0.001473443],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9927546,0.00016125679,0.0006609826,0.0007193676,0.0049138404,0.0007899671],"domain_scores_gemma":[0.9928026,0.0040342896,0.0005606623,0.00046965465,0.0017636075,0.0003691628],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011203759,0.0006337178,0.0006799675,0.0010091909,0.00020479216,0.00019104838,0.000794929,0.0019933975,0.001159754],"category_scores_gemma":[0.0035122493,0.0006925079,0.00031317532,0.0011596376,0.00016851959,0.00034323998,0.00033461803,0.0020254885,0.04497034],"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.00007152265,0.00016008863,0.00002869515,0.00007726421,0.00017483636,0.0000027789213,0.000028954666,0.0026974808,0.0000029482476,0.00020172652,0.99620473,0.0003489505],"study_design_scores_gemma":[0.00086146884,0.00004325981,0.00009274418,0.00005215598,0.00012367155,0.0000018911242,0.0000048800334,0.00014417627,0.0000010481142,0.002612827,0.9953544,0.0007074375],"about_ca_topic_score_codex":0.000028034887,"about_ca_topic_score_gemma":0.0000015570774,"teacher_disagreement_score":0.043810587,"about_ca_system_score_codex":0.0006235658,"about_ca_system_score_gemma":0.0012068269,"threshold_uncertainty_score":0.9997533},"labels":[],"label_agreement":null},{"id":"W4207027624","doi":"10.1016/j.comgeo.2017.06.010","title":"Table cartogram","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba; University of Waterloo; University of British Columbia","funders":"","keywords":"Rectangle; Table (database); Quadrilateral; Regular polygon; Mathematics; Partition (number theory); Combinatorics; Adjacency list; Geometry; Computer science; Physics; Database","score_opus":0.024357971888012264,"score_gpt":0.3034193636811764,"score_spread":0.27906139179316414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207027624","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.0041930783,0.00009592909,0.9584191,0.00071497605,0.00021072384,0.00005784297,0.000003173669,0.0004739114,0.0358313],"genre_scores_gemma":[0.6559038,9.4234974e-7,0.34324998,0.00022176513,0.000036473397,0.0000064982705,0.000004501705,0.0000055210717,0.0005705272],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999112,0.000008467063,0.0001288713,0.0002757977,0.0002865147,0.00018833972],"domain_scores_gemma":[0.99892455,0.000058821395,0.00012863876,0.0006190389,0.0001967261,0.000072250994],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00016029223,0.00009305771,0.00009928304,0.00012897307,0.00042283162,0.0019006807,0.0016444357,0.000034216177,0.000009528706],"category_scores_gemma":[0.00020257325,0.00009446603,0.000038108454,0.00020291691,0.000101999816,0.0018116422,0.0006263259,0.00008134773,0.00012162652],"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.00000344545,0.0002018353,0.01005437,0.000043788743,0.000033592398,0.000061405415,0.00009981476,0.0020272704,0.0001418341,0.3290806,0.020220686,0.63803136],"study_design_scores_gemma":[0.00034489547,0.00007679534,0.060478516,0.00005414478,0.0000047493445,0.00006814208,0.0000047552057,0.19451275,0.0022425577,0.71611404,0.025639443,0.00045918292],"about_ca_topic_score_codex":0.000012319008,"about_ca_topic_score_gemma":5.6953223e-7,"teacher_disagreement_score":0.65171075,"about_ca_system_score_codex":0.000016107379,"about_ca_system_score_gemma":0.00008344387,"threshold_uncertainty_score":0.99913543},"labels":[],"label_agreement":null},{"id":"W4210743659","doi":"10.1016/j.comgeo.2020.101632","title":"Preface","year":2020,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Genetics, Bioinformatics, and Biomedical Research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Memorial University of Newfoundland; Fields Institute for Research in Mathematical Sciences","keywords":"Delaunay triangulation; Computer science; Tetrahedron; Algorithm; Pruning; Computation; Representation (politics); Triangulation; Alpha (finance); Mathematics; Geometry","score_opus":0.024509652189703426,"score_gpt":0.2886808771066543,"score_spread":0.2641712249169509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210743659","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.78914624,0.00088649435,0.19532518,0.005894349,0.00025279316,0.0003016498,0.00008208455,0.000049618557,0.008061556],"genre_scores_gemma":[0.9874446,0.000049125563,0.008624845,0.0027821043,0.0003714121,0.0000039149886,0.00031720343,0.000009809401,0.0003970269],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991371,0.000018915154,0.00016877627,0.00018569,0.0003065576,0.00018293103],"domain_scores_gemma":[0.9995052,0.000021538743,0.00003572723,0.000098322154,0.00011727551,0.00022190856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009952596,0.00008502154,0.00008044419,0.00003924563,0.000052530533,0.000027646613,0.00020353844,0.00008033002,0.00009645795],"category_scores_gemma":[0.00030652672,0.00007857273,0.00005595056,0.00018392815,0.00009119465,0.0000024608141,0.00016335597,0.0000828404,0.0002455462],"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.0006590105,0.000582821,0.026044581,0.00080393656,0.0006249219,0.000031080115,0.0010748259,0.057202496,0.17628838,0.0023257327,0.50280493,0.23155728],"study_design_scores_gemma":[0.0025371455,0.0019232676,0.052222237,0.000024644383,0.000026108526,0.000030161664,0.00042345648,0.06871682,0.04358351,0.0023375016,0.8272944,0.00088076596],"about_ca_topic_score_codex":0.0000011085968,"about_ca_topic_score_gemma":3.403529e-7,"teacher_disagreement_score":0.32448944,"about_ca_system_score_codex":0.0000056673275,"about_ca_system_score_gemma":0.0000931107,"threshold_uncertainty_score":0.3204103},"labels":[],"label_agreement":null},{"id":"W4210982562","doi":"10.1016/j.comgeo.2004.01.001","title":"Editorial","year":2004,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Philosophy","score_opus":0.007576107578959697,"score_gpt":0.2780825414590256,"score_spread":0.2705064338800659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210982562","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015399777,0.0003580652,0.0019003114,0.000023403467,0.9914033,0.0002812175,0.0033793445,0.0005660644,0.0020729264],"genre_scores_gemma":[0.00012737013,0.000006200541,0.0028926276,0.000022097089,0.9779868,0.000039903618,0.017632136,0.00033360076,0.0009592454],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9922893,0.000101433536,0.0007085005,0.000989563,0.0052907323,0.00062044687],"domain_scores_gemma":[0.9940564,0.0026455107,0.0005367547,0.00047404083,0.0020169874,0.00027028643],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007215722,0.00066281087,0.0007074467,0.0011483688,0.00022085816,0.0002578488,0.00088345323,0.0020014443,0.0005609564],"category_scores_gemma":[0.003972048,0.0007450017,0.00034518025,0.0014354787,0.00020477612,0.00023122792,0.00028477362,0.002149958,0.026979834],"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.000080199636,0.00013967816,0.0000035630362,0.0000914135,0.00015871995,0.000013660375,0.000023648918,0.055646718,0.0000022550216,0.00037352738,0.9433239,0.00014271274],"study_design_scores_gemma":[0.0017179298,0.00008606261,0.000028862927,0.00013160758,0.000085049396,0.0000024434803,0.0000046794944,0.00012788326,0.0000014797579,0.020842066,0.976249,0.00072296284],"about_ca_topic_score_codex":0.00006625782,"about_ca_topic_score_gemma":0.000004217393,"teacher_disagreement_score":0.055518836,"about_ca_system_score_codex":0.0014195279,"about_ca_system_score_gemma":0.00397137,"threshold_uncertainty_score":0.9995001},"labels":[],"label_agreement":null},{"id":"W4211032338","doi":"10.1016/s0925-7721(02)00168-2","title":"Editorial","year":2003,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Medicine","score_opus":0.008317735964968896,"score_gpt":0.2779199927020234,"score_spread":0.2696022567370545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211032338","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000101843625,0.00042373262,0.0014501824,0.00001212178,0.9885367,0.00026384662,0.0026983218,0.00037027177,0.006234648],"genre_scores_gemma":[0.000024730178,0.000007667592,0.0030197923,0.000033760713,0.98135746,0.00004158192,0.011922626,0.0003325543,0.0032598411],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9925285,0.00022629996,0.0007115132,0.000975401,0.004925674,0.0006326247],"domain_scores_gemma":[0.9929928,0.0035781346,0.00054146204,0.0004892091,0.0021289263,0.00026944687],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009911603,0.00066194986,0.0007204568,0.0010700865,0.00022148316,0.00024814808,0.0007281544,0.0019813399,0.0010031362],"category_scores_gemma":[0.005744021,0.0007459905,0.000327079,0.0015166375,0.00017452856,0.00020077123,0.00016914881,0.0020482135,0.024839405],"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.000055501612,0.00012322137,0.000008098282,0.0000647442,0.00016536225,0.000008455302,0.000012666025,0.008584932,0.000002029001,0.00029934774,0.9905543,0.00012138804],"study_design_scores_gemma":[0.0011510461,0.000066711524,0.000013883968,0.00005419454,0.00008604443,0.0000025324007,0.0000049835667,0.0001822522,0.0000013708694,0.007283276,0.99041873,0.0007349449],"about_ca_topic_score_codex":0.000017324797,"about_ca_topic_score_gemma":0.0000016556505,"teacher_disagreement_score":0.02383627,"about_ca_system_score_codex":0.00065816403,"about_ca_system_score_gemma":0.0020079145,"threshold_uncertainty_score":0.99991006},"labels":[],"label_agreement":null},{"id":"W4211077528","doi":"10.1016/j.comgeo.2004.12.001","title":"Editorial","year":2005,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Political science","score_opus":0.0077902607951852885,"score_gpt":0.28343394134916894,"score_spread":0.27564368055398364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211077528","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001399271,0.00048663895,0.00087818987,0.000033102922,0.99122477,0.00025012848,0.0034094446,0.0005575323,0.0031462212],"genre_scores_gemma":[0.000067061184,0.000010558543,0.003862505,0.000029432313,0.9770058,0.00003940842,0.015943754,0.0003307535,0.00271073],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99231976,0.00013286313,0.00074861496,0.00095617323,0.0052123847,0.0006301788],"domain_scores_gemma":[0.99305904,0.0036821743,0.00054985157,0.0004763945,0.0019616282,0.0002709403],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008278644,0.0006562962,0.00070404954,0.001165119,0.00020930424,0.00025429082,0.0009092383,0.0019660133,0.00084719347],"category_scores_gemma":[0.0036403728,0.0007391031,0.0003362151,0.001243916,0.00017173636,0.00026994897,0.00029432884,0.0021436263,0.036016624],"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.00008248657,0.00013572167,0.000005153103,0.000046779056,0.00015575382,0.000005829639,0.000019102248,0.024130268,0.0000020240905,0.00009685212,0.9743576,0.0009624223],"study_design_scores_gemma":[0.0011629805,0.000060105172,0.00003569785,0.000062537336,0.00008525649,0.0000019754152,0.0000042138267,0.0007936547,9.154754e-7,0.0021613918,0.9949014,0.0007298417],"about_ca_topic_score_codex":0.000022672775,"about_ca_topic_score_gemma":0.000005072011,"teacher_disagreement_score":0.03516943,"about_ca_system_score_codex":0.0008222084,"about_ca_system_score_gemma":0.0017547994,"threshold_uncertainty_score":0.999506},"labels":[],"label_agreement":null},{"id":"W4211098474","doi":"10.1016/j.comgeo.2007.06.002","title":"Editorial","year":2007,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University","funders":"","keywords":"Political science","score_opus":0.009724885773030918,"score_gpt":0.3008812772410711,"score_spread":0.2911563914680402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211098474","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027983711,0.00025272786,0.0040860386,0.000008706532,0.9872902,0.00025892424,0.0024700183,0.00053796964,0.005067419],"genre_scores_gemma":[0.00007329688,0.0000049025152,0.0034213802,0.000030318988,0.9787504,0.000018877558,0.015964014,0.000330177,0.0014066265],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9900733,0.0001070801,0.00082065276,0.00094771956,0.0073097325,0.0007414856],"domain_scores_gemma":[0.98904216,0.006486931,0.00058140355,0.00046526646,0.003114515,0.0003097096],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.001973257,0.0006511329,0.0006956599,0.0017582788,0.00021333227,0.00021779558,0.00086307904,0.0023207997,0.00060237275],"category_scores_gemma":[0.0058136075,0.00073452137,0.00033229863,0.0018088184,0.00021161391,0.00020196418,0.0002890288,0.0028081697,0.024805143],"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.00013958158,0.00012308762,0.0000070906995,0.00006888854,0.0001610961,0.000018314706,0.00002452757,0.0060928976,0.000002020516,0.00012649361,0.99265486,0.0005811187],"study_design_scores_gemma":[0.0010318543,0.00007431885,0.00007630836,0.00006796328,0.000077246164,0.0000022615034,0.000009948313,0.00026630925,0.00000184494,0.0032244464,0.9944436,0.0007238946],"about_ca_topic_score_codex":0.000043582288,"about_ca_topic_score_gemma":0.000004233121,"teacher_disagreement_score":0.02420277,"about_ca_system_score_codex":0.0007713996,"about_ca_system_score_gemma":0.0016867826,"threshold_uncertainty_score":0.9995106},"labels":[],"label_agreement":null},{"id":"W4226118606","doi":"10.1016/j.comgeo.2022.101881","title":"On the spanning and routing ratios of the directed Θ6-graph","year":2022,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Windsor","funders":"","keywords":"Combinatorics; Computer science; Spanning tree; Mathematics","score_opus":0.014729963671572522,"score_gpt":0.22568190341607905,"score_spread":0.21095193974450652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226118606","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.64102703,0.00020762549,0.35350773,0.0035912856,0.00060187624,0.0002721833,0.000012972765,0.00008304734,0.0006962559],"genre_scores_gemma":[0.9925364,0.0000010947105,0.0060843597,0.0011380353,0.000050487684,0.000026064006,0.000012909556,0.000006038908,0.00014455762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984405,0.00024809144,0.0002530752,0.0002657639,0.0006520692,0.0001404799],"domain_scores_gemma":[0.99794215,0.0014567258,0.00019147816,0.0002460315,0.00013035112,0.000033282653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006119213,0.00010630697,0.00010792441,0.00021084177,0.00093320746,0.00008222576,0.0005591274,0.00001841454,0.00004963555],"category_scores_gemma":[0.00026995625,0.00007474482,0.00007233137,0.0019324858,0.0000641486,0.00012340338,0.0005358873,0.00021929485,0.0000031339187],"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.0000058989913,0.000046680583,0.001002083,0.000004605146,0.00002267377,8.880057e-7,0.00045019877,0.6220608,0.00018145354,0.37037784,0.0012614608,0.0045854794],"study_design_scores_gemma":[0.00033277393,0.00009823577,0.08541923,0.000017283997,0.000008952783,0.000035910536,0.00014897456,0.80788857,0.00047949073,0.10460027,0.0008027431,0.00016756097],"about_ca_topic_score_codex":0.000006141394,"about_ca_topic_score_gemma":5.8887787e-7,"teacher_disagreement_score":0.35150942,"about_ca_system_score_codex":0.00003859943,"about_ca_system_score_gemma":0.000107679385,"threshold_uncertainty_score":0.71775717},"labels":[],"label_agreement":null},{"id":"W4233479398","doi":"10.1016/j.comgeo.2013.08.004","title":"Editorial","year":2013,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Political science","score_opus":0.007911007244067174,"score_gpt":0.2715486134820179,"score_spread":0.26363760623795074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233479398","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031230884,0.0002961456,0.0008844215,0.000021509471,0.992574,0.00038383596,0.0021883408,0.0005219144,0.0030986085],"genre_scores_gemma":[0.000060671035,0.0000063496054,0.0025869065,0.000023883727,0.97766453,0.0000959462,0.015786974,0.0003321004,0.0034426232],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99263686,0.0001466524,0.00072099443,0.0009379016,0.00492526,0.0006323375],"domain_scores_gemma":[0.9916169,0.0041267583,0.0005755006,0.00050699856,0.0028768338,0.00029701964],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006374324,0.0006583257,0.0007180057,0.0010778263,0.00020083264,0.00038648225,0.0009427521,0.001992436,0.002072638],"category_scores_gemma":[0.004236487,0.0007026559,0.00029021513,0.0011689838,0.00018758353,0.00033117,0.00034393393,0.002020918,0.09336275],"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.00003637226,0.000100697325,0.0000065432664,0.00007088086,0.00016661866,0.0000040095374,0.000016364393,0.0058529596,0.0000035548467,0.0001703892,0.99320513,0.00036645707],"study_design_scores_gemma":[0.0009277675,0.000066973,0.000047853566,0.00006495473,0.00006880258,0.0000013426176,0.0000056269755,0.0008578707,8.963319e-7,0.0073293857,0.9899189,0.0007096308],"about_ca_topic_score_codex":0.00008664409,"about_ca_topic_score_gemma":0.000001785375,"teacher_disagreement_score":0.09129011,"about_ca_system_score_codex":0.0005676052,"about_ca_system_score_gemma":0.0014536446,"threshold_uncertainty_score":0.9995425},"labels":[],"label_agreement":null},{"id":"W4238393073","doi":"10.1016/j.comgeo.2016.08.005","title":"Guest Editor's foreword","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Posthumanist Ethics and Activism","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science","score_opus":0.02744371421637009,"score_gpt":0.32399872652709827,"score_spread":0.29655501231072817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238393073","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.37959558,0.00046125508,0.14262006,0.07466155,0.050552808,0.00064501463,0.00014768378,0.00078882667,0.35052723],"genre_scores_gemma":[0.9860619,0.000012798806,0.00065139,0.00035315336,0.010181558,0.0000040609043,0.0000052665223,0.0000067352667,0.0027231732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912214,0.000049463593,0.000094783085,0.00013575742,0.0004146793,0.0001831933],"domain_scores_gemma":[0.9990412,0.00061766343,0.000047565307,0.000065780325,0.00014268393,0.000085116124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041389192,0.000054483986,0.00006468587,0.00008439344,0.00037286355,0.00005191227,0.00016673701,0.00006904718,0.0003516918],"category_scores_gemma":[0.0002949357,0.000040501964,0.000040715313,0.00019802821,0.00023282021,0.00017244896,0.00003367345,0.000067505774,0.00037274323],"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.000007881747,0.000076528144,0.0043566776,0.000005197175,0.00002341504,0.0000046456526,0.0011827816,0.000041644602,0.000079211495,0.8700698,0.098093554,0.026058655],"study_design_scores_gemma":[0.00017967413,0.000018331095,0.012753532,0.000020159256,0.000002810574,6.01926e-7,0.00012517122,0.00002164191,0.000023438053,0.20713547,0.7796068,0.0001123273],"about_ca_topic_score_codex":0.00006369648,"about_ca_topic_score_gemma":0.000038653045,"teacher_disagreement_score":0.6815133,"about_ca_system_score_codex":0.00006552842,"about_ca_system_score_gemma":0.0001491253,"threshold_uncertainty_score":0.47909847},"labels":[],"label_agreement":null},{"id":"W4280652037","doi":"10.1016/j.comgeo.2022.101897","title":"An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures","year":2022,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shortest path problem; Combinatorics; Euclidean shortest path; Mathematics; Convexity; Generalization; Upper and lower bounds; Euclidean geometry; Path (computing); K shortest path routing; Computer science; Geometry; Graph; Mathematical analysis","score_opus":0.01410959408346892,"score_gpt":0.27390265288713267,"score_spread":0.25979305880366377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280652037","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.8659992,0.000059232694,0.13207237,0.0006025216,0.0006413738,0.0002923068,0.00008140582,0.000037490576,0.00021406279],"genre_scores_gemma":[0.960683,3.2428505e-7,0.03738808,0.0014022833,0.00010971448,0.000060403705,0.00021094887,0.000013725388,0.00013152805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979013,0.000156758,0.00041905593,0.00046629095,0.00079593423,0.00026064544],"domain_scores_gemma":[0.9982045,0.0009945468,0.00019539159,0.000298239,0.00023341422,0.00007386631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059107074,0.0001793221,0.00018947624,0.0003514198,0.00058386655,0.00015205282,0.00068173034,0.000045941862,0.0002534195],"category_scores_gemma":[0.00004556228,0.00015677241,0.00011004727,0.0013287452,0.00008573195,0.00029477716,0.00020157128,0.00023061525,0.000008197076],"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.00011436353,0.0006310538,0.0019934129,0.000013332786,0.000019816454,0.000008731045,0.00037702193,0.8094845,0.0015789808,0.17984504,0.001842073,0.0040916735],"study_design_scores_gemma":[0.0008772597,0.0003568375,0.04816741,0.000007893116,0.0000065234667,0.00002780492,0.0000576801,0.7494337,0.0013034343,0.1985073,0.0009768446,0.0002773213],"about_ca_topic_score_codex":0.000015689813,"about_ca_topic_score_gemma":0.0000018380518,"teacher_disagreement_score":0.094684295,"about_ca_system_score_codex":0.00009920327,"about_ca_system_score_gemma":0.00030744562,"threshold_uncertainty_score":0.63929933},"labels":[],"label_agreement":null},{"id":"W4304127965","doi":"10.1016/j.comgeo.2022.101948","title":"On path-greedy geometric spanners","year":2022,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Spanner; Planarity testing; Path (computing); Path graph; Shortest path problem; Line segment; Greedy algorithm; Distance; Graph; Discrete mathematics; Computer science; Algorithm; Line graph; Geometry; Graph power","score_opus":0.014211617992623942,"score_gpt":0.23649283017849868,"score_spread":0.22228121218587474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304127965","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.10725432,0.00033559737,0.88576007,0.0013474087,0.0015854472,0.00024402727,0.00003863223,0.00029820472,0.0031362742],"genre_scores_gemma":[0.9619417,0.0000033169174,0.03385334,0.0027601938,0.00016182916,0.000078489255,0.00021361587,0.00001880499,0.000968677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687976,0.00018181185,0.00039330733,0.0006912832,0.0014690498,0.000384816],"domain_scores_gemma":[0.9982134,0.0008139435,0.00018563555,0.0004191396,0.0001989659,0.00016891769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006753884,0.00023172781,0.00021271399,0.001865448,0.0008676472,0.0001776256,0.001045731,0.000042915133,0.0005175326],"category_scores_gemma":[0.0001804682,0.00026204926,0.00015141556,0.005946114,0.00003753035,0.00036040763,0.00065090606,0.0003773693,0.00031304715],"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.000014217634,0.00020970817,0.0001491112,0.000005634346,0.000025916985,0.00002596215,0.000082222614,0.76693,0.000020655714,0.1917247,0.014254405,0.026557447],"study_design_scores_gemma":[0.0014432045,0.00091698865,0.022634571,0.00000946849,0.000013350289,0.00020890792,0.000079393154,0.77500594,0.00011841914,0.15356849,0.045214746,0.0007865236],"about_ca_topic_score_codex":0.0000068360237,"about_ca_topic_score_gemma":2.5456328e-7,"teacher_disagreement_score":0.8546874,"about_ca_system_score_codex":0.00025555587,"about_ca_system_score_gemma":0.00023117707,"threshold_uncertainty_score":0.9999832},"labels":[],"label_agreement":null},{"id":"W4376118022","doi":"10.1016/j.comgeo.2023.102011","title":"Simple linear time algorithms for piercing pairwise intersecting disks","year":2023,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Metal Forming Simulation Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairwise comparison; Simple (philosophy); Combinatorics; Set (abstract data type); Mathematics; Algorithm; RADIUS; Point (geometry); Plane (geometry); Unit (ring theory); Computer science; Geometry; Statistics","score_opus":0.03213116140602747,"score_gpt":0.30558975604374256,"score_spread":0.2734585946377151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376118022","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.47646832,0.000035303954,0.52043015,0.000021652693,0.00026925857,0.0002510494,0.00005310377,0.0021478813,0.00032327021],"genre_scores_gemma":[0.9569431,0.0000020993639,0.041908063,0.000034015888,0.00021120554,0.000038882925,0.00047702904,0.00005371281,0.00033191754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991663,0.000010423393,0.0002616207,0.00016190547,0.00017842157,0.00022131873],"domain_scores_gemma":[0.9991871,0.0005318638,0.00003559811,0.000102709266,0.000086310574,0.00005637685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031537618,0.00012466786,0.00015057511,0.00039547516,0.00010795598,0.00003197637,0.00011346221,0.0000610913,0.00006731881],"category_scores_gemma":[0.00019049099,0.0001385484,0.00008994983,0.0006977019,0.000016336355,0.00014189862,0.000046278215,0.0001016614,0.0002341846],"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.00000470781,0.000009441635,0.00035455922,0.00011041033,0.000048168095,0.0000023917787,0.00020486604,0.9440674,0.00078926625,0.00048589706,0.0045751976,0.04934766],"study_design_scores_gemma":[0.00017433487,0.000024498207,0.0013932205,0.000021854457,0.0000073021547,0.000002242364,0.00003937354,0.98130625,0.0010798699,0.013251395,0.0025309902,0.00016866668],"about_ca_topic_score_codex":0.0000023229854,"about_ca_topic_score_gemma":2.386997e-7,"teacher_disagreement_score":0.48047474,"about_ca_system_score_codex":0.000061909486,"about_ca_system_score_gemma":0.000011218932,"threshold_uncertainty_score":0.56498396},"labels":[],"label_agreement":null},{"id":"W4382404770","doi":"10.1016/j.comgeo.2023.102035","title":"Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG)","year":2023,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"3D Modeling in Geospatial Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Geometry; Computer science; Mathematics","score_opus":0.018482199184813492,"score_gpt":0.2555176904222433,"score_spread":0.2370354912374298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382404770","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012817046,0.000036035995,0.003939726,0.0010444585,0.9822958,0.00065464724,0.0040764036,0.0006671812,0.0071575376],"genre_scores_gemma":[0.002341702,0.00004150292,0.0009537456,0.00019797018,0.98540306,0.00022707808,0.009848664,0.0002656756,0.00072058255],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946685,0.000093867515,0.0008424108,0.0008866125,0.0026700685,0.00083856005],"domain_scores_gemma":[0.9906799,0.0067763324,0.00021781186,0.0006791514,0.0011829642,0.00046384742],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00064683735,0.000788451,0.0006322169,0.001355373,0.0005925582,0.00040297088,0.0012505807,0.0011895762,0.0006847363],"category_scores_gemma":[0.0015341528,0.00077338703,0.0002326423,0.0016684746,0.00018927663,0.00010430689,0.0001290623,0.0023990101,0.008276039],"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.000007807615,0.000025754794,0.00000182201,0.00003737248,0.000091386944,0.000005357108,0.000039494087,0.46287453,3.310771e-7,0.0017479043,0.534851,0.00031723734],"study_design_scores_gemma":[0.00032564718,0.00008200726,0.0001456735,0.00017319972,0.000044824304,9.719149e-7,0.000026130869,0.100065656,0.0000024029068,0.008859176,0.88957983,0.00069447485],"about_ca_topic_score_codex":0.0031207332,"about_ca_topic_score_gemma":0.0029114569,"teacher_disagreement_score":0.36280888,"about_ca_system_score_codex":0.0010373765,"about_ca_system_score_gemma":0.0013451905,"threshold_uncertainty_score":0.9999025},"labels":[],"label_agreement":null},{"id":"W4396609193","doi":"10.1016/j.comgeo.2024.102103","title":"Distance queries over dynamic interval graphs","year":2024,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interval (graph theory); Interval graph; Computer science; Combinatorics; Mathematics; Chordal graph; Theoretical computer science; Graph; 1-planar graph","score_opus":0.012364742372267706,"score_gpt":0.3126870457532805,"score_spread":0.3003223033810128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396609193","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.036927216,0.0023830184,0.9581202,0.0005683286,0.000696807,0.00009659751,0.000017262884,0.00041760548,0.0007729107],"genre_scores_gemma":[0.95668674,0.000017569893,0.042251844,0.00017071652,0.000031792275,0.000016547301,0.000022479813,0.000016844566,0.0007854639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840236,0.00006309233,0.00021305229,0.00049568544,0.0005243388,0.00030148058],"domain_scores_gemma":[0.9989161,0.0005411361,0.000030349605,0.00031194187,0.00010148049,0.00009898024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028234604,0.00014949743,0.00013650766,0.00056013005,0.00012620522,0.00036289482,0.0007558468,0.00004244081,0.00008117053],"category_scores_gemma":[0.000064896994,0.00014204637,0.00011867351,0.002031599,0.00018353156,0.00083233416,0.00033411378,0.00025545032,0.00021277394],"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.000007966798,0.000025980935,0.00039610374,0.000056183257,0.000037055182,0.00006206285,0.0001603654,0.007099886,0.00005790952,0.9558847,0.0007053263,0.035506442],"study_design_scores_gemma":[0.00008428898,0.000036010948,0.0072450265,0.000048132235,0.0000018922782,0.00002689343,0.000013462944,0.35183284,0.000023978686,0.63564146,0.004898395,0.00014760467],"about_ca_topic_score_codex":0.0000025796924,"about_ca_topic_score_gemma":0.0000028346212,"teacher_disagreement_score":0.9197595,"about_ca_system_score_codex":0.000086445456,"about_ca_system_score_gemma":0.00009610354,"threshold_uncertainty_score":0.57924825},"labels":[],"label_agreement":null},{"id":"W4399999583","doi":"10.1016/j.comgeo.2024.102120","title":"Online class cover problem","year":2024,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada; Human Resource Development Group; Council of Scientific and Industrial Research, India","keywords":"Cover (algebra); Class (philosophy); Computer science; Artificial intelligence; Engineering","score_opus":0.02232847278315972,"score_gpt":0.29096735695886516,"score_spread":0.2686388841757055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399999583","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.0008681122,0.00034697875,0.98513407,0.003974225,0.0003866063,0.0001292512,0.000018328547,0.00044376552,0.008698683],"genre_scores_gemma":[0.40367234,0.000034768003,0.5828684,0.0022707614,0.0002282798,0.000018041588,0.00021979911,0.000024926021,0.010662673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987786,0.000041715157,0.00020208376,0.00035448343,0.00042150303,0.00020161773],"domain_scores_gemma":[0.9993096,0.00024188093,0.000024350033,0.00017767954,0.00014557019,0.00010094103],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002336659,0.000100522055,0.00009312931,0.0003486518,0.00008370186,0.0004327637,0.00043260044,0.0000465153,0.00035591354],"category_scores_gemma":[0.000030321213,0.00009284722,0.00005980198,0.0013532615,0.0000369057,0.00050867954,0.00018994253,0.00016985377,0.0017286263],"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.0000012962327,0.00011324491,0.000080131234,0.00006253151,0.00003241809,0.000026613421,0.00015571494,0.5298159,0.0000146901975,0.40150198,0.033181306,0.035014156],"study_design_scores_gemma":[0.000116124094,0.000024174034,0.0006745383,0.000029337862,0.0000018806202,0.000021397986,0.0000043155974,0.8800277,0.0000068105987,0.035992913,0.08299014,0.00011064773],"about_ca_topic_score_codex":0.0000022480324,"about_ca_topic_score_gemma":3.7502062e-7,"teacher_disagreement_score":0.40280423,"about_ca_system_score_codex":0.000051797597,"about_ca_system_score_gemma":0.0001983316,"threshold_uncertainty_score":0.99904865},"labels":[],"label_agreement":null},{"id":"W4400453024","doi":"10.1016/j.comgeo.2024.102121","title":"Routing on heavy path WSPD spanners","year":2024,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Routing (electronic design automation); Path (computing); Computer science; Computer network; Business; Distributed computing","score_opus":0.01706455049105644,"score_gpt":0.26645605779187354,"score_spread":0.2493915073008171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400453024","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.03180656,0.0007022273,0.9584106,0.0024204522,0.001985807,0.00014970786,0.000012487366,0.0006064662,0.0039056994],"genre_scores_gemma":[0.94699943,0.000007904694,0.05033119,0.0012393207,0.0005057501,0.000014999345,0.00009821986,0.000018407976,0.00078479457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979067,0.00007213627,0.00033908754,0.0006564682,0.000707862,0.0003177555],"domain_scores_gemma":[0.9986902,0.00069307105,0.000058419515,0.00026222534,0.00015424268,0.00014186514],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047067148,0.0002149861,0.00016425783,0.0007019934,0.00024134624,0.00058557047,0.00046668565,0.00007457064,0.00006200123],"category_scores_gemma":[0.00010617774,0.00021061549,0.00013516069,0.002128342,0.000035835903,0.0005626723,0.00015749183,0.00025347786,0.00083338644],"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.0000066048046,0.00006167013,0.000058674632,0.000028037126,0.000037924823,0.000047547728,0.00017266966,0.39576834,0.00005213501,0.51000345,0.0071589095,0.08660402],"study_design_scores_gemma":[0.00019339098,0.00013119717,0.003706884,0.0000904415,0.0000068864483,0.00006350383,0.000018039818,0.93202114,0.000247727,0.04778227,0.015442663,0.00029583834],"about_ca_topic_score_codex":0.000004415343,"about_ca_topic_score_gemma":3.8381768e-7,"teacher_disagreement_score":0.91519284,"about_ca_system_score_codex":0.00012208178,"about_ca_system_score_gemma":0.00023768135,"threshold_uncertainty_score":0.99994457},"labels":[],"label_agreement":null},{"id":"W4403096939","doi":"10.1016/j.comgeo.2024.102147","title":"Computing Euclidean distance and maximum likelihood retraction maps for constrained optimization","year":2024,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fields Institute for Research in Mathematical Sciences","keywords":"Euclidean distance; Maximum likelihood; Euclidean geometry; Computer science; Mathematical optimization; Constrained optimization problem; Mathematics; Combinatorics; Algorithm; Optimization problem; Artificial intelligence; Statistics; Geometry","score_opus":0.007015648072327307,"score_gpt":0.25176641300134794,"score_spread":0.24475076492902065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403096939","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.0025420126,0.00091908337,0.99477834,0.0001325153,0.00021235387,0.00015591182,0.000049676975,0.000859536,0.00035054993],"genre_scores_gemma":[0.67365104,0.0000295808,0.32593057,0.000035535897,0.00010183042,0.000009018314,0.0002025444,0.000025225074,0.000014643834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992387,0.00000992318,0.0002369879,0.00022049864,0.00013475388,0.000159099],"domain_scores_gemma":[0.9994431,0.0003358873,0.00002889415,0.00006104636,0.00007452293,0.000056543962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013383938,0.00012536276,0.00014580227,0.00021036627,0.000075633514,0.00008820625,0.000051585306,0.000065910324,0.000016826245],"category_scores_gemma":[0.000051664898,0.0001344533,0.000055258868,0.0005268563,0.000043632088,0.00019018188,0.000017345968,0.00013730886,0.000004813359],"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.000003991075,0.000008098842,0.00006177299,0.00014713686,0.000044743312,0.0000023942246,0.000024716672,0.9199537,0.00008844341,0.0024987832,0.00067770435,0.07648852],"study_design_scores_gemma":[0.0001059448,0.000022502032,0.00017865418,0.00005781818,0.000021756272,0.000012203413,0.000022267852,0.9544431,0.00011259642,0.0423896,0.0024851747,0.0001483774],"about_ca_topic_score_codex":8.086408e-7,"about_ca_topic_score_gemma":3.4798848e-7,"teacher_disagreement_score":0.6711091,"about_ca_system_score_codex":0.00007410072,"about_ca_system_score_gemma":0.000011966156,"threshold_uncertainty_score":0.5482846},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W4407694635","doi":"10.1016/j.comgeo.2025.102172","title":"Approximating average bounded-angle minimum spanning trees","year":2025,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Minimum spanning tree; Mathematics; Spanning tree; Combinatorics; Mathematical analysis","score_opus":0.014400568408841604,"score_gpt":0.2617562545055416,"score_spread":0.24735568609669997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407694635","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.0095349355,0.0001933945,0.9718748,0.00076392834,0.0005352147,0.00011753279,0.000006167238,0.00022773874,0.016746286],"genre_scores_gemma":[0.51572716,0.0000025710933,0.47899908,0.0010829716,0.00010668511,0.000014880591,0.00009728718,0.00000834136,0.0039610174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987035,0.000033991724,0.00028072778,0.00040102334,0.00032885012,0.00025190017],"domain_scores_gemma":[0.9992222,0.00024149862,0.00009279338,0.00031882987,0.000077137534,0.000047512753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032451304,0.00013610364,0.00015429892,0.00046484557,0.00024933755,0.000538778,0.00087849,0.000035954454,0.000026540412],"category_scores_gemma":[0.00008579709,0.00014156302,0.00006568689,0.0013063557,0.000040156454,0.0007377812,0.0006755563,0.00011352298,0.00009420637],"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.000004866914,0.0001832353,0.002973994,0.00009973883,0.00013701405,0.00003489659,0.00030731328,0.06071165,0.000041584095,0.61902803,0.017690513,0.29878718],"study_design_scores_gemma":[0.00035402985,0.00001888641,0.010169134,0.00004717586,0.0000070525307,0.000002915219,0.00004248523,0.90255517,0.00004734696,0.07818023,0.008398482,0.00017707533],"about_ca_topic_score_codex":0.0000058767937,"about_ca_topic_score_gemma":7.1400865e-7,"teacher_disagreement_score":0.84184355,"about_ca_system_score_codex":0.000042043353,"about_ca_system_score_gemma":0.00006065303,"threshold_uncertainty_score":0.57727724},"labels":[],"label_agreement":null},{"id":"W4408961034","doi":"10.1016/j.comgeo.2025.102192","title":"Bounds on the edge-length ratio of 2-outerplanar graphs","year":2025,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Ministero dell'Università e della Ricerca; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Outerplanar graph; Pathwidth; Computer science; Graph; Telecommunications; Line graph","score_opus":0.017873185146532328,"score_gpt":0.29802974953785755,"score_spread":0.2801565643913252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408961034","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.060958546,0.00021756401,0.9293683,0.0036399374,0.00035093472,0.00020645808,0.0000109269295,0.000072681294,0.0051746494],"genre_scores_gemma":[0.98361087,0.0000064628443,0.01473485,0.0010777632,0.000020705571,0.000017695855,0.000009800045,0.000005592211,0.0005162371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985968,0.00014140438,0.00024935437,0.00030315938,0.0004937584,0.00021551446],"domain_scores_gemma":[0.99732083,0.0018082923,0.000083788604,0.0005045273,0.00023698292,0.000045571916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005397962,0.000118229706,0.00014706349,0.00062198244,0.00020673324,0.000088250665,0.0011475483,0.00004161217,0.000029471672],"category_scores_gemma":[0.00022620706,0.00008876863,0.00009337062,0.0023051617,0.00020235345,0.00018391825,0.00024004703,0.00021129573,0.000047555375],"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.000014383862,0.00006303303,0.00079203723,0.000013658442,0.000042505537,0.0000024733886,0.000114172144,0.013477266,0.00006255554,0.974283,0.002314137,0.0088208085],"study_design_scores_gemma":[0.00028205884,0.00009136728,0.01641162,0.00004030289,0.0000038016194,0.000003465349,0.000049972616,0.0638394,0.0010057401,0.9163829,0.0017748916,0.00011449281],"about_ca_topic_score_codex":0.0000023089506,"about_ca_topic_score_gemma":5.703401e-7,"teacher_disagreement_score":0.92265236,"about_ca_system_score_codex":0.000033492248,"about_ca_system_score_gemma":0.00014953919,"threshold_uncertainty_score":0.36198798},"labels":[],"label_agreement":null},{"id":"W4411341154","doi":"10.1016/j.comgeo.2025.102209","title":"Piercing unit geodesic disks","year":2025,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geodesic; Unit (ring theory); Mathematics; Computer science; Geology; Geometry","score_opus":0.01698410397826499,"score_gpt":0.2830171587380699,"score_spread":0.2660330547598049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411341154","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.050910868,0.00046965675,0.93894863,0.0014662759,0.00085046154,0.0001463147,0.000003410342,0.00024366245,0.006960744],"genre_scores_gemma":[0.8843668,0.000006908482,0.111860335,0.0014480958,0.000098454184,0.000018102053,0.000073911186,0.0000073765273,0.002120028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838966,0.000078110934,0.00035225303,0.00047936017,0.00042044648,0.0002801958],"domain_scores_gemma":[0.99865943,0.00051363395,0.00009056893,0.00032985222,0.0003125984,0.000093941424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036812157,0.00017992311,0.00018155374,0.0008731922,0.00034328003,0.00026153252,0.0006738466,0.00007459204,0.00004756911],"category_scores_gemma":[0.00013641604,0.00019257182,0.00009685704,0.0029816516,0.000047900558,0.0005237497,0.0002968421,0.00017710468,0.00015313293],"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.0000062336367,0.00008821863,0.001929852,0.000027264156,0.00004826761,0.0000067166416,0.000065465865,0.332745,0.00011637901,0.55016494,0.003366296,0.1114354],"study_design_scores_gemma":[0.00056622695,0.000037726637,0.084678575,0.00004425145,0.00001328587,0.000017056382,0.00001695485,0.7012178,0.00043889545,0.19873677,0.013941714,0.00029079642],"about_ca_topic_score_codex":0.000008327408,"about_ca_topic_score_gemma":0.0000013808924,"teacher_disagreement_score":0.8334559,"about_ca_system_score_codex":0.000070938295,"about_ca_system_score_gemma":0.00029476022,"threshold_uncertainty_score":0.7852851},"labels":[],"label_agreement":null},{"id":"W4414121634","doi":"10.1016/j.comgeo.2025.102227","title":"On the structure of extremal point-line arrangements","year":2025,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Nemzeti Kutatási és Technológiai Hivatal; National Science Foundation","keywords":"Polynomial; Rigidity (electromagnetism); Existential quantification; Fraction (chemistry); Complement (music)","score_opus":0.014000167227193243,"score_gpt":0.26047994011055775,"score_spread":0.2464797728833645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414121634","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.19678414,0.0001330414,0.7983251,0.0026432402,0.0005400084,0.00016677911,0.000016793201,0.000043717388,0.0013471515],"genre_scores_gemma":[0.97663015,0.0000018635864,0.020899998,0.001944452,0.00006135167,0.00000331652,0.000043195912,0.0000042842316,0.0004113755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869895,0.00007979201,0.00031098537,0.00029532294,0.000463665,0.00015127995],"domain_scores_gemma":[0.99838793,0.0008593996,0.00012730018,0.00030932794,0.00028025912,0.000035774658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022540482,0.00013467036,0.00014552622,0.00044579443,0.00017179632,0.00007304119,0.00060864224,0.000048111902,0.00012105573],"category_scores_gemma":[0.00019860466,0.000102269805,0.000080500045,0.0017051335,0.000052065705,0.00017457444,0.0001719642,0.00013720324,0.000022050972],"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.000013702186,0.00007755055,0.00018247335,0.000017765798,0.000050864703,0.0000011662263,0.000054721186,0.2865214,0.0009751648,0.6948108,0.00476229,0.012532123],"study_design_scores_gemma":[0.0006418338,0.00011634954,0.018788042,0.00006282321,0.000013678278,0.000006100625,0.000022938964,0.35085356,0.0072442167,0.6207612,0.0013053701,0.00018384958],"about_ca_topic_score_codex":0.0000024439605,"about_ca_topic_score_gemma":0.0000010649894,"teacher_disagreement_score":0.779846,"about_ca_system_score_codex":0.000035948608,"about_ca_system_score_gemma":0.00012569242,"threshold_uncertainty_score":0.41704416},"labels":[],"label_agreement":null},{"id":"W4414498470","doi":"10.1016/j.comgeo.2025.102230","title":"City guarding with cameras of bounded field of view","year":2025,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Bounded function; Guard (computer science); Constructive; Regular polygon; Mathematical proof; Space (punctuation)","score_opus":0.016446833491829974,"score_gpt":0.32199638321835605,"score_spread":0.3055495497265261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414498470","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.15210557,0.0005781698,0.84416175,0.0002464511,0.00014424388,0.000059662274,0.000001871066,0.000026999547,0.0026752616],"genre_scores_gemma":[0.78069705,0.0000052829705,0.2190312,0.00022225257,0.000009729465,0.0000018451267,0.000002435453,0.0000019770746,0.000028255492],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991709,0.0000629795,0.00023836474,0.00018698601,0.00023589801,0.000104885105],"domain_scores_gemma":[0.9983597,0.0009950214,0.00012331526,0.00022388266,0.00027704515,0.000021083864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031763836,0.00007623836,0.00021865692,0.000247221,0.00004995663,0.000024556442,0.0003425033,0.00003420009,0.000010099529],"category_scores_gemma":[0.00014625142,0.0000673567,0.000057692367,0.0011617123,0.000049604147,0.00012066235,0.00010243175,0.00007921427,0.000001400469],"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.00005787591,0.00017526193,0.29320392,0.0007111291,0.00027884217,0.000009406768,0.0006829189,0.032600883,0.000273733,0.2531678,0.0006252723,0.41821295],"study_design_scores_gemma":[0.0017679806,0.0004938339,0.8250859,0.00075485965,0.00004250967,0.000019324683,0.00014216194,0.024949038,0.02251407,0.12066584,0.0031072032,0.0004573065],"about_ca_topic_score_codex":0.00002405884,"about_ca_topic_score_gemma":0.000002749302,"teacher_disagreement_score":0.6285915,"about_ca_system_score_codex":0.000015795105,"about_ca_system_score_gemma":0.00016093689,"threshold_uncertainty_score":0.27467263},"labels":[],"label_agreement":null},{"id":"W84917342","doi":"","title":"Selected papers from the 12th Annual Canadian Conference on Computational Geometry - Editorial.","year":2001,"lang":"en","type":"article","venue":"Computational Geometry","topic":"3D Modeling in Geospatial Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Geometry; Computer science; Engineering physics; Physics; Mathematics","score_opus":0.011365324898782444,"score_gpt":0.22015143516890848,"score_spread":0.20878611027012603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84917342","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.5821835,0.00044468895,0.37003464,0.0049297465,0.02199602,0.0011718208,0.0041896766,0.0014423452,0.01360758],"genre_scores_gemma":[0.98531544,0.000014637674,0.0057893666,0.0006259681,0.006187502,0.000050477684,0.001900401,0.000047642017,0.000068577065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821275,0.000035610174,0.00034377546,0.0003508854,0.00064878556,0.00040820957],"domain_scores_gemma":[0.9980349,0.00083065755,0.00005789713,0.0002588056,0.00055625447,0.00026147754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015483072,0.00025754306,0.00019642043,0.00028994484,0.0003444838,0.00011164724,0.00043647588,0.00017098356,0.0005896181],"category_scores_gemma":[0.00014303197,0.00024449496,0.000063105545,0.0013603937,0.00008632535,0.00011280095,0.00003557265,0.00044991044,0.00045700563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007108519,0.000027429689,0.0015126875,0.0000035278413,0.00007311203,0.0000029232756,0.0001412722,0.9249937,0.000022237133,0.0022288067,0.068992995,0.0019942191],"study_design_scores_gemma":[0.0005809649,0.000047967285,0.12278533,0.00003639685,0.00003201034,0.000010474757,0.00013081936,0.80159307,0.000011716997,0.015386633,0.058883272,0.00050137],"about_ca_topic_score_codex":0.006695133,"about_ca_topic_score_gemma":0.0033544358,"teacher_disagreement_score":0.40313193,"about_ca_system_score_codex":0.00027710313,"about_ca_system_score_gemma":0.00038413945,"threshold_uncertainty_score":0.99991935},"labels":[],"label_agreement":null}]}