{"meta":{"query_hash":"197df429970c","filters":{"topic":"Computational Geometry and Mesh Generation"},"cohort_total":1616,"direct_labels_cover":0,"predictions_cover":1616,"exported":1616,"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/197df429970c","api":"https://metacan.xera.ac/api/v1/cohort?topic=Computational+Geometry+and+Mesh+Generation"},"results":[{"id":"W105060927","doi":"","title":"A 3D Free-Lagrangian method to simulate three-dimensional groundwater flow and mass transport","year":2008,"lang":"en","type":"article","venue":"international conference on Modelling and simulation","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Delaunay triangulation; Voronoi diagram; Computer science; Flow (mathematics); Hydrogeology; Topology (electrical circuits); Groundwater flow; Computational science; Algorithm; Mesh generation; Mechanics; Geology; Finite element method; Aquifer; Groundwater; Geometry; Mathematics; Geotechnical engineering; Engineering; Physics","score_opus":0.06701382394367007,"score_gpt":0.29842867311552235,"score_spread":0.2314148491718523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105060927","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.14535584,0.000025047773,0.852816,0.0010408999,0.00020105437,0.00013958111,0.000009002055,0.00006161818,0.00035099336],"genre_scores_gemma":[0.70389855,0.000008802234,0.29545173,0.0003152699,0.000078190074,0.000006388088,0.000031931882,0.0000063824964,0.00020277385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858713,0.000047925107,0.00026662817,0.0004779357,0.00046102624,0.00015933409],"domain_scores_gemma":[0.9991531,0.00016612725,0.00006140909,0.00018406253,0.00031075574,0.00012456898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027633837,0.00016903157,0.00014871178,0.0002554695,0.00022148147,0.0001054609,0.00023817043,0.000073892144,0.000029973336],"category_scores_gemma":[0.0000152553885,0.00016135392,0.000040068415,0.00015366587,0.000025395913,0.00044241382,0.000055081247,0.00011875277,0.000012851899],"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.00005605943,0.00003136246,0.00019626801,0.0000033601466,0.00001887808,0.000008367502,0.00036232252,0.9724577,0.00026826683,0.012329685,0.0000069038692,0.014260837],"study_design_scores_gemma":[0.00046280192,0.000101490885,0.00078713126,0.00002724472,0.0000059927547,0.000014383579,0.0000027386757,0.97434825,0.00013790946,0.023493767,0.00042999702,0.00018828307],"about_ca_topic_score_codex":0.000049796417,"about_ca_topic_score_gemma":0.000013195781,"teacher_disagreement_score":0.55854267,"about_ca_system_score_codex":0.000029111136,"about_ca_system_score_gemma":0.00004871849,"threshold_uncertainty_score":0.65798223},"labels":[],"label_agreement":null},{"id":"W1051752637","doi":"10.1016/j.tcs.2015.07.033","title":"Efficient operations on discrete paths","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Linear space; Intersection (aeronautics); Time complexity; Convex hull; Discrete geometry; Quadtree; Jordan curve theorem; Combinatorics; Intersection graph; Graph; Data structure; Discrete mathematics; Regular polygon; Algorithm; Computer science; Geometry; Line graph","score_opus":0.018063704667419335,"score_gpt":0.2739309740895367,"score_spread":0.25586726942211735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1051752637","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.066584885,0.000013773416,0.9256225,0.0018901221,0.0010460356,0.00014301843,0.0000014529148,0.00016739381,0.004530804],"genre_scores_gemma":[0.8384652,4.014354e-7,0.16040133,0.0009117923,0.00018201252,0.000007766456,0.0000018199191,0.000004082417,0.00002560226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976985,0.000105875835,0.00021977568,0.00061848166,0.0009813438,0.0003760561],"domain_scores_gemma":[0.99845713,0.00012764435,0.000027955362,0.0006165391,0.00034349563,0.00042726094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001386469,0.00014751378,0.00012546452,0.00023416609,0.00041924592,0.0005445132,0.0013469375,0.000032222695,0.000013876389],"category_scores_gemma":[0.00016931671,0.000116724674,0.000045716963,0.0014107388,0.0007467245,0.00027163152,0.00056592573,0.00013430277,0.00029125687],"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.0000034826555,0.000047486086,0.000002630929,6.142227e-7,0.0000010367239,0.00000397943,0.00026078068,0.27355322,0.00014135594,0.71568066,0.00007931576,0.0102253985],"study_design_scores_gemma":[0.00021689727,0.0003001456,0.00021158584,0.000009432175,0.0000016816437,0.000020714107,0.0000051677707,0.950102,0.0024346889,0.046300486,0.00023425874,0.0001629952],"about_ca_topic_score_codex":0.000001920101,"about_ca_topic_score_gemma":3.0437164e-7,"teacher_disagreement_score":0.7718803,"about_ca_system_score_codex":0.00009155711,"about_ca_system_score_gemma":0.00029303713,"threshold_uncertainty_score":0.5250754},"labels":[],"label_agreement":null},{"id":"W106774954","doi":"","title":"k-star-shaped polygons.","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on 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 British Columbia","funders":"","keywords":"Star (game theory); Computer science; Astronomy; Physics; Astrophysics","score_opus":0.021260620510737852,"score_gpt":0.2466922709916981,"score_spread":0.22543165048096026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W106774954","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.25817558,0.00006452099,0.6825866,0.017289886,0.0040440094,0.00050086045,0.00012559365,0.00039943613,0.036813494],"genre_scores_gemma":[0.94583863,0.0000023706505,0.049408924,0.003594509,0.00025413994,0.000018919121,0.00013949828,0.000013753099,0.00072926853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799716,0.00005383774,0.00030972232,0.00060305174,0.0005377712,0.00049842376],"domain_scores_gemma":[0.9979501,0.00025275917,0.00009843809,0.0004503739,0.0004960911,0.00075224653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003124902,0.00024351176,0.00018922787,0.0011200374,0.00040420648,0.00044274743,0.00091038574,0.00014783852,0.0007995607],"category_scores_gemma":[0.00017454947,0.00026650558,0.00008800984,0.0013398158,0.0000820215,0.00044128674,0.00007609944,0.0004826996,0.0006711091],"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.0000048797874,0.00004834027,0.00027523065,0.000005510535,0.000021789852,0.00003179682,0.00008882747,0.005802536,0.00087594084,0.9492685,0.0031653694,0.040411234],"study_design_scores_gemma":[0.0006361333,0.00015580063,0.04181235,0.000020216277,0.000007661382,0.00010257884,0.000026417903,0.79591775,0.00023889042,0.11305383,0.047307387,0.00072097214],"about_ca_topic_score_codex":0.0018582375,"about_ca_topic_score_gemma":0.009905346,"teacher_disagreement_score":0.8362147,"about_ca_system_score_codex":0.00010505836,"about_ca_system_score_gemma":0.0020496747,"threshold_uncertainty_score":0.9999787},"labels":[],"label_agreement":null},{"id":"W10847438","doi":"10.46298/dmtcs.3433","title":"Minor-monotone crossing number","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Minor (academic); Combinatorics; Monotone polygon; Crossing number (knot theory); Graph; Graph minor; Discrete mathematics; Line graph; Voltage graph; Geometry; Geography","score_opus":0.013274412245565321,"score_gpt":0.28282787796421127,"score_spread":0.26955346571864597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10847438","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.04020739,0.000029751001,0.9494058,0.0013139352,0.00037046452,0.00018648685,0.0000017389842,0.00022059181,0.008263865],"genre_scores_gemma":[0.5293097,9.014068e-7,0.46993178,0.0005055004,0.00019752949,0.000006515888,0.0000012622266,0.0000070708406,0.00003973472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711293,0.000058540685,0.00048699608,0.00072628143,0.0010040861,0.0006111717],"domain_scores_gemma":[0.9981653,0.000280368,0.00013500742,0.0008417351,0.00027081702,0.00030674116],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013517801,0.00025290795,0.00025300603,0.00017660572,0.00090396195,0.0019109265,0.0019108759,0.00006132299,0.00014378526],"category_scores_gemma":[0.00011384789,0.00021309438,0.00011133395,0.0013195268,0.0016909759,0.0013170041,0.0009040954,0.00018599999,0.00050072564],"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.0000018661622,0.00009145149,0.000023036158,0.000012239483,0.0000050989474,0.0000039953884,0.0012598614,0.0014807144,0.0006314737,0.9720851,0.000102912694,0.02430226],"study_design_scores_gemma":[0.00017229299,0.00003918131,0.00014725223,0.000029433533,0.000005613063,0.00007999376,0.000010567654,0.7957452,0.0048175026,0.19786067,0.00083115464,0.00026111823],"about_ca_topic_score_codex":0.0000010552359,"about_ca_topic_score_gemma":6.157539e-7,"teacher_disagreement_score":0.7942645,"about_ca_system_score_codex":0.00007465031,"about_ca_system_score_gemma":0.0001942039,"threshold_uncertainty_score":0.9991252},"labels":[],"label_agreement":null},{"id":"W108520386","doi":"","title":"Bi-Chromatic Minimum Spanning Trees","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Spanning tree; Combinatorics; Mathematics; Minimum spanning tree; Minimum degree spanning tree; Planar; Disjoint sets; Planar graph; Connected dominating set; Chromatic scale; Greedy algorithm; Discrete mathematics; Graph; Algorithm; Computer science","score_opus":0.01719207396910605,"score_gpt":0.2509931357309643,"score_spread":0.23380106176185828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108520386","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.07747136,0.00009379852,0.9092127,0.0025890425,0.0001535158,0.000048006004,1.5014444e-7,0.00015549864,0.010275896],"genre_scores_gemma":[0.74748963,0.0000018479701,0.24890254,0.0006112593,0.00016497538,0.0000033400797,0.0000018229363,0.000002096331,0.0028224953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941933,0.000018010447,0.00012785595,0.00016095953,0.00015716105,0.00011670651],"domain_scores_gemma":[0.99966294,0.0000595825,0.000028948754,0.00016711939,0.00003433786,0.000047090372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114632814,0.000060216997,0.00005971842,0.0000972873,0.00007633782,0.00010227089,0.000233225,0.000019049716,0.000080157704],"category_scores_gemma":[0.000018422188,0.000052929063,0.000029607887,0.00029313882,0.000008144872,0.00043834207,0.00006434167,0.000030938063,0.00030319506],"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.0000022572433,0.00012679178,0.00020099676,0.000009318864,0.00002029608,0.0000059579124,0.0010182363,0.056107152,0.012628322,0.20225242,0.018779283,0.70884895],"study_design_scores_gemma":[0.0001719024,0.000034753095,0.0035770864,0.000006262302,0.0000020874606,0.00001596418,0.000012927689,0.9621085,0.008836748,0.0022454194,0.022870965,0.000117391195],"about_ca_topic_score_codex":0.0000030102692,"about_ca_topic_score_gemma":0.00000867893,"teacher_disagreement_score":0.9060013,"about_ca_system_score_codex":0.000016967186,"about_ca_system_score_gemma":0.00003101256,"threshold_uncertainty_score":0.38970605},"labels":[],"label_agreement":null},{"id":"W109768219","doi":"","title":"(t, k)-Geodetic Set of a Graph.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Mathematics; Graph; Combinatorics; Set (abstract data type); Geodesy; Computer science; Geography; Programming language","score_opus":0.01344245841610485,"score_gpt":0.25378482168323485,"score_spread":0.24034236326713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109768219","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.7775498,0.00016080285,0.2176015,0.0001928621,0.0016493269,0.00009518379,0.0000010701065,0.00007495675,0.002674474],"genre_scores_gemma":[0.9916184,0.0000040457167,0.008186452,0.00008348243,0.000009553362,0.0000018827113,0.0000042719034,0.0000034282489,0.00008846817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919647,0.000025759538,0.00020676746,0.00017204035,0.0002430721,0.00015587214],"domain_scores_gemma":[0.99934304,0.00013017423,0.00007765543,0.00026095123,0.0001256163,0.00006256916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048358814,0.000070461465,0.00009712688,0.00016284511,0.000053805976,0.000023487999,0.0003368681,0.000036488636,0.0000084692965],"category_scores_gemma":[0.000038730246,0.000072178234,0.000048771293,0.00073458574,0.00002422338,0.00018416277,0.00008404911,0.000058714217,0.000020468882],"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.000004190587,0.00004130482,0.0005351151,0.000006617815,0.000008446031,0.000005189308,0.00023207044,0.00016423146,0.0015748183,0.98514044,0.000576115,0.01171147],"study_design_scores_gemma":[0.0005597262,0.00014891186,0.016307194,0.000011994645,0.0000053626295,0.000013630494,0.000019741627,0.0050545973,0.028879957,0.9462623,0.0025832325,0.00015338162],"about_ca_topic_score_codex":0.000010099309,"about_ca_topic_score_gemma":0.0000030190552,"teacher_disagreement_score":0.21406859,"about_ca_system_score_codex":0.000015613079,"about_ca_system_score_gemma":0.00004065912,"threshold_uncertainty_score":0.29433432},"labels":[],"label_agreement":null},{"id":"W111421868","doi":"","title":"Adding and Deleting Crossings in Drawings of Graphs.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic","score_opus":0.0073801810679505675,"score_gpt":0.22934764672525917,"score_spread":0.2219674656573086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111421868","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.99705195,0.00017301503,0.00072281016,0.000118738935,0.00018487284,0.000049640086,3.091815e-7,0.000027081207,0.001671552],"genre_scores_gemma":[0.9937616,0.000014548203,0.0060513183,0.00007611198,0.0000027821222,0.0000027191547,0.0000013483275,0.0000031038057,0.0000864786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993515,0.000030149626,0.00018049988,0.00018232276,0.00013234763,0.0001232033],"domain_scores_gemma":[0.9996802,0.00008666194,0.000046398338,0.00011165421,0.000040496452,0.00003456195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025827638,0.00006329464,0.00009821237,0.00011972487,0.00008132579,0.00007947878,0.00015987325,0.000030633004,0.000013182055],"category_scores_gemma":[0.000029009878,0.00006913808,0.000020799815,0.0005299295,0.000033120155,0.00031853217,0.000047458936,0.000064161,0.000003596208],"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.0000076291376,0.00006457779,0.007094775,0.000018221866,0.000005927509,0.0000068251,0.0016304475,0.0007011725,0.001961253,0.8460514,0.00018888577,0.14226891],"study_design_scores_gemma":[0.0014922662,0.00013171003,0.070895635,0.00011647717,0.0000048212355,0.00002452861,0.000030917516,0.06842641,0.0068724905,0.84800977,0.003685032,0.0003099622],"about_ca_topic_score_codex":0.000036035584,"about_ca_topic_score_gemma":0.0000021806384,"teacher_disagreement_score":0.14195895,"about_ca_system_score_codex":0.00001284932,"about_ca_system_score_gemma":0.000027154932,"threshold_uncertainty_score":0.2819369},"labels":[],"label_agreement":null},{"id":"W113840492","doi":"","title":"Computing the Boundary of a Class of Labeled-Leaf BSP Solids","year":2005,"lang":"en","type":"article","venue":"","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 Alberta","funders":"","keywords":"Polyhedron; Boundary (topology); Constructive; Shadow (psychology); Class (philosophy); Constructive solid geometry; Boundary representation; Piecewise linear function; Piecewise; Computer science; Mathematics; Tree (set theory); Computational geometry; Algorithm; Combinatorics; Geometry; Artificial intelligence; Mathematical analysis; Process (computing)","score_opus":0.013764359821125973,"score_gpt":0.2568294073660856,"score_spread":0.24306504754495964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W113840492","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.20856255,0.00017971918,0.7820014,0.0026513091,0.00016182524,0.00008125457,9.2770756e-7,0.000038236092,0.0063227806],"genre_scores_gemma":[0.9338128,0.0000035206972,0.06519209,0.0004880069,0.00011041238,8.1244013e-7,0.0000015898643,0.0000022611407,0.00038852886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992306,0.0000470688,0.00025039722,0.00013255567,0.00023150964,0.00010783046],"domain_scores_gemma":[0.99932975,0.00015996648,0.00010787419,0.00023893735,0.00013951845,0.000023979876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034154908,0.00005944741,0.000101889775,0.000066234825,0.0000890831,0.000035496087,0.00040079173,0.000024046378,0.000022411263],"category_scores_gemma":[0.000025448384,0.000042127016,0.000049111335,0.00040564736,0.00005278916,0.00017400079,0.00015166395,0.000058371643,0.000011345579],"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.000008420256,0.00017512367,0.00035056987,0.000030667063,0.000040675597,7.9370074e-7,0.0017496777,0.07035828,0.014105416,0.5120027,0.0049782735,0.39619943],"study_design_scores_gemma":[0.00029900312,0.000087811786,0.0027108327,0.000013976278,0.0000054841107,0.000011580318,0.000044884768,0.9195507,0.048176426,0.0028252066,0.026176607,0.000097444325],"about_ca_topic_score_codex":0.000011734806,"about_ca_topic_score_gemma":0.000013688634,"teacher_disagreement_score":0.84919244,"about_ca_system_score_codex":0.000013095451,"about_ca_system_score_gemma":0.00009763424,"threshold_uncertainty_score":0.17178899},"labels":[],"label_agreement":null},{"id":"W117857050","doi":"10.1007/978-3-319-07959-2_3","title":"Integral Simplex Using Decomposition with Primal Cuts","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Simplex; Decomposition; Simplex algorithm; Mathematical optimization; Algorithm; Mathematics; Combinatorics; Linear programming","score_opus":0.018203717994505042,"score_gpt":0.27100906210388837,"score_spread":0.2528053441093833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117857050","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.0011569576,0.000097726595,0.9956494,0.00032443544,0.0009086211,0.00030211452,0.0000027017932,0.00013017212,0.0014278587],"genre_scores_gemma":[0.3166022,0.0000036580693,0.6816056,0.001012203,0.0005787239,0.000003901917,0.000018907282,0.000024167972,0.00015068817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968103,0.00004437115,0.0004229364,0.0012573068,0.0009618756,0.00050317217],"domain_scores_gemma":[0.9981403,0.00028202773,0.00028722812,0.0007643363,0.00036418572,0.00016195285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059302006,0.00046118864,0.0004116229,0.00089996186,0.000324884,0.00060145365,0.0015458753,0.00020840505,0.000020106241],"category_scores_gemma":[0.000029669118,0.00039626617,0.000093833994,0.00070003874,0.00035191586,0.00059358723,0.0005895759,0.0005323024,0.000022324833],"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.000012650204,0.000018797426,0.000025284411,0.000022631573,0.000010887904,0.00003455939,0.00020512629,0.44671246,0.00034934815,0.04314779,0.000013635634,0.5094468],"study_design_scores_gemma":[0.00026470725,0.0002623505,0.0001062414,0.00024056707,0.000010277802,0.00022236515,5.973323e-8,0.9356039,0.0017017593,0.05946254,0.0015867368,0.000538474],"about_ca_topic_score_codex":0.000017612449,"about_ca_topic_score_gemma":0.00005293472,"teacher_disagreement_score":0.50890833,"about_ca_system_score_codex":0.00035111382,"about_ca_system_score_gemma":0.0006714185,"threshold_uncertainty_score":0.9998489},"labels":[],"label_agreement":null},{"id":"W121933743","doi":"","title":"Area-Proportional Drawings of Intersecting Families of Simple Closed Curves.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on 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 Victoria","funders":"","keywords":"Jordan curve theorem; Mathematics; Combinatorics; Plane curve; Simple (philosophy); Graph; Plane (geometry); Geometry","score_opus":0.028939908460865162,"score_gpt":0.2564893939256543,"score_spread":0.22754948546478912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121933743","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.45671332,0.00034263547,0.52697307,0.004540362,0.00045217812,0.0003890687,0.0001685647,0.00008320852,0.010337581],"genre_scores_gemma":[0.9777967,0.000019566427,0.020513574,0.0012721356,0.00008418665,0.000008561954,0.00019418787,0.000008836559,0.00010227736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980446,0.00005733288,0.00060446525,0.00038904144,0.0006164872,0.000288049],"domain_scores_gemma":[0.99798185,0.00029808405,0.00032103658,0.00025803555,0.0008894709,0.00025151903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037448338,0.00018670825,0.0002859429,0.0010621353,0.00013282595,0.000051861833,0.00055362214,0.0000748402,0.00030192494],"category_scores_gemma":[0.00022370592,0.00020524483,0.000112720765,0.0012013887,0.0001085636,0.00039640852,0.00007120935,0.00016879676,0.00002852559],"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.000025500183,0.00020772147,0.0030834354,0.00021791385,0.00012111261,0.00001166026,0.00073306117,0.33904022,0.00092776574,0.48387814,0.007560301,0.16419315],"study_design_scores_gemma":[0.0010944763,0.0004261805,0.05752256,0.0005467214,0.000026039821,0.00004830587,0.00025869923,0.88492966,0.0054093953,0.042870626,0.0061305775,0.0007367577],"about_ca_topic_score_codex":0.0016498228,"about_ca_topic_score_gemma":0.002417304,"teacher_disagreement_score":0.54588944,"about_ca_system_score_codex":0.00015477263,"about_ca_system_score_gemma":0.0014908776,"threshold_uncertainty_score":0.8369641},"labels":[],"label_agreement":null},{"id":"W130561602","doi":"","title":"Morphing Planar Graph Drawings.","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Morphing; Planar graph; Graph drawing; Mathematical proof; Outerplanar graph; Computer science; Lattice graph; Planar straight-line graph; Vertex (graph theory); Graph; Mathematics; Combinatorics; Line graph; Computer graphics (images); Pathwidth; Geometry; Voltage graph","score_opus":0.02609874843551627,"score_gpt":0.25238890273672476,"score_spread":0.2262901543012085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130561602","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.043173432,0.00006907789,0.9363164,0.0026342624,0.00087662745,0.00018324019,0.000024833857,0.00015633811,0.016565844],"genre_scores_gemma":[0.9480151,0.0000036157733,0.04754776,0.0037242472,0.0002149444,0.0000061147443,0.00012429866,0.00001334157,0.00035059577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977149,0.000046901205,0.0003892201,0.0005871736,0.00064283557,0.000618966],"domain_scores_gemma":[0.9980622,0.00033629246,0.00012020455,0.00032589916,0.00042612705,0.0007292698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007451346,0.00024373671,0.00019564429,0.0017926705,0.00046620288,0.0003678846,0.0007614138,0.00012239038,0.00013605722],"category_scores_gemma":[0.000115210605,0.00027252364,0.00009334957,0.0018498681,0.00006405569,0.00047861066,0.000045173732,0.00028628932,0.00034125135],"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.000008359335,0.00003707554,0.0006380742,0.000008033434,0.000029884139,0.00011159947,0.00018203235,0.036387347,0.00012814715,0.91702104,0.003328406,0.042119995],"study_design_scores_gemma":[0.0015092036,0.0004500616,0.16608252,0.00013997732,0.000020768202,0.00027183915,0.00019351,0.35932985,0.0011100089,0.435982,0.033108264,0.0018020247],"about_ca_topic_score_codex":0.002144105,"about_ca_topic_score_gemma":0.0047983406,"teacher_disagreement_score":0.90484166,"about_ca_system_score_codex":0.0002515657,"about_ca_system_score_gemma":0.0010155884,"threshold_uncertainty_score":0.9999727},"labels":[],"label_agreement":null},{"id":"W132285569","doi":"10.1007/978-3-642-40313-2_29","title":"Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba","funders":"","keywords":"Cardinality (data modeling); Guard (computer science); Point (geometry); Line segment; Computer science; Time complexity; Vanishing point; Set (abstract data type); Polygon (computer graphics); Combinatorics; Mathematics; Computer vision; Algorithm; Image (mathematics); Geometry; Telecommunications","score_opus":0.025233999050963154,"score_gpt":0.2520918658525649,"score_spread":0.22685786680160172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132285569","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.0009947761,0.0006064195,0.99375975,0.0004610279,0.0022404955,0.0003400761,0.000008877332,0.0001107994,0.0014777713],"genre_scores_gemma":[0.10856062,0.00011743769,0.8880528,0.00083306374,0.0011424234,0.000011330084,0.000026757814,0.000039107155,0.0012164279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963738,0.000047110054,0.0006098991,0.0014965234,0.00092489074,0.0005478127],"domain_scores_gemma":[0.99808675,0.00037863574,0.00033007606,0.0006542331,0.00036739965,0.00018290522],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009499509,0.00048631427,0.00047041764,0.00091500476,0.0005111043,0.0011192323,0.0011491332,0.00023273539,0.000018691788],"category_scores_gemma":[0.00013040965,0.00047415466,0.0000921041,0.000638117,0.00033822158,0.0012289799,0.0010693142,0.00054070255,0.000036554287],"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.000010946225,0.00001843542,0.000025923964,0.000049598082,0.000025269517,0.00006929609,0.00095570646,0.14106356,0.0009499525,0.02220759,0.0001407082,0.834483],"study_design_scores_gemma":[0.00031610136,0.00008313024,0.00014408307,0.00034417218,0.000008919819,0.00022083653,4.745155e-7,0.95814985,0.0007694908,0.03515107,0.004179157,0.00063269614],"about_ca_topic_score_codex":0.000015230263,"about_ca_topic_score_gemma":0.000014261629,"teacher_disagreement_score":0.8338503,"about_ca_system_score_codex":0.00022100894,"about_ca_system_score_gemma":0.00053656433,"threshold_uncertainty_score":0.9999177},"labels":[],"label_agreement":null},{"id":"W133799465","doi":"","title":"Cross-Stitching Using Little Thread.","year":2005,"lang":"en","type":"article","venue":"","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 New Brunswick; University of Waterloo","funders":"","keywords":"Image stitching; Thread (computing); Computer science; Parallel computing; Artificial intelligence; Operating system","score_opus":0.03462733127791525,"score_gpt":0.32588192692917173,"score_spread":0.2912545956512565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133799465","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.19035912,0.000063952786,0.8033778,0.0003538822,0.00018204558,0.000029002513,2.5579862e-7,0.000089107256,0.0055448464],"genre_scores_gemma":[0.6301463,0.0000011891044,0.36784986,0.00040609844,0.00023573676,7.8349683e-7,0.0000013724803,0.000002076364,0.0013565498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945587,0.000012418941,0.00010994769,0.00016812672,0.00013874794,0.00011491294],"domain_scores_gemma":[0.99968725,0.000034077762,0.000025229172,0.0001570005,0.000054929977,0.00004150849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014717103,0.000052877804,0.00004590771,0.000061176856,0.00013180815,0.00022315602,0.00021187484,0.00002142283,0.00009435731],"category_scores_gemma":[0.000016284972,0.000048496833,0.000027151036,0.00023063303,0.000009232032,0.00072620186,0.000087756634,0.000041769905,0.000117905634],"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.0000018068038,0.00005013188,0.001278061,0.000002986959,0.000007703066,0.0000023069272,0.00027801452,0.3726513,0.0048144404,0.35935768,0.00043351483,0.26112205],"study_design_scores_gemma":[0.00012527262,0.000010102031,0.0031544596,0.0000031933741,0.0000010784871,0.000018238448,0.0000022011138,0.96757764,0.00808989,0.003954594,0.016961535,0.00010178533],"about_ca_topic_score_codex":0.000012421289,"about_ca_topic_score_gemma":0.000006254162,"teacher_disagreement_score":0.59492636,"about_ca_system_score_codex":0.000029093735,"about_ca_system_score_gemma":0.00004253803,"threshold_uncertainty_score":0.21518986},"labels":[],"label_agreement":null},{"id":"W136659167","doi":"10.1023/a:1009934225596","title":"Exact Computation of Delaunay and Power Triangulations","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","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":"University of Calgary","funders":"","keywords":"Delaunay triangulation; Computation; Algorithm; Floating point; Sign (mathematics); Rounding; Mathematics; Computer science","score_opus":0.011646323250239623,"score_gpt":0.25388309387716557,"score_spread":0.24223677062692595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136659167","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.37039426,0.00034431354,0.62568104,0.00016841036,0.00012716881,0.00009747165,7.439393e-7,0.00007644549,0.0031101413],"genre_scores_gemma":[0.91335076,0.000015339045,0.08632625,0.00008670672,0.00004322801,0.0000010200453,0.0000068986606,0.0000054167594,0.00016440236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990253,0.000048644633,0.0003116616,0.00025903617,0.00019873715,0.00015661611],"domain_scores_gemma":[0.99941015,0.00015005359,0.00010237604,0.00016208678,0.00011480562,0.000060497714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032059196,0.000096695134,0.0001476716,0.0001330707,0.00016970857,0.0000773794,0.000158174,0.00004320314,0.00004253242],"category_scores_gemma":[0.000029147242,0.000100846504,0.000040490988,0.0005625136,0.0000249837,0.0002859847,0.0000630383,0.0000710496,0.000018617924],"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.000011232397,0.00008394128,0.00077616633,0.00003029737,0.000025075737,0.0000033155704,0.00084450527,0.56339157,0.0010877097,0.02981475,0.0006257964,0.40330568],"study_design_scores_gemma":[0.00042548738,0.00007470129,0.013616527,0.000046299694,0.00000598821,0.000024924571,0.00001177726,0.9788103,0.0007310655,0.0039716447,0.002144729,0.00013656156],"about_ca_topic_score_codex":0.000017035965,"about_ca_topic_score_gemma":6.110593e-7,"teacher_disagreement_score":0.5429565,"about_ca_system_score_codex":0.000018580704,"about_ca_system_score_gemma":0.000047063168,"threshold_uncertainty_score":0.4112401},"labels":[],"label_agreement":null},{"id":"W139336693","doi":"","title":"Nested BIBDs from affine planes.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Affine transformation; Nested set model; Pure mathematics; Computer science; Data mining","score_opus":0.010893721262640994,"score_gpt":0.22368034522890867,"score_spread":0.21278662396626769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W139336693","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.9293462,0.00022247342,0.06262648,0.0019503012,0.0037712269,0.00013329097,0.0000048432894,0.00029396755,0.0016511894],"genre_scores_gemma":[0.9892172,0.0000069484595,0.0101072565,0.00042442232,0.00003613275,0.000007747333,0.000053632037,0.0000063373536,0.00014030545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991024,0.000028637269,0.00016408971,0.00028712937,0.00025215885,0.00016556132],"domain_scores_gemma":[0.99938,0.0000792816,0.000054670974,0.0003256885,0.00007617701,0.00008416402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010281879,0.000109467546,0.00011247668,0.00011490142,0.00010900732,0.000118362455,0.0004325753,0.00005523206,0.000027708566],"category_scores_gemma":[0.00003268058,0.000110886365,0.000038121514,0.0006572867,0.000015973095,0.00035291674,0.000110473935,0.0000876039,0.00020757261],"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.0000045617603,0.000108380176,0.000241045,0.0000020846549,0.000013970364,0.00002299933,0.0002035466,0.0037901555,0.0014413517,0.98605907,0.0011979393,0.006914883],"study_design_scores_gemma":[0.0014843658,0.000098932294,0.015607205,0.000014814992,0.0000062143286,0.0000129477385,0.0000072695007,0.0050552106,0.009009738,0.95970184,0.00877078,0.00023069957],"about_ca_topic_score_codex":0.00008986033,"about_ca_topic_score_gemma":0.000009245287,"teacher_disagreement_score":0.05987099,"about_ca_system_score_codex":0.000052225303,"about_ca_system_score_gemma":0.000098623146,"threshold_uncertainty_score":0.4521815},"labels":[],"label_agreement":null},{"id":"W142539835","doi":"10.22215/etd/2004-06003","title":"Computing Fréchet distance of two paths on a convex polyhedron","year":2004,"lang":"en","type":"dissertation","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"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":"Polyhedron; Regular polygon; Convex polytope; Combinatorics; Mathematics; Simple (philosophy); Surface (topology); Geometry; Convex set; Convex optimization","score_opus":0.011152234558146644,"score_gpt":0.28312662120057597,"score_spread":0.27197438664242934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142539835","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.09157741,0.00038165328,0.87991077,0.00013352028,0.0019393732,0.00032924485,0.000012176891,0.00016804507,0.025547799],"genre_scores_gemma":[0.967494,0.000012229295,0.026994552,0.00021149137,0.00016731428,0.000006951869,0.00047838528,0.000016985074,0.0046181004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981893,0.00004988458,0.00046990893,0.0005302794,0.00054231595,0.00021833486],"domain_scores_gemma":[0.99877965,0.0001329436,0.00038283688,0.0004012724,0.00022978376,0.00007352022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020125398,0.00025925922,0.0003379246,0.00025614287,0.00010910538,0.00008744213,0.00056223135,0.00012860175,0.00003636951],"category_scores_gemma":[0.000037296217,0.0002537707,0.00013260386,0.0005345399,0.000018125282,0.00017173329,0.000046570956,0.000217948,0.000044896133],"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.000047731522,0.00027244634,0.00006517939,0.00024008725,0.0000578884,0.000014941813,0.0018258807,0.03070498,0.0021651236,0.8711125,0.0005566564,0.09293653],"study_design_scores_gemma":[0.0066768704,0.0019690378,0.023885168,0.003440346,0.00013899364,0.00004722866,0.00076137733,0.5089552,0.28793374,0.1551492,0.007161972,0.0038808594],"about_ca_topic_score_codex":0.000073090625,"about_ca_topic_score_gemma":0.00010650739,"teacher_disagreement_score":0.8759166,"about_ca_system_score_codex":0.00009207813,"about_ca_system_score_gemma":0.0003490819,"threshold_uncertainty_score":0.9999915},"labels":[],"label_agreement":null},{"id":"W1438552389","doi":"10.1007/978-3-642-34191-5_19","title":"Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Planar; Computer science; Planar graph; Enhanced Data Rates for GSM Evolution; Bounded function; Constant (computer programming); Book embedding; Outerplanar graph; Geometry; Algorithm; 1-planar graph; Combinatorics; Computer graphics (images); Pathwidth; Theoretical computer science; Graph; Mathematics; Chordal graph; Artificial intelligence; Mathematical analysis; Programming language; Line graph","score_opus":0.01865126701825929,"score_gpt":0.2478325409799121,"score_spread":0.22918127396165283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1438552389","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.004743294,0.001185463,0.99178183,0.00020591303,0.001022478,0.00025649287,0.0000073075416,0.00005388763,0.0007433209],"genre_scores_gemma":[0.82516295,0.000019284289,0.17390634,0.0005974953,0.00017714206,0.000005036105,0.00001516005,0.000017484554,0.00009912373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701655,0.000040555966,0.00061942445,0.000877262,0.000838001,0.0006082107],"domain_scores_gemma":[0.99823546,0.0004052936,0.00033038945,0.0007006751,0.00019916885,0.00012899395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011604351,0.00036551896,0.0004777298,0.0014230551,0.00024236621,0.00040889884,0.0015015282,0.00023152861,0.000019604937],"category_scores_gemma":[0.00007291856,0.00035687065,0.00011509129,0.0012175024,0.00041296094,0.000862407,0.0004549338,0.0004810732,0.000011790044],"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.000024259309,0.00031745213,0.0033116282,0.0002419599,0.00002983467,0.00013684004,0.011258358,0.104847714,0.0024691368,0.24737953,0.00006916914,0.6299141],"study_design_scores_gemma":[0.00066917425,0.00019191395,0.0033228144,0.00072508,0.000011383122,0.00008083071,8.82008e-7,0.5318652,0.0039246827,0.4568021,0.0014901719,0.0009157865],"about_ca_topic_score_codex":0.000022133903,"about_ca_topic_score_gemma":0.0001602079,"teacher_disagreement_score":0.82041967,"about_ca_system_score_codex":0.00016699528,"about_ca_system_score_gemma":0.00054595654,"threshold_uncertainty_score":0.9998883},"labels":[],"label_agreement":null},{"id":"W1480718878","doi":"10.1007/11841036_49","title":"I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","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":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.008285170191687717,"score_gpt":0.22636593809615943,"score_spread":0.2180807679044717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480718878","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.169556,0.000112491274,0.82851267,0.00059641217,0.0006904088,0.00021354112,0.0000012059796,0.0001921356,0.00012511542],"genre_scores_gemma":[0.7017283,8.474612e-7,0.2977209,0.00031993087,0.00020575951,0.000009406535,0.0000047644567,0.0000066180855,0.0000034574682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972521,0.00007190727,0.00031731822,0.00096235797,0.00082550064,0.0005708087],"domain_scores_gemma":[0.9985233,0.000339009,0.00010682888,0.00062653865,0.00029440122,0.00010990957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061051664,0.0002496327,0.00020811272,0.0005614932,0.00037959547,0.0005753224,0.0011983471,0.00006769935,0.000005937887],"category_scores_gemma":[0.00006377244,0.00020558778,0.000044776312,0.0046243533,0.00029422832,0.0003567978,0.000317982,0.00022335132,0.000019280991],"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.0000047036833,0.00012711133,0.0010018558,0.0000040212326,0.0000022543286,0.000027078857,0.00018965286,0.85298544,0.0016053386,0.004238501,0.000011851977,0.1398022],"study_design_scores_gemma":[0.00034282703,0.0001412156,0.018794043,0.000032196316,0.0000026586108,0.000072448885,3.45067e-7,0.9622335,0.009784772,0.008157645,0.00013501162,0.00030337143],"about_ca_topic_score_codex":0.00008754876,"about_ca_topic_score_gemma":0.00019063949,"teacher_disagreement_score":0.5321723,"about_ca_system_score_codex":0.00018885922,"about_ca_system_score_gemma":0.0004784047,"threshold_uncertainty_score":0.8383627},"labels":[],"label_agreement":null},{"id":"W1480727810","doi":"10.1023/a:1015626820950","title":"Implicit Convex Polygons","year":2002,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","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":"McGill University","funders":"","keywords":"Partition (number theory); Regular polygon; Simple (philosophy); Computer science; Representation (politics); Combinatorics; Mathematics; Computer graphics; Time complexity; Computational geometry; Algorithm; Artificial intelligence; Geometry","score_opus":0.04273633534547535,"score_gpt":0.2520657650801522,"score_spread":0.20932942973467686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480727810","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.011622152,0.0006891939,0.98547786,0.0015082203,0.000115713025,0.000030335745,4.626947e-7,0.000014827341,0.00054123154],"genre_scores_gemma":[0.51540065,0.00014665858,0.4838405,0.00014241933,0.00018786723,7.524525e-7,1.41127e-7,0.000004532088,0.00027645956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916375,0.000027123131,0.00033754826,0.00010021408,0.00025187596,0.0001194723],"domain_scores_gemma":[0.99932927,0.00019598196,0.00013644269,0.00009966644,0.000117764954,0.00012086187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034675992,0.000076371136,0.0001851265,0.00010280239,0.00007546496,0.00010319159,0.00016466831,0.000035296263,0.00002912609],"category_scores_gemma":[0.000032963086,0.000058245216,0.00006523542,0.00014333584,0.000021519923,0.00026507225,0.000037232167,0.0001288568,0.000017748032],"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.000008518251,0.00059585704,0.000011490011,0.00011003861,0.00011793452,0.0000824873,0.002726007,0.20106532,0.0006365039,0.5443457,0.001959979,0.24834022],"study_design_scores_gemma":[0.00016598903,0.00007406101,0.0000038873986,0.000028858442,0.0000075594844,0.00034194536,0.000010872732,0.84450674,0.00019261774,0.1542455,0.00036250404,0.00005947991],"about_ca_topic_score_codex":3.7403473e-7,"about_ca_topic_score_gemma":1.4126276e-8,"teacher_disagreement_score":0.64344144,"about_ca_system_score_codex":0.000009216607,"about_ca_system_score_gemma":0.000011159137,"threshold_uncertainty_score":0.23751709},"labels":[],"label_agreement":null},{"id":"W1484713053","doi":"10.1007/978-3-540-92248-3_33","title":"Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Spanner; Unit disk graph; Vertex (graph theory); Bipartite graph; Computer science; Combinatorics; Locality; Graph; Mathematics; Database","score_opus":0.01680644095101965,"score_gpt":0.23324718124199018,"score_spread":0.21644074029097052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484713053","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.0044947243,0.00043786282,0.9938605,0.00010196815,0.00066899,0.00019007761,0.000004035965,0.00003080784,0.00021103167],"genre_scores_gemma":[0.83480275,0.00013814624,0.16490081,0.000058490285,0.000057946552,0.0000023235034,0.00000795489,0.00000796064,0.000023653294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981131,0.000026491956,0.0004537939,0.0006231862,0.00058327493,0.00020014112],"domain_scores_gemma":[0.99840033,0.00026113642,0.0003595097,0.00039971032,0.0005029124,0.00007641274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032661593,0.00022868536,0.00033371578,0.0008504937,0.00013049944,0.000051092695,0.0006266614,0.00015711611,0.000002900633],"category_scores_gemma":[0.00004168808,0.00022942714,0.00005533577,0.0009263026,0.0011056147,0.0004023752,0.00033361083,0.00023885108,0.0000011112361],"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.0000107058095,0.000017726996,0.00025712908,0.00008430289,0.000011300066,0.0000061490723,0.0005150618,0.3296116,0.00021582805,0.035879828,0.000004256282,0.63338614],"study_design_scores_gemma":[0.0004021693,0.00032523292,0.002358642,0.0004831907,0.000014601555,0.00017934346,0.0000019830804,0.9140727,0.013024293,0.06838328,0.00029348742,0.00046110322],"about_ca_topic_score_codex":0.000024428964,"about_ca_topic_score_gemma":0.000029007835,"teacher_disagreement_score":0.830308,"about_ca_system_score_codex":0.00006809112,"about_ca_system_score_gemma":0.00043383936,"threshold_uncertainty_score":0.93557674},"labels":[],"label_agreement":null},{"id":"W1486513335","doi":"10.1007/978-3-540-73951-7_29","title":"On Generalized Diamond Spanners","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"","keywords":"Combinatorics; Delaunay triangulation; Polygon (computer graphics); Mathematics; Geometric graph theory; Diamond; Vertex (graph theory); Graph; Computer science; Line graph; Graph power","score_opus":0.025256371175187715,"score_gpt":0.26893403505441,"score_spread":0.24367766387922227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486513335","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.00028194833,0.00031737966,0.9852309,0.0006846969,0.0028604767,0.00030667498,0.0000038129504,0.0001570186,0.010157078],"genre_scores_gemma":[0.10203841,0.000068530826,0.88490796,0.008312255,0.0016226547,0.000012418425,0.00003616027,0.000060277907,0.0029413127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960474,0.000032413987,0.0005033641,0.001488665,0.001305591,0.0006225766],"domain_scores_gemma":[0.9976042,0.0006176222,0.00024147726,0.0010599882,0.00025723258,0.00021951165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010393278,0.00050299877,0.0004197111,0.0015548985,0.00027053378,0.0004627631,0.0021304921,0.00030256185,0.000044205917],"category_scores_gemma":[0.000107748456,0.00047196398,0.00015114693,0.00094111054,0.00033148556,0.00044115342,0.0006215995,0.00065324985,0.00013412765],"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.000009127608,0.00002619367,0.0000042150386,0.0000101063315,0.000008301446,0.00007802507,0.00017290129,0.22929761,0.00009385435,0.20648593,0.00011519766,0.56369853],"study_design_scores_gemma":[0.00042859098,0.000261494,0.00009335301,0.00016194445,0.0000062294703,0.000050404575,4.3371877e-8,0.56239367,0.0024304977,0.42725113,0.0061448757,0.00077778776],"about_ca_topic_score_codex":0.000010843336,"about_ca_topic_score_gemma":0.00004341746,"teacher_disagreement_score":0.56292075,"about_ca_system_score_codex":0.00032354175,"about_ca_system_score_gemma":0.0004676745,"threshold_uncertainty_score":0.9997732},"labels":[],"label_agreement":null},{"id":"W1490020014","doi":"10.1007/3-540-45545-0_78","title":"On Dynamic Generalized Voronoi Diagrams in the Euclidean Metric","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Calgary","funders":"","keywords":"Voronoi diagram; SPHERES; Weighted Voronoi diagram; Euclidean geometry; Metric (unit); Euclidean space; Euclidean distance; Polynomial; Mathematics; Tangent; Tangent space; Power diagram; Set (abstract data type); Topology (electrical circuits); Computer science; Mathematical analysis; Geometry; Combinatorics; Physics","score_opus":0.01571594469342446,"score_gpt":0.25711842749028335,"score_spread":0.24140248279685889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490020014","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.0011630958,0.00060338085,0.9904204,0.0015456848,0.0015757072,0.000513245,0.0000028795735,0.000081867394,0.004093746],"genre_scores_gemma":[0.82533026,0.00022922424,0.16488025,0.007911041,0.00067239,0.000040936484,0.00004131411,0.00004515309,0.0008494636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594575,0.00013413391,0.0005757758,0.0013883975,0.0013492916,0.0006066401],"domain_scores_gemma":[0.99696386,0.0012799812,0.00024889625,0.0012481752,0.00015279223,0.00010629902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017063923,0.00049680984,0.00043561592,0.0019056476,0.0002668278,0.0006664384,0.0034974408,0.00023797121,0.000026170801],"category_scores_gemma":[0.00018214856,0.0003756311,0.00015342068,0.002677597,0.00025850517,0.00042696536,0.00052467856,0.00082926865,0.00006970265],"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.000005628888,0.000051738378,0.000020027212,0.000008271472,0.0000053896897,0.000092225106,0.00038409946,0.3018296,0.000017407197,0.08966944,0.000042845142,0.6078733],"study_design_scores_gemma":[0.00035371442,0.00019561329,0.0006304042,0.000097747026,0.000005219119,0.000067089,1.5719519e-7,0.70967793,0.000059894228,0.28621283,0.0022416664,0.0004577164],"about_ca_topic_score_codex":0.000035174176,"about_ca_topic_score_gemma":0.00031744028,"teacher_disagreement_score":0.8255401,"about_ca_system_score_codex":0.0003961576,"about_ca_system_score_gemma":0.00033901946,"threshold_uncertainty_score":0.9998696},"labels":[],"label_agreement":null},{"id":"W1492058106","doi":"10.1007/3-540-44634-6_2","title":"Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Queen's University","funders":"","keywords":"Christian ministry; Quadratic equation; Algorithm; Planar; Computer science; Planar graph; Graph; Combinatorics; Mathematics; Theoretical computer science; Geometry","score_opus":0.0318007421251974,"score_gpt":0.25987321454555606,"score_spread":0.22807247242035866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492058106","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.0002267774,0.0007936184,0.9953503,0.00075595244,0.0011615079,0.0007522483,0.00001078662,0.00013347027,0.000815345],"genre_scores_gemma":[0.008196041,0.00014814956,0.9898888,0.0007406141,0.00046414477,0.00003477266,0.000021790169,0.000027882583,0.00047783463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666595,0.00002282906,0.00045655217,0.0015934629,0.0006894324,0.00057176757],"domain_scores_gemma":[0.99797815,0.00046638725,0.00023626933,0.0007111531,0.00040984477,0.00019819323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008830064,0.00047684566,0.0004438103,0.00089041376,0.0004171738,0.0006943009,0.0014466816,0.00027385962,0.000010323121],"category_scores_gemma":[0.000082124825,0.00046018188,0.00012811537,0.0007161767,0.00046151885,0.00091301603,0.00070861366,0.00042582283,0.0000064248225],"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.000008472478,0.000032121272,0.000016226226,0.000039088398,0.000012075362,0.000022113232,0.00018752932,0.41767937,0.00004156322,0.041430492,0.000065554814,0.5404654],"study_design_scores_gemma":[0.00033412746,0.00025403037,0.00007045958,0.0000958056,0.00000962469,0.00012062914,1.0487944e-7,0.86323476,0.00037689964,0.13202503,0.0029587594,0.0005197699],"about_ca_topic_score_codex":0.0000083723435,"about_ca_topic_score_gemma":0.000020987021,"teacher_disagreement_score":0.53994566,"about_ca_system_score_codex":0.00013490104,"about_ca_system_score_gemma":0.00041199007,"threshold_uncertainty_score":0.999785},"labels":[],"label_agreement":null},{"id":"W1493335170","doi":"10.1023/a:1018823806289","title":"Geometric and computational aspects of polymer reconfiguration","year":2000,"lang":"en","type":"article","venue":"Journal of Mathematical Chemistry","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":"McGill University","funders":"","keywords":"Chain (unit); Vertex (graph theory); Regular polygon; Combinatorics; Plane (geometry); Motion (physics); Path (computing); Sequence (biology); Space (punctuation); Enhanced Data Rates for GSM Evolution; Mathematics; Geometry; Physics; Computer science; Classical mechanics; Chemistry; Quantum mechanics","score_opus":0.01154453867074347,"score_gpt":0.23597442971118504,"score_spread":0.22442989104044156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493335170","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.5789733,0.00048887025,0.40684375,0.0005769738,0.00004003753,0.000037696558,0.0000014563759,0.000010487597,0.013027474],"genre_scores_gemma":[0.97297955,0.000018857649,0.026525877,0.00004321139,0.00008783623,5.5363375e-7,0.0000015734661,0.0000031338343,0.00033942267],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990241,0.00001850547,0.000446829,0.00009180678,0.00034135533,0.000077420096],"domain_scores_gemma":[0.9991786,0.00024449464,0.00022852622,0.000089411704,0.00017755713,0.000081413185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029409272,0.00007060098,0.00017398261,0.00008390108,0.000031650623,0.00004237811,0.0001747017,0.000044628323,0.00052766845],"category_scores_gemma":[0.00010798735,0.000060558894,0.000058960904,0.000340902,0.000032896973,0.00024521773,0.000017932603,0.000095965566,0.000008064128],"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.00016456461,0.0018302106,0.00021243202,0.0013745534,0.00038707125,0.00009995695,0.0015318469,0.028077511,0.12826455,0.21841511,0.0028238546,0.61681837],"study_design_scores_gemma":[0.0015322022,0.00026603832,0.0024674681,0.00022271842,0.000054578093,0.0024608616,0.00004654176,0.12600857,0.48233685,0.3836181,0.000646281,0.00033982183],"about_ca_topic_score_codex":2.6023594e-7,"about_ca_topic_score_gemma":1.8378339e-8,"teacher_disagreement_score":0.6164785,"about_ca_system_score_codex":0.000015978409,"about_ca_system_score_gemma":0.00007980816,"threshold_uncertainty_score":0.57776},"labels":[],"label_agreement":null},{"id":"W1494368934","doi":"10.1007/s00454-001-0089-9","title":"Visibility Queries and Maintenance in Simple Polygons","year":2002,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"Army Research Office; Multidisciplinary University Research Initiative; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Visibility polygon; Visibility; Polygon (computer graphics); Simple polygon; Point in polygon; Star-shaped polygon; Mathematics; Disjoint sets; Computer science; Algorithm; Combinatorics; Regular polygon; Geometry; Geography","score_opus":0.01461476435847057,"score_gpt":0.24566496950688094,"score_spread":0.23105020514841038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494368934","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.379758,0.000654985,0.6159132,0.0017595238,0.00017511417,0.00018543891,0.00002098786,0.00010866272,0.0014240444],"genre_scores_gemma":[0.9645293,0.000026808806,0.034445398,0.0006211186,0.00006161329,0.000016706239,0.00004710511,0.000008659456,0.00024331376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982278,0.000093691066,0.0003855592,0.00057210267,0.00039979417,0.00032107727],"domain_scores_gemma":[0.9990301,0.0003471662,0.00009760471,0.0002682061,0.00012905175,0.00012787759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033253126,0.00018770232,0.00020933687,0.00042835265,0.00017607593,0.00019339549,0.00032937038,0.00006246309,0.0001036838],"category_scores_gemma":[0.00016028144,0.00018959779,0.000061400875,0.0013853482,0.000099078294,0.0007507252,0.00022608752,0.00016668362,0.000048988495],"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.000035278554,0.00042162155,0.05301203,0.00009175942,0.00006116446,0.000066472305,0.0020692253,0.25767365,0.00023467687,0.53572774,0.004500812,0.14610557],"study_design_scores_gemma":[0.000535472,0.00006911775,0.24474001,0.000016127566,0.0000030292065,0.000038406986,0.000051345578,0.6851306,0.00004534786,0.06683482,0.0022641155,0.00027161776],"about_ca_topic_score_codex":0.00004022175,"about_ca_topic_score_gemma":0.00002372729,"teacher_disagreement_score":0.5847713,"about_ca_system_score_codex":0.00006504263,"about_ca_system_score_gemma":0.000039172548,"threshold_uncertainty_score":0.77315736},"labels":[],"label_agreement":null},{"id":"W1494793116","doi":"10.1007/978-1-4939-2864-4_294","title":"Planar Geometric Spanners","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","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":"Planar; Computer science; Computer graphics (images)","score_opus":0.01321160507583427,"score_gpt":0.22616361705284363,"score_spread":0.21295201197700936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494793116","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004508981,0.0010620138,0.37150937,0.00036696118,0.0013842483,0.00015360101,0.000046586058,0.000081735685,0.62539095],"genre_scores_gemma":[0.00022646555,0.0022878146,0.07282561,0.00012228747,0.0013081933,0.0000104305145,0.00006321196,0.000042117194,0.9231139],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979539,0.000018058508,0.00050324854,0.000572334,0.0006908534,0.0002616226],"domain_scores_gemma":[0.9984004,0.0002544854,0.00038550433,0.0005832134,0.00023193794,0.00014449816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024520984,0.00032609346,0.00040436175,0.0009354995,0.0000709493,0.00003696499,0.00076171523,0.0002566475,0.00020399962],"category_scores_gemma":[0.000054802083,0.00028043528,0.00019326192,0.00026579914,0.00006628866,0.00030098262,0.00017085536,0.00020727969,0.00039004383],"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.0000037831933,0.000020523668,0.000004331754,0.000028048966,0.00007266447,0.00003063495,0.00006320093,0.00006556449,0.000009057278,0.48209667,0.013945015,0.5036605],"study_design_scores_gemma":[0.0003583166,0.00018229157,0.00012032887,0.000110624074,0.000030423169,0.000027359913,0.0000015951333,0.0008597719,0.000087264794,0.15019996,0.84747994,0.00054213015],"about_ca_topic_score_codex":0.000004064868,"about_ca_topic_score_gemma":0.0000014745987,"teacher_disagreement_score":0.8335349,"about_ca_system_score_codex":0.00007066834,"about_ca_system_score_gemma":0.00024025603,"threshold_uncertainty_score":0.9999648},"labels":[],"label_agreement":null},{"id":"W1495542305","doi":"10.1007/11618058_2","title":"Morphing Planar Graphs While Preserving Edge Directions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Morphing; Computer science; Simple (philosophy); Planar graph; Transformation (genetics); Enhanced Data Rates for GSM Evolution; Combinatorics; Graph; Planar; Mathematics; Computer graphics (images); Artificial intelligence","score_opus":0.019555418173186498,"score_gpt":0.2353126155325862,"score_spread":0.2157571973593997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495542305","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.00015373074,0.00084973406,0.9833903,0.0006339655,0.0025302276,0.00030606796,0.000008904915,0.00025534604,0.01187174],"genre_scores_gemma":[0.19434294,0.00010978256,0.79725176,0.0017707815,0.0020999347,0.000038812712,0.00008987968,0.000077053686,0.0042190845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654573,0.000040525825,0.00050632353,0.0013833502,0.0009690321,0.00055503007],"domain_scores_gemma":[0.99785405,0.0004567687,0.00025275024,0.0009988104,0.0002897809,0.00014782285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068160956,0.00044628052,0.00037844238,0.0014024195,0.0005722267,0.0007367817,0.0022482965,0.00024318087,0.000025630452],"category_scores_gemma":[0.00006232364,0.00045161298,0.0001506965,0.001223239,0.000250404,0.0009526119,0.00073940953,0.0006415602,0.000038479364],"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.0000043286955,0.00006602462,0.00017188003,0.000051013292,0.000022492368,0.0000850061,0.00042266372,0.537379,0.000541317,0.07476276,0.001439283,0.3850542],"study_design_scores_gemma":[0.00021055127,0.0000957242,0.0008532604,0.0002558395,0.0000108802005,0.000097872595,8.681776e-8,0.68888783,0.0011031398,0.29285976,0.014863443,0.0007615901],"about_ca_topic_score_codex":0.000082760096,"about_ca_topic_score_gemma":0.00017166878,"teacher_disagreement_score":0.3842926,"about_ca_system_score_codex":0.000230395,"about_ca_system_score_gemma":0.00041716537,"threshold_uncertainty_score":0.9997936},"labels":[],"label_agreement":null},{"id":"W1496438519","doi":"10.46298/dmtcs.464","title":"Centerpoint theorems for wedges","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universitat Politècnica de Catalunya","keywords":"Mathematics; Combinatorics; Point (geometry); Set (abstract data type); Discrete mathematics; Geometry; Computer science","score_opus":0.013485989728800706,"score_gpt":0.2728398253834265,"score_spread":0.2593538356546258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496438519","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.0036765304,0.000033365857,0.9881951,0.0029734836,0.00055106194,0.00042671437,0.0000042639813,0.00020973397,0.003929696],"genre_scores_gemma":[0.535729,0.000002267437,0.4634694,0.00063223025,0.00013181708,0.000010379812,0.0000033687688,0.0000051338925,0.000016425598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975726,0.000046031477,0.00042161284,0.0006893806,0.00069972046,0.0005706323],"domain_scores_gemma":[0.99814403,0.00038892656,0.0001254861,0.00076231745,0.00032518202,0.00025403776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015394798,0.00023890384,0.00026094285,0.00023512216,0.00052234036,0.00077608053,0.0019795764,0.000051840267,0.000019876385],"category_scores_gemma":[0.00018868968,0.00018744644,0.00014970542,0.0009161085,0.00070321007,0.0006836163,0.00035012976,0.00011784966,0.000035312194],"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.0000050556173,0.00010282859,0.0000011516478,0.000012469355,0.0000042171323,0.0000017046381,0.00061383384,0.00037605796,0.0012209204,0.9665625,0.00013642732,0.030962842],"study_design_scores_gemma":[0.0001480268,0.00020057222,0.000054198368,0.000022731727,0.0000041937988,0.000017501863,0.000008214487,0.4995305,0.0031081429,0.49659684,0.00016048258,0.00014859674],"about_ca_topic_score_codex":1.811634e-7,"about_ca_topic_score_gemma":1.0396772e-7,"teacher_disagreement_score":0.53205246,"about_ca_system_score_codex":0.00004399681,"about_ca_system_score_gemma":0.00010872417,"threshold_uncertainty_score":0.7643844},"labels":[],"label_agreement":null},{"id":"W1497522640","doi":"10.1007/3-540-44679-6_16","title":"Packing Two Disks into a Polygonal Environment","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McGill University; Carleton University","funders":"","keywords":"Polygon (computer graphics); Computation; Computer science; Simple polygon; RADIUS; Combinatorics; Algebraic number; Randomized algorithm; Binary logarithm; Tree (set theory); Running time; Simple (philosophy); Time complexity; Algorithm; Mathematics; Regular polygon; Geometry","score_opus":0.016160683674990847,"score_gpt":0.2500689776211862,"score_spread":0.23390829394619533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497522640","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.00025947366,0.0006392257,0.99263316,0.0010360709,0.0013667395,0.00026771563,0.0000024615542,0.00010842401,0.0036867398],"genre_scores_gemma":[0.35651177,0.00012249406,0.63894576,0.0019433148,0.0014792929,0.000016258822,0.0000267964,0.000040472387,0.0009138594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619424,0.000037102247,0.0004903772,0.0014866963,0.0012363849,0.0005552018],"domain_scores_gemma":[0.99817944,0.00031340998,0.00024311383,0.0009581359,0.00010371148,0.00020221533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068807014,0.0004791277,0.00037722944,0.00083635113,0.00036380283,0.00052818836,0.0020501786,0.00018427566,0.00007810026],"category_scores_gemma":[0.000037984588,0.00046450816,0.00013787203,0.00055560254,0.00038392624,0.0006193344,0.0012736827,0.0005930606,0.00012304858],"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.000003257706,0.000026389438,0.000034264343,0.00000951408,0.00000845226,0.00006537078,0.00039012657,0.19880593,0.00027606555,0.035479695,0.000014347777,0.76488656],"study_design_scores_gemma":[0.00032436813,0.00013453355,0.00014911137,0.00014494223,0.000007604621,0.00012660364,1.0442214e-7,0.6250594,0.0014434012,0.3616229,0.010301784,0.0006852148],"about_ca_topic_score_codex":0.000030348478,"about_ca_topic_score_gemma":0.000038925722,"teacher_disagreement_score":0.76420134,"about_ca_system_score_codex":0.00045067776,"about_ca_system_score_gemma":0.00040749798,"threshold_uncertainty_score":0.99978065},"labels":[],"label_agreement":null},{"id":"W149959876","doi":"10.1016/j.cag.2013.05.016","title":"Minimizing edge length to connect sparsely sampled unstructured point sets","year":2013,"lang":"en","type":"article","venue":"Computers & Graphics","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":"Concordia University","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Point (geometry); Algorithm; Mathematics; Artificial intelligence; Geometry","score_opus":0.03845166615690865,"score_gpt":0.24483188634942835,"score_spread":0.2063802201925197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W149959876","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.19240488,0.0000845407,0.8016554,0.0031224214,0.0018383196,0.00045151258,0.0000040645186,0.0002670276,0.00017179456],"genre_scores_gemma":[0.7343894,0.00001030665,0.261084,0.0042263963,0.00019146586,0.00002893413,0.000028281693,0.000015223164,0.000025982716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792457,0.00012828184,0.00040301692,0.00067159865,0.00041275035,0.00045981116],"domain_scores_gemma":[0.9982523,0.00035010092,0.00012825323,0.00061373773,0.00032806268,0.00032754935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028736968,0.00028370568,0.0002852538,0.00051042275,0.0002821034,0.00049073866,0.0009551759,0.000101037134,0.000027426879],"category_scores_gemma":[0.00007681129,0.0002835227,0.00014613214,0.0014214397,0.000049198658,0.00063470955,0.0003910782,0.00020611011,0.00013999273],"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.0000301226,0.00023714958,0.0010863654,0.00007977083,0.00025177907,0.000034123805,0.0054383976,0.03721703,0.005235424,0.42893,0.109518364,0.41194147],"study_design_scores_gemma":[0.0015522478,0.00047219318,0.042644735,0.00010126638,0.000028617387,0.00011785505,0.00007179283,0.8462916,0.003763181,0.07329876,0.030261992,0.0013957351],"about_ca_topic_score_codex":0.00005257928,"about_ca_topic_score_gemma":0.00001498201,"teacher_disagreement_score":0.8090746,"about_ca_system_score_codex":0.000047430403,"about_ca_system_score_gemma":0.000099762656,"threshold_uncertainty_score":0.9999617},"labels":[],"label_agreement":null},{"id":"W1501937057","doi":"10.1007/978-1-4939-2864-4_158","title":"Fully Dynamic Transitive Closure","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","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 Victoria","funders":"","keywords":"Transitive closure; Closure (psychology); Transitive relation; Computer science; Mathematics; Combinatorics; Political science","score_opus":0.007245124310746306,"score_gpt":0.223361274430009,"score_spread":0.2161161501192627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501937057","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012435019,0.0008109246,0.46998277,0.0005841756,0.0010495336,0.00020146911,0.00009129893,0.000078364304,0.527189],"genre_scores_gemma":[0.0012110099,0.0022406715,0.0666647,0.0001434985,0.00083056715,0.000016531161,0.00009892989,0.00005504691,0.9287391],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981134,0.000027526781,0.00047655782,0.0005806525,0.00057090743,0.00023096395],"domain_scores_gemma":[0.99863446,0.00016990764,0.0002994704,0.00048292696,0.00030116862,0.000112048234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020463335,0.00033810583,0.0004024903,0.0003032228,0.00007310695,0.000031037354,0.000574066,0.00028026727,0.00017019817],"category_scores_gemma":[0.000017910563,0.0002952165,0.0002395833,0.000096897595,0.00008300961,0.00030331698,0.0001229603,0.00023514431,0.00018808112],"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.000010100682,0.000031009153,0.0000017697672,0.00004397881,0.000116876494,0.000047939076,0.0003848547,0.00008499825,0.000058094727,0.4003675,0.0017948726,0.597058],"study_design_scores_gemma":[0.00091107003,0.00046332626,0.0003057407,0.00035918818,0.00008806926,0.000067896806,0.0000061578776,0.008996659,0.00017395563,0.31993517,0.6675939,0.0010988285],"about_ca_topic_score_codex":0.0000017765369,"about_ca_topic_score_gemma":0.0000054296042,"teacher_disagreement_score":0.6657991,"about_ca_system_score_codex":0.00006876719,"about_ca_system_score_gemma":0.0002931401,"threshold_uncertainty_score":0.99995},"labels":[],"label_agreement":null},{"id":"W1503263721","doi":"10.1090/dimacs/067/07","title":"Geometric algorithms for layered manufacturing","year":2005,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","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":"Computer science; Algorithm","score_opus":0.01684826391080185,"score_gpt":0.2565476044589772,"score_spread":0.23969934054817532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503263721","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.00015563266,0.00023579605,0.9652481,0.00048822947,0.0004493369,0.00049510115,0.000023151582,0.00008026756,0.032824364],"genre_scores_gemma":[0.042120874,0.00015588409,0.95180845,0.00021376659,0.0004034389,0.00003752503,0.00002168688,0.00004062817,0.00519774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727714,0.000012780614,0.00059659657,0.0009214547,0.0006923116,0.00049970543],"domain_scores_gemma":[0.99833274,0.00044677473,0.00021203977,0.0006198213,0.00017952743,0.00020909063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001047974,0.0004124927,0.0004961097,0.00077104097,0.00035359568,0.00074508105,0.0013046747,0.00016025722,0.000036547328],"category_scores_gemma":[0.00007985656,0.00036215558,0.00011956867,0.0003281977,0.0010778573,0.00069187605,0.00089027773,0.00026794683,0.000011203219],"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.000004860851,0.000021630942,2.4397957e-7,0.00008616969,0.0000100514635,0.000006215808,0.00020317608,0.0008091817,0.00000921138,0.92767704,0.000021514836,0.0711507],"study_design_scores_gemma":[0.00022094924,0.0001487482,0.000010226991,0.0001169366,0.000008696348,0.000051251565,0.000004774372,0.3903305,0.0007810032,0.603806,0.0041400106,0.0003808895],"about_ca_topic_score_codex":5.764384e-7,"about_ca_topic_score_gemma":0.0000014826478,"teacher_disagreement_score":0.3895213,"about_ca_system_score_codex":0.00009402208,"about_ca_system_score_gemma":0.00011006099,"threshold_uncertainty_score":0.99988306},"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":"W1504893535","doi":"10.1007/978-3-540-68880-8_20","title":"Shortest Path Queries in Polygonal Domains","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Voronoi diagram; Shortest path problem; Computer science; Graph; Path (computing); Combinatorics; Distance; Domain (mathematical analysis); Time complexity; Algorithm; Theoretical computer science; Mathematics; Geometry","score_opus":0.014786638362403326,"score_gpt":0.2347587505430358,"score_spread":0.21997211218063248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504893535","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.00087824505,0.00080535363,0.9927703,0.0006898606,0.0014799831,0.00028552092,0.0000066734865,0.00011024264,0.0029738352],"genre_scores_gemma":[0.5481708,0.00025507974,0.44781044,0.0021170655,0.0009082014,0.00001836102,0.000031220832,0.00003698886,0.0006518636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632066,0.0000403335,0.00057911745,0.0013744683,0.0010936263,0.00059177907],"domain_scores_gemma":[0.99821246,0.0004159362,0.00019670039,0.0008211724,0.00019518095,0.00015857568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059698755,0.00046863235,0.00045508973,0.0012759244,0.00026203683,0.00033097796,0.0019476587,0.0002651903,0.00002210779],"category_scores_gemma":[0.000081099424,0.00046144394,0.00011588987,0.0010985644,0.00053071283,0.0007535574,0.00082297536,0.00068492675,0.00003984106],"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.000011856419,0.00009328465,0.00045287228,0.000020362631,0.000011264679,0.0005147295,0.0017057305,0.27449438,0.00020741587,0.05855781,0.00015854178,0.66377175],"study_design_scores_gemma":[0.0006029832,0.00031419686,0.0047001825,0.00039177103,0.00000555303,0.00051389664,3.0570342e-7,0.83491445,0.0010026778,0.14644778,0.009741732,0.0013644577],"about_ca_topic_score_codex":0.00003168303,"about_ca_topic_score_gemma":0.00022269652,"teacher_disagreement_score":0.6624073,"about_ca_system_score_codex":0.00033622765,"about_ca_system_score_gemma":0.0010243899,"threshold_uncertainty_score":0.99978375},"labels":[],"label_agreement":null},{"id":"W1505266085","doi":"10.1007/978-3-540-46515-7_9","title":"Folding and Cutting Paper","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":49,"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":"Folding (DSP implementation); Computer science; Graph; Plane (geometry); Algorithm; Skeleton (computer programming); Fold (higher-order function); Geometry; Topology (electrical circuits); Combinatorics; Theoretical computer science; Mathematics; Structural engineering; Engineering","score_opus":0.013211215895128331,"score_gpt":0.23520144078749639,"score_spread":0.22199022489236805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505266085","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.0002532398,0.0011013122,0.9892553,0.0006674407,0.00078101305,0.00017858967,0.0000014259336,0.00010596319,0.0076557333],"genre_scores_gemma":[0.29130256,0.00020963192,0.7032583,0.0034941477,0.0009840409,0.000007575233,0.000008243689,0.00003360983,0.00070191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748915,0.000021923803,0.00035034868,0.0011232343,0.0006182495,0.00039709013],"domain_scores_gemma":[0.99872905,0.00034850286,0.00013330212,0.0005508962,0.00010825457,0.00012998725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057592336,0.00032737886,0.00028942613,0.000649659,0.00030534153,0.0005827448,0.0010625226,0.00017624834,0.000044409706],"category_scores_gemma":[0.000043994685,0.0003176282,0.00006292678,0.00047578834,0.00023258262,0.00081385457,0.00061398017,0.00041522254,0.000027730375],"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.0000015551074,0.0000064270675,0.000014496341,0.000010833612,0.000004215155,0.000024212386,0.0002648928,0.036261924,0.00013511699,0.037188277,0.000010013662,0.926078],"study_design_scores_gemma":[0.0001992648,0.00008873476,0.00021457067,0.00022246868,0.000005830748,0.00013535086,6.839305e-8,0.6036602,0.0006705739,0.38597265,0.008283947,0.0005463026],"about_ca_topic_score_codex":0.0000079079,"about_ca_topic_score_gemma":0.0000129303835,"teacher_disagreement_score":0.92553174,"about_ca_system_score_codex":0.00010482183,"about_ca_system_score_gemma":0.00025243039,"threshold_uncertainty_score":0.9999276},"labels":[],"label_agreement":null},{"id":"W1505970908","doi":"10.1017/cbo9780511546884","title":"Geometric Spanner Networks","year":2007,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":520,"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":"Spanner; Computer science; Decomposition; Point (geometry); Theoretical computer science; Geometric shape; Geometric networks; Algorithm; Mathematics; Complex network; Distributed computing; Geometry; World Wide Web","score_opus":0.017961230381792332,"score_gpt":0.20074986984527676,"score_spread":0.18278863946348442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505970908","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007284632,0.00024115735,0.4792909,0.000007600549,0.0005564367,0.00015251322,0.000012064704,0.00014441965,0.5195876],"genre_scores_gemma":[0.00037075873,0.000058646863,0.0032683304,0.00019599154,0.00054855226,5.340448e-7,0.000118438074,0.000021454314,0.9954173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981757,0.00006342414,0.00022050769,0.00067758124,0.00046235748,0.0004004406],"domain_scores_gemma":[0.9983684,0.00019524289,0.0002337125,0.00067773537,0.00030089804,0.00022402867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002775226,0.00032744836,0.00031505828,0.00093920226,0.00023829115,0.0001489854,0.0012659514,0.0004040856,0.0000019347399],"category_scores_gemma":[0.000015770416,0.00039951788,0.00020815845,0.00019072495,0.000087135224,0.00024289727,0.00072276336,0.000508502,0.000026607195],"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.000012594529,0.000013649709,6.813051e-7,0.000022652983,0.00005872696,0.00020766033,0.000010359994,0.0022300205,0.0000021250953,0.661584,0.318688,0.017169518],"study_design_scores_gemma":[0.00033006343,0.000047664307,0.00004782304,0.00003962007,0.000048559697,0.000027153788,0.000001769233,0.021880774,0.000080908736,0.000017106837,0.9770425,0.00043605088],"about_ca_topic_score_codex":0.00002619768,"about_ca_topic_score_gemma":8.87628e-7,"teacher_disagreement_score":0.6615669,"about_ca_system_score_codex":0.00036329043,"about_ca_system_score_gemma":0.00033133893,"threshold_uncertainty_score":0.9998457},"labels":[],"label_agreement":null},{"id":"W1507638461","doi":"10.1007/978-3-540-31856-9_42","title":"Fast Pruning of Geometric Spanners","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Spanner; Combinatorics; Bounded function; Pruning; Binary logarithm; Sequence (biology); Graph; Order (exchange); Constant (computer programming); Mathematics; Set (abstract data type); Computer science; Discrete mathematics; Database","score_opus":0.01626230688773359,"score_gpt":0.24236896892779175,"score_spread":0.22610666204005817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507638461","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.00023549981,0.00074823224,0.9923072,0.00041976225,0.0012140145,0.00023143247,0.000003822492,0.00008308606,0.0047569848],"genre_scores_gemma":[0.30666506,0.00006702952,0.69083935,0.0006181576,0.00074195553,0.000004681346,0.000011340292,0.000025358477,0.0010270259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675286,0.00002528453,0.0005818839,0.0010642073,0.001122685,0.00045306585],"domain_scores_gemma":[0.9978331,0.00041762236,0.0003907026,0.0008404732,0.0003811035,0.0001370195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000812159,0.00037397476,0.0004488932,0.0025515265,0.00015911777,0.00023131506,0.0021900672,0.00021693046,0.000031487558],"category_scores_gemma":[0.00011816263,0.0003676822,0.00013220862,0.0021392726,0.00034243034,0.0006357281,0.0008517696,0.00048210597,0.000031841235],"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.0000017448646,0.000016733835,0.000017310345,0.000016982813,0.0000063579723,0.000009174545,0.00018459943,0.33692217,0.0001240828,0.013956576,0.000014984283,0.6487293],"study_design_scores_gemma":[0.0003513992,0.00024452296,0.0004586512,0.00030024917,0.000011349899,0.00007524932,2.099866e-7,0.94026333,0.0056854105,0.047644086,0.0042119487,0.0007535886],"about_ca_topic_score_codex":0.00000947348,"about_ca_topic_score_gemma":0.000019892148,"teacher_disagreement_score":0.6479757,"about_ca_system_score_codex":0.00022111463,"about_ca_system_score_gemma":0.00059098535,"threshold_uncertainty_score":0.9998775},"labels":[],"label_agreement":null},{"id":"W1510263261","doi":"10.1007/978-3-540-34958-7_13","title":"How Efficient are Delaunay Refined Meshes? An Empirical Study","year":2007,"lang":"en","type":"book-chapter","venue":"","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":"Polygon mesh; Measure (data warehouse); Delaunay triangulation; Mathematics; Piecewise; Algorithm; Piecewise linear function; Function (biology); Applied mathematics; Computer science; Mathematical optimization; Geometry; Mathematical analysis; Data mining","score_opus":0.0744871153535283,"score_gpt":0.3181338704155267,"score_spread":0.2436467550619984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510263261","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.0026061607,0.00023732844,0.8416085,0.0012460778,0.0009943516,0.000701094,0.0000068403697,0.0004257296,0.15217388],"genre_scores_gemma":[0.1085197,0.000010455191,0.045772802,0.0020798114,0.001012967,0.000021761902,0.00010289951,0.000064893524,0.8424147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974231,0.000050384788,0.00036729092,0.00094145106,0.00093213236,0.00028561265],"domain_scores_gemma":[0.99817854,0.00012490917,0.00024155862,0.0008512764,0.0003688243,0.0002348994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005852359,0.000381546,0.00036597502,0.00048792802,0.00018878131,0.00044662747,0.00077638205,0.00024399806,0.00009387406],"category_scores_gemma":[0.000032624048,0.00033141993,0.00013958981,0.00019103214,0.00003247149,0.0002316752,0.00030828197,0.0003259958,0.00011465614],"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.00009299618,0.0017341509,0.00028022914,0.000046164554,0.0003055133,0.0006467281,0.0014717962,0.013496097,0.00004199138,0.6987133,0.018718202,0.26445282],"study_design_scores_gemma":[0.0018748237,0.0025950496,0.0075401794,0.000096028976,0.0001427678,0.00013499375,0.00022409618,0.19618863,0.00022629127,0.014514991,0.77393055,0.0025316211],"about_ca_topic_score_codex":0.0000040175155,"about_ca_topic_score_gemma":0.0001128003,"teacher_disagreement_score":0.79583573,"about_ca_system_score_codex":0.00011336969,"about_ca_system_score_gemma":0.00013064634,"threshold_uncertainty_score":0.9999138},"labels":[],"label_agreement":null},{"id":"W1512495408","doi":"10.1023/a:1013587415197","title":"Optimal BSR Solutions to Several Convex Polygon Problems","year":2002,"lang":"en","type":"article","venue":"The Journal of Supercomputing","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 Ottawa","funders":"","keywords":"Polygon (computer graphics); Regular polygon; Computer science; Convex polygon; Star-shaped polygon; Point in polygon; Reduction (mathematics); Constant (computer programming); Convex set; Rectilinear polygon; Algorithm; Combinatorics; Mathematics; Convex optimization; Simple polygon; Geometry; Telecommunications","score_opus":0.04107786948675623,"score_gpt":0.23524618273809336,"score_spread":0.19416831325133713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512495408","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.3025896,0.0003972221,0.6918573,0.004357698,0.00047695494,0.000079975915,5.066421e-7,0.00002550794,0.00021524909],"genre_scores_gemma":[0.9307606,0.000018145956,0.06788971,0.00068735046,0.0004883261,5.7320176e-7,4.2869317e-7,0.000006066795,0.00014875864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864924,0.00014655339,0.00041978402,0.00011885393,0.00038392656,0.0002816389],"domain_scores_gemma":[0.99909216,0.00020878398,0.00013141625,0.00019004096,0.0002505456,0.00012704621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134216,0.00010822849,0.00015524177,0.00018464238,0.0003902578,0.0001320872,0.0007148157,0.00003168155,0.000036452122],"category_scores_gemma":[0.00006306481,0.00007874117,0.00008593051,0.0005769216,0.00002563402,0.0005198941,0.0002223297,0.00023535936,0.00006119063],"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.0000048843317,0.00007458042,0.000056857167,0.000006114041,0.000031232288,0.000007750712,0.0057938974,0.95814484,0.0052489857,0.0028824713,0.005282967,0.02246544],"study_design_scores_gemma":[0.00034902286,0.00026281594,0.0010274432,0.00005506852,0.000016144266,0.00089641643,0.00014064943,0.9920607,0.000926459,0.00048527785,0.00362319,0.00015676256],"about_ca_topic_score_codex":0.000010948228,"about_ca_topic_score_gemma":0.0000016689925,"teacher_disagreement_score":0.628171,"about_ca_system_score_codex":0.000054328182,"about_ca_system_score_gemma":0.000042410156,"threshold_uncertainty_score":0.32109717},"labels":[],"label_agreement":null},{"id":"W1512882170","doi":"10.48550/arxiv.0906.2924","title":"Lower Bounds for Pinning Lines by Balls","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Disjoint sets; Combinatorics; Transversal (combinatorics); Subfamily; Line (geometry); Regular polygon; Mathematics; Pairwise comparison; Unit (ring theory); Integer (computer science); Property (philosophy); Discrete mathematics; Computer science; Geometry; Mathematical analysis; Statistics","score_opus":0.04073148470873926,"score_gpt":0.29316171878175706,"score_spread":0.2524302340730178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512882170","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.20469126,0.00085071014,0.7889379,0.0027704637,0.0018960352,0.00029775992,0.000014491845,0.00016786769,0.00037348413],"genre_scores_gemma":[0.9059288,0.00008523151,0.08473994,0.003666732,0.0015116191,0.00010525238,0.0003431093,0.000024653391,0.0035947002],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984052,0.000041162508,0.00033898326,0.00068276346,0.00025083666,0.0002810607],"domain_scores_gemma":[0.9988065,0.00012323029,0.00019062971,0.00053052715,0.0002583679,0.00009078219],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034493592,0.00024604934,0.00024613738,0.00013453989,0.00018239928,0.00028875668,0.00080453325,0.00019861283,0.000012796602],"category_scores_gemma":[0.000097327065,0.00025517,0.0001657449,0.0002414951,0.00002236125,0.00024996922,0.0004456032,0.0002577793,0.000049854043],"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.000115929324,0.0012407737,0.016581554,0.0005645858,0.00043849356,0.000045541936,0.0014680396,0.122959,0.023859523,0.0346812,0.49184686,0.30619848],"study_design_scores_gemma":[0.0013205647,0.0005539535,0.040667247,0.00035724175,0.00007796095,0.000019732872,0.000009597841,0.29271588,0.01639756,0.047102008,0.59889513,0.0018831212],"about_ca_topic_score_codex":0.000012926411,"about_ca_topic_score_gemma":0.000003019413,"teacher_disagreement_score":0.704198,"about_ca_system_score_codex":0.000058153237,"about_ca_system_score_gemma":0.0001881719,"threshold_uncertainty_score":0.99999005},"labels":[],"label_agreement":null},{"id":"W1515108012","doi":"10.1142/s0218195900000036","title":"COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Université du Québec en Outaouais","funders":"","keywords":"Ackermann function; Combinatorics; Line segment; Omega; Mathematics; Line (geometry); Inverse; Planar; Binary logarithm; Set (abstract data type); Function (biology); Discrete mathematics; Algorithm; Computer science; Geometry; Physics","score_opus":0.01232425687127098,"score_gpt":0.31876264280377237,"score_spread":0.3064383859325014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515108012","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.1276873,0.00041524047,0.868922,0.0006996196,0.00038468596,0.00025781308,0.00003839372,0.00004823895,0.0015467182],"genre_scores_gemma":[0.81117207,0.00004127685,0.18769339,0.00034777244,0.0005286881,0.000015186213,0.0000824917,0.000013319079,0.00010582448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657106,0.00011502768,0.0012969418,0.00033809384,0.0014426184,0.00023625318],"domain_scores_gemma":[0.9959967,0.0006065912,0.00096982,0.0002495809,0.0020175963,0.0001597188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007538731,0.00021476379,0.00033468055,0.00081637374,0.00019197474,0.00020512509,0.0015150729,0.00006593272,0.00021144825],"category_scores_gemma":[0.000051972875,0.0002302782,0.00024221418,0.0012313909,0.00008192451,0.0008577,0.00015508334,0.0002564578,0.00007835016],"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.00002779055,0.00038697652,0.0011062381,0.000015606578,0.00023561816,0.0000111077825,0.00017638667,0.5948731,0.0006652115,0.025574261,0.00036589347,0.37656182],"study_design_scores_gemma":[0.007615438,0.00060920167,0.057084903,0.0004174082,0.00016549054,0.0024783192,0.00018222663,0.6124689,0.007718411,0.21766001,0.092111625,0.0014880456],"about_ca_topic_score_codex":0.000009991085,"about_ca_topic_score_gemma":0.0000013612928,"teacher_disagreement_score":0.68348473,"about_ca_system_score_codex":0.00012356378,"about_ca_system_score_gemma":0.00033266947,"threshold_uncertainty_score":0.9390472},"labels":[],"label_agreement":null},{"id":"W1516502686","doi":"10.3233/sfc-2010-0105","title":"Automated hexahedral mesh generation of complex biological objects","year":2010,"lang":"en","type":"article","venue":"Strength Fracture and Complexity","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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 Ottawa","funders":"","keywords":"Hexahedron; Computer science; Mesh generation; Geology; Engineering; Finite element method; Structural engineering","score_opus":0.06864542504435425,"score_gpt":0.2962007474065553,"score_spread":0.22755532236220102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516502686","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.9000811,0.000066717876,0.09711338,0.0009747449,0.00039355815,0.00015533764,0.000014745805,0.00030779908,0.00089264405],"genre_scores_gemma":[0.9435976,0.000008755297,0.055408508,0.00059049344,0.00022388514,0.000004744421,0.00014353996,0.0000035356998,0.000018907482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989752,0.000075381875,0.0002515656,0.00032490492,0.00019973249,0.00017321714],"domain_scores_gemma":[0.99927497,0.00009435063,0.0001280812,0.00027035933,0.00013618829,0.00009606291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017456533,0.00014755211,0.00020003028,0.000091217276,0.00017953495,0.00008268309,0.00027308337,0.000111861154,0.000102186976],"category_scores_gemma":[0.000054533455,0.00012042588,0.000052589923,0.00026926762,0.00012841253,0.00022910314,0.00010946487,0.00020268597,0.0000051827246],"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.000045435787,0.00059050013,0.003924086,0.000053937067,0.00009956234,0.000012649578,0.001537382,0.0012055589,0.35694352,0.5323265,0.016918387,0.086342484],"study_design_scores_gemma":[0.00066685124,0.0002606881,0.19028288,0.000007095547,0.000010563179,0.0000472555,0.00002703547,0.7455559,0.03056804,0.019196337,0.013020852,0.0003565333],"about_ca_topic_score_codex":0.000037812788,"about_ca_topic_score_gemma":0.00009534794,"teacher_disagreement_score":0.7443503,"about_ca_system_score_codex":0.000006778335,"about_ca_system_score_gemma":0.000053687894,"threshold_uncertainty_score":0.4910825},"labels":[],"label_agreement":null},{"id":"W1517258173","doi":"10.20382/jocg.v5i1a14","title":"Incidences with $k$-non-degenerate sets and their applications","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israeli Centers for Research Excellence; National Science Foundation","keywords":"Combinatorics; Mathematics; Degenerate energy levels; Upper and lower bounds; Plane (geometry); Polynomial; Degree (music); Space (punctuation); Set (abstract data type); Discrete mathematics; Geometry; Mathematical analysis; Physics","score_opus":0.006298468167368431,"score_gpt":0.18590014177228512,"score_spread":0.1796016736049167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517258173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2959051,0.00013658848,0.70244783,0.00073383405,0.00007431034,0.00013782592,0.00000261743,0.00001856771,0.0005432873],"genre_scores_gemma":[0.9030314,0.000033918994,0.09634443,0.00022135551,0.00010234239,0.0000014045024,0.000007271465,0.0000060561238,0.00025178184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889135,0.00007265259,0.0002751,0.00022742352,0.0003696359,0.00016383569],"domain_scores_gemma":[0.9980198,0.0002905385,0.00037409738,0.00013557354,0.0009900946,0.00018987137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022064299,0.00015675659,0.00021555282,0.0009646759,0.000229582,0.00020620308,0.0004948545,0.000052908446,0.0000276463],"category_scores_gemma":[0.000013846147,0.00012779009,0.000070181784,0.001636744,0.00008204442,0.00151098,0.00012511821,0.00017018274,0.0000154287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008836829,0.00039248227,0.0055753943,0.00007820976,0.0005189663,0.0001054427,0.0012081739,0.6296462,0.0025540374,0.11524041,0.0034699282,0.24112238],"study_design_scores_gemma":[0.007277054,0.0028459057,0.1933598,0.00028639185,0.000177243,0.0031716987,0.0025185726,0.5631488,0.004934465,0.1523362,0.06786022,0.0020836322],"about_ca_topic_score_codex":0.000012560225,"about_ca_topic_score_gemma":0.0000026994992,"teacher_disagreement_score":0.6071263,"about_ca_system_score_codex":0.000066878085,"about_ca_system_score_gemma":0.00028279994,"threshold_uncertainty_score":0.52111286},"labels":[],"label_agreement":null},{"id":"W1519506066","doi":"10.1007/978-3-540-85363-3_41","title":"Near Optimal Dimensionality Reductions That Preserve Volumes","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Combinatorics; Dimension (graph theory); Linear subspace; Affine space; Euclidean space; Projection (relational algebra); Space (punctuation); Mathematics; Subspace topology; Curse of dimensionality; Dimensionality reduction; Affine transformation; Discrete mathematics; Geometry; Algorithm; Mathematical analysis; Computer science; Statistics","score_opus":0.029808267614252662,"score_gpt":0.2561323078202257,"score_spread":0.22632404020597308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519506066","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.0017279675,0.0009140226,0.99156517,0.0014521009,0.0024543065,0.00034814986,0.00000931988,0.0001840457,0.0013448907],"genre_scores_gemma":[0.19047175,0.0001376594,0.8049456,0.0010162112,0.0009293973,0.000017557752,0.000040971223,0.000034968725,0.0024059196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603206,0.000055749555,0.000462587,0.0015537678,0.0013554525,0.0005404134],"domain_scores_gemma":[0.99753994,0.00037576954,0.00026154108,0.0012005657,0.00041127673,0.00021091364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006240597,0.00046144985,0.00042080318,0.0005800561,0.00077100436,0.0005820181,0.0020957417,0.00027229585,0.00004569203],"category_scores_gemma":[0.00009740669,0.00045045395,0.00017812778,0.0007649628,0.0008361388,0.0010396542,0.0012922012,0.00067860604,0.00007202039],"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.000007816015,0.00006261084,0.00005840147,0.000019714551,0.000022087359,0.000076817625,0.00076619163,0.68426764,0.00007113864,0.008893069,0.000909084,0.30484542],"study_design_scores_gemma":[0.0002166401,0.00013294746,0.0007069746,0.00011776563,0.000008429606,0.00030577925,1.2711887e-7,0.9502774,0.0010530925,0.031501193,0.015036939,0.00064272416],"about_ca_topic_score_codex":0.00003220798,"about_ca_topic_score_gemma":0.000024495028,"teacher_disagreement_score":0.3042027,"about_ca_system_score_codex":0.00025730723,"about_ca_system_score_gemma":0.0010878866,"threshold_uncertainty_score":0.9997947},"labels":[],"label_agreement":null},{"id":"W1519709295","doi":"10.1007/978-3-642-36763-2_25","title":"Kinetic and Stationary Point-Set Embeddability for Plane Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Mathematics; Combinatorics; Plane (geometry); Time complexity; Embedding; Graph; Function (biology); Algebraic number; Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.016842775682434828,"score_gpt":0.2504623982825729,"score_spread":0.23361962260013805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519709295","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.00075929624,0.00043201525,0.9954996,0.0009068632,0.0009838602,0.0007425583,0.000026927319,0.00008386206,0.0005649991],"genre_scores_gemma":[0.16015394,0.000047224814,0.8371925,0.0015667103,0.0003551492,0.000054036307,0.00009592886,0.000024874484,0.0005096477],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735546,0.000030099221,0.00043363773,0.0012216126,0.0005718476,0.00038733374],"domain_scores_gemma":[0.9977184,0.0009508672,0.00019579854,0.00062837405,0.00035158466,0.00015496225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066596305,0.0003532724,0.00033628734,0.0006359352,0.0002574875,0.000424557,0.000997461,0.00018306736,0.000033061384],"category_scores_gemma":[0.00011600731,0.00033057088,0.00007912278,0.00038319314,0.00040452628,0.00063523033,0.00047458857,0.00028946868,0.000019155204],"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.000011630152,0.000032587744,0.00004832486,0.00010737677,0.0000143112065,0.000009845067,0.00062301743,0.049121127,0.0001802172,0.1386705,0.00029021804,0.81089085],"study_design_scores_gemma":[0.00022190965,0.00018292057,0.00056422624,0.000058009682,0.0000049659297,0.00004106378,1.281837e-7,0.46004757,0.000234036,0.5368236,0.0015006105,0.00032099313],"about_ca_topic_score_codex":0.0000141867395,"about_ca_topic_score_gemma":0.000023619987,"teacher_disagreement_score":0.8105698,"about_ca_system_score_codex":0.000100070676,"about_ca_system_score_gemma":0.00030346386,"threshold_uncertainty_score":0.99991465},"labels":[],"label_agreement":null},{"id":"W1521937241","doi":"10.1007/978-3-642-18469-7_28","title":"Complexity of Finding Non-Planar Rectilinear Drawings of Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council; Michael Smith Health Research BC","keywords":"Vertex (graph theory); Planar graph; Combinatorics; NP-complete; Planar; Time complexity; Enhanced Data Rates for GSM Evolution; Computer science; Computational complexity theory; Degree (music); Mathematics; Discrete mathematics; Graph; Algorithm; Artificial intelligence; Computer graphics (images)","score_opus":0.04288147402704064,"score_gpt":0.26293117609485334,"score_spread":0.22004970206781269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521937241","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.0016805768,0.00017253916,0.9934807,0.000102468126,0.0011568278,0.00025463555,0.000009774375,0.000042975473,0.0030995444],"genre_scores_gemma":[0.54697067,0.000025044435,0.4525676,0.00017073625,0.00012412762,0.0000024166434,0.000009712146,0.0000148775935,0.00011478535],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971914,0.000031712836,0.00070358464,0.00090414495,0.0008205279,0.0003486075],"domain_scores_gemma":[0.99767697,0.0003280155,0.00059180736,0.0008405456,0.0004581843,0.000104480074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088916696,0.00034313614,0.00057916297,0.0012563138,0.0001457047,0.00007760162,0.001999767,0.00021249233,0.000025610634],"category_scores_gemma":[0.00007703664,0.00033505092,0.00016990668,0.0010072177,0.00089282275,0.00041381386,0.0005153535,0.00041570206,0.000008223002],"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.000035041056,0.00014362436,0.00034919987,0.00028021177,0.0000570974,0.000037113146,0.0034477022,0.036471754,0.005501368,0.35723382,0.000060298597,0.5963828],"study_design_scores_gemma":[0.00031057323,0.00036413458,0.001209642,0.0004743593,0.000014254457,0.000044072796,2.2444569e-7,0.24202226,0.042381596,0.7123719,0.00027616607,0.00053083576],"about_ca_topic_score_codex":0.00006692281,"about_ca_topic_score_gemma":0.000040810934,"teacher_disagreement_score":0.59585196,"about_ca_system_score_codex":0.00007900434,"about_ca_system_score_gemma":0.00044821447,"threshold_uncertainty_score":0.9999102},"labels":[],"label_agreement":null},{"id":"W1522158825","doi":"10.1109/iciap.1999.797625","title":"Constructing iso-surfaces satisfying the Delaunay constraint. Application to the skeleton computation","year":2003,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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 Toronto","funders":"European Synchrotron Radiation Facility","keywords":"Delaunay triangulation; Constrained Delaunay triangulation; Bowyer–Watson algorithm; Mathematics; Voronoi diagram; Topological skeleton; Surface (topology); Skeleton (computer programming); Computation; Surface triangulation; Medial axis; Computer science; Topology (electrical circuits); Combinatorics; Geometry; Algorithm; Artificial intelligence","score_opus":0.014295775638244052,"score_gpt":0.2560316857049948,"score_spread":0.24173591006675074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522158825","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.027602859,0.000068898284,0.9571955,0.0057847146,0.00034562402,0.00045909817,0.0000013380331,0.000108404674,0.008433554],"genre_scores_gemma":[0.89062214,0.0000024616556,0.10783514,0.0013239013,0.000058932903,0.000035332218,0.000006477728,0.0000047546373,0.00011084869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872214,0.00019882692,0.0002653003,0.00031267878,0.00030556475,0.00019551025],"domain_scores_gemma":[0.99886006,0.00050763285,0.00011151857,0.0002934387,0.00016753092,0.00005979581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008662094,0.00011921009,0.000090616435,0.00006396645,0.0005566843,0.00030423046,0.00039707794,0.000034737914,0.000017987864],"category_scores_gemma":[0.00014057224,0.00007409907,0.000041977193,0.00078864046,0.000058480367,0.00024471607,0.000072490926,0.000113884234,0.0000943668],"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":[9.894703e-7,0.000009302791,0.00038314197,0.0000028662155,0.000010617471,2.846778e-7,0.00046745405,0.09997755,0.00085340743,0.6284269,0.00082071713,0.26904675],"study_design_scores_gemma":[0.000353147,0.00006835387,0.0027996392,0.000014157696,0.00001461004,0.00014684461,0.0012980596,0.9173147,0.01101931,0.03536461,0.031247495,0.0003590497],"about_ca_topic_score_codex":0.000033819106,"about_ca_topic_score_gemma":0.00008147031,"teacher_disagreement_score":0.8630193,"about_ca_system_score_codex":0.000050334187,"about_ca_system_score_gemma":0.000094044386,"threshold_uncertainty_score":0.42816216},"labels":[],"label_agreement":null},{"id":"W1522686611","doi":"10.1007/s40590-015-0080-8","title":"Hamiltonian tetrahedralizations with Steiner points","year":2015,"lang":"es","type":"article","venue":"Boletín de la Sociedad Matemática Mexicana","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 British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Hamiltonian path; Convex hull; Tetrahedron; Hamiltonian (control theory); General position; Vertex (graph theory); Dual graph; Discrete mathematics; Graph; Regular polygon; Geometry; Planar graph; Mathematical optimization","score_opus":0.016182962516908445,"score_gpt":0.27586357043105003,"score_spread":0.2596806079141416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522686611","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.1752459,0.0017008936,0.7390078,0.018801074,0.00085111713,0.0007769861,0.000087840446,0.00058197445,0.06294643],"genre_scores_gemma":[0.93790674,0.000085361,0.056750312,0.0017441394,0.0003552278,0.00003806279,0.00004415146,0.000050290357,0.0030257031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969538,0.0004933754,0.00042320648,0.0006369148,0.00084388105,0.0006488493],"domain_scores_gemma":[0.9977863,0.00027154823,0.00020201222,0.00062497734,0.0004620274,0.00065312884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010939611,0.00036869297,0.0003559344,0.00021000639,0.00033416486,0.0009213526,0.0006782726,0.00023842193,0.000079497746],"category_scores_gemma":[0.00021018031,0.0003391939,0.00011320805,0.0012356802,0.0003452757,0.00051318656,0.00020592002,0.00029829273,0.00020776296],"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.000065365166,0.0005716335,0.008479089,0.00017460571,0.00028144478,0.00019448876,0.0039971406,0.01641797,0.00073859835,0.9066136,0.053174496,0.009291593],"study_design_scores_gemma":[0.006209057,0.001359145,0.100763,0.00075463025,0.00051628536,0.0007430336,0.0016977129,0.29099724,0.0038407356,0.05211691,0.53807795,0.002924306],"about_ca_topic_score_codex":0.00016045998,"about_ca_topic_score_gemma":0.00002480617,"teacher_disagreement_score":0.85449666,"about_ca_system_score_codex":0.0002814871,"about_ca_system_score_gemma":0.0014804973,"threshold_uncertainty_score":0.999906},"labels":[],"label_agreement":null},{"id":"W1522901264","doi":"10.1007/978-3-540-34958-7_19","title":"Implementation in ALBERTA of an Automatic Tetrahedral Mesh Generator","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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":"Tetrahedron; Hexahedron; Generator (circuit theory); Cube (algebra); Boundary (topology); Generalization; Domain (mathematical analysis); Computer science; Mesh generation; Code (set theory); Computational science; Algorithm; Finite element method; Topology (electrical circuits); Geometry; Mathematics; Engineering; Structural engineering; Combinatorics; Mathematical analysis; Programming language; Physics; Set (abstract data type)","score_opus":0.02503369297276872,"score_gpt":0.30159274382931417,"score_spread":0.2765590508565455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522901264","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.019265879,0.00021748769,0.53467476,0.000385123,0.0011867257,0.0011241862,0.000020542637,0.00018890567,0.4429364],"genre_scores_gemma":[0.278534,0.000050185325,0.4338148,0.0013827046,0.00075003906,0.000035428857,0.0008148289,0.00009011146,0.2845279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984227,0.000023867236,0.0005964523,0.00038359442,0.00039939693,0.00017401193],"domain_scores_gemma":[0.9991209,0.000100062905,0.00022350861,0.00035866597,0.000117865195,0.00007903026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034254036,0.0002030633,0.00025230786,0.0005656277,0.00003496634,0.00005601923,0.00038999342,0.00014362132,0.0005049961],"category_scores_gemma":[0.000008378105,0.00020487692,0.000073580246,0.00015064642,0.000020209973,0.00042286722,0.000089827605,0.00011670036,0.000035348097],"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.000001973723,0.00002865901,0.00002471969,0.0000251926,0.000017552695,0.000006898543,0.00019439275,0.00030209112,0.00015876473,0.8027645,0.00033441267,0.19614087],"study_design_scores_gemma":[0.0028611189,0.001197194,0.0054383692,0.00022038688,0.00008098431,0.00009916229,0.000073465446,0.71151555,0.019940907,0.21072842,0.04566717,0.0021772939],"about_ca_topic_score_codex":0.00029879215,"about_ca_topic_score_gemma":0.004226774,"teacher_disagreement_score":0.7112134,"about_ca_system_score_codex":0.000077186145,"about_ca_system_score_gemma":0.00019149396,"threshold_uncertainty_score":0.8354639},"labels":[],"label_agreement":null},{"id":"W1523269886","doi":"10.48550/arxiv.1411.7277","title":"$1$-String $B_2$-VPG Representation of Planar Graphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planar; Combinatorics; Planar graph; String (physics); Representation (politics); Enhanced Data Rates for GSM Evolution; Graph; Mathematics; Grid; Computer science; Geometry; Artificial intelligence; Computer graphics (images)","score_opus":0.07463916650787789,"score_gpt":0.20145981936537247,"score_spread":0.12682065285749458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523269886","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.32203683,0.000028787492,0.67633235,0.00005344671,0.0004562534,0.000126951,0.0000060920547,0.00008263219,0.00087665574],"genre_scores_gemma":[0.992676,0.00006156878,0.0065908954,0.00005135504,0.00007271732,6.473539e-7,0.00005848927,0.0000076290576,0.0004806608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985881,0.00014111827,0.0002372894,0.0007263921,0.00013161161,0.00017549995],"domain_scores_gemma":[0.9984409,0.00015053309,0.00034445425,0.0007627761,0.0002114408,0.00008988247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022013136,0.00018266903,0.00026185004,0.00043573123,0.00009512791,0.000059590468,0.00090459,0.00015998915,0.000011658917],"category_scores_gemma":[0.00004728909,0.00022427233,0.00018045961,0.00083505345,0.000049899645,0.0002876951,0.00054292276,0.0002391839,0.000022089404],"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.000011972304,0.000034314155,0.0013275734,0.000045536755,0.00004325437,0.000018837687,0.00008794485,0.49914706,0.00017188687,0.49736705,0.00031689202,0.0014276768],"study_design_scores_gemma":[0.00042129916,0.000058122187,0.004917802,0.000073337564,0.00004859781,0.0000047210247,0.00002365299,0.68725944,0.002459825,0.30401233,0.00039310343,0.00032775823],"about_ca_topic_score_codex":0.000091278365,"about_ca_topic_score_gemma":0.000013969239,"teacher_disagreement_score":0.6706392,"about_ca_system_score_codex":0.00005945872,"about_ca_system_score_gemma":0.0001145931,"threshold_uncertainty_score":0.914556},"labels":[],"label_agreement":null},{"id":"W1525225516","doi":"10.1007/978-3-642-03367-4_32","title":"Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Queen's University","funders":"","keywords":"Perimeter; Polygon (computer graphics); Computer science; Algorithm; Set (abstract data type); Line (geometry); Rectilinear polygon; Simple polygon; Mathematics; Monotone polygon; Geometry; Programming language; Telecommunications","score_opus":0.042727481831830054,"score_gpt":0.2994706362007461,"score_spread":0.25674315436891604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525225516","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.00085635326,0.00017997649,0.9964688,0.00032880882,0.0012152292,0.00060109835,0.00001253174,0.00006445439,0.00027278406],"genre_scores_gemma":[0.1964335,0.0000069548246,0.8021956,0.00043329922,0.0006074497,0.000014036956,0.000041655836,0.00001892572,0.00024859543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972474,0.000029053155,0.00063749735,0.0010088475,0.0006737947,0.00040343578],"domain_scores_gemma":[0.99811256,0.00044330247,0.00047614268,0.00052680593,0.00035125265,0.00008994629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000943445,0.00036472612,0.00043305606,0.0010893857,0.00019395593,0.00026688297,0.0012028621,0.00020851681,0.000007589324],"category_scores_gemma":[0.00012894352,0.00035885305,0.00016362444,0.00060595263,0.0001500325,0.00056789233,0.00040745368,0.00030771975,0.000004711279],"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.00001285754,0.00002559413,0.000004071533,0.00006079023,0.00001336737,0.0000041207313,0.0012974305,0.052933436,0.0021992496,0.0025299273,0.00000845132,0.9409107],"study_design_scores_gemma":[0.00038440406,0.00045546985,0.000024363038,0.00032689073,0.00001022033,0.000030669315,6.531511e-7,0.9324526,0.018060822,0.04768486,0.00020841695,0.00036063904],"about_ca_topic_score_codex":0.0000055740466,"about_ca_topic_score_gemma":0.0000076134297,"teacher_disagreement_score":0.9405501,"about_ca_system_score_codex":0.00021180099,"about_ca_system_score_gemma":0.00029448318,"threshold_uncertainty_score":0.99988633},"labels":[],"label_agreement":null},{"id":"W1528496018","doi":"10.1023/a:1014444525059","title":"An Optimal Strategy for the Constrained Cycle Cover Problem","year":2002,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","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":"HEC Montréal; Université de Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Cover (algebra); Decomposition; Constraint (computer-aided design); Set cover problem; Set (abstract data type); Complex system; Theoretical computer science; Mathematics; Artificial intelligence; Engineering","score_opus":0.17371864583893756,"score_gpt":0.3546069838677639,"score_spread":0.18088833802882634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528496018","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.017859701,0.00023436648,0.9799435,0.001271046,0.000046746503,0.00021927833,0.000007318592,0.000018453287,0.00039956588],"genre_scores_gemma":[0.90452343,0.0000884953,0.095131405,0.00014180114,0.000050611903,0.000014459977,0.0000014673612,0.000003590754,0.000044759185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928945,0.000013607772,0.00028249173,0.00015107194,0.00013449935,0.00012885766],"domain_scores_gemma":[0.9991593,0.00032811824,0.00010702667,0.00018197933,0.00017748648,0.00004613004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038206961,0.00007650792,0.000102018894,0.00003839078,0.00013990907,0.00014085411,0.00026770076,0.0000273838,0.000049264425],"category_scores_gemma":[0.000046835317,0.000056095185,0.000041490704,0.00014648058,0.00008229624,0.00021943267,0.000030788044,0.00003860148,0.000009340441],"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.0000029302955,0.00017974719,4.19617e-7,0.0000260354,0.000012114914,3.6893087e-7,0.0009363295,0.071998514,0.00075062574,0.65151536,0.00015633114,0.27442124],"study_design_scores_gemma":[0.000011561071,0.0001650562,0.0000031287047,0.00000984881,0.0000036406698,0.000003899022,0.00017776611,0.82340914,0.024972474,0.15095937,0.00022264918,0.00006147629],"about_ca_topic_score_codex":0.0000029355251,"about_ca_topic_score_gemma":0.0000018155202,"teacher_disagreement_score":0.88666373,"about_ca_system_score_codex":0.000001329196,"about_ca_system_score_gemma":0.000014506452,"threshold_uncertainty_score":0.22874953},"labels":[],"label_agreement":null},{"id":"W1529164554","doi":"10.1007/978-3-540-31843-9_3","title":"Hexagonal Grid Drawings: Algorithms and Lower Bounds","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Hexagonal crystal system; Grid; Hexagonal tiling; Combinatorics; Focus (optics); Simple (philosophy); Graph; Mathematics; Lattice graph; Simple graph; Algorithm; Computer science; Discrete mathematics; Geometry; Line graph; Physics; Optics; Voltage graph","score_opus":0.012093589034696475,"score_gpt":0.24060870073593615,"score_spread":0.22851511170123967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529164554","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.0002018206,0.001115722,0.99101585,0.0014044205,0.0032747588,0.00022463143,0.000006609473,0.0001237826,0.0026323956],"genre_scores_gemma":[0.0649406,0.00015643713,0.92367405,0.004606488,0.0043616355,0.000012026053,0.000026077609,0.000043986307,0.0021786958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653256,0.000024848061,0.0004542932,0.001451488,0.0010111594,0.0005256609],"domain_scores_gemma":[0.9983147,0.00032533988,0.00019682037,0.0006960633,0.0002551501,0.00021196561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007334259,0.0004633175,0.0003895395,0.00083189394,0.00036489725,0.0009202679,0.001502645,0.00025461905,0.00003802303],"category_scores_gemma":[0.0000531112,0.00044757832,0.00010054281,0.0005868618,0.00052210223,0.00089706015,0.0010160941,0.0005975039,0.000041006202],"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.000004115039,0.00002891069,0.00001417215,0.000014855875,0.000010019067,0.00004916487,0.00031760646,0.03519328,0.00007104477,0.021531725,0.00009478979,0.94267035],"study_design_scores_gemma":[0.00037193013,0.00025209875,0.0003588093,0.00018845116,0.000009628568,0.00027927177,9.7072906e-8,0.8363881,0.00052525516,0.12389829,0.036854956,0.00087307143],"about_ca_topic_score_codex":0.000007957179,"about_ca_topic_score_gemma":0.000028632243,"teacher_disagreement_score":0.94179726,"about_ca_system_score_codex":0.00021424663,"about_ca_system_score_gemma":0.0005697657,"threshold_uncertainty_score":0.9997976},"labels":[],"label_agreement":null},{"id":"W1531170768","doi":"10.1007/3-540-44842-x_84","title":"An Explicit Solution for Computing the Euclidean d-dimensional Voronoi Diagram of Spheres in a Floating-Point Arithmetic","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Calgary","funders":"University of Calgary","keywords":"Voronoi diagram; Weighted Voronoi diagram; Power diagram; Centroidal Voronoi tessellation; Euclidean geometry; Computation; Point (geometry); Diagram; Set (abstract data type); Mathematics; Euclidean distance; SPHERES; Algorithm; Computational geometry; Bowyer–Watson algorithm; Computer science; Geometry; Physics","score_opus":0.019167042624588838,"score_gpt":0.26274728331040426,"score_spread":0.2435802406858154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531170768","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.0028631657,0.0003589116,0.9941111,0.0006476823,0.0010997248,0.00073960726,0.00000520896,0.000050016588,0.00012454874],"genre_scores_gemma":[0.4715153,0.000004638324,0.52723444,0.00091278506,0.00026439156,0.000010209665,0.000014192242,0.000018990324,0.000025059631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996665,0.00011359547,0.00078913674,0.001130922,0.0007832618,0.0005180624],"domain_scores_gemma":[0.9971006,0.001149557,0.0004447016,0.0008188354,0.0003826981,0.00010359582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016457369,0.0003919403,0.000463517,0.00059364503,0.00031163235,0.00026591722,0.001607359,0.00019710303,0.000008975721],"category_scores_gemma":[0.00021162225,0.00032568793,0.00014211655,0.0007742271,0.00029990164,0.00047878077,0.00041681906,0.0004536798,0.0000030894166],"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.000007767713,0.000063894084,0.0000636808,0.000031802552,0.000006730584,0.000004583873,0.0005905272,0.5325614,0.00061477313,0.024758898,0.000024053617,0.4412719],"study_design_scores_gemma":[0.00032672434,0.0002656843,0.00026203634,0.00020172032,0.0000064466117,0.000025635247,0.0000010798564,0.90136164,0.0019081621,0.09517606,0.00013417946,0.0003305995],"about_ca_topic_score_codex":0.000077567085,"about_ca_topic_score_gemma":0.00041230296,"teacher_disagreement_score":0.46865216,"about_ca_system_score_codex":0.0002145978,"about_ca_system_score_gemma":0.0004266207,"threshold_uncertainty_score":0.99991953},"labels":[],"label_agreement":null},{"id":"W153260397","doi":"10.82308/10590","title":"Reconfigurations of polygonal structures","year":2005,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polygonal chain; Polygon (computer graphics); Polyhedron; Monotone polygon; Combinatorics; Control reconfiguration; Sequence (biology); Triangulation; Surface (topology); Point (geometry); Mathematics; Planar; Simple polygon; Dihedral angle; Regular polygon; Geometry; Computer science; Computer graphics (images); Physics","score_opus":0.017879285823855288,"score_gpt":0.2368389817842298,"score_spread":0.2189596959603745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153260397","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.93358487,0.00024751178,0.00271033,0.0006046993,0.0009390101,0.0003585507,0.00027126723,0.0003153639,0.06096841],"genre_scores_gemma":[0.9463916,0.000015734,0.052309353,0.0004838369,0.000078413854,0.000013856641,0.00002977656,0.000014095747,0.0006633351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99811673,0.00014050574,0.0005035113,0.00047052745,0.00047884544,0.0002898999],"domain_scores_gemma":[0.9986865,0.00017158111,0.0002133764,0.00047520438,0.00029113068,0.00016220083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040066452,0.00020542234,0.0002137383,0.00028499644,0.00050134124,0.0000709526,0.00066190463,0.0001156259,0.00020388397],"category_scores_gemma":[0.00019696847,0.00021160686,0.0001333889,0.0007009634,0.00004331952,0.0013345071,0.00015878581,0.00026543724,0.00011317438],"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.0000063443154,0.000052474308,0.000007510778,0.000006924479,0.000021753174,0.0000018222388,0.0000037887544,0.0037255103,0.03408442,0.6652993,0.000012392689,0.29677776],"study_design_scores_gemma":[0.0010216734,0.00021486447,0.0050079115,0.000038013495,0.000032511623,0.0001312388,0.000018995317,0.013922122,0.5389803,0.27027822,0.16962005,0.00073409267],"about_ca_topic_score_codex":0.000025306603,"about_ca_topic_score_gemma":0.0000702535,"teacher_disagreement_score":0.50489587,"about_ca_system_score_codex":0.00012609723,"about_ca_system_score_gemma":0.000053494943,"threshold_uncertainty_score":0.86290777},"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":"W1535808042","doi":"","title":"5-6-7 meshes","year":2012,"lang":"en","type":"article","venue":"Graphics Interface","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":"Simon Fraser University","funders":"","keywords":"Polygon mesh; Vertex (graph theory); Triangle mesh; Mesh generation; Laplacian smoothing; Computer science; T-vertices; Topology (electrical circuits); Mathematics; Combinatorics; Algorithm; Theoretical computer science; Finite element method; Physics; Computer graphics (images); Graph","score_opus":0.025518406705209145,"score_gpt":0.2804894123806826,"score_spread":0.2549710056754734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535808042","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.046185523,0.0009127814,0.94766265,0.00062452734,0.0009337357,0.000045019377,6.4284393e-7,0.00011346912,0.003521624],"genre_scores_gemma":[0.97875875,0.000016694012,0.020390114,0.00035218528,0.00012284261,0.000004618149,0.0000014694557,0.000003394306,0.00034990066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938846,0.00003319156,0.00010494037,0.00012840518,0.00015845652,0.00018655777],"domain_scores_gemma":[0.99955773,0.000056422734,0.00003306283,0.00021994609,0.00005403132,0.00007881292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026279577,0.000069645095,0.000057432713,0.000108072825,0.000077410856,0.000064257154,0.00032033963,0.000032478645,0.000021910242],"category_scores_gemma":[0.000028230077,0.000065342174,0.000040229745,0.0004230309,0.000019273723,0.0005524609,0.00011759811,0.000084337094,0.00012825988],"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.0000018568002,0.000061239385,0.0012557737,0.000004958189,0.000014866429,4.4236742e-7,0.0006559406,0.0005114589,0.0013481292,0.9779239,0.005438642,0.012782784],"study_design_scores_gemma":[0.0006606715,0.00022168523,0.036974028,0.000044365723,0.00002178943,0.00014462197,0.000105594176,0.13591048,0.15912879,0.09653079,0.56924903,0.0010081884],"about_ca_topic_score_codex":0.0000033466383,"about_ca_topic_score_gemma":0.0000014201339,"teacher_disagreement_score":0.93257326,"about_ca_system_score_codex":0.000011012498,"about_ca_system_score_gemma":0.000013738211,"threshold_uncertainty_score":0.26645765},"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":"W1539296241","doi":"10.1007/978-3-540-44400-8_15","title":"A Note on Point Subsets with a Specified Number of Interior Points","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Concordia University","funders":"","keywords":"Integer (computer science); Combinatorics; Convex hull; Plane (geometry); Point (geometry); Mathematics; Interior point method; Boundary (topology); Set (abstract data type); Regular polygon; Geometry; Discrete mathematics; Mathematical analysis; Algorithm; Computer science","score_opus":0.01586065914874254,"score_gpt":0.25547946848531383,"score_spread":0.2396188093365713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539296241","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.0012525085,0.00004966394,0.9902786,0.0007853382,0.0010434687,0.00034964585,0.000005884808,0.000060646435,0.0061742505],"genre_scores_gemma":[0.36040527,0.000016888946,0.63624674,0.0026209925,0.00026315445,0.000009453471,0.000009474056,0.00003673839,0.00039125982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966271,0.000049677703,0.000539845,0.0012416312,0.0011066443,0.0004350985],"domain_scores_gemma":[0.997783,0.0003851357,0.00028533852,0.0010273709,0.00037138883,0.00014773561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006482453,0.00047448257,0.0005217464,0.00071409065,0.00012791446,0.0002304444,0.001525065,0.0001986917,0.00005667503],"category_scores_gemma":[0.000071056864,0.00039598736,0.00012047327,0.0008145817,0.00037204725,0.00041289016,0.00040023235,0.00053044094,0.00006848959],"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.00016708109,0.00013705475,0.000101811514,0.0001143365,0.00004985075,0.0002603097,0.0020557968,0.050327275,0.0009924194,0.12787741,0.00018113261,0.8177355],"study_design_scores_gemma":[0.002431353,0.0022311069,0.001083338,0.0030573672,0.00004600161,0.0012817907,9.431013e-7,0.46228427,0.07457353,0.4428008,0.0069556423,0.0032538706],"about_ca_topic_score_codex":0.0000054913203,"about_ca_topic_score_gemma":0.000039487153,"teacher_disagreement_score":0.8144817,"about_ca_system_score_codex":0.0002285477,"about_ca_system_score_gemma":0.0004100889,"threshold_uncertainty_score":0.9998492},"labels":[],"label_agreement":null},{"id":"W154255124","doi":"","title":"Minimum Degree and the Orientation of a Graph.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Orientation (vector space); Graph; Combinatorics; Geometry; Physics","score_opus":0.013963262927331192,"score_gpt":0.23887480670042938,"score_spread":0.2249115437730982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154255124","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.9536532,0.0004424568,0.041407067,0.0021508287,0.0007568427,0.00016669932,6.43286e-7,0.000033969678,0.0013882521],"genre_scores_gemma":[0.99359107,0.000019544786,0.0061335484,0.00015806127,0.000010428152,0.000008052649,0.0000018944013,0.000002001399,0.000075375705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994294,0.00005749631,0.00014459538,0.00012980888,0.0001651354,0.00007358608],"domain_scores_gemma":[0.99947727,0.00016522473,0.00007172511,0.00017121049,0.00008769042,0.000026897862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002942184,0.000052697687,0.000077712306,0.00006215786,0.00007963066,0.00003766958,0.0001926548,0.000020400606,0.0000031682139],"category_scores_gemma":[0.000042600834,0.000039007064,0.00002874907,0.00034259542,0.00006013753,0.00024163489,0.00006702992,0.000040387113,0.0000052598916],"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.000010354314,0.000024968766,0.00018815808,0.0000028157758,0.0000071717445,2.2473874e-7,0.00057840813,0.0001470555,0.00016270851,0.9720828,0.0003581536,0.026437178],"study_design_scores_gemma":[0.002889202,0.00008481765,0.012105222,0.00000881621,0.000012231463,0.000011623824,0.00003807559,0.05661712,0.005084752,0.9209426,0.002090172,0.000115391354],"about_ca_topic_score_codex":0.000007469291,"about_ca_topic_score_gemma":0.0000028254742,"teacher_disagreement_score":0.056470066,"about_ca_system_score_codex":0.000008234837,"about_ca_system_score_gemma":0.000025534702,"threshold_uncertainty_score":0.1590662},"labels":[],"label_agreement":null},{"id":"W15435421","doi":"","title":"On k-sets of type (2, h) in a planar space.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Type (biology); Space (punctuation); Combinatorics; Arithmetic; Topology (electrical circuits); Pure mathematics; Discrete mathematics; Computer science; Computer graphics (images); Operating system; Geology","score_opus":0.009590963137248,"score_gpt":0.2338139800957916,"score_spread":0.2242230169585436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15435421","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.9919204,0.00007336074,0.0022781137,0.00034365008,0.0010311927,0.00007722534,8.3596865e-7,0.000030770632,0.004244445],"genre_scores_gemma":[0.9976241,0.0000020039704,0.002187341,0.00005507493,0.0000048511333,0.0000021760466,0.000007184014,0.000002905619,0.00011438057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993983,0.000033599357,0.00014018248,0.00015130972,0.00017430392,0.000102290855],"domain_scores_gemma":[0.99960005,0.00009724413,0.000049328894,0.00017844947,0.000054605673,0.00002032843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013298287,0.000060026578,0.0000877821,0.00014680561,0.000023163691,0.000018289438,0.00019432633,0.000032139687,0.0000062106],"category_scores_gemma":[0.000029734487,0.00006128377,0.000019466497,0.00057965895,0.000010324463,0.000104886785,0.000027174367,0.000055385008,0.00003173562],"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.0000073305587,0.000111700654,0.00087231904,0.0000034409386,0.0000018042306,0.0000058611827,0.000039129387,0.0025455218,0.0004993023,0.9924441,0.0026905986,0.0007789231],"study_design_scores_gemma":[0.00050594367,0.00015981123,0.028398054,0.000015442927,0.0000010503671,0.0000022990343,0.0000022486067,0.0137996385,0.0032371138,0.9530381,0.0007541995,0.000086094806],"about_ca_topic_score_codex":0.000058532863,"about_ca_topic_score_gemma":0.0000126366385,"teacher_disagreement_score":0.039405964,"about_ca_system_score_codex":0.000025443574,"about_ca_system_score_gemma":0.00004434201,"threshold_uncertainty_score":0.24990796},"labels":[],"label_agreement":null},{"id":"W1546475620","doi":"10.1137/1.9781611973204.12","title":"On the Average Number of Edges in Theta Graphs","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Square (algebra); Graph; Indifference graph; Discrete mathematics; Geometry","score_opus":0.024883465140519038,"score_gpt":0.2626279245246153,"score_spread":0.23774445938409627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546475620","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.5830754,0.00007130619,0.34009364,0.0032893242,0.0010865057,0.0004995231,0.0000035947487,0.00006141587,0.0718193],"genre_scores_gemma":[0.9925981,0.000022235407,0.005145614,0.00038954086,0.000031303127,0.000034506593,0.0000065929357,0.0000036305275,0.001768476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905723,0.000103566366,0.00021515394,0.00027841784,0.00024464965,0.000101008074],"domain_scores_gemma":[0.998958,0.0003031328,0.00010232543,0.0005294221,0.00008541654,0.000021694133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031013697,0.00011666427,0.00013551179,0.00011566743,0.000030514142,0.000089868394,0.00073977665,0.00007968052,0.0002784743],"category_scores_gemma":[0.00003915583,0.00007314329,0.000080110774,0.0002584749,0.000023014705,0.000081656326,0.00055069523,0.00023361047,0.00012008001],"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.0000012506829,0.000055214554,0.00017227401,0.0000128966085,0.000010836858,7.4539946e-7,0.00024740794,0.034945436,0.0000314076,0.95351887,0.0028526278,0.00815106],"study_design_scores_gemma":[0.00008249089,0.0000134384445,0.0050135516,0.000043659475,0.000001645129,0.0000020371187,0.00000605096,0.0864287,0.0020434004,0.9058947,0.0003465779,0.00012372537],"about_ca_topic_score_codex":0.000090125606,"about_ca_topic_score_gemma":0.00001223054,"teacher_disagreement_score":0.4095227,"about_ca_system_score_codex":0.000014621123,"about_ca_system_score_gemma":0.00006750547,"threshold_uncertainty_score":0.30490983},"labels":[],"label_agreement":null},{"id":"W1547244092","doi":"","title":"Minimum-Layer Drawings of Trees - (Extended Abstract).","year":2011,"lang":"en","type":"article","venue":"Workshop on Algorithms and Computation","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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 Manitoba","funders":"","keywords":"Layer (electronics); Planar; Line (geometry); Combinatorics; Tree (set theory); Geometry; Computer science; Mathematics; Computer graphics (images); Materials science; Composite material","score_opus":0.04419088176485853,"score_gpt":0.2795382562338335,"score_spread":0.23534737446897497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547244092","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.17107904,0.00016362035,0.8253489,0.00020427952,0.00038041399,0.00014276915,0.0000019682645,0.00008601617,0.0025929813],"genre_scores_gemma":[0.909028,0.000024457378,0.09054323,0.00016816538,0.00006830052,0.000007660892,0.000009311877,0.0000070916367,0.00014381472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989022,0.00003201133,0.0003021454,0.00033629363,0.00027117765,0.00015616686],"domain_scores_gemma":[0.99932474,0.00013698592,0.00016040138,0.00016303186,0.00013402777,0.000080836595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020786411,0.00014190942,0.00016290929,0.00020913684,0.00010941031,0.000068820125,0.00019348641,0.00006892413,0.000019832927],"category_scores_gemma":[0.00002163772,0.00013471869,0.000055125474,0.00039666172,0.000042962158,0.00034665148,0.00006336679,0.00009906032,0.000013575129],"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.000030499315,0.0002390461,0.000049580893,0.000013024572,0.000028173332,0.0000077104905,0.0020772282,0.004165307,0.0007147806,0.024169946,0.0004119436,0.96809274],"study_design_scores_gemma":[0.0013142313,0.00052705844,0.18996248,0.00012275505,0.000025328269,0.00003287096,0.0002669651,0.752917,0.008474366,0.044992257,0.0008232343,0.0005414698],"about_ca_topic_score_codex":0.000015810689,"about_ca_topic_score_gemma":0.00000583389,"teacher_disagreement_score":0.9675513,"about_ca_system_score_codex":0.000014294549,"about_ca_system_score_gemma":0.000035227342,"threshold_uncertainty_score":0.54936683},"labels":[],"label_agreement":null},{"id":"W1547671143","doi":"10.5555/1496770.1496791","title":"Optimal halfspace range reporting in three dimensions","year":2009,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":68,"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":"Range (aeronautics); Binary logarithm; Partition (number theory); Half-space; Mathematics; Space (punctuation); Time complexity; Data structure; Computational geometry; Combinatorics; Discrete mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.03413526231537922,"score_gpt":0.28705407040527114,"score_spread":0.2529188080898919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547671143","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.32324308,0.00006089509,0.66986305,0.0026937586,0.000097446515,0.00006295796,6.273399e-8,0.000074751384,0.00390399],"genre_scores_gemma":[0.7983983,0.000001723911,0.20079826,0.00042731783,0.000034893368,0.000001955788,0.0000011431347,0.0000011776622,0.00033519504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991595,0.000016029879,0.0003227761,0.0002110083,0.00015254266,0.00013814047],"domain_scores_gemma":[0.9995415,0.000040235154,0.00013756054,0.00019200389,0.000046283334,0.00004238295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003992541,0.000058789963,0.000082517174,0.000112413836,0.00006264387,0.000059240432,0.00014900952,0.000024830244,0.000012682351],"category_scores_gemma":[0.00013581799,0.00005323129,0.000031603733,0.00047478234,0.0000050021886,0.00029560388,0.00004726379,0.00006342788,0.000021352154],"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.000010727097,0.00024029387,0.00737497,0.0000042490415,0.000007445714,0.00019067574,0.00074231543,0.2807013,0.007313656,0.5642609,0.0021433127,0.13701017],"study_design_scores_gemma":[0.00034163185,0.00009274206,0.16939881,0.000013303725,0.0000016986537,0.00006007352,0.000013938718,0.8078038,0.002036922,0.01914697,0.00090771535,0.00018240031],"about_ca_topic_score_codex":0.00001852217,"about_ca_topic_score_gemma":0.00005263395,"teacher_disagreement_score":0.5451139,"about_ca_system_score_codex":0.000018611721,"about_ca_system_score_gemma":0.00003964174,"threshold_uncertainty_score":0.2170709},"labels":[],"label_agreement":null},{"id":"W1548178949","doi":"10.1007/978-3-540-70904-6_39","title":"Biclique Edge Cover Graphs and Confluent Drawings","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Queen's University","funders":"","keywords":"Planarity testing; Heuristics; Cover (algebra); Computer science; Combinatorics; Enhanced Data Rates for GSM Evolution; Planar graph; Graph drawing; Planar; Complete bipartite graph; Book embedding; Graph; Set (abstract data type); Crossing number (knot theory); Mathematics; Bipartite graph; Algorithm; 1-planar graph; Artificial intelligence; Computer graphics (images); Chordal graph; Programming language; Engineering","score_opus":0.018268175329017512,"score_gpt":0.2581348821296759,"score_spread":0.23986670680065839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548178949","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.0007769236,0.0008305165,0.99207985,0.00050719536,0.0014841737,0.00031291062,0.000003351155,0.00012789572,0.0038771983],"genre_scores_gemma":[0.35301867,0.00022535106,0.6334127,0.010629497,0.0007708182,0.000012911162,0.000022090398,0.000058558446,0.0018493835],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685913,0.000024861853,0.00046480552,0.0013073217,0.0008468108,0.00049704267],"domain_scores_gemma":[0.9981218,0.00047275476,0.00021616339,0.00067410315,0.00030323688,0.0002119483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010554066,0.00042353486,0.00037610246,0.0012106285,0.00027624075,0.00057875353,0.001264124,0.00028213664,0.000022710576],"category_scores_gemma":[0.00006629426,0.00040580405,0.000094483556,0.0007409385,0.000544028,0.00061217585,0.0008489274,0.0005615534,0.000038981325],"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.000008472547,0.000028782059,0.00008359229,0.0000398763,0.000014864493,0.00008681266,0.0006473691,0.02824184,0.00034760212,0.25600338,0.000078949706,0.7144185],"study_design_scores_gemma":[0.000529946,0.00027363753,0.00095591723,0.00029244737,0.000012362477,0.00022625423,1.234077e-7,0.44167355,0.0035722877,0.5340144,0.017394435,0.0010546402],"about_ca_topic_score_codex":0.000014504042,"about_ca_topic_score_gemma":0.000023207489,"teacher_disagreement_score":0.7133638,"about_ca_system_score_codex":0.00015221749,"about_ca_system_score_gemma":0.00042217245,"threshold_uncertainty_score":0.99983937},"labels":[],"label_agreement":null},{"id":"W1549363509","doi":"10.46298/dmtcs.315","title":"Track Layouts of Graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; Univerzita Karlova v Praze","keywords":"Combinatorics; Bounded function; Vertex (graph theory); Mathematics; Planar graph; Queue; Graph; Discrete mathematics; Computer science","score_opus":0.012722073503782792,"score_gpt":0.25953466792096674,"score_spread":0.24681259441718395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549363509","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.056006413,0.000035369078,0.9400747,0.00055252743,0.00031862434,0.00016899292,0.0000026155417,0.000108187276,0.0027326108],"genre_scores_gemma":[0.5839054,0.0000021453436,0.41594577,0.00010624315,0.00002782373,0.0000034042803,0.0000011934708,0.000004546798,0.0000034683671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976819,0.000035566587,0.00045931936,0.00050893036,0.00093052187,0.00038375342],"domain_scores_gemma":[0.99845606,0.00017836329,0.00015316068,0.00071692764,0.00029315375,0.00020232784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082568673,0.00018520169,0.00025415068,0.00028716947,0.00024313499,0.00025429562,0.0017660435,0.000047584428,0.000020979005],"category_scores_gemma":[0.00010688655,0.00015050366,0.00011940864,0.0016869232,0.0013023716,0.000637512,0.0005273754,0.00012561938,0.000038046266],"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.000001791855,0.00011481001,0.000005274077,0.000024282072,0.0000054494567,0.0000038107269,0.0014491339,0.0040508765,0.0014749902,0.98944396,0.000007331132,0.003418269],"study_design_scores_gemma":[0.00022480109,0.00011488608,0.00012651744,0.00004529119,0.0000056996387,0.000031172247,0.00002039733,0.27724695,0.01417246,0.7078428,0.000012304971,0.00015667808],"about_ca_topic_score_codex":0.000001549008,"about_ca_topic_score_gemma":3.6929936e-7,"teacher_disagreement_score":0.527899,"about_ca_system_score_codex":0.0000328102,"about_ca_system_score_gemma":0.00017823075,"threshold_uncertainty_score":0.6137361},"labels":[],"label_agreement":null},{"id":"W1549928317","doi":"10.1023/a:1021666512528","title":"Aperture-Angle Optimization Problems in Three Dimensions","year":2002,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","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":"McGill University","funders":"","keywords":"Combinatorics; Polyhedron; Mathematics; Regular polygon; Line segment; Point (geometry); Computational geometry; Line (geometry); Computation; Geometry; Algorithm","score_opus":0.04591818117153679,"score_gpt":0.23778151727242647,"score_spread":0.19186333610088968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549928317","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.004689132,0.0008091386,0.9931339,0.0010303103,0.00007341866,0.000060709783,2.9685282e-7,0.000011555489,0.00019155868],"genre_scores_gemma":[0.28546435,0.00019290744,0.71413034,0.00008369456,0.00006570637,0.0000017742202,3.589057e-7,0.000004626705,0.000056262503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999132,0.000029796547,0.00037113973,0.00011089489,0.00024514954,0.0001110627],"domain_scores_gemma":[0.9993583,0.00024798207,0.00012622522,0.00008741258,0.000103185615,0.000076895885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039557202,0.00007665525,0.00016928987,0.00015112948,0.000056609242,0.0000775749,0.00012324215,0.00004284757,0.000016475],"category_scores_gemma":[0.00006300679,0.000058165897,0.000043698165,0.00023700821,0.000015725796,0.0003277117,0.000033890017,0.00013792134,0.0000054050684],"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":[7.283234e-7,0.00011937984,0.000006042727,0.0000144889245,0.000006043908,0.000005774115,0.00030941598,0.9820318,0.000017681712,0.012629257,0.000024099807,0.004835242],"study_design_scores_gemma":[0.00022341254,0.00006581538,0.0000054348748,0.00007726352,0.0000045308216,0.000100541234,0.0000062987197,0.88441205,0.000012575199,0.11497586,0.000055368033,0.000060862167],"about_ca_topic_score_codex":7.0116016e-7,"about_ca_topic_score_gemma":2.4586416e-7,"teacher_disagreement_score":0.28077522,"about_ca_system_score_codex":0.000014983792,"about_ca_system_score_gemma":0.00001077741,"threshold_uncertainty_score":0.23719364},"labels":[],"label_agreement":null},{"id":"W1550087630","doi":"10.1007/978-3-540-30551-4_23","title":"Geometric Optimization Problems Over Sliding Windows","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Computer science; Computer graphics (images); Mathematical optimization; Mathematics","score_opus":0.01725328938100285,"score_gpt":0.2349357074300714,"score_spread":0.21768241804906854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550087630","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.00004423769,0.0006047347,0.9936879,0.0003834145,0.002007904,0.00053528656,0.000003455839,0.00019400835,0.0025390377],"genre_scores_gemma":[0.17942685,0.00010432106,0.8179416,0.0011387304,0.0008252778,0.000017740058,0.000034212928,0.000044432927,0.0004668639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995937,0.000029568782,0.0006016555,0.001527876,0.0013113247,0.0005925685],"domain_scores_gemma":[0.9978979,0.0003172484,0.00036259403,0.00088454277,0.00035836626,0.00017933772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008752365,0.00050315034,0.00042968406,0.0025941506,0.000359266,0.0008207152,0.0020139008,0.00031292767,0.00007919038],"category_scores_gemma":[0.0001272923,0.0004994636,0.00013719875,0.0026614643,0.00017869563,0.001172571,0.00086844,0.0006006367,0.00004258056],"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.0000013753494,0.00002025698,0.000011928462,0.000021826161,0.000006431737,0.000020620671,0.00017503375,0.81477606,0.000035321973,0.024243323,0.0000085452175,0.16067925],"study_design_scores_gemma":[0.00037731393,0.00013259205,0.00010291293,0.00026309214,0.000007426829,0.000056394943,3.654844e-8,0.88980347,0.0006485884,0.10734882,0.00066978246,0.00058954675],"about_ca_topic_score_codex":0.000016998707,"about_ca_topic_score_gemma":0.000014476889,"teacher_disagreement_score":0.1793826,"about_ca_system_score_codex":0.0006608139,"about_ca_system_score_gemma":0.0008963424,"threshold_uncertainty_score":0.9997457},"labels":[],"label_agreement":null},{"id":"W1550666632","doi":"10.1016/j.jctb.2016.11.004","title":"5-choosability of graphs with crossings far apart","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Planar graph; Graph; Plane (geometry); Outerplanar graph; Line graph; Crossing number (knot theory)","score_opus":0.006835304738614545,"score_gpt":0.22240173226694906,"score_spread":0.21556642752833452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550666632","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.68602616,0.00016334336,0.3080669,0.00085059606,0.003722885,0.000092618946,0.0000026268208,0.00002464843,0.001050232],"genre_scores_gemma":[0.9934646,0.000017567225,0.0060897535,0.000049071165,0.00018924476,0.000001112328,2.0631751e-7,0.000004947716,0.0001835344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871385,0.00018589261,0.00043035226,0.00012683442,0.00041406887,0.00012902281],"domain_scores_gemma":[0.9981871,0.00033854053,0.00048615126,0.00023629524,0.0006672203,0.000084668936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012493328,0.00010392596,0.00023982638,0.00012573396,0.00009429674,0.00006984435,0.00045208822,0.00004483235,0.00002693616],"category_scores_gemma":[0.0002505877,0.000060883867,0.00010227793,0.00036224237,0.000213056,0.0012023633,0.00006437172,0.000086584594,0.0000018454645],"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.00061766844,0.000111106565,0.0005492386,0.000009708242,0.00004247859,0.000005809384,0.00028209592,0.000055565182,0.006809877,0.98087645,0.00020025755,0.010439721],"study_design_scores_gemma":[0.0013753299,0.0011533436,0.0021436713,0.000058334932,0.000013503333,0.000106276144,0.000027691001,0.000012573126,0.04644279,0.9362616,0.012292185,0.00011273213],"about_ca_topic_score_codex":8.710212e-7,"about_ca_topic_score_gemma":3.9868186e-7,"teacher_disagreement_score":0.30743843,"about_ca_system_score_codex":0.00003466251,"about_ca_system_score_gemma":0.00022174542,"threshold_uncertainty_score":0.2482772},"labels":[],"label_agreement":null},{"id":"W1552370277","doi":"10.1109/cvpr.1992.223166","title":"Multi-resolution surface modeling from multiple range views","year":2003,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Triangulation; Venn diagram; Range (aeronautics); Set (abstract data type); Resolution (logic); Computer science; Viewpoints; Surface (topology); Diagram; Artificial intelligence; Process (computing); Algorithm; Theoretical computer science; Computer vision; Mathematics; Programming language; Engineering; Geometry","score_opus":0.07983369893389004,"score_gpt":0.2758711205664076,"score_spread":0.19603742163251758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552370277","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.08178523,0.0004694073,0.9161886,0.00012060858,0.0003786743,0.000119218224,0.0000019954507,0.00012235038,0.00081391167],"genre_scores_gemma":[0.5150786,0.0000092110895,0.48431548,0.00015220226,0.000024517383,0.000002982939,0.0000081069065,0.0000029642179,0.00040593024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990515,0.000102741615,0.00019068297,0.00031064026,0.0001850572,0.00015934528],"domain_scores_gemma":[0.99946684,0.000086537664,0.00003718396,0.00025476297,0.00008827075,0.0000663788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026533715,0.00009702236,0.00009659534,0.000045856537,0.000131276,0.00009003453,0.00021064255,0.00004393105,0.00005614754],"category_scores_gemma":[0.000083269595,0.000090446636,0.000048030684,0.0002813409,0.000006566166,0.00041994237,0.000045960085,0.00006257893,0.0001520827],"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.0000021043925,0.0000605129,0.0003812641,0.0000016165334,0.0000063910747,0.0000010750772,0.00020446173,0.9846725,0.0046636746,0.007247672,0.00033241883,0.0024262927],"study_design_scores_gemma":[0.00046139047,0.000009418272,0.00030756282,0.0000036681183,0.0000022393067,0.0000015388671,0.000012047976,0.99199045,0.002006368,0.0010555384,0.004028892,0.00012089891],"about_ca_topic_score_codex":0.00014452671,"about_ca_topic_score_gemma":0.00011828152,"teacher_disagreement_score":0.43329337,"about_ca_system_score_codex":0.0000310488,"about_ca_system_score_gemma":0.000042252228,"threshold_uncertainty_score":0.36883068},"labels":[],"label_agreement":null},{"id":"W1552496115","doi":"","title":"Calculating the meeting point of scattered robots on weighted terrain surfaces","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"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":"Combinatorics; Mathematics; Discretization; Vertex (graph theory); Convex hull; Graph; Upper and lower bounds; Regular polygon; Computational geometry; Euclidean distance; Metric (unit); Geometry; Mathematical analysis","score_opus":0.015885244246349538,"score_gpt":0.25198902866862966,"score_spread":0.2361037844222801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552496115","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.5317874,0.00006358668,0.45020697,0.009349905,0.000112981885,0.00012683049,5.652435e-7,0.0000717476,0.0082800295],"genre_scores_gemma":[0.91174245,0.000001273049,0.087160796,0.00074761256,0.00008213838,0.00000253856,0.0000021717613,0.0000027654205,0.00025826745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918133,0.000077615325,0.00021630594,0.00017518474,0.00023103267,0.00011855175],"domain_scores_gemma":[0.9993935,0.00020873538,0.0000917893,0.0002135266,0.00006556799,0.00002687318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043538574,0.000072338196,0.00007861715,0.000063834435,0.00012626291,0.000058259946,0.0002906315,0.000020897889,0.000028184239],"category_scores_gemma":[0.00003636699,0.00004693079,0.000041320654,0.00029928942,0.000017624736,0.0001936149,0.00008514859,0.00005411725,0.00002146839],"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.0000056235062,0.00007723972,0.0003433706,0.000007739746,0.000021082207,8.003189e-7,0.0014529318,0.76964027,0.017905194,0.054176316,0.0014987082,0.15487073],"study_design_scores_gemma":[0.00013861152,0.000035153895,0.003976227,0.000019476978,0.0000019706827,0.0000037060736,0.000033999982,0.957855,0.03658334,0.00073171285,0.0005447925,0.00007602994],"about_ca_topic_score_codex":0.00003273344,"about_ca_topic_score_gemma":0.000029120636,"teacher_disagreement_score":0.37995505,"about_ca_system_score_codex":0.000017973794,"about_ca_system_score_gemma":0.000023408578,"threshold_uncertainty_score":0.1913782},"labels":[],"label_agreement":null},{"id":"W1552693607","doi":"10.5772/9033","title":"Voronoi diagram: An adaptive spatial tessellation for processes simulation","year":2010,"lang":"en","type":"book-chapter","venue":"InTech eBooks","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voronoi diagram; Centroidal Voronoi tessellation; Tessellation (computer graphics); Computer science; Diagram; Statistical physics; Computer graphics (images); Algorithm; Mathematics; Geometry; Physics; Database","score_opus":0.0390605298545789,"score_gpt":0.2811709171794221,"score_spread":0.24211038732484322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552693607","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.00008318463,0.000049097234,0.96115863,0.0000485718,0.0006903822,0.0008453198,0.000029831108,0.00023688366,0.036858115],"genre_scores_gemma":[0.86492497,0.000004036192,0.06327012,0.00016939556,0.0014454667,0.00012490973,0.00028147682,0.00006153416,0.06971808],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984625,0.000015973344,0.00037360057,0.0006172116,0.00033984942,0.000190879],"domain_scores_gemma":[0.99784887,0.0003408141,0.0003320019,0.00041591737,0.0009678158,0.00009460189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021457889,0.00030871975,0.00024331527,0.00027168303,0.00020941028,0.00021235584,0.00046515465,0.00040601348,0.000025843492],"category_scores_gemma":[0.00010990052,0.0003177676,0.000099527395,0.000037297796,0.000056752637,0.0003123266,0.00009737987,0.0003124656,0.000028564365],"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.00008963969,0.00004026752,0.0000012537893,0.00010148186,0.000055548906,0.0000033182102,0.00054410443,0.004821407,0.0073278383,0.16095582,0.000037412086,0.8260219],"study_design_scores_gemma":[0.00046534272,0.00092892395,0.000013872957,0.00013858912,0.000057375062,0.000009125303,0.0000044650965,0.36664468,0.08816897,0.4038455,0.13889638,0.0008267783],"about_ca_topic_score_codex":0.000016167329,"about_ca_topic_score_gemma":0.0002525164,"teacher_disagreement_score":0.8978885,"about_ca_system_score_codex":0.00006387618,"about_ca_system_score_gemma":0.00036288187,"threshold_uncertainty_score":0.99992746},"labels":[],"label_agreement":null},{"id":"W1556215126","doi":"10.1007/s00013-012-0404-0","title":"Classifying ACM sets of points in $${\\mathbb{P}^{1} \\times \\mathbb{P}^{1}}$$ via separators","year":2012,"lang":"de","type":"article","venue":"Archiv der Mathematik","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":"Lakehead University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.037936835017863664,"score_gpt":0.3019711320900513,"score_spread":0.2640342970721876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556215126","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.58271754,0.007506642,0.40011653,0.001455247,0.0027821453,0.0010209705,0.000046335073,0.00017840002,0.004176218],"genre_scores_gemma":[0.8611907,0.00010634197,0.13756919,0.00031730204,0.0003880981,0.000039063405,0.000043156837,0.000048285612,0.00029788382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99567837,0.00044031616,0.0013027171,0.0006752403,0.0008923495,0.0010110276],"domain_scores_gemma":[0.99644846,0.00110601,0.0006262506,0.0013130056,0.00014543318,0.00036082577],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015785417,0.0005285913,0.0007545729,0.00078484305,0.0002063121,0.00015199282,0.0013661209,0.0001880764,0.00021106507],"category_scores_gemma":[0.0004261827,0.0005280379,0.00026967702,0.0013010649,0.00016256086,0.0012802748,0.0009966245,0.0004308364,0.0010829755],"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.0002210972,0.0070181033,0.028806968,0.0040959367,0.0013062486,0.00011918744,0.17232266,0.006472668,0.015677856,0.5331702,0.018288735,0.21250032],"study_design_scores_gemma":[0.0031189327,0.00039444206,0.059370577,0.0016945507,0.00032055797,0.0002799234,0.00076566223,0.42712474,0.02865968,0.46679866,0.009072024,0.0024002297],"about_ca_topic_score_codex":0.000024773193,"about_ca_topic_score_gemma":0.000008885716,"teacher_disagreement_score":0.42065206,"about_ca_system_score_codex":0.0001083253,"about_ca_system_score_gemma":0.00024061359,"threshold_uncertainty_score":0.9997171},"labels":[],"label_agreement":null},{"id":"W1556473760","doi":"10.1090/crmp/048/03","title":"Polyhedral representation conversion up to symmetries","year":2009,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":47,"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 New Brunswick","funders":"","keywords":"Polyhedron; Generalization; Homogeneous space; Sketch; Representation (politics); Symmetry (geometry); Computer science; Decomposition; Algebra over a field; Mathematics; Algorithm; Theoretical computer science; Pure mathematics; Combinatorics; Geometry; Mathematical analysis","score_opus":0.02149822791285771,"score_gpt":0.2564316784570742,"score_spread":0.2349334505442165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556473760","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.0014149569,0.0011937555,0.6367744,0.012439719,0.002168635,0.0010194756,0.000012470303,0.00070072897,0.34427583],"genre_scores_gemma":[0.96650183,0.00010847934,0.008433701,0.0064740945,0.0020622034,0.00002173381,0.00014590393,0.00006749739,0.016184561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782974,0.0000055362743,0.00035524435,0.00086161285,0.00064891984,0.00029895673],"domain_scores_gemma":[0.998342,0.00013117406,0.00026292042,0.00023114904,0.0008499143,0.00018287235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017857572,0.0004064755,0.00035910777,0.00071174314,0.00025941987,0.00048373302,0.00059801224,0.00034936267,0.00005206583],"category_scores_gemma":[0.00037235158,0.00040297408,0.00016097285,0.0004400462,0.00003344664,0.00053903373,0.0002019815,0.0003590376,0.00017129864],"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.000036811274,0.000010474091,0.00002387784,0.000047070123,0.000037110378,0.00000536646,0.001143826,0.00035615335,0.0018157908,0.81914115,0.0022789736,0.17510343],"study_design_scores_gemma":[0.00039652994,0.000526146,0.00037763943,0.00023387629,0.00007025999,0.0000700538,0.0000141131395,0.0034620992,0.047893167,0.8281074,0.117892645,0.0009560593],"about_ca_topic_score_codex":0.0000073149845,"about_ca_topic_score_gemma":0.0000019367014,"teacher_disagreement_score":0.9650869,"about_ca_system_score_codex":0.00012854341,"about_ca_system_score_gemma":0.00012201428,"threshold_uncertainty_score":0.9998422},"labels":[],"label_agreement":null},{"id":"W1556623511","doi":"10.1007/978-3-540-24698-5_20","title":"Space-Efficient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Waterloo","funders":"","keywords":"Convex hull; Partition (number theory); Simple (philosophy); SIMPLE algorithm; Regular polygon; Computer science; Algorithm; Extreme point; Line segment; Time complexity; Combinatorics; Mathematics; Geometry; Artificial intelligence","score_opus":0.020076447813308675,"score_gpt":0.27153900865106706,"score_spread":0.25146256083775836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556623511","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.0010483571,0.0003487255,0.99517435,0.0013258128,0.0010455803,0.0007897685,0.000019648885,0.000054877743,0.00019287175],"genre_scores_gemma":[0.42278564,0.00000977607,0.5751285,0.0009730051,0.0008399539,0.000011825414,0.000037843416,0.000031511343,0.00018195467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669635,0.000043849952,0.0007422921,0.0010690427,0.000897381,0.0005510626],"domain_scores_gemma":[0.99717957,0.0011689593,0.00041371223,0.0007109038,0.00042471167,0.00010212945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015468459,0.00040639978,0.00054340455,0.0008020535,0.00024078543,0.00017254744,0.0019157268,0.00021287004,0.000015654578],"category_scores_gemma":[0.00015419084,0.0003298597,0.00017394783,0.0010411231,0.000462376,0.00017009434,0.00080084946,0.0005113164,0.00001358888],"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.000009331945,0.000052896212,0.000006842176,0.00003135821,0.000007875702,0.000008518879,0.0005871289,0.8665373,0.00024743937,0.017023658,0.000009581081,0.115478076],"study_design_scores_gemma":[0.00053689745,0.00023028401,0.00010053002,0.00020544423,0.000006101462,0.000026012165,2.945451e-7,0.9334616,0.0022527163,0.06246098,0.00038983105,0.00032928164],"about_ca_topic_score_codex":0.000035209265,"about_ca_topic_score_gemma":0.000026242937,"teacher_disagreement_score":0.42173728,"about_ca_system_score_codex":0.00026405588,"about_ca_system_score_gemma":0.0010007459,"threshold_uncertainty_score":0.99991536},"labels":[],"label_agreement":null},{"id":"W1556720455","doi":"10.48550/arxiv.1303.2162","title":"New Hardness Results for Guarding Orthogonal Polygons with Sliding Cameras","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Manitoba","funders":"","keywords":"Cardinality (data modeling); Combinatorics; Point (geometry); Line segment; Guard (computer science); Polygon (computer graphics); Set (abstract data type); Time complexity; Regular polygon; Mathematics; Computer science; Geometry","score_opus":0.07851725886197111,"score_gpt":0.19666434870157404,"score_spread":0.11814708983960293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556720455","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.07259976,0.00004748487,0.92447466,0.00032401786,0.00088908756,0.00046230966,0.00002781548,0.00017144586,0.0010034186],"genre_scores_gemma":[0.92510283,0.000019105515,0.06842185,0.00010065711,0.00030207212,0.0000035380197,0.00010458892,0.000016402328,0.0059289737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815255,0.0000708422,0.0002249721,0.0010901961,0.00011786039,0.00034359406],"domain_scores_gemma":[0.99830997,0.0001947662,0.00028246117,0.00065844704,0.0003310442,0.00022331924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024849843,0.0002925416,0.000283096,0.00033644936,0.0002905001,0.00028718292,0.00096941134,0.00017407206,0.000010623714],"category_scores_gemma":[0.00005361018,0.00030964988,0.00016791892,0.0006489583,0.0000259254,0.0005701658,0.0007124631,0.0003003405,0.00003499787],"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.00011987746,0.00003826845,0.00030055133,0.00004916915,0.0001352973,0.000037209706,0.00027790453,0.6160385,0.00008432198,0.37133533,0.00438728,0.0071962816],"study_design_scores_gemma":[0.0014426243,0.0001253966,0.0010845546,0.0001271581,0.000083263796,0.000014934284,0.000047992802,0.957328,0.0004033593,0.032782126,0.0059238966,0.00063669635],"about_ca_topic_score_codex":0.00017020969,"about_ca_topic_score_gemma":0.00004256439,"teacher_disagreement_score":0.8560528,"about_ca_system_score_codex":0.00015095327,"about_ca_system_score_gemma":0.00062640524,"threshold_uncertainty_score":0.99993557},"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":"W1559894044","doi":"10.1007/s00453-006-0168-7","title":"Reconfiguring Triangulations with Edge Flips and Point Moves","year":2007,"lang":"en","type":"article","venue":"Algorithmica","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":"Triangulation; Point (geometry); Enhanced Data Rates for GSM Evolution; Point set triangulation; Combinatorics; Computer science; Control reconfiguration; Upper and lower bounds; Delaunay triangulation; Mathematics; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.008872586701530067,"score_gpt":0.22365302800655926,"score_spread":0.21478044130502918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559894044","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.055609964,0.000120089084,0.9401113,0.0006972503,0.0001519645,0.00009876629,0.0000011057004,0.000077258555,0.0031322946],"genre_scores_gemma":[0.6890094,0.000005029493,0.3098411,0.00022968535,0.00022201579,0.000004868602,0.0000073506903,0.000005894406,0.00067465147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993551,0.000015841062,0.00013603485,0.00021689855,0.00012883406,0.00014734131],"domain_scores_gemma":[0.99953794,0.00012047525,0.00004375481,0.00015644882,0.00006455517,0.00007679593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028710414,0.00007408153,0.00007412491,0.00012716731,0.00013095302,0.000086585474,0.00012023034,0.000027682461,0.000009642101],"category_scores_gemma":[0.000020144285,0.00006515453,0.000017214912,0.00031382122,0.00002236092,0.00031301644,0.000042984044,0.00006016521,0.000014116689],"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.000015268732,0.00004811813,0.0001547225,0.000007282768,0.000028016493,0.000020225585,0.00071258895,0.0007301091,0.0015186837,0.06763661,0.00039869596,0.92872965],"study_design_scores_gemma":[0.0042844857,0.000820609,0.18390957,0.00010762426,0.00005262118,0.00079803076,0.00030267957,0.58196425,0.0961625,0.057871103,0.07226529,0.0014612124],"about_ca_topic_score_codex":0.000007144776,"about_ca_topic_score_gemma":0.000010896007,"teacher_disagreement_score":0.92726845,"about_ca_system_score_codex":0.000017050452,"about_ca_system_score_gemma":0.00003249936,"threshold_uncertainty_score":0.26569247},"labels":[],"label_agreement":null},{"id":"W1561175729","doi":"10.5555/1496770.1496824","title":"Biased range trees","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"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":"Range query (database); Data structure; Range (aeronautics); Computer science; Range tree; Set (abstract data type); Preprocessor; Tree (set theory); Tree structure; Query optimization; Segment tree; Interval tree; Data mining; Mathematics; Algorithm; Combinatorics; Sargable; Artificial intelligence; Web search query; Information retrieval; Search engine","score_opus":0.01441717215288716,"score_gpt":0.25912092714576584,"score_spread":0.2447037549928787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561175729","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.013445498,0.00029764776,0.9401494,0.022478305,0.0011172025,0.00036896014,0.0000148472145,0.0005268321,0.021601306],"genre_scores_gemma":[0.9584111,0.000045781333,0.036404442,0.0027861178,0.0004938754,0.000016455702,0.000039397524,0.000010179377,0.0017926471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862057,0.0000663343,0.0002101775,0.00043420622,0.0004016121,0.00026710107],"domain_scores_gemma":[0.99923116,0.000072621195,0.00006707075,0.0004349691,0.00006747124,0.0001266946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019745885,0.00017264909,0.00014901016,0.00018781572,0.00016018134,0.00019022619,0.0004426965,0.00005749274,0.000020245303],"category_scores_gemma":[0.000017649392,0.00015168478,0.00010177018,0.0005473479,0.000019810792,0.00041323472,0.00004402541,0.00010428414,0.00015117096],"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.000092748494,0.00060808624,0.000120304445,0.000013832041,0.000070292364,0.00012371033,0.0013258473,0.03677823,0.037653137,0.29503605,0.015281817,0.61289597],"study_design_scores_gemma":[0.0026513755,0.0022998212,0.025952948,0.00007101013,0.00002783223,0.000057081823,0.000028186176,0.8657123,0.034025874,0.036600452,0.031406287,0.0011668587],"about_ca_topic_score_codex":0.0000057712555,"about_ca_topic_score_gemma":0.0000019242996,"teacher_disagreement_score":0.9449656,"about_ca_system_score_codex":0.00003754986,"about_ca_system_score_gemma":0.00004499002,"threshold_uncertainty_score":0.6185526},"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":"W1561631292","doi":"10.1007/bfb0019426","title":"Upward drawings to fit surfaces","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Ottawa","funders":"","keywords":"Piecewise linear function; Construct (python library); Mathematics; Piecewise; Geometry; Computer science; Mathematical analysis","score_opus":0.020190934232303445,"score_gpt":0.2590255466711827,"score_spread":0.23883461243887927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561631292","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.0005129202,0.0003721077,0.9898176,0.0033863457,0.001915502,0.0003657314,0.0000044060507,0.00018315423,0.0034421978],"genre_scores_gemma":[0.15513341,0.000031337193,0.83496803,0.0055771875,0.0012929242,0.000011180748,0.000008142744,0.000033601213,0.002944181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961898,0.000026218258,0.00049236696,0.0015332825,0.0011628743,0.00059548055],"domain_scores_gemma":[0.9978834,0.0003614394,0.00018053812,0.00097236707,0.0003310638,0.00027119066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008100993,0.00046816943,0.00042074572,0.0011117489,0.00029379432,0.00077021087,0.0027301472,0.00022832201,0.0000532397],"category_scores_gemma":[0.00009828773,0.00045887753,0.00012070654,0.0010532973,0.00020840403,0.0007498588,0.0012181974,0.0004953198,0.00028851937],"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.0000026580374,0.000014212308,0.000009719629,0.000008860882,0.0000049724827,0.000018448229,0.0004377134,0.43112203,0.00013866933,0.011666879,0.00013146603,0.55644435],"study_design_scores_gemma":[0.00027369848,0.0002694971,0.00041063217,0.00027711352,0.000008244027,0.000079370715,1.19042085e-7,0.8380027,0.0031920876,0.10161501,0.054722793,0.0011487269],"about_ca_topic_score_codex":0.000013476357,"about_ca_topic_score_gemma":0.00006943127,"teacher_disagreement_score":0.55529565,"about_ca_system_score_codex":0.00030557418,"about_ca_system_score_gemma":0.00056860124,"threshold_uncertainty_score":0.9997863},"labels":[],"label_agreement":null},{"id":"W1561982800","doi":"10.1007/978-3-642-40104-6_10","title":"On the Stretch Factor of the Theta-4 Graph","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Combinatorics; Graph; Path graph; Wheel graph; Euclidean geometry; Bounded function; Distance; Computer science; Mathematics; Discrete mathematics; Graph power; Line graph; Shortest path problem; Geometry; Mathematical analysis","score_opus":0.020635952046383035,"score_gpt":0.2295789757623995,"score_spread":0.20894302371601647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561982800","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.0043548886,0.00014486027,0.98752844,0.0028614723,0.0017964136,0.00047819913,0.0000073325996,0.000038272967,0.0027900918],"genre_scores_gemma":[0.97424215,0.000012932616,0.022795511,0.0020824117,0.00023355456,0.000010884469,0.0000018453594,0.000015236011,0.0006054995],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744624,0.0000650568,0.00036789617,0.00072488724,0.0010943855,0.0003015202],"domain_scores_gemma":[0.99694407,0.0010581037,0.0003116027,0.0013524668,0.00027334833,0.00006039103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046200253,0.00031619763,0.0002643166,0.0003355728,0.000280189,0.00028622278,0.0035342516,0.00014789449,0.00014648939],"category_scores_gemma":[0.00012390352,0.00016767601,0.0001793137,0.0007931723,0.0005587856,0.00025110375,0.0008284803,0.0005580077,0.00004246976],"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.00000244698,0.000030867453,0.000021485266,0.000013856795,0.000016952246,0.0000023903963,0.00064633903,0.062117327,0.00024368014,0.46356186,0.00018341844,0.47315937],"study_design_scores_gemma":[0.00009778182,0.000106750034,0.00070648035,0.00015134955,0.0000046938403,0.00001082147,1.3892394e-7,0.31617084,0.0050394963,0.6768333,0.000604531,0.00027380508],"about_ca_topic_score_codex":0.000012124288,"about_ca_topic_score_gemma":0.0000182648,"teacher_disagreement_score":0.96988726,"about_ca_system_score_codex":0.000078786754,"about_ca_system_score_gemma":0.00033715516,"threshold_uncertainty_score":0.6837629},"labels":[],"label_agreement":null},{"id":"W1562525740","doi":"10.1002/rsa.10099","title":"One line and n points","year":2003,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"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 British Columbia","funders":"","keywords":"Computer science; Line (geometry); Mathematics; Geometry","score_opus":0.01310099690627803,"score_gpt":0.23891851597771457,"score_spread":0.22581751907143655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562525740","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.07673593,0.0020644634,0.9194102,0.0007838912,0.0003251284,0.00014372282,0.000003253242,0.00004697844,0.00048637792],"genre_scores_gemma":[0.8437169,0.00018370396,0.15551922,0.0003248173,0.000113370035,0.0000035666524,0.0000041993703,0.000003882105,0.00013032842],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938136,0.000049837385,0.000112221445,0.0002190505,0.00012541722,0.00011212808],"domain_scores_gemma":[0.99967164,0.00008194869,0.000033285898,0.000102566344,0.0000358266,0.00007472887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017268126,0.00008069579,0.00012358172,0.000056210047,0.00012950001,0.00012243725,0.000063377694,0.00003281922,0.000012659476],"category_scores_gemma":[0.000047452115,0.00006982868,0.00001947553,0.00013089452,0.000026129568,0.00014919128,0.000038492904,0.0000581967,0.0000011946883],"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.000027087333,0.000025668734,0.000087322034,0.000021682901,0.000037996077,0.000006283346,0.00033591024,0.0005276526,0.0008406722,0.35838208,0.00015825016,0.63954943],"study_design_scores_gemma":[0.011432611,0.0002584946,0.020364001,0.000024299412,0.000030609463,0.00028783348,0.00003252998,0.15134943,0.015431738,0.7830842,0.017135603,0.0005686651],"about_ca_topic_score_codex":0.0000052132445,"about_ca_topic_score_gemma":0.0000015142394,"teacher_disagreement_score":0.766981,"about_ca_system_score_codex":0.0000038034157,"about_ca_system_score_gemma":0.000016331369,"threshold_uncertainty_score":0.2847531},"labels":[],"label_agreement":null},{"id":"W1562793767","doi":"10.2202/1559-0410.1047","title":"Improved Draws for Highland Dance","year":2007,"lang":"en","type":"article","venue":"Journal of Quantitative Analysis in Sports","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dance; Balance (ability); Order (exchange); Constant (computer programming); Sociology; Computer science; Visual arts; Art; Psychology; Economics","score_opus":0.023880710291205524,"score_gpt":0.3324719861465488,"score_spread":0.3085912758553433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562793767","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.30289248,0.000248248,0.6963671,0.00016971541,0.00019394561,0.000051347808,8.2799994e-7,0.0000036856304,0.00007265903],"genre_scores_gemma":[0.785628,0.000022226459,0.21410605,0.00009302257,0.00006890077,9.835144e-7,0.0000030065773,0.0000025178067,0.00007530186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9986652,0.00003163514,0.00067157013,0.00016444772,0.00030826248,0.000158884],"domain_scores_gemma":[0.998292,0.00037084383,0.000613291,0.00013563254,0.0005226835,0.00006554356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024336511,0.00008547616,0.00030705697,0.0010309502,0.000051657393,0.000049810085,0.00025832278,0.00003493803,0.0000065537265],"category_scores_gemma":[0.0001689637,0.00007277747,0.0002352672,0.001970162,0.000020037029,0.0005086719,0.000023235805,0.000094557,4.893643e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010205265,0.0012857212,0.26175278,0.000083917876,0.0023971812,0.00067112275,0.008345812,0.2634374,0.021881789,0.28888384,0.001773567,0.14846636],"study_design_scores_gemma":[0.0014962256,0.0006567687,0.5477305,0.000046364323,0.00036490965,0.000040345916,0.0003672996,0.42144632,0.004870233,0.01837841,0.0042511984,0.00035141557],"about_ca_topic_score_codex":0.000006413405,"about_ca_topic_score_gemma":0.00011168138,"teacher_disagreement_score":0.4827355,"about_ca_system_score_codex":0.000048201375,"about_ca_system_score_gemma":0.0000809953,"threshold_uncertainty_score":0.2967779},"labels":[],"label_agreement":null},{"id":"W1563247514","doi":"10.1007/978-3-540-73951-7_35","title":"Cauchy’s Theorem and Edge Lengths of Convex Polyhedra","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Mathematics; Combinatorics; Dihedral angle; Integer points in convex polyhedra; Cauchy distribution; Point (geometry); Enhanced Data Rates for GSM Evolution; Linear programming; Computer science; Convex set; Geometry; Algorithm; Convex optimization; Mathematical analysis; Artificial intelligence","score_opus":0.018727453099209833,"score_gpt":0.257643107700777,"score_spread":0.23891565460156713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563247514","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.0005365543,0.001187015,0.9912629,0.0003513626,0.001232324,0.00024475832,0.000004886093,0.00006202628,0.005118153],"genre_scores_gemma":[0.5851395,0.00012010074,0.412115,0.0013993805,0.00062059454,0.0000035168537,0.000009618332,0.000028014094,0.00056424394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972736,0.000029148276,0.0005076107,0.0009933803,0.00079624634,0.00039999248],"domain_scores_gemma":[0.997885,0.000659373,0.0002839056,0.00070721476,0.0003154042,0.00014909433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011120648,0.00035561476,0.00043811792,0.0009916141,0.00015969093,0.00019791363,0.0013206744,0.00024566636,0.000018545175],"category_scores_gemma":[0.00008727284,0.00033028555,0.00008418906,0.00062322366,0.0007255444,0.00043114324,0.00078229146,0.0004323921,0.0000106357575],"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.0000063177395,0.00002015095,0.00003899927,0.00003842649,0.0000098496275,0.000025368212,0.00057848246,0.0072450605,0.00032381754,0.22037786,0.0000141076125,0.77132154],"study_design_scores_gemma":[0.0005647089,0.00037986823,0.0008772941,0.0003659904,0.000016279748,0.00020680223,4.9731267e-7,0.54195684,0.012821942,0.4379273,0.0039336653,0.0009488065],"about_ca_topic_score_codex":0.000014525685,"about_ca_topic_score_gemma":0.000032377593,"teacher_disagreement_score":0.77037275,"about_ca_system_score_codex":0.00010062188,"about_ca_system_score_gemma":0.00044744255,"threshold_uncertainty_score":0.99991494},"labels":[],"label_agreement":null},{"id":"W156350744","doi":"","title":"Hamiltonian cycles in sparse vertex-adjacency duals","year":2004,"lang":"en","type":"article","venue":"Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)","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":"McGill University","funders":"","keywords":"Dual polyhedron; Adjacency list; Vertex (graph theory); Combinatorics; Hamiltonian path; Adjacency matrix; Hamiltonian (control theory); Mathematics; Computer science; Discrete mathematics; Graph; Mathematical optimization","score_opus":0.010647417065304993,"score_gpt":0.20002055125616572,"score_spread":0.18937313419086071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156350744","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.64423215,0.0013740553,0.34173408,0.004308095,0.0006281458,0.00048246278,0.000043881897,0.0006017857,0.006595333],"genre_scores_gemma":[0.9535444,0.0010700518,0.042267807,0.0011532506,0.00019401751,0.000008491282,0.00011338332,0.000047886304,0.0016007461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9962109,0.00028132705,0.00050541415,0.0011207552,0.0006427673,0.0012388638],"domain_scores_gemma":[0.9977798,0.00018555335,0.00028491634,0.00086596684,0.00020401803,0.0006797718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005115795,0.0006125221,0.00053368905,0.0013102597,0.0011186348,0.00036247095,0.00220916,0.00050224154,0.00014174504],"category_scores_gemma":[0.00008365496,0.00077912444,0.00034864858,0.0027956516,0.00027389626,0.003375179,0.0009232894,0.0006614235,0.0002757264],"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.00061393593,0.00094027637,0.0065030027,0.00012893663,0.00019713973,0.0035645424,0.017482242,0.36049604,0.005701578,0.56299025,0.007816562,0.033565514],"study_design_scores_gemma":[0.04488666,0.0010901148,0.3741653,0.0016598924,0.00041301272,0.004370687,0.015848935,0.22957055,0.018451694,0.08243132,0.22107844,0.006033393],"about_ca_topic_score_codex":0.0010317754,"about_ca_topic_score_gemma":0.00090787665,"teacher_disagreement_score":0.4805589,"about_ca_system_score_codex":0.0017445348,"about_ca_system_score_gemma":0.0019961644,"threshold_uncertainty_score":0.99946594},"labels":[],"label_agreement":null},{"id":"W1564227754","doi":"10.1007/978-3-540-34958-7_2","title":"Quad-Dominant Mesh Adaptation Using Specialized Simplicial Optimization","year":2007,"lang":"en","type":"book-chapter","venue":"","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":"Polytechnique Montréal","funders":"","keywords":"Vertex (graph theory); Mathematics; Polygon mesh; Metric (unit); Eigenvalues and eigenvectors; Operator (biology); Topology (electrical circuits); Combinatorics; Computer science; Graph; Geometry; Engineering; Physics","score_opus":0.08000587151545006,"score_gpt":0.2951302986837159,"score_spread":0.2151244271682658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564227754","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.000007193465,0.00008672141,0.7722106,0.000076214885,0.0009967174,0.00030063995,0.000004578818,0.00010181029,0.22621553],"genre_scores_gemma":[0.0014078665,0.00010307116,0.8104425,0.0006102036,0.0021722617,0.0000055857513,0.00026679473,0.000058987673,0.18493274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978861,0.000028624918,0.000596905,0.0005959475,0.0006409076,0.00025147852],"domain_scores_gemma":[0.9986133,0.00011757177,0.0003838526,0.00037669536,0.00039763647,0.00011096087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041519993,0.00033369404,0.0003344638,0.0005597569,0.00022377077,0.00021486096,0.00039677694,0.00031129672,0.00047595167],"category_scores_gemma":[0.00003332283,0.0003467743,0.00016505476,0.00019239064,0.00003455577,0.00047679938,0.00015206277,0.00018690375,0.00008473699],"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.00001788951,0.0000140163775,1.8504177e-7,0.000008047083,0.000023363671,0.000010583368,0.00010077428,0.3159778,0.00007355069,0.64648366,0.00046364174,0.036826495],"study_design_scores_gemma":[0.0003862954,0.0000565871,0.0000038390226,0.000040466697,0.000034387172,0.000026167643,0.0000058199616,0.9348739,0.00028480616,0.019437252,0.044405878,0.00044463546],"about_ca_topic_score_codex":0.00003868154,"about_ca_topic_score_gemma":0.000061054954,"teacher_disagreement_score":0.6270464,"about_ca_system_score_codex":0.0002078719,"about_ca_system_score_gemma":0.00030735106,"threshold_uncertainty_score":0.99989843},"labels":[],"label_agreement":null},{"id":"W1565785024","doi":"10.1007/11751540_14","title":"Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Saskatchewan","funders":"","keywords":"Delaunay triangulation; Computer science; Wireless ad hoc network; Triangulation; Routing (electronic design automation); Computer network; Wireless; Algorithm; Mathematics; Geometry; Telecommunications","score_opus":0.015167069041129527,"score_gpt":0.21973038752294646,"score_spread":0.20456331848181694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565785024","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.0046827006,0.001615698,0.9911026,0.00018444784,0.0017065585,0.0004779252,0.0000021595285,0.000072721894,0.00015521266],"genre_scores_gemma":[0.9713034,0.000022316659,0.027552301,0.0004444062,0.00041595238,0.0000076108413,0.0000065541926,0.000022908534,0.00022453937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969495,0.00008473353,0.0006821548,0.0008999079,0.0009758811,0.00040784507],"domain_scores_gemma":[0.99802256,0.00020885142,0.0005175666,0.00087303657,0.00031182723,0.00006618147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000639778,0.00038205183,0.00042420442,0.00037297985,0.0003129316,0.00029907146,0.0017719627,0.000261199,0.0000062891827],"category_scores_gemma":[0.00004937952,0.00028168602,0.0001960517,0.00082801824,0.0004070809,0.00036182674,0.0008132338,0.00042373867,0.000002697973],"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.000009621991,0.000015534493,0.000022291391,0.000015962722,0.00000781904,0.0000041881904,0.00015000661,0.75430053,0.0004958783,0.0022072713,0.000010906201,0.24275996],"study_design_scores_gemma":[0.0003150164,0.00006253466,0.00015886455,0.0003365759,0.000010349339,0.000026943733,5.9797514e-8,0.9801147,0.0066724713,0.011624983,0.00034855265,0.00032896295],"about_ca_topic_score_codex":0.0000218377,"about_ca_topic_score_gemma":0.00008392786,"teacher_disagreement_score":0.9666207,"about_ca_system_score_codex":0.00021637462,"about_ca_system_score_gemma":0.00033166603,"threshold_uncertainty_score":0.9999635},"labels":[],"label_agreement":null},{"id":"W1566173313","doi":"10.1002/jgt.20249","title":"The crossing number of <i>K</i><sub>11</sub> is 100","year":2007,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"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":"Crossing number (knot theory); Combinatorics; Mathematics; Simple (philosophy); Graph; Exploit; Graph theory; Discrete mathematics; Computer science","score_opus":0.010164067260674911,"score_gpt":0.2722684164393138,"score_spread":0.2621043491786389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566173313","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.5233305,0.0004437082,0.47483724,0.00023090605,0.0005423738,0.000023870767,4.3509803e-7,0.0000058904798,0.0005850947],"genre_scores_gemma":[0.99276114,0.000042327072,0.006421863,0.00048325336,0.00021455949,2.4099353e-7,1.5586575e-7,0.000004729395,0.00007172136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987574,0.00010776393,0.00047531092,0.00009189983,0.00040234352,0.00016524347],"domain_scores_gemma":[0.99828094,0.0006274137,0.00046746773,0.00018802409,0.00036528715,0.00007086163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034468314,0.00007892036,0.00012589742,0.0001501544,0.0003117144,0.00016104654,0.0004698681,0.00003920931,0.000007791412],"category_scores_gemma":[0.00009328272,0.00005363489,0.00017753411,0.0005708489,0.00014096321,0.00036325745,0.000058488647,0.00014350528,0.000006027399],"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.00017357308,0.0001518712,0.0026667002,0.000016210004,0.000105251325,0.00003715693,0.00260317,0.0008781923,0.057585314,0.58808386,0.003801198,0.34389746],"study_design_scores_gemma":[0.0006315168,0.0001314935,0.014061485,0.00007752315,0.000026449197,0.00053668633,0.00017662102,0.0007609952,0.34552506,0.62670684,0.011188303,0.0001770023],"about_ca_topic_score_codex":8.576251e-7,"about_ca_topic_score_gemma":0.0000021802455,"teacher_disagreement_score":0.46943066,"about_ca_system_score_codex":0.000019071736,"about_ca_system_score_gemma":0.00011790686,"threshold_uncertainty_score":0.23974866},"labels":[],"label_agreement":null},{"id":"W1569585172","doi":"10.1007/978-3-642-12200-2_3","title":"The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Saskatchewan","funders":"","keywords":"Rectangle; Hypercube; Square (algebra); Plane (geometry); Time complexity; Combinatorics; Volume (thermodynamics); Set (abstract data type); Computer science; Mathematics; Discrete mathematics; Algorithm; Geometry; Physics","score_opus":0.018634980358884442,"score_gpt":0.2455453835371479,"score_spread":0.22691040317826344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569585172","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.00869245,0.0017744747,0.9859395,0.0018023623,0.0009090151,0.0004893544,0.0000019222073,0.000055584984,0.0003353294],"genre_scores_gemma":[0.68570054,0.00049473264,0.31185013,0.0012860468,0.0002935378,0.00003288616,0.000007964819,0.000028574612,0.0003055705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979027,0.00004235539,0.0003627,0.00086873816,0.00046771852,0.00035579695],"domain_scores_gemma":[0.99818236,0.0008547292,0.00015180974,0.0005831388,0.00011157085,0.000116385825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094440335,0.0002813879,0.00025664686,0.00043369643,0.00038039644,0.0005507957,0.00083234534,0.00017383258,0.0000023068396],"category_scores_gemma":[0.00011271013,0.0002082535,0.00003387709,0.0004564456,0.00046485243,0.0003525194,0.0007955123,0.0006155537,0.0000045045244],"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.0000039584424,0.000035675745,0.00022624369,0.00005761999,0.000012166786,0.000029668894,0.002561887,0.023293952,0.0016220636,0.019210767,0.000023886347,0.9529221],"study_design_scores_gemma":[0.00025760432,0.00015130572,0.0019012077,0.0002661101,0.0000058580167,0.00012372437,3.8805723e-7,0.6949204,0.00047111587,0.2987619,0.0027225765,0.00041779372],"about_ca_topic_score_codex":0.000025640866,"about_ca_topic_score_gemma":0.0006725298,"teacher_disagreement_score":0.95250434,"about_ca_system_score_codex":0.00007147481,"about_ca_system_score_gemma":0.00021732948,"threshold_uncertainty_score":0.84923315},"labels":[],"label_agreement":null},{"id":"W1571741349","doi":"10.1023/a:1014310721543","title":"On a Nearest-Neighbor Problem Under Minkowski and Power Metrics for Large Data Sets","year":2002,"lang":"en","type":"article","venue":"The Journal of Supercomputing","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 Calgary","funders":"","keywords":"Voronoi diagram; Computer science; Metric (unit); Set (abstract data type); Data structure; Computational geometry; Binary logarithm; Algorithm; Online analytical processing; Preprocessor; Point (geometry); Theoretical computer science; Data mining; Data warehouse; Discrete mathematics; Mathematics; Programming language","score_opus":0.06344665619959859,"score_gpt":0.28906850617709595,"score_spread":0.22562184997749735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571741349","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.15991578,0.0012275943,0.83526933,0.002881716,0.00033240073,0.0001232862,0.000009166786,0.000017820279,0.00022294172],"genre_scores_gemma":[0.9199601,0.00003788557,0.079030894,0.00075310044,0.00015568193,4.5119197e-7,0.0000033101903,0.000007798867,0.00005078345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988217,0.00010879993,0.0003401742,0.0001734001,0.0003405822,0.00021538581],"domain_scores_gemma":[0.9980213,0.0012080722,0.00016248401,0.00032923248,0.0002022806,0.00007661617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001824871,0.000107668995,0.00015254947,0.00019952796,0.00029609277,0.00016514621,0.00084570225,0.000037307687,0.000012561483],"category_scores_gemma":[0.00022160281,0.000072923234,0.00004292585,0.0004732664,0.000017005375,0.000557373,0.00032342193,0.00018436469,0.000005155163],"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.0001673782,0.0014029552,0.0008369368,0.00017048062,0.00052383693,0.00006257368,0.016179733,0.12513809,0.002713504,0.27321887,0.083553426,0.49603224],"study_design_scores_gemma":[0.00092160195,0.00040764193,0.0010544495,0.00006183985,0.000030493324,0.00032264405,0.00014201237,0.982199,0.00012577727,0.008385192,0.0061992332,0.0001501271],"about_ca_topic_score_codex":0.000001903502,"about_ca_topic_score_gemma":0.0000017357519,"teacher_disagreement_score":0.8570609,"about_ca_system_score_codex":0.000025600952,"about_ca_system_score_gemma":0.000034112934,"threshold_uncertainty_score":0.2973723},"labels":[],"label_agreement":null},{"id":"W1571925205","doi":"10.1007/978-3-642-10631-6_91","title":"Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Calgary","funders":"","keywords":"Planar graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Planar; Graph; Plane (geometry); Line (geometry); Mathematics; Geometry; Artificial intelligence; Computer graphics (images)","score_opus":0.02326946534439766,"score_gpt":0.26775811750917106,"score_spread":0.2444886521647734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571925205","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.00019140335,0.000317126,0.99424237,0.0011187785,0.001797042,0.0007679527,0.000020308526,0.00014942304,0.0013955837],"genre_scores_gemma":[0.1421306,0.000053271833,0.8524566,0.0026783675,0.0012355297,0.00003942408,0.00013708239,0.000036529706,0.0012325528],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967423,0.000037210782,0.0005224401,0.001417241,0.0007868221,0.0004940019],"domain_scores_gemma":[0.9977531,0.0007130439,0.00031675084,0.00070058793,0.0003621972,0.00015433316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095797883,0.00045474834,0.0004406518,0.0010896318,0.00036515517,0.0004680343,0.0015048633,0.0002676603,0.000015421858],"category_scores_gemma":[0.000106534186,0.00044512306,0.00018374536,0.00078207423,0.0001959063,0.0007764887,0.00017790942,0.00040521816,0.000013671753],"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.000016707821,0.00004558842,0.000004291051,0.000024159894,0.000011171322,0.00001148419,0.00020913346,0.06951231,0.00038352594,0.08199368,0.000078345765,0.8477096],"study_design_scores_gemma":[0.00060277455,0.00048999354,0.00023265778,0.00010771692,0.000012385106,0.000033397937,7.935981e-8,0.45567527,0.004010418,0.5360365,0.0022671486,0.00053163193],"about_ca_topic_score_codex":0.000005671948,"about_ca_topic_score_gemma":0.000068294394,"teacher_disagreement_score":0.847178,"about_ca_system_score_codex":0.0002451815,"about_ca_system_score_gemma":0.00051885145,"threshold_uncertainty_score":0.9998},"labels":[],"label_agreement":null},{"id":"W1572614461","doi":"10.1007/978-3-540-31843-9_27","title":"Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McGill University","funders":"","keywords":"Planar graph; Planar; Combinatorics; Outerplanar graph; Vertex (graph theory); Graph; Hamiltonian (control theory); Hamiltonian path; Planar straight-line graph; Book embedding; Mathematics; Computer science; 1-planar graph; Discrete mathematics; Line graph; Pathwidth; Computer graphics (images)","score_opus":0.008726890628925375,"score_gpt":0.22043576840891785,"score_spread":0.21170887777999248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572614461","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.00035984564,0.0012370588,0.9912242,0.0037527115,0.00038289552,0.0005850038,0.0000023972077,0.000106212705,0.0023496642],"genre_scores_gemma":[0.26780504,0.00016117624,0.7284521,0.0022338417,0.00040184372,0.000032819622,0.000008474042,0.000025524734,0.0008791747],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970717,0.000059245518,0.0004198741,0.0012184813,0.0008288456,0.0004018582],"domain_scores_gemma":[0.9980689,0.0004189495,0.00022457616,0.00089055224,0.00027660484,0.00012041038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013109581,0.00040991136,0.0004138595,0.0004454841,0.00045719335,0.00070187484,0.0015284647,0.0001576508,0.00000926396],"category_scores_gemma":[0.000052674597,0.00026011225,0.0000877386,0.0006811032,0.0016027681,0.0005297945,0.000730838,0.00052554504,0.0000078361745],"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.000011593387,0.0000229669,0.000041063075,0.000029077419,0.000013911577,0.000011344467,0.00059640367,0.068188004,0.000028849325,0.25719038,0.000011665893,0.67385477],"study_design_scores_gemma":[0.0010239732,0.000172341,0.0012339595,0.00018752064,0.000014768638,0.00015447549,1.5113747e-7,0.42456463,0.00030422886,0.56866163,0.0031256163,0.00055671815],"about_ca_topic_score_codex":0.00001672308,"about_ca_topic_score_gemma":0.00019437441,"teacher_disagreement_score":0.673298,"about_ca_system_score_codex":0.000113999515,"about_ca_system_score_gemma":0.0004229298,"threshold_uncertainty_score":0.9999851},"labels":[],"label_agreement":null},{"id":"W1573036177","doi":"10.1007/3-540-45294-x_21","title":"I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Combinatorics; sort; Set (abstract data type); Point (geometry); Mathematics; Plane (geometry); Range (aeronautics); Left and right; Binary logarithm; Algorithm; Discrete mathematics; Computer science; Geometry; Arithmetic","score_opus":0.02337606576316631,"score_gpt":0.2532877619939588,"score_spread":0.2299116962307925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573036177","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.0005431639,0.00066582265,0.99376416,0.0011475828,0.00047104544,0.0013345233,0.0000052400815,0.0001401825,0.0019282597],"genre_scores_gemma":[0.50801784,0.00008559868,0.48578456,0.0035449064,0.0012100328,0.00024616448,0.000018162951,0.00005498313,0.0010377717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678046,0.000024995808,0.00044310433,0.0014227564,0.0008480003,0.00048066973],"domain_scores_gemma":[0.99818367,0.0003217632,0.00020081477,0.00063278864,0.00043777816,0.00022315871],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009385102,0.00037520227,0.0003389767,0.0007660824,0.00037882145,0.00050787395,0.001317285,0.00017752041,0.000010220331],"category_scores_gemma":[0.00008485412,0.0003674316,0.000059994018,0.0011785942,0.00014022857,0.0002868906,0.00093422126,0.00039870283,0.000049062546],"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.000003052393,0.000045136378,0.00002386198,0.00006399638,0.000006807933,0.000010168661,0.00081937434,0.5201557,0.00036158052,0.05010036,0.000010530645,0.4283994],"study_design_scores_gemma":[0.0001882871,0.0000814037,0.00014667623,0.00015685869,0.0000061826245,0.000060807153,1.407408e-7,0.9574083,0.00034851025,0.034197636,0.0069224634,0.00048272943],"about_ca_topic_score_codex":0.000007587623,"about_ca_topic_score_gemma":0.000032625543,"teacher_disagreement_score":0.50797963,"about_ca_system_score_codex":0.00020408581,"about_ca_system_score_gemma":0.00034460452,"threshold_uncertainty_score":0.99987775},"labels":[],"label_agreement":null},{"id":"W1574320314","doi":"10.1007/978-3-540-77050-3_33","title":"Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Polyhedron; Regular polygon; Polygon (computer graphics); Star-shaped polygon; Rectilinear polygon; Polygon covering; Combinatorics; Convex polygon; Face (sociological concept); Enhanced Data Rates for GSM Evolution; Construct (python library); Computer science; Mathematics; Convex polytope; Convex set; Geometry; Convex optimization; Artificial intelligence; Simple polygon","score_opus":0.026459950766963926,"score_gpt":0.2642927247373306,"score_spread":0.2378327739703667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574320314","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.005101046,0.0008179348,0.9894618,0.00025791055,0.0011131465,0.00019072116,0.000010650592,0.000045186975,0.003001619],"genre_scores_gemma":[0.53281957,0.00012050312,0.46493253,0.00093785924,0.0006626831,0.0000062757913,0.00001961583,0.00002302103,0.00047791775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983512,0.00001920218,0.00028350417,0.00076404447,0.00032428507,0.0002577224],"domain_scores_gemma":[0.99907386,0.00038369882,0.000115685616,0.00025598417,0.00008242422,0.00008833361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004176601,0.0002150695,0.00022435574,0.00068077614,0.00016496876,0.00025653033,0.00037961148,0.00016595692,0.000017011205],"category_scores_gemma":[0.000050163937,0.00021823468,0.000026217453,0.00044467137,0.00031292994,0.0003322298,0.0003488936,0.00041131175,0.000008929715],"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.0000032691983,0.000010697619,0.0010245708,0.000011108611,0.000006403312,0.000022788136,0.00061153487,0.0018258312,0.00009803988,0.018859187,0.000010437613,0.9775161],"study_design_scores_gemma":[0.00047533392,0.000093995535,0.005430571,0.0003298689,0.000009210786,0.00031187313,0.0000022009438,0.8612271,0.0006027685,0.12769143,0.0030547865,0.00077086734],"about_ca_topic_score_codex":0.00003973054,"about_ca_topic_score_gemma":0.00012484932,"teacher_disagreement_score":0.97674525,"about_ca_system_score_codex":0.00008488375,"about_ca_system_score_gemma":0.00031871905,"threshold_uncertainty_score":0.8899352},"labels":[],"label_agreement":null},{"id":"W157468222","doi":"10.1016/j.disc.2003.12.003","title":"Light edges in degree-constrained graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","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":"Degree (music); Mathematics; Combinatorics; Graph; Bounded function; Constant (computer programming); Discrete mathematics; 1-planar graph; Line graph; Computer science; Physics","score_opus":0.026238300099238197,"score_gpt":0.2545521773285069,"score_spread":0.22831387722926869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157468222","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.073324054,0.00008696323,0.9157499,0.0015014503,0.00016719554,0.00015139343,0.000001416334,0.00009235798,0.00892527],"genre_scores_gemma":[0.78638214,0.000005165883,0.21335436,0.000111638605,0.000028097465,0.000012048112,0.000004617203,0.000005628552,0.00009630674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991602,0.000016143174,0.00024418707,0.00019282175,0.00021510759,0.00017158483],"domain_scores_gemma":[0.99952203,0.000053193533,0.00006522225,0.00026185453,0.000043149743,0.000054547352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020615688,0.00010801439,0.00013477843,0.0001775094,0.000057644458,0.000095171294,0.00033134146,0.00004075073,0.0000084087],"category_scores_gemma":[0.000052885895,0.00009509287,0.000054066193,0.0005598725,0.000017829692,0.0002596004,0.00007568567,0.00007496221,0.000050435665],"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":[9.886868e-7,0.00009168523,0.000038936938,0.000032562308,0.000007815931,0.00001475763,0.0020920313,0.0031853945,0.0013552548,0.9852122,0.00006212291,0.007906252],"study_design_scores_gemma":[0.0008724525,0.000073804906,0.0012694926,0.00011334211,0.000007217881,0.000054493812,0.00017910603,0.03706899,0.01671206,0.94268155,0.0006386325,0.00032887986],"about_ca_topic_score_codex":0.000003395869,"about_ca_topic_score_gemma":0.000021405864,"teacher_disagreement_score":0.7130581,"about_ca_system_score_codex":0.000030281843,"about_ca_system_score_gemma":0.00006521335,"threshold_uncertainty_score":0.38777748},"labels":[],"label_agreement":null},{"id":"W1575954839","doi":"10.1016/j.jda.2005.12.004","title":"The strength of weak proximity","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"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":"Mathematics; Combinatorics; Graph; Graph drawing","score_opus":0.008308327042227587,"score_gpt":0.2407506924496122,"score_spread":0.2324423654073846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575954839","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.039025456,0.0013857875,0.9538409,0.0026715298,0.0008503102,0.000089224435,0.0000042853085,0.000012923397,0.0021195456],"genre_scores_gemma":[0.90295327,0.000065475295,0.09581674,0.000026846465,0.00056224247,0.000001233188,0.0000018911327,0.0000043852374,0.0005679207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891305,0.000060679627,0.00041568317,0.00007993491,0.0004165216,0.000114105496],"domain_scores_gemma":[0.9989467,0.00015067542,0.00041727908,0.00015696311,0.00028871102,0.000039673057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052634533,0.000066741064,0.00011862657,0.00007528273,0.00011269134,0.00008381851,0.00041694188,0.000024085924,0.0000032581343],"category_scores_gemma":[0.00004571566,0.000040845716,0.00010651057,0.00029916756,0.0000387587,0.0004400852,0.000060422288,0.000110652385,0.0000016395963],"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.000061429026,0.000384603,0.0010625616,0.000030324165,0.00016396899,0.000029618732,0.0003185509,0.017198164,0.005842947,0.3627841,0.017325282,0.59479845],"study_design_scores_gemma":[0.0026918042,0.0015254454,0.07218464,0.00012829641,0.00008264705,0.0005061854,0.00022320088,0.50827456,0.064321764,0.25670585,0.09279282,0.00056283054],"about_ca_topic_score_codex":0.000012195189,"about_ca_topic_score_gemma":0.0000063454145,"teacher_disagreement_score":0.8639278,"about_ca_system_score_codex":0.000019503523,"about_ca_system_score_gemma":0.0001049123,"threshold_uncertainty_score":0.166564},"labels":[],"label_agreement":null},{"id":"W1576096982","doi":"10.1007/3-540-44842-x_94","title":"On the Reliability of Triangle Intersection in 3D","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McGill University","funders":"","keywords":"Intersection (aeronautics); Point (geometry); Reliability (semiconductor); Code (set theory); Space (punctuation); Mathematics; Computer science; Algorithm; Arithmetic; Geometry; Set (abstract data type); Geography; Physics; Programming language; Cartography","score_opus":0.017198452708866083,"score_gpt":0.24117718722042622,"score_spread":0.22397873451156014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576096982","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.002724679,0.00007813127,0.99093723,0.0011280652,0.0015581934,0.00035331206,0.0000017772717,0.000026834987,0.0031917724],"genre_scores_gemma":[0.88263017,0.00001623737,0.11469602,0.002156689,0.00017731999,0.000014086626,0.000003864867,0.000015299014,0.000290343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976898,0.000100256395,0.0004945261,0.0008105376,0.00064989756,0.0002550014],"domain_scores_gemma":[0.9975302,0.0011506139,0.0002431489,0.0008348279,0.00019442035,0.000046785946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017859827,0.00024661032,0.0003149382,0.00073565636,0.00010520513,0.00011980378,0.0012404466,0.0001590478,0.00002614525],"category_scores_gemma":[0.0004090847,0.00018428652,0.00009787809,0.00095102185,0.00028676787,0.0002732262,0.00028261053,0.0005186914,0.0000117160025],"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.000019933239,0.00008633333,0.00004456078,0.000026253147,0.0000049549217,0.000010777466,0.0007140857,0.5437805,0.00014076252,0.12574223,0.00007985249,0.32934976],"study_design_scores_gemma":[0.00028788968,0.00028005187,0.00031380195,0.00023035397,0.0000028816874,0.000015015411,2.3105942e-7,0.5706542,0.0025435137,0.42460427,0.0007845358,0.0002832596],"about_ca_topic_score_codex":0.000017403023,"about_ca_topic_score_gemma":0.00006390578,"teacher_disagreement_score":0.87990546,"about_ca_system_score_codex":0.0002853416,"about_ca_system_score_gemma":0.00028468008,"threshold_uncertainty_score":0.7514986},"labels":[],"label_agreement":null},{"id":"W1577290713","doi":"10.1007/bfb0038197","title":"Face traverses and a volume algorithm for polyhedra","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Polyhedron; Traverse; Volume (thermodynamics); Face (sociological concept); Algorithm; Computation; Computer science; Geometry; Combinatorics; Mathematics; Geology; Physics","score_opus":0.012855334095978856,"score_gpt":0.2363724245625477,"score_spread":0.22351709046656884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577290713","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.000029429108,0.00062240625,0.9962488,0.0005925226,0.0011249438,0.00046620183,0.00002703811,0.0000978776,0.0007907704],"genre_scores_gemma":[0.015073638,0.000026000936,0.98092735,0.00083067454,0.0006915268,0.000017406963,0.000033824348,0.000023681901,0.0023758796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974705,0.000016272996,0.0003534348,0.0011712224,0.00056004367,0.00042854904],"domain_scores_gemma":[0.99859464,0.00040110637,0.00017342869,0.00049488875,0.00021615873,0.00011977362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004536718,0.00036708915,0.00034644836,0.00063292857,0.00028055772,0.0006620961,0.0010593006,0.00020965232,0.0000065642444],"category_scores_gemma":[0.000041662875,0.00036305643,0.00009741142,0.00039845155,0.0003201884,0.0006380104,0.00043833363,0.00027024283,0.00001035789],"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.0000015090341,0.000012801218,0.0000036346166,0.0000150507085,0.0000052378537,0.000009588321,0.00014475474,0.042872794,0.000037840167,0.0064559225,0.00013249938,0.9503084],"study_design_scores_gemma":[0.0002685199,0.00015304817,0.00013509399,0.00006413249,0.000006923274,0.000055709785,1.07151024e-7,0.9258098,0.00048189724,0.06265633,0.0099546,0.00041383083],"about_ca_topic_score_codex":0.000016224369,"about_ca_topic_score_gemma":0.000019920011,"teacher_disagreement_score":0.94989455,"about_ca_system_score_codex":0.00012561295,"about_ca_system_score_gemma":0.0003481252,"threshold_uncertainty_score":0.99988216},"labels":[],"label_agreement":null},{"id":"W1578000835","doi":"10.1007/3-540-46521-9_14","title":"Triangulations without Minimum-Weight Drawing","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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","funders":"","keywords":"Delaunay triangulation; Constrained Delaunay triangulation; Triangulation; Pitteway triangulation; Minimum-weight triangulation; Minimum weight; Point set triangulation; Bowyer–Watson algorithm; Computer science; Combinatorics; Mathematics; Geometry","score_opus":0.01725744111328664,"score_gpt":0.25364691851734766,"score_spread":0.23638947740406102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578000835","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.0002667356,0.00046431352,0.9847532,0.00080339797,0.0017513827,0.00036137743,0.0000047540784,0.0001847853,0.011410056],"genre_scores_gemma":[0.32100892,0.000073703464,0.67216736,0.0020136377,0.0018526508,0.000018209792,0.00004021046,0.000050404287,0.0027748952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964392,0.00004260402,0.0005850858,0.0013856032,0.0010230516,0.00052446086],"domain_scores_gemma":[0.9980052,0.00032750767,0.00022921394,0.0010317294,0.00022202796,0.00018430279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006363983,0.0004616797,0.00044579452,0.0012365248,0.0004266519,0.0006428998,0.001982324,0.0002694255,0.000114830844],"category_scores_gemma":[0.00006028438,0.0004498847,0.00015748544,0.000993447,0.00031251664,0.00082952215,0.000469887,0.0005374253,0.00013098474],"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.0000054412453,0.000025604106,0.000023075341,0.00001028619,0.000011050146,0.000032157357,0.00046835898,0.1548488,0.00012062323,0.027344765,0.000035278397,0.81707454],"study_design_scores_gemma":[0.00039706376,0.0000984557,0.0003056316,0.00017901533,0.000011132698,0.00007807382,5.2285074e-8,0.7315187,0.0007475619,0.25717956,0.008884443,0.0006002948],"about_ca_topic_score_codex":0.000011105281,"about_ca_topic_score_gemma":0.000030500474,"teacher_disagreement_score":0.81647426,"about_ca_system_score_codex":0.0002256957,"about_ca_system_score_gemma":0.0007370292,"threshold_uncertainty_score":0.9997953},"labels":[],"label_agreement":null},{"id":"W1579171921","doi":"10.1007/bfb0028264","title":"Immobilizing a polytope","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; University of Ottawa; Université du Québec en Outaouais","funders":"","keywords":"Combinatorics; Polytope; Polygon (computer graphics); Mathematics; Boundary (topology); Regular polygon; Convex polytope; General position; Polygon covering; Polyhedron; Convex polygon; Position (finance); Point (geometry); Simple polygon; Convex set; Geometry; Computer science; Mathematical analysis; Convex optimization","score_opus":0.016677696001507487,"score_gpt":0.249318264119708,"score_spread":0.23264056811820052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579171921","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.00008651231,0.0009733511,0.9878722,0.0011500919,0.0016376497,0.00027421463,0.0000024109167,0.00016892643,0.007834647],"genre_scores_gemma":[0.1569245,0.00008331285,0.8354579,0.0032310283,0.0019415139,0.000012440393,0.000012665229,0.000039285045,0.0022973116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966276,0.000025502713,0.0004857314,0.0013691229,0.00095392985,0.0005380997],"domain_scores_gemma":[0.9980482,0.00031814125,0.00021659317,0.001010813,0.00023974739,0.00016651323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074533763,0.00042580845,0.00037764508,0.0010312326,0.0002673041,0.0005657034,0.0023171038,0.00023317138,0.000050950217],"category_scores_gemma":[0.00006585616,0.00041510147,0.00013117689,0.00079191313,0.000277194,0.0007965974,0.0010073856,0.00057710375,0.00013045875],"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.000002978088,0.000018708071,0.000006083985,0.000010316268,0.000005532894,0.00002890955,0.00022993721,0.10379598,0.00020727303,0.047199424,0.00002699856,0.8484678],"study_design_scores_gemma":[0.00028142193,0.00019208313,0.00011457256,0.0002127674,0.000006752508,0.00014296721,7.291144e-8,0.8286142,0.0025385404,0.15006112,0.017020665,0.00081487803],"about_ca_topic_score_codex":0.00000845563,"about_ca_topic_score_gemma":0.000045129094,"teacher_disagreement_score":0.847653,"about_ca_system_score_codex":0.0003153047,"about_ca_system_score_gemma":0.0006760079,"threshold_uncertainty_score":0.99983007},"labels":[],"label_agreement":null},{"id":"W1581798618","doi":"10.46298/dmtcs.545","title":"A de Bruijn - Erdos theorem and metric spaces","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"De Bruijn sequence; Mathematics; Generalization; Metric space; Combinatorics; Plane (geometry); Set (abstract data type); Discrete mathematics; Chen; Metric (unit); Computer science; Mathematical analysis; Geometry","score_opus":0.0191087445210922,"score_gpt":0.2562057253920496,"score_spread":0.2370969808709574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581798618","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.037346095,0.000073052244,0.9523513,0.00028163646,0.00020497445,0.00018566792,0.0000014741988,0.00014984903,0.009405972],"genre_scores_gemma":[0.5565723,0.000006090779,0.44316074,0.00019375418,0.000041603394,0.000006428536,4.6791436e-7,0.000005899081,0.000012702224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978159,0.00009267076,0.00031696283,0.00061271584,0.00063889514,0.0005228235],"domain_scores_gemma":[0.99842113,0.00035374393,0.00011347702,0.0006057762,0.0001759042,0.00032993968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019044637,0.00021980306,0.00023171522,0.000397789,0.00041283068,0.0007580906,0.0014656184,0.000056723242,0.00006253366],"category_scores_gemma":[0.0002051296,0.0001728079,0.000067590314,0.0016898885,0.0014061071,0.00072644185,0.00092697813,0.00015516735,0.000033929948],"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.0000030858598,0.00006715852,0.00003391367,0.00001999351,0.00000761963,0.000008129797,0.0034842857,0.000051817766,0.00031824713,0.98319286,0.000019328496,0.012793531],"study_design_scores_gemma":[0.00009878614,0.00010524059,0.0005172573,0.000019221961,0.0000079913625,0.000075684664,0.000034115543,0.5063641,0.001932017,0.49065244,0.000031909043,0.00016126141],"about_ca_topic_score_codex":0.0000035196142,"about_ca_topic_score_gemma":3.3916382e-7,"teacher_disagreement_score":0.51922625,"about_ca_system_score_codex":0.00003546936,"about_ca_system_score_gemma":0.00013576406,"threshold_uncertainty_score":0.73102844},"labels":[],"label_agreement":null},{"id":"W1583270413","doi":"10.1007/978-3-662-45803-7_25","title":"Morphing Schnyder Drawings of Planar Triangulations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Morphing; Planar; Computer science; Computer graphics (images); Mathematics; Engineering drawing; Engineering","score_opus":0.01733986488737967,"score_gpt":0.2449281265707318,"score_spread":0.2275882616833521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583270413","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.00018980772,0.00023252986,0.99521315,0.0007242569,0.0011683324,0.00024228854,0.0000040235777,0.00008765003,0.0021379732],"genre_scores_gemma":[0.3228449,0.000011794322,0.67506063,0.000838936,0.00059716543,0.000005326191,0.000017605495,0.000022559641,0.00060105853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722,0.000034698496,0.00057744957,0.0009197338,0.0009034929,0.0003446712],"domain_scores_gemma":[0.9977969,0.00055046094,0.00037459008,0.00083806954,0.00032760948,0.0001124004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009170876,0.0003215048,0.0004307433,0.0011808546,0.00022391441,0.00025577337,0.0016957625,0.00021161948,0.000021182304],"category_scores_gemma":[0.0001414445,0.0003146813,0.00013084637,0.0007715288,0.00030748983,0.00043368412,0.0004064438,0.00039725384,0.000024253983],"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.0000045940556,0.000020048585,0.000032981407,0.00003848296,0.000014239452,0.000012826188,0.00052394025,0.2359602,0.00065362494,0.24617733,0.00005747516,0.5165042],"study_design_scores_gemma":[0.00032107398,0.000119352655,0.00030114828,0.00024834435,0.000010137948,0.00004031695,8.194763e-8,0.7083903,0.0020653205,0.28538424,0.0026639826,0.00045572134],"about_ca_topic_score_codex":0.000014320747,"about_ca_topic_score_gemma":0.000019214625,"teacher_disagreement_score":0.51604855,"about_ca_system_score_codex":0.000119286015,"about_ca_system_score_gemma":0.00044634406,"threshold_uncertainty_score":0.9999305},"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":"W1587885651","doi":"10.1007/978-3-540-46515-7_5","title":"On the Existente of a Point Subset with 4 or 5 Interior Points","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McGill University","funders":"","keywords":"Convex hull; Integer (computer science); Combinatorics; Point (geometry); Interior point method; Set (abstract data type); Plane (geometry); Boundary (topology); Planar; Regular polygon; Mathematics; Hull; Geometry; Discrete mathematics; Computer science; Algorithm; Mathematical analysis; Computer graphics (images)","score_opus":0.020578748559304545,"score_gpt":0.24123237248837337,"score_spread":0.22065362392906882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587885651","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.0014625083,0.00007641808,0.99205834,0.0018334456,0.0005091526,0.00039835644,0.0000075421085,0.000050781095,0.0036034712],"genre_scores_gemma":[0.73251265,0.00004970334,0.25983164,0.0059113726,0.0003491368,0.000023571762,0.000013124656,0.00004289657,0.0012658881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734414,0.000049277936,0.00042897815,0.000902672,0.0009361573,0.00033876413],"domain_scores_gemma":[0.9976152,0.0007883929,0.00027129133,0.0010208823,0.0002161081,0.00008809297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066139584,0.00036692273,0.00037844724,0.00057751033,0.00017287863,0.00025718287,0.0020849134,0.00012045269,0.00012514718],"category_scores_gemma":[0.00007543563,0.00021134656,0.000097360746,0.000744462,0.0004906304,0.00030237937,0.00041303682,0.00045805975,0.00003631467],"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.0002551924,0.000088181296,0.000013255566,0.00005284228,0.0000445062,0.00014657892,0.0015753041,0.06897536,0.00018175461,0.22315267,0.00016512185,0.70534927],"study_design_scores_gemma":[0.00084381003,0.0023810505,0.00021194176,0.0016991678,0.000020129944,0.00039468292,7.093459e-7,0.54083264,0.006782165,0.4430603,0.0027650322,0.0010083506],"about_ca_topic_score_codex":0.000008469059,"about_ca_topic_score_gemma":0.00006491463,"teacher_disagreement_score":0.73222667,"about_ca_system_score_codex":0.00011498073,"about_ca_system_score_gemma":0.0004945832,"threshold_uncertainty_score":0.86184627},"labels":[],"label_agreement":null},{"id":"W1588622438","doi":"10.37236/3263","title":"Sparse Distance Sets in the Triangular Lattice","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","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":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Euclidean geometry; Plane (geometry); Planar; Euclidean distance; Lattice (music); Hexagonal lattice; Point (geometry); Function (biology); Discrete mathematics; Geometry; Physics","score_opus":0.00998602909444497,"score_gpt":0.23487174949504638,"score_spread":0.22488572040060142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588622438","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.34116444,0.0047783544,0.63938785,0.01308738,0.0006417761,0.00025575122,1.7722968e-7,0.000012254798,0.00067200896],"genre_scores_gemma":[0.99902594,0.00015980395,0.00018602322,0.00041747067,0.00007428572,0.0000049710065,3.562062e-7,0.0000036141496,0.0001275046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861383,0.0002779997,0.0002985691,0.00008498181,0.0004341682,0.00029041938],"domain_scores_gemma":[0.99891984,0.0003676206,0.00022612659,0.00026583124,0.00018901701,0.000031543954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017328105,0.000082683146,0.00012027118,0.00008423353,0.00010847451,0.00014167096,0.0011499217,0.000027104305,0.0000062384056],"category_scores_gemma":[0.00009988642,0.000046307403,0.0000640284,0.0008371013,0.000022080498,0.00043926988,0.000043686934,0.00043824478,0.000017577237],"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.0000058264236,0.00008072418,0.000059338432,0.000002208776,0.000012790673,0.0000057961715,0.0005541209,0.0009746693,0.00004855177,0.9930327,0.001135324,0.004087973],"study_design_scores_gemma":[0.00061504426,0.00022959487,0.003105515,0.000009639146,0.00001037028,0.00017888389,0.00008530487,0.014403386,0.00019448045,0.97067404,0.010413367,0.00008037224],"about_ca_topic_score_codex":0.000006784631,"about_ca_topic_score_gemma":0.0000049098894,"teacher_disagreement_score":0.65786153,"about_ca_system_score_codex":0.00012167447,"about_ca_system_score_gemma":0.000250158,"threshold_uncertainty_score":0.21368597},"labels":[],"label_agreement":null},{"id":"W1590344984","doi":"10.1007/11751540_8","title":"Two Map Labeling Algorithms for GIS Applications","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Calgary","funders":"","keywords":"Inscribed figure; Rectangle; Orientation (vector space); Computer science; Regular polygon; Set (abstract data type); Algorithm; Center (category theory); Geographic information system; Mathematics; Geometry; Cartography","score_opus":0.021555197416907045,"score_gpt":0.27809002219823087,"score_spread":0.25653482478132383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590344984","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.0000036698868,0.00074075535,0.99451804,0.00086896704,0.0013623049,0.00085397303,0.000020848724,0.00016487316,0.0014665748],"genre_scores_gemma":[0.0040826458,0.000011724979,0.9919456,0.00091741385,0.0015238677,0.00010768143,0.000075235635,0.000027690801,0.0013080986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696165,0.000016545586,0.0004975341,0.0013432618,0.0006918135,0.000489205],"domain_scores_gemma":[0.9977889,0.00053989084,0.0002495291,0.00084750756,0.00045694047,0.00011722099],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069457706,0.00038460176,0.0003447327,0.0007656028,0.00042120513,0.0005251448,0.0018799953,0.00018169562,0.000007770687],"category_scores_gemma":[0.00002783845,0.0003917919,0.00013887676,0.0006502004,0.0002271687,0.00044248087,0.00052089314,0.00034913287,0.000040382023],"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.0000015783568,0.000024515111,0.0000033965061,0.000030006404,0.0000066813736,0.000004344093,0.000061144776,0.30070838,0.00014508294,0.06313461,0.0001820143,0.63569826],"study_design_scores_gemma":[0.0002679938,0.00006343184,0.000009336402,0.000067679845,0.0000074513064,0.000017360147,3.667474e-8,0.69768447,0.0009156209,0.27325577,0.027306188,0.00040463946],"about_ca_topic_score_codex":0.000018610413,"about_ca_topic_score_gemma":0.000040904284,"teacher_disagreement_score":0.6352936,"about_ca_system_score_codex":0.00022274807,"about_ca_system_score_gemma":0.00048081376,"threshold_uncertainty_score":0.9998534},"labels":[],"label_agreement":null},{"id":"W1590814900","doi":"","title":"Space-Efficient Algorithms for Klee's Measure Problem.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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":"Measure (data warehouse); Combinatorics; Mathematics; Plane (geometry); Space (punctuation); Binary logarithm; Set (abstract data type); Computational geometry; Degenerate energy levels; Time complexity; Algorithm; Discrete mathematics; Geometry; Computer science; Physics; Data mining","score_opus":0.03807973057664759,"score_gpt":0.2652294900331958,"score_spread":0.2271497594565482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590814900","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.003842313,0.00009476521,0.96926254,0.01645502,0.00046719186,0.000623136,0.00008798276,0.0001264514,0.0090405885],"genre_scores_gemma":[0.73076516,0.000002290426,0.26590323,0.0019606173,0.00033731418,0.00008251665,0.00012564544,0.00001681116,0.0008063977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977068,0.00006265669,0.0003562386,0.0006906156,0.0006185839,0.0005651243],"domain_scores_gemma":[0.997968,0.00027219133,0.00012460878,0.0003230075,0.0007174166,0.0005947682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048198446,0.00026914242,0.00022203785,0.0008493132,0.0004374992,0.00034543354,0.00066358305,0.00012580039,0.00021440422],"category_scores_gemma":[0.000113036556,0.00029205895,0.00011819452,0.0011862464,0.000055020708,0.00028066346,0.000063875785,0.00019356763,0.00040946604],"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.000005798351,0.00004915152,0.000018155195,0.000006996223,0.000018156754,0.0000030575293,0.00009280075,0.563543,0.000023610644,0.32476163,0.008083617,0.10339402],"study_design_scores_gemma":[0.0005823794,0.00013474272,0.0011032243,0.000028581197,0.0000071293302,0.000020916592,0.000014397758,0.92340875,0.00016814494,0.018809594,0.05534977,0.00037236253],"about_ca_topic_score_codex":0.0006640994,"about_ca_topic_score_gemma":0.0019316875,"teacher_disagreement_score":0.72692287,"about_ca_system_score_codex":0.00042888193,"about_ca_system_score_gemma":0.0016081322,"threshold_uncertainty_score":0.99995315},"labels":[],"label_agreement":null},{"id":"W1592173722","doi":"10.1007/978-3-540-44400-8_9","title":"On the Minimum Perimeter Triangle Enclosing a Convex Polygon","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Windsor; Simon Fraser University","funders":"","keywords":"Perimeter; Polygon (computer graphics); Regular polygon; Property (philosophy); Star-shaped polygon; Polygon covering; Rectilinear polygon; Combinatorics; Convex polygon; Computer science; Mathematics; Simple polygon; Convex set; Geometry; Convex optimization","score_opus":0.022989547071437112,"score_gpt":0.246375315216998,"score_spread":0.22338576814556088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592173722","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.000490801,0.00045162445,0.98491144,0.003022462,0.0025028137,0.00044212653,0.0000032831733,0.00008069894,0.008094743],"genre_scores_gemma":[0.582413,0.000056074834,0.3736367,0.03755033,0.0016297416,0.000047424426,0.000019256086,0.00009624632,0.004551219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966267,0.00010316042,0.00046860374,0.001239059,0.0010441229,0.0005184081],"domain_scores_gemma":[0.99683523,0.0014452921,0.00025792545,0.0011227281,0.00020928783,0.00012952395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012229715,0.00046430732,0.00041634278,0.0007374954,0.00046278426,0.0007297979,0.0020655254,0.00022744936,0.00009704625],"category_scores_gemma":[0.00024587457,0.00034296061,0.00018042502,0.00079933385,0.00040126548,0.00036927158,0.00046534935,0.00066406565,0.00009156484],"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.000022098187,0.00008884342,0.0000060348193,0.000025245894,0.000031798125,0.00007731551,0.0011178545,0.051607553,0.0012812,0.39109278,0.0009508743,0.5536984],"study_design_scores_gemma":[0.0004994462,0.0004605129,0.000035922803,0.000298698,0.000013385415,0.000111304726,3.4432495e-7,0.5524068,0.01131222,0.42378327,0.010168576,0.00090955046],"about_ca_topic_score_codex":0.000004799666,"about_ca_topic_score_gemma":0.000006009447,"teacher_disagreement_score":0.6112748,"about_ca_system_score_codex":0.00022955785,"about_ca_system_score_gemma":0.00045056653,"threshold_uncertainty_score":0.99990225},"labels":[],"label_agreement":null},{"id":"W1592802262","doi":"10.1007/s00453-005-1181-y","title":"A Fixed-Parameter Approach to 2-Layer Planarization","year":2006,"lang":"en","type":"article","venue":"Algorithmica","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; Carleton University; McGill University","funders":"","keywords":"Chemical-mechanical planarization; Bipartite graph; Mathematics; Time complexity; Combinatorics; Permutation (music); Theory of computation; Graph; Layer (electronics); Line graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Computer science; Physics; Materials science","score_opus":0.012689429855639651,"score_gpt":0.22403745475337417,"score_spread":0.21134802489773452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592802262","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.00563677,0.000024262294,0.9848653,0.0006411117,0.00024346627,0.00015840714,0.0000031169002,0.000122029785,0.00830554],"genre_scores_gemma":[0.44733015,3.9184886e-7,0.55026317,0.00085785263,0.0003047081,0.000031161904,0.0000670381,0.000006621092,0.0011389359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907625,0.000031945907,0.00016181539,0.0003217638,0.0002314089,0.00017680062],"domain_scores_gemma":[0.99953103,0.000054810585,0.000036341182,0.00024113328,0.000076281,0.0000604175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011048325,0.0000953279,0.00008633881,0.00015584349,0.00009639817,0.0001407646,0.00030084123,0.000043029744,0.0000067629107],"category_scores_gemma":[0.00002034011,0.000093154995,0.000035502784,0.0006355807,0.000008525273,0.00025434885,0.0000836073,0.000054845408,0.00013200972],"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.000014631704,0.0006164364,0.00026943776,0.000018991303,0.00003857594,0.000011464769,0.0005034092,0.14991058,0.0068402756,0.49237117,0.08374305,0.26566195],"study_design_scores_gemma":[0.00026865318,0.00006688707,0.004320568,0.0000043220252,0.00000574853,0.000029602897,0.0000048272364,0.9359963,0.009739318,0.0144552635,0.034837455,0.00027108012],"about_ca_topic_score_codex":0.000036195208,"about_ca_topic_score_gemma":0.0000018901594,"teacher_disagreement_score":0.78608567,"about_ca_system_score_codex":0.000028531213,"about_ca_system_score_gemma":0.000033713684,"threshold_uncertainty_score":0.37987503},"labels":[],"label_agreement":null},{"id":"W1592876209","doi":"10.1007/11602613_86","title":"On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Regina","funders":"","keywords":"Colored; Domino; Rectangle; Combinatorics; Polygon (computer graphics); Simple (philosophy); Mathematics; Set (abstract data type); Orthogonal basis; Computer science; Frame (networking); Geometry","score_opus":0.014355166049815501,"score_gpt":0.2509207220027706,"score_spread":0.2365655559529551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592876209","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.03524622,0.00015313478,0.96271956,0.0005789947,0.00030527767,0.00036718207,0.000013814325,0.000024164809,0.0005916792],"genre_scores_gemma":[0.9286569,0.000016740614,0.070511036,0.0005972889,0.00015189998,0.000004618972,0.000013821334,0.00001180694,0.000035911507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975602,0.000043863984,0.00058190926,0.00072635076,0.00080579595,0.0002818707],"domain_scores_gemma":[0.99735826,0.001246351,0.00046756427,0.00049635244,0.0003486505,0.00008279627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084894156,0.00030177343,0.0004159538,0.0006000366,0.00019376492,0.00011938844,0.0010254601,0.00015807162,0.000014451858],"category_scores_gemma":[0.00010774832,0.00023789862,0.00009955113,0.0006100174,0.0005708078,0.0002565676,0.00051233347,0.00033573038,0.0000040659693],"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.00003577671,0.000074752126,0.00009094907,0.000058335412,0.000026599124,0.0000066894727,0.0010463103,0.32729948,0.0016136519,0.1470712,0.00008830532,0.52258795],"study_design_scores_gemma":[0.00033207162,0.00032595178,0.0013976827,0.00013398308,0.000009954593,0.00001957692,4.6007992e-7,0.75771177,0.006036061,0.23357956,0.00018461484,0.00026830618],"about_ca_topic_score_codex":0.000015775555,"about_ca_topic_score_gemma":0.000047528716,"teacher_disagreement_score":0.8934107,"about_ca_system_score_codex":0.00007305138,"about_ca_system_score_gemma":0.000404567,"threshold_uncertainty_score":0.97012246},"labels":[],"label_agreement":null},{"id":"W1598065240","doi":"10.37236/3527","title":"A De Bruijn–Erdős Theorem for Chordal Graphs","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Canada Research Chairs; Concordia University; National Science Foundation","keywords":"Mathematics; De Bruijn sequence; Generalization; Combinatorics; Chordal graph; Metric space; Discrete mathematics; Assertion; Graph; Computer science; Mathematical analysis","score_opus":0.01595044930320462,"score_gpt":0.2582220934261321,"score_spread":0.2422716441229275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598065240","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.07309765,0.0021510618,0.921455,0.002138336,0.00069544604,0.00011034783,3.1011564e-7,0.000017628972,0.00033416148],"genre_scores_gemma":[0.99795896,0.000076516386,0.0013340416,0.00023352771,0.00016491585,0.0000042577703,6.333914e-7,0.0000068264917,0.00022029827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998816,0.00012501897,0.00025191286,0.00009080535,0.00035045508,0.0003658051],"domain_scores_gemma":[0.99872035,0.00024737182,0.00023732739,0.0001853941,0.0005017507,0.00010779742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025136403,0.00009009636,0.00013579069,0.000117034666,0.00011505006,0.00010642147,0.00082799187,0.0000372357,0.0000010360519],"category_scores_gemma":[0.0001968057,0.00006280665,0.000114088776,0.0005222929,0.000024848303,0.00026852317,0.000053071522,0.00026855734,0.0000022677943],"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.000035444955,0.000057454814,0.000032499964,0.0000022350466,0.00003270157,0.0000015063679,0.00042546107,0.0019124857,0.000115847775,0.9920033,0.0014457038,0.0039353375],"study_design_scores_gemma":[0.0008460412,0.000713303,0.00007945806,0.000004893445,0.000017618944,0.00023945347,0.000040216008,0.012109605,0.0013925085,0.9713422,0.013139128,0.000075587486],"about_ca_topic_score_codex":0.0000023409941,"about_ca_topic_score_gemma":0.0000015590394,"teacher_disagreement_score":0.9248613,"about_ca_system_score_codex":0.00024551607,"about_ca_system_score_gemma":0.0012007059,"threshold_uncertainty_score":0.2561181},"labels":[],"label_agreement":null},{"id":"W159810765","doi":"","title":"Approximating Radio Maps.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Terrain; Algorithm; WiMAX; Approximation algorithm; Antenna (radio); Radar; Scale (ratio); Wireless; Point (geometry); Real-time computing; Mathematics; Telecommunications; Geography","score_opus":0.02632379849969603,"score_gpt":0.2428773898434252,"score_spread":0.21655359134372915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159810765","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.014644614,0.00014651561,0.93598473,0.012792255,0.0006054379,0.00028643577,0.000048301674,0.000227725,0.035263974],"genre_scores_gemma":[0.8436591,0.000003889569,0.15176652,0.0033152814,0.00033087813,0.000020078549,0.0001429289,0.000012356684,0.0007489497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979504,0.000072956165,0.00039407567,0.0005612675,0.0005374911,0.00048381294],"domain_scores_gemma":[0.99841094,0.00020835247,0.00012449865,0.00034016345,0.0003590315,0.0005570136],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038117956,0.00023080189,0.00020175065,0.0010114092,0.00038129085,0.00040960652,0.0007434255,0.00009847369,0.00027312807],"category_scores_gemma":[0.00011862948,0.0002563751,0.0000817192,0.0012074163,0.000048767943,0.000588898,0.00006642255,0.0002445535,0.0008638952],"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.0000024977965,0.00003450815,0.00009463611,0.000006739609,0.000018061886,0.000010794364,0.00014048575,0.1906071,0.000023856688,0.64644045,0.005960237,0.15666065],"study_design_scores_gemma":[0.00043453329,0.000080563725,0.0037005774,0.000029998842,0.0000045022493,0.00005807443,0.000026278136,0.9145275,0.00015184912,0.039829593,0.040724795,0.0004317685],"about_ca_topic_score_codex":0.0006020359,"about_ca_topic_score_gemma":0.0017398312,"teacher_disagreement_score":0.8290145,"about_ca_system_score_codex":0.00034086886,"about_ca_system_score_gemma":0.0012505283,"threshold_uncertainty_score":0.99998885},"labels":[],"label_agreement":null},{"id":"W1599115183","doi":"10.20382/jocg.v7i1a1","title":"Density of Range Capturing Hypergraphs","year":2014,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; General position; Vertex (graph theory); Regular polygon; Upper and lower bounds; Homothetic transformation; Convex hull; Element (criminal law); Integer (computer science); Discrete mathematics; Geometry; Graph; Mathematical analysis; Computer science","score_opus":0.011950627074551457,"score_gpt":0.20808191159341108,"score_spread":0.1961312845188596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599115183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3538261,0.00022788835,0.6437253,0.00031822754,0.0010893614,0.00010258698,0.0000114879595,0.000028103379,0.00067095505],"genre_scores_gemma":[0.9095661,0.000064315755,0.08968202,0.00011448939,0.00032168353,1.7475034e-7,0.00002355741,0.000012985105,0.00021465025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971043,0.0002886033,0.00080993137,0.0004127034,0.0011441549,0.0002403443],"domain_scores_gemma":[0.9949666,0.00055135484,0.0017886823,0.00037858597,0.00209694,0.00021778351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080888165,0.000313079,0.00073840545,0.0030078036,0.00013791167,0.0001103341,0.0015075116,0.0002614658,0.000019785008],"category_scores_gemma":[0.00013753895,0.00034633986,0.0006060153,0.0015124944,0.00009965487,0.00053174794,0.0008734803,0.0007105649,0.000006239649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007462345,0.00015536365,0.0019017321,0.00016561324,0.0003131974,0.00011112313,0.00021587897,0.9613957,0.00015951975,0.028573317,0.0007166304,0.0062173014],"study_design_scores_gemma":[0.008906796,0.0016293299,0.15225737,0.0017320842,0.0010207916,0.0013188915,0.00037306687,0.58313376,0.0052161515,0.20706771,0.03431727,0.0030267613],"about_ca_topic_score_codex":0.000023429668,"about_ca_topic_score_gemma":0.0000032379796,"teacher_disagreement_score":0.55574,"about_ca_system_score_codex":0.00021020713,"about_ca_system_score_gemma":0.0007390384,"threshold_uncertainty_score":0.99989885},"labels":[],"label_agreement":null},{"id":"W1599901748","doi":"10.1023/a:1009833410742","title":"On Some Polyhedra Covering Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","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":"Memorial University of Newfoundland","funders":"","keywords":"Polyhedron; Combinatorics; Mathematics; Regular polygon; Theory of computation; Translation (biology); Cover (algebra); Dual polyhedron; Simple (philosophy); Geometry; Algorithm; Chemistry","score_opus":0.007005178050143841,"score_gpt":0.21680079423530862,"score_spread":0.2097956161851648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599901748","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.032650456,0.00015597382,0.9594297,0.0008266603,0.004826564,0.00013279279,6.8243224e-7,0.000045530247,0.0019316478],"genre_scores_gemma":[0.9094789,0.0001692206,0.088679925,0.0004252945,0.0009297747,0.0000027708213,0.000005529814,0.000013948744,0.0002946465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885744,0.00006911373,0.0003835933,0.00011996507,0.0004499882,0.00011988492],"domain_scores_gemma":[0.9992222,0.000089973364,0.00024610406,0.00013486833,0.00022707712,0.00007975314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033653894,0.000094502095,0.00014797114,0.00019033845,0.000100974205,0.00016509976,0.00031260075,0.000053635926,0.000098868084],"category_scores_gemma":[0.00006503646,0.0000871837,0.0000742625,0.00039090798,0.000010328754,0.001222865,0.000020506153,0.0001304794,0.000017883282],"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.000033267544,0.00009648315,0.000003940592,0.0000030964748,0.00001075069,0.000003990419,0.00007602919,0.85475487,0.00008186874,0.13597086,0.00042236058,0.008542513],"study_design_scores_gemma":[0.0024025373,0.0010806064,0.0001263985,0.00007537673,0.000014394836,0.00007283475,0.0000029246119,0.8435091,0.0016438649,0.14561246,0.0052343314,0.00022517295],"about_ca_topic_score_codex":0.0000012042,"about_ca_topic_score_gemma":2.1745297e-8,"teacher_disagreement_score":0.87682843,"about_ca_system_score_codex":0.00007020858,"about_ca_system_score_gemma":0.000107354776,"threshold_uncertainty_score":0.3555248},"labels":[],"label_agreement":null},{"id":"W1600658344","doi":"10.1007/978-3-540-87744-8_4","title":"On Dominance Reporting in 3D","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Pointer (user interface); Linear space; Algorithm; Running time; Time complexity; Preprocessor; Data structure; Grid; Range (aeronautics); Theoretical computer science; Combinatorics; Discrete mathematics; Mathematics; Artificial intelligence; Programming language","score_opus":0.02422402868927025,"score_gpt":0.2632892819544189,"score_spread":0.23906525326514866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600658344","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.0014197333,0.00035689777,0.9906696,0.00042006795,0.0016074469,0.00028317526,0.0000011771431,0.0000841503,0.005157732],"genre_scores_gemma":[0.4159228,0.00011884595,0.58008856,0.002287202,0.0006143823,0.000016246891,0.000009106701,0.000031894015,0.000910948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592304,0.000031940534,0.0011089628,0.0014666189,0.0009695662,0.0004998625],"domain_scores_gemma":[0.9973133,0.00055004755,0.00091335655,0.0009379228,0.00018464707,0.00010069185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012370694,0.0003919971,0.00047321615,0.0012169138,0.00021388545,0.0002266553,0.0015348784,0.00022397109,0.000010740824],"category_scores_gemma":[0.00049990276,0.00038349928,0.00010233501,0.0010175924,0.0002559752,0.00047851223,0.0005587435,0.00072138465,0.000045743687],"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.0000056891276,0.000029652289,0.000047797632,0.000012782718,0.0000023513714,0.00036225398,0.0004179834,0.37785006,0.000051522675,0.013251305,0.000052230826,0.60791636],"study_design_scores_gemma":[0.00037615435,0.00020575251,0.0012313805,0.0005291403,0.0000020184627,0.00028808846,4.7144827e-8,0.879211,0.0012202335,0.11387389,0.0023503446,0.0007119499],"about_ca_topic_score_codex":0.000015056218,"about_ca_topic_score_gemma":0.000057568705,"teacher_disagreement_score":0.60720444,"about_ca_system_score_codex":0.00034521607,"about_ca_system_score_gemma":0.00063627015,"threshold_uncertainty_score":0.9998617},"labels":[],"label_agreement":null},{"id":"W1601919219","doi":"10.1007/3-540-44679-6_30","title":"A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":45,"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":"Transitive closure; Computer science; Closure (psychology); Algorithm; Path (computing); Shortest path problem; Space (punctuation); Transitive relation; Theoretical computer science; Discrete mathematics; Mathematics; Combinatorics; Graph; Computer network","score_opus":0.012451451834332068,"score_gpt":0.2454966569590938,"score_spread":0.23304520512476173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601919219","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.00034233864,0.0010485376,0.99513793,0.00092368457,0.0010102374,0.0007370924,0.000025590854,0.00019783463,0.0005767501],"genre_scores_gemma":[0.21381111,0.00019511054,0.7839403,0.00074063113,0.00054308126,0.000035483088,0.000054136515,0.000044762357,0.00063535897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996801,0.00003822364,0.0004302585,0.001524027,0.00066705316,0.00053941255],"domain_scores_gemma":[0.997836,0.00084875914,0.0002093142,0.0005304413,0.00039927135,0.00017619149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007077187,0.0004891267,0.00049409654,0.0008155384,0.0003646502,0.0004959454,0.0009827379,0.00027513172,0.000005493575],"category_scores_gemma":[0.00010170483,0.00047594978,0.0001322649,0.00093867304,0.0002934618,0.0005424811,0.00031435117,0.00045200603,0.0000035614567],"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.000014322198,0.00003923849,0.000029622488,0.00003485204,0.000022265282,0.00006209515,0.0009875263,0.043252155,0.00040369577,0.008413007,0.000021569354,0.94671965],"study_design_scores_gemma":[0.00044218142,0.00026126535,0.000533877,0.0002097778,0.00001767808,0.00013809165,3.4996268e-7,0.93723506,0.00025067554,0.058759816,0.0015835132,0.0005677153],"about_ca_topic_score_codex":0.00001244246,"about_ca_topic_score_gemma":0.000099798184,"teacher_disagreement_score":0.9461519,"about_ca_system_score_codex":0.00022538855,"about_ca_system_score_gemma":0.00043428986,"threshold_uncertainty_score":0.9997692},"labels":[],"label_agreement":null},{"id":"W1602071642","doi":"10.1007/978-3-642-25878-7_3","title":"Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Rectangle; Planar graph; Combinatorics; Planar; Mathematics; Vertex (graph theory); Graph; Planar straight-line graph; Geometry; Graph drawing; Line graph; Computer graphics (images); Computer science; 1-planar graph","score_opus":0.016513601780573657,"score_gpt":0.24355095371958468,"score_spread":0.22703735193901103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602071642","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.0009152111,0.00017188549,0.98924637,0.00030675074,0.00061367534,0.0005814198,0.000005554402,0.000071205606,0.008087923],"genre_scores_gemma":[0.35889637,0.000021723024,0.6392248,0.0011179073,0.0001863006,0.000016891237,0.000010055626,0.00003052991,0.0004953766],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654895,0.000034013276,0.0005601457,0.0014273301,0.000946863,0.000482699],"domain_scores_gemma":[0.99723303,0.00037748308,0.0004948844,0.0012108559,0.0005155166,0.00016824873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081357005,0.00048361003,0.0005986745,0.0008247052,0.00025090168,0.00057439716,0.005019978,0.00025554036,0.000023402481],"category_scores_gemma":[0.00006886353,0.00040998997,0.000084183666,0.001025639,0.0005611912,0.001294686,0.0012494689,0.00037812252,0.000026280259],"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.000085212174,0.00011476542,0.00031446927,0.00011582544,0.00006278473,0.0001834544,0.0038627642,0.09401102,0.0014940039,0.13671075,0.0000965765,0.7629484],"study_design_scores_gemma":[0.001217638,0.0018582226,0.0019296156,0.0019759089,0.000040852203,0.000291058,7.027157e-7,0.20704846,0.024755718,0.7557577,0.002992197,0.0021319166],"about_ca_topic_score_codex":0.000118341486,"about_ca_topic_score_gemma":0.000084634135,"teacher_disagreement_score":0.76081645,"about_ca_system_score_codex":0.0001348793,"about_ca_system_score_gemma":0.0010298557,"threshold_uncertainty_score":0.9998352},"labels":[],"label_agreement":null},{"id":"W1604379475","doi":"10.1007/978-3-540-75103-8_17","title":"An Extension of the Advancing Front Method to Composite Geometry","year":2007,"lang":"en","type":"book-chapter","venue":"","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":"École de Technologie Supérieure; Université du Québec à Trois-Rivières","funders":"","keywords":"Extension (predicate logic); Front (military); Geometry; Computer science; Composite number; Engineering drawing; Mathematics; Mechanical engineering; Engineering; Algorithm; Programming language","score_opus":0.02469641196873568,"score_gpt":0.3058818211823454,"score_spread":0.28118540921360974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604379475","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.0001379447,0.00015812725,0.90723664,0.00020460712,0.00057226495,0.00024123222,0.0000044637422,0.00005805039,0.09138665],"genre_scores_gemma":[0.0031370195,0.0000070201004,0.888556,0.0018658024,0.00020975703,0.0000019927868,0.000014100212,0.000019421828,0.10618889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983128,0.00004670531,0.00039064648,0.0005024331,0.0005632232,0.00018422103],"domain_scores_gemma":[0.99833393,0.00017256658,0.00020379607,0.0008289968,0.00032659972,0.00013408187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082862336,0.00021151853,0.00027519214,0.00040025762,0.00012003949,0.000050773386,0.0007929575,0.00014158619,0.00010613675],"category_scores_gemma":[0.000019316623,0.00015648786,0.00013984398,0.00017318063,0.000017951268,0.0002029661,0.000361125,0.00019508382,0.00004920443],"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.000016721173,0.000043697946,0.00001068281,0.000027570914,0.00003603812,0.00000668384,0.00020177507,0.043075517,0.016663658,0.4929833,0.0019282504,0.4450061],"study_design_scores_gemma":[0.000788399,0.0009064729,0.006114183,0.0006810439,0.00013139792,0.00017357212,0.000027811126,0.29019177,0.09114931,0.12132763,0.48653126,0.001977164],"about_ca_topic_score_codex":0.000021567896,"about_ca_topic_score_gemma":0.000034019795,"teacher_disagreement_score":0.484603,"about_ca_system_score_codex":0.00006764696,"about_ca_system_score_gemma":0.00008557994,"threshold_uncertainty_score":0.638139},"labels":[],"label_agreement":null},{"id":"W1605836264","doi":"","title":"Proceedings of the twenty-eighth annual symposium on Computational geometry","year":2012,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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 Victoria","funders":"","keywords":"Presentation (obstetrics); Computer science; Animation; Process (computing); Chapel; Library science; Graphics; Operations research; Computer graphics (images); Mathematics","score_opus":0.010124490279890598,"score_gpt":0.22944797317328364,"score_spread":0.21932348289339304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605836264","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.7643468,0.00006977211,0.19652371,0.003644485,0.0015783997,0.00033046425,0.000013182232,0.00013075386,0.033362463],"genre_scores_gemma":[0.98143524,0.0000011046417,0.016476268,0.0006584571,0.00018174067,0.000005638735,0.0000032693429,0.0000039881634,0.001234283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989805,0.000014882651,0.00018778954,0.00016693177,0.0004659901,0.00018388884],"domain_scores_gemma":[0.9993831,0.000096338954,0.00010448835,0.00011264395,0.00023401846,0.00006940886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028720257,0.00009188825,0.000086366024,0.0001339318,0.00012480584,0.000044307042,0.00042813184,0.000035594345,0.000027721257],"category_scores_gemma":[0.000025615229,0.00006196808,0.00006329055,0.00076569157,0.000030910334,0.0006174211,0.00016463113,0.00008306259,0.000036266174],"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.0000061833566,0.00024676378,0.007353463,0.00001482496,0.000018297626,7.8750006e-8,0.000679971,0.0110276565,0.0012212821,0.96511036,0.011472592,0.0028485032],"study_design_scores_gemma":[0.0015809012,0.0005540408,0.63867104,0.000089934954,0.000037722344,0.000105491315,0.00031612805,0.1814817,0.09559496,0.032483995,0.048168905,0.00091519585],"about_ca_topic_score_codex":0.000002327793,"about_ca_topic_score_gemma":1.6836427e-7,"teacher_disagreement_score":0.93262637,"about_ca_system_score_codex":0.000028015935,"about_ca_system_score_gemma":0.00004043204,"threshold_uncertainty_score":0.25269848},"labels":[],"label_agreement":null},{"id":"W1606491959","doi":"10.48550/arxiv.1410.5105","title":"Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Algorithm; Computer science","score_opus":0.06234806509790879,"score_gpt":0.19826373558393093,"score_spread":0.13591567048602213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606491959","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.049665403,0.000055775068,0.94703233,0.00020507592,0.0021349767,0.0005578048,0.0000080841455,0.00015224089,0.0001882955],"genre_scores_gemma":[0.988834,0.0000521858,0.009767948,0.00012206154,0.0004154542,0.000006012637,0.000052479918,0.0000148298805,0.0007350238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841076,0.00008429665,0.00019557629,0.00097023026,0.000076072785,0.00026309042],"domain_scores_gemma":[0.99867964,0.00018063924,0.00022578011,0.0005217833,0.00025329983,0.00013888265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000309347,0.0002478509,0.0002753988,0.00021503387,0.0002452389,0.00020491466,0.000703058,0.00023122161,0.0000011573393],"category_scores_gemma":[0.000046417616,0.00029331096,0.00014254097,0.00030145203,0.000054379783,0.00047193177,0.0009021349,0.00025908012,0.0000035047387],"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.000045276538,0.00009739238,0.00020221545,0.00026301877,0.00011946095,0.000026373351,0.00026619577,0.26706058,0.00016917386,0.72069126,0.00057167426,0.010487366],"study_design_scores_gemma":[0.0008774055,0.000099315075,0.000075166914,0.000047372738,0.000037485475,0.000005882324,0.0000085754855,0.84738225,0.00017748958,0.14766648,0.0033190073,0.00030356788],"about_ca_topic_score_codex":0.000048447608,"about_ca_topic_score_gemma":0.000007723953,"teacher_disagreement_score":0.93916863,"about_ca_system_score_codex":0.000102914,"about_ca_system_score_gemma":0.00016851364,"threshold_uncertainty_score":0.9999519},"labels":[],"label_agreement":null},{"id":"W1610448541","doi":"10.1007/s00454-016-9796-0","title":"A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon","year":2016,"lang":"en","type":"article","venue":"Discrete & 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":"Carleton University","funders":"National Institutes of Natural Sciences; National Research Foundation of Korea","keywords":"Geodesic; Simple polygon; Mathematics; Combinatorics; Center (category theory); Polygon (computer graphics); Time complexity; Simple (philosophy); Path (computing); Shortest path problem; Point (geometry); Algorithm; Discrete mathematics; Regular polygon; Geometry; Computer science","score_opus":0.013262794940170849,"score_gpt":0.26509074850379444,"score_spread":0.2518279535636236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1610448541","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.010582849,0.00018599378,0.98620856,0.0019648476,0.00028292026,0.00037966613,0.0002101553,0.00007519795,0.000109822264],"genre_scores_gemma":[0.745335,0.0000116285455,0.25269082,0.0005926878,0.00035778113,0.00007060368,0.00017695191,0.00002140568,0.00074315805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823624,0.00006724301,0.00043397894,0.00041885357,0.000536845,0.00030682658],"domain_scores_gemma":[0.99728876,0.001644386,0.00021645117,0.0003421202,0.0004168489,0.00009143404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004541245,0.00018975686,0.00021826844,0.00027109846,0.00022381116,0.00006872489,0.0006740898,0.00005992678,0.00007451813],"category_scores_gemma":[0.00012301382,0.00011753165,0.00021184751,0.000826602,0.000094761075,0.0004143981,0.00019871161,0.000066229004,0.00006617762],"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.00004516076,0.00018598087,0.00042406988,0.00002785211,0.00020188064,0.0000024577275,0.00017677461,0.050986663,0.0018031837,0.040701527,0.0041023553,0.9013421],"study_design_scores_gemma":[0.001244734,0.00017461649,0.007716948,0.000029422352,0.000019253534,0.000020283924,0.000010677697,0.9529905,0.0013964149,0.02834302,0.0078141475,0.00024002515],"about_ca_topic_score_codex":0.000008658999,"about_ca_topic_score_gemma":8.423476e-7,"teacher_disagreement_score":0.90200377,"about_ca_system_score_codex":0.00004512248,"about_ca_system_score_gemma":0.00014200521,"threshold_uncertainty_score":0.47928017},"labels":[],"label_agreement":null},{"id":"W1616062690","doi":"10.1109/hicss.1997.667213","title":"Graph algorithms with small communication costs","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Implementation; Workstation; Focus (optics); Parallel algorithm; Shortest path problem; Cost efficiency; Graph theory; Theoretical computer science; Graph; Communications system; Analysis of parallel algorithms; Algorithm design; Dijkstra's algorithm; Algorithm; Distributed computing; Parallel computing; Mathematics; Computer network","score_opus":0.03267049712825272,"score_gpt":0.22213427258736243,"score_spread":0.1894637754591097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1616062690","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.006921983,0.0002256908,0.96944594,0.0015820651,0.00005459824,0.00008346483,3.3349346e-7,0.0001354656,0.021550436],"genre_scores_gemma":[0.4928644,0.000050090217,0.50437814,0.0005984901,0.000025588077,0.00001221435,0.000007741599,0.0000034932498,0.0020598643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948,0.000038620314,0.000090969435,0.00015595852,0.00013700649,0.00009743032],"domain_scores_gemma":[0.9994095,0.000057574543,0.000034152905,0.00035703176,0.000094723204,0.00004702802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001010523,0.00006180152,0.000051567393,0.000084271305,0.00011985485,0.00010403534,0.00036294584,0.000020471758,0.00006341706],"category_scores_gemma":[0.000006132175,0.000049579223,0.000018042501,0.00047791065,0.000018913273,0.0002672088,0.00006612535,0.000053368898,0.00008888247],"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.000002743225,0.00016849009,0.00027008762,0.000003956267,0.000021957238,0.000004844486,0.0004586544,0.0048010116,0.00016698446,0.30858365,0.006111449,0.67940617],"study_design_scores_gemma":[0.0007183121,0.00020683154,0.003843025,0.00001848959,0.0000065460763,0.0000716343,0.00003082999,0.958599,0.002632836,0.0061182193,0.027431041,0.00032324722],"about_ca_topic_score_codex":0.000021065653,"about_ca_topic_score_gemma":0.00003873653,"teacher_disagreement_score":0.953798,"about_ca_system_score_codex":0.000018542747,"about_ca_system_score_gemma":0.00000827622,"threshold_uncertainty_score":0.20217821},"labels":[],"label_agreement":null},{"id":"W162388132","doi":"","title":"A Comparison of Two Fully-Dynamic Delaunay Triangulation Methods.","year":2009,"lang":"en","type":"article","venue":"","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 Victoria","funders":"","keywords":"Delaunay triangulation; Bowyer–Watson algorithm; Constrained Delaunay triangulation; Computer science; Pitteway triangulation; Surface triangulation; Triangulation; Mathematics; Algorithm; Geometry","score_opus":0.040197388019427086,"score_gpt":0.43863500339256634,"score_spread":0.39843761537313926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162388132","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.029870601,0.0001695378,0.96668136,0.00059307704,0.00017759392,0.0001061323,3.3833942e-7,0.00007868711,0.002322668],"genre_scores_gemma":[0.5470626,9.711503e-7,0.45263535,0.00010244538,0.000016044021,0.0000010604921,0.000005269224,0.0000010669589,0.00017522226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907786,0.00012164855,0.00030285094,0.0001956372,0.00019366472,0.000108362234],"domain_scores_gemma":[0.9993644,0.00013372408,0.00011595252,0.00022232754,0.00011995708,0.000043665972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004546791,0.0000749085,0.00015777088,0.0001669457,0.000054145778,0.000042608077,0.0002457659,0.000030020794,0.000032548982],"category_scores_gemma":[0.00004606152,0.00006865052,0.000058044632,0.0005843862,0.000009668352,0.00028568,0.00003172858,0.000051417566,0.000010390047],"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.0000074465493,0.00010739624,0.000110079614,0.00000266106,0.0000074005043,3.6222224e-7,0.0002992529,0.03353902,0.036970217,0.17653126,0.00023574993,0.75218916],"study_design_scores_gemma":[0.0003717345,0.00013443358,0.00823148,0.0000037561192,0.000005232127,0.000003448181,0.000009129624,0.9214744,0.034216557,0.034893528,0.00056932244,0.00008700063],"about_ca_topic_score_codex":0.0000062298286,"about_ca_topic_score_gemma":0.000006670836,"teacher_disagreement_score":0.88793534,"about_ca_system_score_codex":0.00002238885,"about_ca_system_score_gemma":0.000041263724,"threshold_uncertainty_score":0.27994868},"labels":[],"label_agreement":null},{"id":"W1628543033","doi":"10.1007/978-3-642-36763-2_10","title":"Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Planar graph; Rectangle; Book embedding; Planar straight-line graph; Graph drawing; Combinatorics; Embedding; Planar; Outerplanar graph; Mathematics; Vertex (graph theory); Graph; Computer science; Geometry; Line graph; 1-planar graph; Pathwidth; Computer graphics (images); Artificial intelligence","score_opus":0.014440665635377773,"score_gpt":0.2529089660886954,"score_spread":0.23846830045331763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1628543033","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.0048930557,0.00024520524,0.98990947,0.00025017583,0.00087197387,0.0007094509,0.000008447246,0.00004497539,0.0030672417],"genre_scores_gemma":[0.48075813,0.000030656498,0.5181407,0.0004969163,0.000112985304,0.000012242934,0.000015588515,0.00002385498,0.0004089429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665856,0.00004039387,0.00082127226,0.0011405511,0.00093869114,0.00040051911],"domain_scores_gemma":[0.99684185,0.0004907568,0.0006986308,0.0011149944,0.0007148429,0.00013894642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091854506,0.0003997185,0.0006689083,0.0011679024,0.00015128501,0.00037646404,0.0050931037,0.00026904195,0.000035910936],"category_scores_gemma":[0.00012821243,0.00037491907,0.00013570665,0.0014769051,0.00049973733,0.0011513224,0.001433513,0.0004029982,0.000025023997],"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.000026827707,0.00009109623,0.0001450751,0.00014207256,0.000052538955,0.00003972474,0.0015119095,0.18051305,0.011497695,0.076886624,0.00016018964,0.7289332],"study_design_scores_gemma":[0.0007608393,0.00056375965,0.001998681,0.0010572469,0.000020552723,0.0000675345,3.3121327e-7,0.5417111,0.032088887,0.41998065,0.00080479553,0.00094561867],"about_ca_topic_score_codex":0.0001607966,"about_ca_topic_score_gemma":0.000029413139,"teacher_disagreement_score":0.7279876,"about_ca_system_score_codex":0.000103717655,"about_ca_system_score_gemma":0.000751214,"threshold_uncertainty_score":0.9998703},"labels":[],"label_agreement":null},{"id":"W163009970","doi":"","title":"The 2x2 simple packing problem","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on 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":"Simple (philosophy); Computer science; Packing problems; Algorithm","score_opus":0.053264506631380576,"score_gpt":0.24375607048789819,"score_spread":0.1904915638565176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163009970","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.021222414,0.00012522479,0.87243164,0.0043806215,0.0009265028,0.00050062995,0.000031012147,0.00020904733,0.100172915],"genre_scores_gemma":[0.9677708,0.000008025806,0.029936021,0.001631959,0.000093418406,0.000029551244,0.00004192639,0.000011544403,0.00047671428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982539,0.00008939572,0.000298767,0.000440324,0.0004389309,0.0004787037],"domain_scores_gemma":[0.9984608,0.00028088276,0.00011426527,0.00036767017,0.00036354794,0.00041282186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004096598,0.0001926001,0.00012994665,0.00038107086,0.0008162187,0.00036983422,0.00090207224,0.000074351025,0.00032267655],"category_scores_gemma":[0.000090041234,0.00016488842,0.000069981805,0.0011285752,0.00008558941,0.0003410012,0.000103401595,0.00021125884,0.0005123111],"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.0000053219883,0.00002427413,0.0004784809,0.0000035290448,0.000023512841,0.000017162038,0.0003600978,0.011042244,0.0000075670387,0.87374586,0.006751861,0.10754009],"study_design_scores_gemma":[0.00039927848,0.00021478988,0.039022103,0.000025862935,0.000008208903,0.000049487648,0.000093251576,0.29403955,0.00015695453,0.60640085,0.05902251,0.00056714605],"about_ca_topic_score_codex":0.002891489,"about_ca_topic_score_gemma":0.0074735074,"teacher_disagreement_score":0.9465484,"about_ca_system_score_codex":0.00016826665,"about_ca_system_score_gemma":0.0009941706,"threshold_uncertainty_score":0.67239547},"labels":[],"label_agreement":null},{"id":"W163840106","doi":"10.1007/978-3-642-16007-3","title":"Transactions on computational science IX: special issue on Voronoi diagrams in science and engineering","year":2010,"lang":"en","type":"book","venue":"DIAL (Catholic University of Leuven)","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 Calgary","funders":"","keywords":"Voronoi diagram; Science and engineering; Computer science; Data science; Management science; Engineering; Engineering ethics; Mathematics; Geometry","score_opus":0.008055123692342646,"score_gpt":0.19662050548211504,"score_spread":0.1885653817897724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163840106","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.26769772,0.000068086265,0.5982609,0.0021245575,0.007074049,0.0015316858,0.00016294431,0.00026035903,0.122819714],"genre_scores_gemma":[0.8704266,0.00008840871,0.069735765,0.0004490293,0.0038593868,0.0000032486735,0.00008096663,0.00005068648,0.055305913],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812865,0.000019214312,0.00015485575,0.0005874365,0.00086780824,0.0002420302],"domain_scores_gemma":[0.9990661,0.0001431634,0.000115828276,0.00026031552,0.00026722444,0.00014738363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838393,0.00018084349,0.00021414722,0.0012084163,0.00037310072,0.00011688379,0.00084863644,0.00012533166,0.000027267859],"category_scores_gemma":[0.000058830974,0.00023099086,0.000056011693,0.0008688883,0.0007059869,0.0004894207,0.00009210479,0.00042284513,0.00002825959],"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.00005283773,0.0002633757,0.0000080397085,0.000049153794,0.000013922608,0.000047883248,0.0059706,0.20288989,0.0011148073,0.04681403,0.00045398786,0.7423215],"study_design_scores_gemma":[0.0023222978,0.00095955154,0.013665542,0.00038963178,0.00004128036,0.00006005803,0.00008187984,0.34543175,0.001340477,0.004260227,0.6299688,0.0014785134],"about_ca_topic_score_codex":0.00003505691,"about_ca_topic_score_gemma":0.00006441258,"teacher_disagreement_score":0.74084294,"about_ca_system_score_codex":0.0003598837,"about_ca_system_score_gemma":0.0016446981,"threshold_uncertainty_score":0.94195336},"labels":[],"label_agreement":null},{"id":"W1653621367","doi":"10.1109/ipps.1996.508057","title":"A randomized algorithm for Voronoi diagram of line segments on coarse grained multiprocessors","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Voronoi diagram; Parallel algorithm; Computer science; Omega; Parallel computing; Binary logarithm; Diagram; Algorithm; Randomized algorithm; Dependency (UML); Line (geometry); Log-log plot; Combinatorics; Mathematics; Physics; Geometry; Artificial intelligence","score_opus":0.03278992914303829,"score_gpt":0.2715365731075537,"score_spread":0.2387466439645154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1653621367","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.0036732738,0.00006978974,0.99432945,0.00050152093,0.00024121841,0.00060576457,0.000006202349,0.0000686391,0.00050412543],"genre_scores_gemma":[0.3737223,0.000027953478,0.6208933,0.0005349494,0.00010981168,0.00016127902,0.000024257562,0.000007684629,0.0045184367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903554,0.00005857209,0.0002969956,0.0002454113,0.0002214306,0.0001420531],"domain_scores_gemma":[0.9990211,0.00045413655,0.00011640504,0.0001754116,0.00017588779,0.00005706787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039190115,0.00010784531,0.00025567948,0.00013117288,0.00006315953,0.00003584864,0.00023278585,0.000037265836,0.000039813112],"category_scores_gemma":[0.00017726146,0.00008522991,0.000126136,0.00028909429,0.000031807325,0.00017019559,0.000039551604,0.000036541343,0.000017334152],"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.0006382911,0.0003765977,0.0000016260002,0.000016624828,0.000044946886,8.303995e-7,0.00039055996,0.0074663963,0.00016405489,0.010758304,0.0011013234,0.97904044],"study_design_scores_gemma":[0.052356295,0.00014582385,0.0000047945587,0.000008008241,0.000008532182,0.0000010386265,0.0000045419724,0.9390058,0.006241255,0.0016767475,0.00045332764,0.00009383396],"about_ca_topic_score_codex":0.000007101838,"about_ca_topic_score_gemma":0.000002254261,"teacher_disagreement_score":0.9789466,"about_ca_system_score_codex":0.000014072619,"about_ca_system_score_gemma":0.000013796503,"threshold_uncertainty_score":0.34755751},"labels":[],"label_agreement":null},{"id":"W1654746924","doi":"10.1007/s003730200005","title":"Enumerating Foldings and Unfoldings Between Polygons and Polytopes","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 Waterloo","funders":"","keywords":"Polytope; Combinatorics; Polygon (computer graphics); Mathematics; Enumeration; Polytope model; Rectilinear polygon; Discrete mathematics; Regular polygon; Computer science; Geometry; Simple polygon","score_opus":0.015730337163467695,"score_gpt":0.19786159864013,"score_spread":0.1821312614766623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1654746924","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.97821075,0.0048514423,0.015212025,0.00096721214,0.00015960397,0.00008077145,0.0000020392968,0.0000778064,0.00043837327],"genre_scores_gemma":[0.9966072,0.00056479475,0.0025332686,0.00013791594,0.000023300863,0.0000038397948,0.0000015311033,0.000004843135,0.00012332524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992547,0.000022175036,0.00014179674,0.00027599186,0.00014133217,0.00016398465],"domain_scores_gemma":[0.99956805,0.000109475295,0.00005370209,0.00010612855,0.000042518997,0.00012010021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014331288,0.00011375828,0.00013047666,0.00014292954,0.00033639785,0.0002807178,0.00010885421,0.000049190377,0.000003096883],"category_scores_gemma":[0.000022322058,0.000112502334,0.000019848694,0.00042666087,0.000040746945,0.00036464288,0.00014746541,0.00008692371,0.0000010804661],"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":[6.4418225e-7,0.000023476669,0.0224482,0.00001847515,0.000018029841,0.0000033637236,0.0008304312,0.0000027611673,0.00032764513,0.8660505,0.00044976117,0.109826714],"study_design_scores_gemma":[0.0019928403,0.0006451163,0.13292411,0.00007740567,0.00007314981,0.00016266089,0.00020514529,0.094256386,0.0027261067,0.75363994,0.012210088,0.00108706],"about_ca_topic_score_codex":0.000015786181,"about_ca_topic_score_gemma":6.7638535e-7,"teacher_disagreement_score":0.11241057,"about_ca_system_score_codex":0.0000062962163,"about_ca_system_score_gemma":0.000005528509,"threshold_uncertainty_score":0.4587712},"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":"W166533694","doi":"10.1007/978-3-642-40273-9_3","title":"Quake Heaps: A Simple Alternative to Fibonacci Heaps","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Quake (natural phenomenon); Fibonacci number; Simple (philosophy); Computer science; Geology; Mathematics; Combinatorics; Philosophy; Seismology; Epistemology","score_opus":0.020677838031343376,"score_gpt":0.26769432225350365,"score_spread":0.24701648422216027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166533694","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.0004347678,0.00029019854,0.99035305,0.0022484495,0.0021205312,0.00076277263,0.000009666888,0.0001600347,0.0036205337],"genre_scores_gemma":[0.20464897,0.000038844693,0.7809786,0.009882064,0.0019186141,0.00006943592,0.000041515366,0.000060225335,0.002361724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955219,0.000050617225,0.00061337743,0.0018146622,0.0012750706,0.00072435243],"domain_scores_gemma":[0.99712336,0.00053275714,0.00024924165,0.0011922437,0.00053239556,0.00037000896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069133233,0.00057615014,0.00053175515,0.0012578882,0.00032074613,0.0008536499,0.0029277245,0.00022961649,0.00012634324],"category_scores_gemma":[0.00013624017,0.00054892077,0.00014863994,0.0011235944,0.00021316952,0.0008612912,0.001505186,0.00059076963,0.0005269416],"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.000004889067,0.000032591655,0.000009195408,0.000018242627,0.000013604103,0.00003590743,0.00084521883,0.2508575,0.00017214948,0.045668907,0.00063858734,0.7017032],"study_design_scores_gemma":[0.00030493265,0.00034984213,0.00018791418,0.00017906356,0.000005440039,0.00006328672,2.3188363e-7,0.6436988,0.0020490894,0.33026993,0.022027165,0.00086426147],"about_ca_topic_score_codex":0.000092234324,"about_ca_topic_score_gemma":0.000120747594,"teacher_disagreement_score":0.7008389,"about_ca_system_score_codex":0.00037748285,"about_ca_system_score_gemma":0.0006172944,"threshold_uncertainty_score":0.99969625},"labels":[],"label_agreement":null},{"id":"W1666596936","doi":"10.1109/icpr.1998.711125","title":"Reference set thinning for the k-nearest neighbor decision rule","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Delaunay triangulation; Voronoi diagram; Combinatorics; Graph; Mathematics; Discrete mathematics; Computer science; Algorithm; Geometry","score_opus":0.07883071685137562,"score_gpt":0.2908295160229232,"score_spread":0.21199879917154757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1666596936","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.0050155907,0.0002341155,0.9884208,0.0020603302,0.00032268083,0.00014374127,0.000002144028,0.000080873964,0.0037197305],"genre_scores_gemma":[0.8219784,0.000028091152,0.17402256,0.0011489412,0.00014001342,0.000026824098,0.000005549483,0.000004111263,0.0026454902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932784,0.000016530887,0.00012670305,0.0002034049,0.00019470611,0.00013080149],"domain_scores_gemma":[0.99884814,0.00070683204,0.000035881643,0.00027032627,0.00010262042,0.00003622114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023356554,0.00006538479,0.00005405687,0.000045770732,0.00029310246,0.00020426152,0.00045882806,0.000027979777,0.00013842912],"category_scores_gemma":[0.00010413387,0.000041564923,0.000033583776,0.00028284002,0.0000118076705,0.00030289523,0.000100781,0.0000568898,0.00012298932],"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.0000067857304,0.00003663333,0.00011729454,0.000004566234,0.000011051063,0.0000013404635,0.0005004432,0.017543707,0.00030511204,0.25358367,0.0459875,0.6819019],"study_design_scores_gemma":[0.00017153693,0.000038662325,0.0021825253,0.0000051448656,0.0000024244066,0.000005829238,0.000013728378,0.9227917,0.0005579206,0.010236342,0.06391708,0.000077085504],"about_ca_topic_score_codex":0.000007121052,"about_ca_topic_score_gemma":0.000007261835,"teacher_disagreement_score":0.90524805,"about_ca_system_score_codex":0.0000130505705,"about_ca_system_score_gemma":0.000013837087,"threshold_uncertainty_score":0.22543369},"labels":[],"label_agreement":null},{"id":"W1670665503","doi":"10.1007/978-3-540-74472-6_4","title":"On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Windsor","funders":"","keywords":"Convex polygon; Polygon (computer graphics); Combinatorics; Rectilinear polygon; Polygon covering; Regular polygon; Simple polygon; Set (abstract data type); Line segment; Convex set; Mathematics; Star-shaped polygon; Line (geometry); Computer science; Geometry; Convex optimization","score_opus":0.029297630259604867,"score_gpt":0.26828259282235867,"score_spread":0.2389849625627538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1670665503","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.009174928,0.00009324507,0.9883263,0.00015693514,0.0006850708,0.00028535526,0.000007245628,0.00003449934,0.0012364066],"genre_scores_gemma":[0.83027977,0.000005261655,0.16886768,0.00054938026,0.00012748147,0.000002428201,0.000007554207,0.000016525424,0.00014391387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972868,0.000025036741,0.00057261775,0.00082631607,0.0009592094,0.00033003054],"domain_scores_gemma":[0.99778336,0.0005698555,0.0005335024,0.00065756135,0.00036256685,0.00009312995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007221186,0.00034137449,0.00047535455,0.0011908134,0.000079131634,0.00007503575,0.001184324,0.0001599277,0.000014951156],"category_scores_gemma":[0.00006510241,0.00028662506,0.00009229894,0.0008034125,0.0004011507,0.00021446597,0.00038674998,0.0003776909,0.000004117827],"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.00014883166,0.0001384288,0.000076812554,0.0001866639,0.000060266782,0.00006950069,0.0034987296,0.35896814,0.0032998258,0.017741986,0.000017771796,0.61579305],"study_design_scores_gemma":[0.0008062934,0.0021600027,0.00007619062,0.001634321,0.000017335731,0.00010259727,0.0000014495945,0.91334766,0.0419076,0.03924874,0.00012149815,0.0005763384],"about_ca_topic_score_codex":0.000011876578,"about_ca_topic_score_gemma":0.000036736,"teacher_disagreement_score":0.8211048,"about_ca_system_score_codex":0.00012133426,"about_ca_system_score_gemma":0.00035256983,"threshold_uncertainty_score":0.9999586},"labels":[],"label_agreement":null},{"id":"W1696465846","doi":"10.1007/11940128_19","title":"Diamond Triangulations Contain Spanners of Bounded Degree","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Spanner; Delaunay triangulation; Combinatorics; Degree (music); Bounded function; Unit disk graph; Constant (computer programming); Vertex (graph theory); Upper and lower bounds; Mathematics; Point set triangulation; Minimum-weight triangulation; Graph; Triangulation; Diamond; Discrete mathematics; Constrained Delaunay triangulation; Computer science; Geometry; Physics; Mathematical analysis","score_opus":0.026387853484134163,"score_gpt":0.2528272845939513,"score_spread":0.22643943110981715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696465846","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.00038604677,0.00044315937,0.99104977,0.0004974522,0.0012042428,0.00036196745,0.000011447846,0.00007984185,0.0059660547],"genre_scores_gemma":[0.4685057,0.0000135426035,0.52890074,0.00048152177,0.00056357955,0.000010180129,0.000048481383,0.000026801934,0.0014494092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970241,0.00004080068,0.00065194455,0.000961347,0.0009240052,0.00039780463],"domain_scores_gemma":[0.997701,0.00055457343,0.00040197716,0.00084113085,0.00039051706,0.00011080523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072427094,0.00036387623,0.00046716604,0.0011342049,0.00020874446,0.00027839813,0.0015879313,0.0002329077,0.00001858538],"category_scores_gemma":[0.00010259963,0.00035899217,0.00015823814,0.0009451601,0.0004597795,0.00050909637,0.00047353227,0.000359016,0.000014384546],"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.000009277452,0.000053199525,0.000074938434,0.000032272856,0.000018001065,0.000030247,0.00029831822,0.34844023,0.00038000717,0.14170444,0.00018249835,0.5087766],"study_design_scores_gemma":[0.0005768182,0.0001818095,0.0013142705,0.00016000119,0.000014531801,0.00003287826,1.3962607e-7,0.6287025,0.0027499187,0.36309615,0.0025751414,0.00059583463],"about_ca_topic_score_codex":0.00005803245,"about_ca_topic_score_gemma":0.0001777156,"teacher_disagreement_score":0.50818074,"about_ca_system_score_codex":0.00022132132,"about_ca_system_score_gemma":0.0007572591,"threshold_uncertainty_score":0.9998862},"labels":[],"label_agreement":null},{"id":"W170076","doi":"10.1289/ehp.7511129","title":"Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Voronoi diagram; Disjoint sets; Combinatorics; Geodesic; Mathematics; Plane (geometry); Computational geometry; Weighted Voronoi diagram; Metric (unit); Diagram; Power diagram; Set (abstract data type); Point (geometry); Representation (politics); Centroidal Voronoi tessellation; Algorithm; Computer science; Geometry","score_opus":0.024418599950654606,"score_gpt":0.24808481372084273,"score_spread":0.22366621377018814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170076","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.37495732,0.00076954457,0.57641757,0.026466675,0.00079494686,0.0010170536,0.00010943195,0.00010089255,0.01936658],"genre_scores_gemma":[0.98547906,0.000013021323,0.0123672085,0.0018033993,0.00012667952,0.000021373895,0.000053985175,0.00000739376,0.00012790303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980776,0.00017448736,0.00039532728,0.00041502275,0.0005732806,0.00036430807],"domain_scores_gemma":[0.99837023,0.0006118756,0.00013048762,0.0004008637,0.0002839965,0.00020251906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055769517,0.00018343868,0.00019280524,0.0007627146,0.00013675966,0.00017347286,0.0010483501,0.00008271057,0.0001053071],"category_scores_gemma":[0.00021042678,0.00016239051,0.00007144244,0.0016072185,0.0000872668,0.00039046578,0.00004871708,0.00023337427,0.00009885269],"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.00000696205,0.00010597311,0.0010005481,0.000011172496,0.000013951231,0.000018582281,0.0009129308,0.20493951,0.000039901293,0.597718,0.0014398387,0.19379264],"study_design_scores_gemma":[0.00058544317,0.00019390303,0.10782682,0.00006758952,0.00000663384,0.000033785742,0.0001613977,0.84577113,0.00025040185,0.028280105,0.016407449,0.00041532],"about_ca_topic_score_codex":0.0022804006,"about_ca_topic_score_gemma":0.013079178,"teacher_disagreement_score":0.64083165,"about_ca_system_score_codex":0.00015773626,"about_ca_system_score_gemma":0.0010156377,"threshold_uncertainty_score":0.7298488},"labels":[],"label_agreement":null},{"id":"W1700872096","doi":"10.1007/3-540-47789-6_11","title":"Collision Detection Optimization in a Multi-particle System","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Calgary","funders":"","keywords":"Voronoi diagram; Collision detection; Computer science; Subdivision; Collision; Particle system; Set (abstract data type); Tree (set theory); Algorithm; Event (particle physics); Optimization problem; Mathematical optimization; Theoretical computer science; Computer graphics (images); Mathematics; Geometry","score_opus":0.02299463384654872,"score_gpt":0.2389561046812457,"score_spread":0.21596147083469697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1700872096","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.00039183037,0.00023697506,0.9968725,0.0001467694,0.0013419377,0.00041919315,0.0000016658701,0.00015173094,0.00043739108],"genre_scores_gemma":[0.58057475,0.000022919268,0.41883764,0.00015864211,0.00016252154,0.00001378886,0.0000044891854,0.000016284457,0.00020898053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731326,0.000053661886,0.000513639,0.0010445213,0.0006961686,0.00037875638],"domain_scores_gemma":[0.9986724,0.00019754887,0.00021631319,0.00058058003,0.00022832259,0.00010483602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069462723,0.00030423934,0.00030354082,0.0008861461,0.00020634105,0.00039017634,0.0009374838,0.00023190606,0.000010523132],"category_scores_gemma":[0.000068846086,0.00030876577,0.00006803678,0.0012957187,0.00011813831,0.00072450953,0.000380719,0.00037048213,0.00003820835],"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.0000031295253,0.000026454783,0.000014116497,0.000020094098,0.0000018290638,0.000024028735,0.00021579195,0.84942675,0.00014723687,0.00286301,0.0000013803649,0.14725617],"study_design_scores_gemma":[0.00038166743,0.00009241467,0.000120588375,0.00022387443,0.0000030496371,0.00004914266,2.0452484e-7,0.9938707,0.0033527436,0.0014978099,0.0000923063,0.0003155258],"about_ca_topic_score_codex":0.000023446562,"about_ca_topic_score_gemma":0.00009266212,"teacher_disagreement_score":0.5801829,"about_ca_system_score_codex":0.0006298422,"about_ca_system_score_gemma":0.00016252877,"threshold_uncertainty_score":0.99993646},"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":"W1754491295","doi":"10.1007/978-3-662-45803-7_26","title":"Trade-Offs in Planar Polyline Drawings","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Combinatorics; Planar; Triangulation; Planar graph; Angular resolution (graph drawing); Mathematics; Graph; Degree (music); Resolution (logic); Geometry; Algorithm; Computer science; Physics; Artificial intelligence; Computer graphics (images)","score_opus":0.013701680449774139,"score_gpt":0.23683908148306182,"score_spread":0.2231374010332877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1754491295","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.0002252283,0.00036704863,0.9927099,0.002563948,0.0016340715,0.0002754858,0.0000033550725,0.00011370758,0.0021072521],"genre_scores_gemma":[0.5226152,0.000046470454,0.46891665,0.0059783566,0.0014755977,0.000013083915,0.000035651068,0.000046848527,0.0008721656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963958,0.000045829427,0.00060975854,0.0014081444,0.0009584296,0.00058202934],"domain_scores_gemma":[0.9981651,0.00048672233,0.00023278115,0.00086104794,0.000090486836,0.00016389156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010543545,0.00045887483,0.0004962537,0.001470532,0.0001784054,0.00040896528,0.0022655318,0.00029375264,0.000016390788],"category_scores_gemma":[0.000086334665,0.00045081085,0.00011145211,0.0009979475,0.00028476556,0.0004474078,0.00044807862,0.0007240671,0.00004627266],"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.0000067764477,0.00003157728,0.00006681141,0.00003064976,0.00000619208,0.000080868376,0.0006832007,0.11686051,0.00026504055,0.07874476,0.0000871206,0.80313647],"study_design_scores_gemma":[0.00045007045,0.00018721394,0.00090515387,0.00028414757,0.0000045649317,0.00009426076,9.4526655e-8,0.8145706,0.0010536163,0.17301255,0.008696505,0.00074123545],"about_ca_topic_score_codex":0.00002517405,"about_ca_topic_score_gemma":0.000118642085,"teacher_disagreement_score":0.8023953,"about_ca_system_score_codex":0.00025810176,"about_ca_system_score_gemma":0.00048393698,"threshold_uncertainty_score":0.99979436},"labels":[],"label_agreement":null},{"id":"W176182772","doi":"10.1007/978-3-642-45043-3_21","title":"Thickness and Colorability of Geometric Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba","funders":"","keywords":"Combinatorics; Vertex (graph theory); Partition (number theory); Planar graph; Mathematics; Graph; Geometric graph theory; Discrete mathematics; Line graph; Graph power","score_opus":0.015853929763021368,"score_gpt":0.2369073298119856,"score_spread":0.22105340004896423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176182772","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.002986118,0.0008039289,0.9932713,0.00033737186,0.0008785565,0.00036228055,0.000003814742,0.000053863,0.0013027888],"genre_scores_gemma":[0.6227302,0.00008561262,0.37636584,0.0004380436,0.00012673496,0.000009831689,0.0000055680157,0.000013847513,0.00022431662],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973027,0.000038552924,0.0004901532,0.0010478504,0.0007978655,0.00032289192],"domain_scores_gemma":[0.9975689,0.0007466058,0.0002915654,0.00076003553,0.0005017502,0.0001311194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000988995,0.00031310096,0.0004406335,0.0015411993,0.00015198375,0.00025184522,0.0013639713,0.0002293237,0.000029972383],"category_scores_gemma":[0.00016691559,0.00028529912,0.000081920654,0.0016234741,0.000659967,0.00058804976,0.0008902961,0.0003967926,0.000014546502],"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.0000035425899,0.000036587146,0.00018537477,0.00008229977,0.000010327737,0.000006730305,0.00026901826,0.023695799,0.00022721587,0.08781087,0.000022537282,0.8876497],"study_design_scores_gemma":[0.00027495474,0.0002664642,0.003945004,0.00014522295,0.000009212123,0.00006209576,1.3235388e-7,0.37161902,0.0020724316,0.6204743,0.00060110295,0.00053005706],"about_ca_topic_score_codex":0.000026607915,"about_ca_topic_score_gemma":0.000017091777,"teacher_disagreement_score":0.88711965,"about_ca_system_score_codex":0.00009076886,"about_ca_system_score_gemma":0.00036967947,"threshold_uncertainty_score":0.99995995},"labels":[],"label_agreement":null},{"id":"W176842924","doi":"10.1007/978-3-642-32241-9_20","title":"Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba","funders":"","keywords":"Computer science","score_opus":0.020343941132421394,"score_gpt":0.25884062245426426,"score_spread":0.23849668132184287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176842924","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.0021065534,0.00032349053,0.9929299,0.00029986625,0.00097067835,0.00026842864,0.0000075696694,0.00010151405,0.0029920326],"genre_scores_gemma":[0.57234967,0.000015097021,0.42675802,0.0002595443,0.00043270105,0.00000308146,0.000010897055,0.000020281715,0.00015069544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970698,0.000044077595,0.0005546318,0.00089111656,0.00088835665,0.000552027],"domain_scores_gemma":[0.9976394,0.0005677187,0.0003991369,0.0007947882,0.00042430972,0.0001746498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076110166,0.00038315522,0.00044656234,0.0005765496,0.0002872799,0.00020748079,0.0012013986,0.00018007797,0.000043792083],"category_scores_gemma":[0.000056539717,0.0003459913,0.00010239634,0.0009892472,0.00043686954,0.0006320897,0.0006046191,0.00050276954,0.00003455864],"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.00001664294,0.00012560532,0.0006680364,0.000084203755,0.00004293612,0.000029378814,0.0018434221,0.27471027,0.0006475022,0.049770217,0.000044959303,0.6720168],"study_design_scores_gemma":[0.00064938853,0.00034094902,0.0009602077,0.000893175,0.000042086616,0.00032480137,0.0000012388531,0.92602146,0.0117197,0.05521404,0.0025936242,0.0012393373],"about_ca_topic_score_codex":0.000018180326,"about_ca_topic_score_gemma":0.00004496051,"teacher_disagreement_score":0.6707775,"about_ca_system_score_codex":0.00014628934,"about_ca_system_score_gemma":0.00060657813,"threshold_uncertainty_score":0.9998992},"labels":[],"label_agreement":null},{"id":"W1769594948","doi":"10.1137/1.9781611973730.109","title":"Optimal detection of intersections between convex polyhedra","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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":"Polyhedron; Combinatorics; Intersection (aeronautics); Dimension (graph theory); Regular polygon; Binary logarithm; Mathematics; Time complexity; Convex polytope; Computational geometry; Constant (computer programming); Representation (politics); Discrete mathematics; Algorithm; Computer science; Convex set; Convex optimization; Geometry","score_opus":0.022109114927073403,"score_gpt":0.2667077151842954,"score_spread":0.24459860025722202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1769594948","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.13510023,0.000032221003,0.86182255,0.00020019396,0.0012245348,0.00014071682,0.0000054112347,0.00013525464,0.001338874],"genre_scores_gemma":[0.9498793,0.000004269874,0.04930174,0.00005328183,0.00036400385,0.00001594825,0.000030434425,0.0000065451954,0.00034451275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987715,0.000085122454,0.00036290043,0.0004051101,0.00024513344,0.00013025489],"domain_scores_gemma":[0.9989201,0.00012169543,0.0002268195,0.0004500187,0.00021473285,0.00006667203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027417627,0.00015502068,0.00025225655,0.00033266796,0.0000719837,0.00009299317,0.00051648164,0.00017449667,0.000025491005],"category_scores_gemma":[0.00004023538,0.0001575418,0.00014249182,0.00026106773,0.000033083295,0.00014972412,0.0006998146,0.0002781406,0.00002849405],"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.000024605148,0.00021043699,0.0011872643,0.00039271923,0.0004917616,0.0000028282025,0.0015918647,0.55631506,0.020198282,0.04285547,0.0013592048,0.3753705],"study_design_scores_gemma":[0.0003409515,0.00026687267,0.011338069,0.000072806455,0.00005454883,0.0000138790265,0.000029713692,0.83745545,0.13714404,0.0094436295,0.0033322913,0.0005077491],"about_ca_topic_score_codex":0.000098499804,"about_ca_topic_score_gemma":0.000014952584,"teacher_disagreement_score":0.81477904,"about_ca_system_score_codex":0.000046202982,"about_ca_system_score_gemma":0.0000997046,"threshold_uncertainty_score":0.6424368},"labels":[],"label_agreement":null},{"id":"W17701413","doi":"10.1007/s00381-007-0455-x","title":"Triangle-Free Polyconvex Graphs","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.018701616499314767,"score_gpt":0.2206636877406595,"score_spread":0.20196207124134474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17701413","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.7870014,0.0046476675,0.087865755,0.015957512,0.024799794,0.00093770603,0.000012019933,0.0016674376,0.07711073],"genre_scores_gemma":[0.992793,0.000025946554,0.0051242453,0.0005044044,0.0000189904,0.000013336601,0.0000037105171,0.000007450624,0.0015088792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891055,0.000065977314,0.00020166505,0.00029668663,0.00030665856,0.0002184743],"domain_scores_gemma":[0.9989951,0.00011713947,0.000068670626,0.000628107,0.00008452196,0.000106452375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019806914,0.000117209995,0.00013440178,0.00017473489,0.0001522432,0.00013136685,0.0008339411,0.00005469426,0.000120600795],"category_scores_gemma":[0.00010660363,0.00012012583,0.00008516729,0.0008130728,0.000023892298,0.0004430156,0.00018649024,0.0001006221,0.00028106786],"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.0000016353458,0.000086763015,0.00013804353,0.0000026722778,0.000011155403,0.000009014194,0.00015023482,0.000032018477,0.000161213,0.9544109,0.027404727,0.017591588],"study_design_scores_gemma":[0.0013416011,0.000112588496,0.0013978628,0.000006201541,0.000005281343,0.000019089697,0.000005299152,0.035629284,0.0015283102,0.9447059,0.015038981,0.00020958214],"about_ca_topic_score_codex":0.0000063508305,"about_ca_topic_score_gemma":0.0000010810949,"teacher_disagreement_score":0.20579167,"about_ca_system_score_codex":0.000026667945,"about_ca_system_score_gemma":0.000019247645,"threshold_uncertainty_score":0.4898589},"labels":[],"label_agreement":null},{"id":"W177056356","doi":"10.1007/978-94-017-0161-7_33","title":"An a Priori Adaptive 3D Advancing Front Mesh Generator Integrated to Solid Modeling","year":2003,"lang":"en","type":"book-chapter","venue":"","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Mesh generation; Discretization; Computer science; Generator (circuit theory); A priori and a posteriori; Finite element method; Process (computing); Boundary (topology); Context (archaeology); Set (abstract data type); Algorithm; Mechanical engineering; Engineering drawing; Computational science; Mathematics; Engineering; Mathematical analysis; Structural engineering","score_opus":0.023850490463763183,"score_gpt":0.25975228164080205,"score_spread":0.23590179117703886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177056356","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.0000980425,0.0002390075,0.93642604,0.00015755394,0.00083264144,0.000437723,0.000013711145,0.00023628915,0.061558966],"genre_scores_gemma":[0.004274528,0.000043795284,0.85788995,0.0032568292,0.0005109575,0.00003309575,0.000096533084,0.000061667924,0.13383263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975114,0.00005169742,0.0005258656,0.0010146144,0.0005210943,0.00037535158],"domain_scores_gemma":[0.99812186,0.000038174443,0.0001458782,0.0006685781,0.00066404993,0.00036146925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035166956,0.00046787946,0.0004322334,0.00044840356,0.00020079411,0.00026285741,0.0006464338,0.00024312161,0.0001966853],"category_scores_gemma":[0.000029305189,0.0004464115,0.00012001762,0.00014205473,0.00001327953,0.00059619936,0.00015744533,0.0003284595,0.00021034067],"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.000020518371,0.00003794296,2.7502168e-7,0.000008325536,0.00008960405,0.000023024828,0.0004691231,0.5995907,0.0010228829,0.33564934,0.003568996,0.059519216],"study_design_scores_gemma":[0.00015819016,0.0002561199,2.5945164e-7,0.0000655874,0.000021887934,0.0000150014785,0.00001616794,0.9484027,0.00066113105,0.009392138,0.040434968,0.0005758317],"about_ca_topic_score_codex":0.00002664102,"about_ca_topic_score_gemma":0.00013642572,"teacher_disagreement_score":0.34881198,"about_ca_system_score_codex":0.00028532458,"about_ca_system_score_gemma":0.00046607805,"threshold_uncertainty_score":0.9997988},"labels":[],"label_agreement":null},{"id":"W1778352006","doi":"10.1007/978-3-642-31155-0_19","title":"Minimum Convex Partitions and Maximum Empty Polytopes","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Calgary","funders":"","keywords":"Combinatorics; Mathematics; Convex body; Partition (number theory); Regular polygon; Convex polytope; Dimension (graph theory); Polytope; Upper and lower bounds; Convex hull; Unit cube; Convex set; General position; Polyhedron; Approximation algorithm; Steiner tree problem; Discrete mathematics; Convex optimization; Geometry; Mathematical analysis","score_opus":0.0200805532088027,"score_gpt":0.2471383111693847,"score_spread":0.227057757960582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778352006","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.0004545952,0.0019805217,0.99213576,0.0013936848,0.0015407035,0.00025988242,0.00000801809,0.000108729364,0.002118116],"genre_scores_gemma":[0.58159745,0.00022458253,0.41262755,0.0031147609,0.0013979969,0.00002002404,0.000027847098,0.000035486883,0.0009542885],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974439,0.00003240459,0.00038876984,0.0009793947,0.0006400121,0.0005154988],"domain_scores_gemma":[0.9983539,0.000358284,0.00017947587,0.00067836995,0.00019315793,0.00023680585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005936228,0.0003695834,0.00035222294,0.00064413936,0.0003296323,0.00046876798,0.001064906,0.00021541657,0.00004880729],"category_scores_gemma":[0.000051317256,0.00035312236,0.00007679948,0.00047285805,0.0004816855,0.000797949,0.0008254144,0.00041488104,0.00006384733],"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.000003918134,0.000040220457,0.00012082836,0.00003179057,0.0000137773495,0.000026073616,0.0006708483,0.008651863,0.00028155601,0.059460793,0.00011022607,0.9305881],"study_design_scores_gemma":[0.00050382945,0.00023866491,0.0018779971,0.00025171143,0.000025818097,0.00030604412,3.7780043e-7,0.33618218,0.0026881986,0.635965,0.02069206,0.0012681063],"about_ca_topic_score_codex":0.00000863993,"about_ca_topic_score_gemma":0.000027023929,"teacher_disagreement_score":0.92932,"about_ca_system_score_codex":0.00010539715,"about_ca_system_score_gemma":0.000322088,"threshold_uncertainty_score":0.99989206},"labels":[],"label_agreement":null},{"id":"W1791954569","doi":"10.1007/978-3-319-12691-3_10","title":"Guarding Monotone Art Galleries with Sliding Cameras in Linear Time","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Manitoba","funders":"","keywords":"Monotone polygon; Time complexity; Polygon (computer graphics); Line segment; Computer science; Guard (computer science); Interior point method; Algorithm; Point in polygon; Simple polygon; Combinatorics; Regular polygon; Point (geometry); Linear programming; Mathematics; Mathematical optimization; Computer vision; Geometry","score_opus":0.01108756555793992,"score_gpt":0.22742418888146607,"score_spread":0.21633662332352616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791954569","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.0006370461,0.0001496705,0.994064,0.0006246806,0.00076936884,0.00031956215,0.0000015654612,0.000120045624,0.003314089],"genre_scores_gemma":[0.26747954,0.000036381312,0.72659284,0.0016366165,0.0009369597,0.00002167827,0.000024893245,0.000053915148,0.0032172024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996696,0.00004874874,0.00049237517,0.0013104536,0.0009091932,0.00054326246],"domain_scores_gemma":[0.99817675,0.00045420686,0.0002452721,0.0007674086,0.00022702261,0.00012935007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009808437,0.0004646154,0.00053172366,0.0011784643,0.00022446818,0.0004295477,0.0014676151,0.00020394895,0.000026430722],"category_scores_gemma":[0.000078751444,0.0004193871,0.00007849399,0.00096264726,0.00024847043,0.0005771483,0.0006180651,0.00060316524,0.00013662835],"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.000017032251,0.000024724197,0.00009912004,0.000034687713,0.000014481467,0.000093673756,0.0007317827,0.71917194,0.00054202,0.018549351,0.00008243661,0.26063874],"study_design_scores_gemma":[0.00033995963,0.00022249049,0.00016778441,0.00043097488,0.0000051695915,0.0000862736,1.5215971e-7,0.9724603,0.0015339617,0.01902299,0.005076461,0.0006534724],"about_ca_topic_score_codex":0.000010828649,"about_ca_topic_score_gemma":0.000058846763,"teacher_disagreement_score":0.26747113,"about_ca_system_score_codex":0.00024566657,"about_ca_system_score_gemma":0.00045181508,"threshold_uncertainty_score":0.9998258},"labels":[],"label_agreement":null},{"id":"W1797665807","doi":"10.1007/3-540-45749-6_58","title":"Covering Things with Things","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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; McGill University","funders":"","keywords":"Dimension (graph theory); Running time; Time complexity; Combinatorics; Notation; Algorithm; Binary logarithm; Computer science; Discrete mathematics; Mathematics; Arithmetic","score_opus":0.013497516783689227,"score_gpt":0.21498064990667748,"score_spread":0.20148313312298824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1797665807","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.000089217545,0.00030784612,0.98909664,0.000986722,0.0010000153,0.00026063013,0.0000012691719,0.00020602962,0.00805161],"genre_scores_gemma":[0.08594606,0.000058654543,0.9063314,0.0049057314,0.00066399336,0.0000098834225,0.000008759815,0.00004664168,0.0020288692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964848,0.000020656014,0.00038507325,0.0013626497,0.001227626,0.0005191916],"domain_scores_gemma":[0.9981006,0.0003219022,0.00026071924,0.00088195206,0.00027782025,0.00015702358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000590563,0.00046526463,0.0003870819,0.0008067232,0.00033570122,0.0007933328,0.0021158562,0.00021054571,0.000040153132],"category_scores_gemma":[0.00004832091,0.0004012536,0.00008686231,0.00081685354,0.00031676498,0.002014775,0.0007802198,0.0007063122,0.00006919746],"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.0000069734147,0.000030923944,0.000021277325,0.000041372736,0.000017908165,0.00014211317,0.0016820767,0.24256441,0.00015610558,0.07087822,0.000053407497,0.6844052],"study_design_scores_gemma":[0.00029066476,0.00019136033,0.00006093571,0.00034842055,0.000008015578,0.00020686671,9.9195695e-8,0.9061272,0.001200759,0.0853121,0.0055207084,0.0007328379],"about_ca_topic_score_codex":0.00001394082,"about_ca_topic_score_gemma":0.000008251069,"teacher_disagreement_score":0.68367237,"about_ca_system_score_codex":0.00024932067,"about_ca_system_score_gemma":0.00033427437,"threshold_uncertainty_score":0.99984396},"labels":[],"label_agreement":null},{"id":"W1798872925","doi":"10.1007/s00454-013-9486-0","title":"An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains","year":2013,"lang":"en","type":"article","venue":"Discrete & 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":"Carleton University","funders":"Los Alamos National Laboratory; Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Combinatorics; Mathematics; Geodesic; Voronoi diagram; Vertex (graph theory); Domain (mathematical analysis); Tetrahedron; Algorithm; Geometry; Graph; Mathematical analysis","score_opus":0.010904921221458088,"score_gpt":0.266188493852599,"score_spread":0.25528357263114093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1798872925","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.13208733,0.00007985506,0.8657147,0.00038377193,0.00041827632,0.0008671438,0.00003014288,0.00019888619,0.00021987378],"genre_scores_gemma":[0.5458012,0.000001627125,0.45285657,0.0003221339,0.0001799101,0.00008988349,0.0007014701,0.000015741572,0.000031413823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972407,0.00014272702,0.0006956627,0.00079345814,0.0006297086,0.0004977216],"domain_scores_gemma":[0.99816805,0.00050792604,0.0002280056,0.00036571344,0.0005227872,0.00020749624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006146899,0.00030146676,0.00031193238,0.0008315352,0.00031589324,0.00052378315,0.0006917448,0.0001245437,0.000044401713],"category_scores_gemma":[0.00005848412,0.00031329846,0.00012736338,0.0018145056,0.000054522545,0.0017833121,0.0001366802,0.00019216456,0.00006967409],"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.000007617781,0.00037541284,0.0016299697,0.000031574906,0.000040741626,0.000006037712,0.00064029254,0.29591194,0.00042188,0.07107118,0.0005264877,0.62933683],"study_design_scores_gemma":[0.00081350975,0.00015552182,0.049730048,0.000022941875,0.0000058665755,0.000016536535,0.00007785936,0.8911189,0.00014652137,0.057317033,0.00023848568,0.00035681992],"about_ca_topic_score_codex":0.00005020796,"about_ca_topic_score_gemma":0.0000060957736,"teacher_disagreement_score":0.62898004,"about_ca_system_score_codex":0.00013033641,"about_ca_system_score_gemma":0.00015253626,"threshold_uncertainty_score":0.99993193},"labels":[],"label_agreement":null},{"id":"W1800138911","doi":"10.1016/j.tcs.2015.01.053","title":"Excuse me! or the courteous theatregoers' problem","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Courtesy; Set (abstract data type); Excuse; Mathematics; Row; Mathematical proof; Combinatorics; Space (punctuation); Computer science; Law; Philosophy; Geometry; Programming language; Linguistics","score_opus":0.022670644685306603,"score_gpt":0.2678674716029356,"score_spread":0.245196826917629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800138911","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.0058414713,0.00004342188,0.97999126,0.0076716105,0.00088640815,0.00024805742,8.351327e-7,0.00020823069,0.0051087267],"genre_scores_gemma":[0.81850404,0.0000033354522,0.17964616,0.0013875103,0.00028726252,0.000012959157,8.7905113e-7,0.000005926635,0.00015195558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739593,0.00017732522,0.00025916347,0.00059997325,0.0010872523,0.00048033398],"domain_scores_gemma":[0.99797374,0.0003845573,0.00006758471,0.00080168765,0.00041108276,0.0003613493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024785134,0.00017424634,0.00015283785,0.00014739024,0.0005296087,0.0007537259,0.0027774216,0.000040007755,0.000029041985],"category_scores_gemma":[0.00013784472,0.00008459066,0.000052261334,0.0019206558,0.0015391064,0.0007258559,0.000991937,0.00018263755,0.00016210676],"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.000015755135,0.000048339803,0.000009490554,0.0000023781768,0.0000036170966,0.000013231042,0.0009813936,0.004278169,0.00009142183,0.93941796,0.0011166009,0.054021634],"study_design_scores_gemma":[0.00029383015,0.00031080065,0.00012776753,0.0000112026455,0.000005045536,0.00017999051,0.000025136782,0.73650753,0.0010980635,0.25755808,0.0036930442,0.0001895459],"about_ca_topic_score_codex":0.000003943332,"about_ca_topic_score_gemma":0.0000017397949,"teacher_disagreement_score":0.81266254,"about_ca_system_score_codex":0.000078045894,"about_ca_system_score_gemma":0.0005907488,"threshold_uncertainty_score":0.7268196},"labels":[],"label_agreement":null},{"id":"W1806592748","doi":"10.48550/arxiv.1501.01783","title":"Upper and Lower Bounds for Competitive Online Routing on Delaunay\\n Triangulations","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Delaunay triangulation; Upper and lower bounds; Computer science; Combinatorics; Routing (electronic design automation); Mathematics; Computer network; Mathematical analysis","score_opus":0.10126926107303667,"score_gpt":0.22694043763679275,"score_spread":0.1256711765637561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1806592748","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.23682658,0.000042503227,0.76034456,0.00027446263,0.0006629313,0.00033726022,0.00008148094,0.0000917652,0.0013384708],"genre_scores_gemma":[0.9874044,0.000016640228,0.010427218,0.00019277773,0.00021088833,0.0000016818475,0.00020087442,0.000010469179,0.0015350555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987695,0.0000780636,0.00016459926,0.00070853677,0.00008648176,0.00019277167],"domain_scores_gemma":[0.99868333,0.00026163648,0.00016212421,0.00038260838,0.00037843242,0.00013186198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026899207,0.00019927397,0.00021265516,0.00025661616,0.00021548763,0.00014446981,0.00040447395,0.00015291962,0.000007171409],"category_scores_gemma":[0.00009748254,0.00022994562,0.000116325755,0.0003416545,0.00005055952,0.00023890895,0.0006970919,0.00022697204,0.0000102436625],"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.000055130593,0.0001262503,0.0002121655,0.000016343893,0.00005183944,0.000014899513,0.00019501876,0.36174342,0.000012123932,0.63514006,0.00036734357,0.0020654309],"study_design_scores_gemma":[0.000834222,0.00014592131,0.0012838657,0.00005718799,0.000042716456,0.0000030414865,0.00006184164,0.9006988,0.000029683457,0.093993634,0.0025650754,0.00028400848],"about_ca_topic_score_codex":0.000018508159,"about_ca_topic_score_gemma":0.000037003047,"teacher_disagreement_score":0.7505778,"about_ca_system_score_codex":0.00015541309,"about_ca_system_score_gemma":0.00024516194,"threshold_uncertainty_score":0.93769103},"labels":[],"label_agreement":null},{"id":"W1810559539","doi":"10.1007/978-3-642-22300-6_46","title":"Closest Pair and the Post Office Problem for Stochastic Points","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Euclidean space; Point (geometry); Set (abstract data type); Euclidean distance; Stochastic geometry; Computer science; Euclidean geometry; Combinatorics; k-nearest neighbors algorithm; Point process; Stochastic process; Space (punctuation); Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Statistics; Geometry","score_opus":0.017112171882038067,"score_gpt":0.2304949142624519,"score_spread":0.21338274238041383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810559539","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.00007121435,0.00044654112,0.99411243,0.0025871946,0.0009490693,0.000966026,0.0000082603565,0.00007831202,0.00078092923],"genre_scores_gemma":[0.2227501,0.00002382127,0.770998,0.004433919,0.00080045214,0.000074777534,0.000022440541,0.000039768598,0.00085669314],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975841,0.0000434078,0.00039776115,0.0010484442,0.00052795926,0.00039829567],"domain_scores_gemma":[0.99716294,0.00135097,0.00024952518,0.0006663038,0.0004599209,0.0001103278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013182814,0.00035881347,0.0003578082,0.00042446025,0.00040206758,0.00042662612,0.0016038272,0.00016397258,0.000007575597],"category_scores_gemma":[0.00018505193,0.0002569174,0.000106059415,0.00036340556,0.0007216919,0.0004314933,0.0007391086,0.0003650827,0.000016519389],"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.000069709306,0.000030019442,0.0000034082743,0.00005477473,0.00001645016,0.000006423394,0.0012823681,0.051933337,0.000024108695,0.35558537,0.000051781346,0.59094226],"study_design_scores_gemma":[0.000781866,0.00022155952,0.00009273834,0.00014103725,0.00001472869,0.00008129569,1.3152118e-7,0.49796915,0.000117890886,0.49886984,0.0013196231,0.00039011787],"about_ca_topic_score_codex":0.000019404308,"about_ca_topic_score_gemma":0.0000431096,"teacher_disagreement_score":0.59055215,"about_ca_system_score_codex":0.00007585693,"about_ca_system_score_gemma":0.00042433833,"threshold_uncertainty_score":0.9999883},"labels":[],"label_agreement":null},{"id":"W1810702064","doi":"10.1007/978-3-642-17517-6_6","title":"Approximating the Average Stretch Factor of Geometric Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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; Vertex (graph theory); Euclidean geometry; Shortest path problem; Mathematics; Approximation algorithm; Graph; Path (computing); Plane (geometry); Set (abstract data type); Discrete mathematics; Computer science; Geometry","score_opus":0.016855616836274304,"score_gpt":0.23803114598761566,"score_spread":0.22117552915134137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810702064","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.002962083,0.00031523203,0.99336207,0.00035603702,0.0016710996,0.0003576624,0.000009198364,0.00006661083,0.0009000129],"genre_scores_gemma":[0.6470848,0.000020024037,0.35209262,0.00037830943,0.000273421,0.000006276552,0.000006952282,0.000017068709,0.000120573655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967692,0.000039006358,0.00062703615,0.0009453867,0.0012035209,0.0004158732],"domain_scores_gemma":[0.99687606,0.0010037058,0.00050898653,0.0011227304,0.0003872752,0.000101234036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009924009,0.0003745078,0.00040669,0.0014161724,0.0003239397,0.00036635343,0.0029642428,0.0002623129,0.00004707024],"category_scores_gemma":[0.00023424099,0.00027793425,0.00016106656,0.002015596,0.0005009176,0.00044925255,0.0009434931,0.0009733671,0.000012676432],"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.000002282658,0.00002908024,0.00006411683,0.000043005362,0.000013696988,0.000009396865,0.00075588893,0.041267052,0.0011387905,0.03664571,0.0000050260664,0.92002594],"study_design_scores_gemma":[0.00022692236,0.00014865823,0.0006883654,0.0001402265,0.000007931617,0.000052404754,2.1110426e-7,0.70939875,0.015882926,0.27223098,0.0006771248,0.00054550165],"about_ca_topic_score_codex":0.0000135765185,"about_ca_topic_score_gemma":0.000026970727,"teacher_disagreement_score":0.91948044,"about_ca_system_score_codex":0.00007953676,"about_ca_system_score_gemma":0.00043536842,"threshold_uncertainty_score":0.9999673},"labels":[],"label_agreement":null},{"id":"W1817851888","doi":"10.1007/978-3-642-36763-2_17","title":"On Representing Graphs by Touching Cuboids","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Queen's University; University of British Columbia; University of Victoria; University of New Brunswick","funders":"","keywords":"Cuboid; Mathematics; Rectangle; Combinatorics; Disjoint sets; Graph; Unit cube; Intersection (aeronautics); Representation (politics); Planar graph; Geometry; Engineering","score_opus":0.01284476302467643,"score_gpt":0.2417111072095744,"score_spread":0.22886634418489796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1817851888","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.0005872578,0.00034089427,0.98535484,0.0007747821,0.0019129086,0.00032982853,0.0000029540686,0.00016893912,0.010527598],"genre_scores_gemma":[0.4012726,0.00006970911,0.5869072,0.005727497,0.0010447789,0.000032905904,0.000047553698,0.000073090574,0.00482464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961055,0.000044241286,0.0005020232,0.0016168877,0.0011654049,0.00056593464],"domain_scores_gemma":[0.99747455,0.00071425806,0.0002824052,0.0011175132,0.00023801824,0.00017325593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007355268,0.00045946662,0.00037437433,0.0009673292,0.00039382032,0.00092881557,0.0022664978,0.00023817056,0.00005976609],"category_scores_gemma":[0.00015627916,0.00043364803,0.00013784895,0.00079438416,0.00024274207,0.00080558175,0.0008935376,0.000751348,0.00015049608],"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.0000025748857,0.000032023938,0.000017301276,0.000016946722,0.000010498557,0.000022072913,0.00025013852,0.10679887,0.0004964595,0.1456284,0.0010495776,0.74567515],"study_design_scores_gemma":[0.0001649808,0.00012548572,0.000043426397,0.00017993775,0.0000034647076,0.000027045893,5.177204e-8,0.54044473,0.0021561503,0.45412,0.0022202556,0.00051444664],"about_ca_topic_score_codex":0.000025154362,"about_ca_topic_score_gemma":0.000008132285,"teacher_disagreement_score":0.7451607,"about_ca_system_score_codex":0.00017446687,"about_ca_system_score_gemma":0.00024071008,"threshold_uncertainty_score":0.99981153},"labels":[],"label_agreement":null},{"id":"W182049128","doi":"10.1023/a:1026138205325","title":"Properties of Three-Dimensional Median Line Location Models","year":2003,"lang":"en","type":"article","venue":"Annals of Operations Research","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":"Royal Military College of Canada","funders":"","keywords":"Theory of computation; Heuristic; Mathematical optimization; Euclidean distance; Computer science; Norm (philosophy); Line (geometry); Mathematics; Euclidean space; Combinatorics; Algorithm; Artificial intelligence; Geometry","score_opus":0.38426250755579067,"score_gpt":0.41592130949951817,"score_spread":0.0316588019437275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182049128","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.2917351,0.0014781295,0.7005483,0.0046197437,0.00011802739,0.00038476824,0.0000047942335,0.000022046639,0.0010891078],"genre_scores_gemma":[0.97706103,0.000041834326,0.02240772,0.000074570504,0.00003300732,0.000031625714,0.000010849876,0.000004608005,0.0003347302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982552,0.0002367264,0.00033170293,0.00021712795,0.00076891494,0.00019035398],"domain_scores_gemma":[0.99617493,0.000090291855,0.000030823787,0.0003375013,0.0032947294,0.0000717223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016293904,0.00006951086,0.00012040563,0.00040878484,0.00020459668,0.00005799856,0.00032360322,0.000046519173,0.000024633258],"category_scores_gemma":[0.00046582372,0.000060235463,0.000037699338,0.001287522,0.00011399275,0.0006900007,0.0000831051,0.00012082593,0.000016715732],"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.0000069779794,0.00015836606,0.000013712464,0.000023182689,0.000014216268,4.6276415e-7,0.00027783023,0.7405154,0.015947763,0.23872387,0.0004233408,0.003894846],"study_design_scores_gemma":[0.00010902309,0.00012525203,0.00009323925,0.00003478485,9.639194e-7,0.000002972937,0.000018271921,0.7591062,0.22801739,0.012260567,0.00017407107,0.000057270023],"about_ca_topic_score_codex":0.00012692285,"about_ca_topic_score_gemma":0.00016863094,"teacher_disagreement_score":0.6853259,"about_ca_system_score_codex":0.00001053275,"about_ca_system_score_gemma":0.00061766355,"threshold_uncertainty_score":0.24563308},"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":"W1822246743","doi":"10.1007/s00453-018-0487-5","title":"Track Layouts, Layered Path Decompositions, and Leveled Planarity","year":2018,"lang":"en","type":"article","venue":"Algorithmica","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Treewidth; Planarity testing; Pathwidth; Parameterized complexity; Bounded function; Planar graph; Path (computing); Planar; 1-planar graph","score_opus":0.011471386148759342,"score_gpt":0.24469458734348468,"score_spread":0.23322320119472534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1822246743","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.08533325,0.00012621275,0.91153646,0.0014930266,0.00035391815,0.00010985506,0.000014398448,0.00013007117,0.00090282864],"genre_scores_gemma":[0.8147315,0.000008001324,0.18421693,0.0005566168,0.000305807,0.0000065899526,0.000022674236,0.0000043625582,0.00014751655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918884,0.000049552902,0.00014825915,0.00029266896,0.0001583765,0.00016228015],"domain_scores_gemma":[0.99947584,0.00007331057,0.0000440408,0.0002065513,0.00011031156,0.00008995562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016032206,0.00009353381,0.000097640936,0.00008032159,0.00023514795,0.00012801788,0.00022368171,0.000046890298,0.000024161238],"category_scores_gemma":[0.000018388422,0.00009242832,0.00002552851,0.00026236894,0.000048429287,0.00029699007,0.00009605092,0.00007167264,0.00007363382],"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.00003356048,0.00034479468,0.0007700196,0.000024101284,0.00009798607,0.000044254237,0.0017880156,0.00018409504,0.0064913384,0.14387362,0.02292464,0.82342356],"study_design_scores_gemma":[0.0014258346,0.0005489037,0.05135174,0.000032130512,0.000021607124,0.00028367652,0.00003966255,0.83848363,0.023317238,0.039592586,0.044239726,0.0006632355],"about_ca_topic_score_codex":0.000019522524,"about_ca_topic_score_gemma":0.000010387178,"teacher_disagreement_score":0.8382996,"about_ca_system_score_codex":0.000017768944,"about_ca_system_score_gemma":0.000049796698,"threshold_uncertainty_score":0.37691176},"labels":[],"label_agreement":null},{"id":"W1824389153","doi":"10.46298/dmtcs.2295","title":"Enumerating Triangulations of Convex Polytopes","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Convex hull; Point set triangulation; Triangulation; Polytope; Regular polygon; Convex polytope; Geometric graph theory; Pitteway triangulation; General position; Graph; Convex set; Delaunay triangulation; Geometry; Convex optimization; Line graph; Voltage graph","score_opus":0.01673953264207265,"score_gpt":0.2761587401245396,"score_spread":0.25941920748246694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824389153","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.035902936,0.000043091517,0.95780736,0.00070903776,0.00030292224,0.00018474754,0.0000021564967,0.00009508062,0.0049526636],"genre_scores_gemma":[0.61636454,0.0000034650498,0.38342777,0.00010710426,0.00006959921,0.000004650199,0.0000019619893,0.0000045935335,0.000016289903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978466,0.00006930496,0.00052090664,0.0004425726,0.0007695315,0.00035106426],"domain_scores_gemma":[0.99826396,0.0004326211,0.00018503658,0.00062303356,0.00032633904,0.00016899266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012299982,0.00016743163,0.00026637176,0.00027220586,0.00037191663,0.00032550938,0.0012871792,0.000042814558,0.00009325678],"category_scores_gemma":[0.00022513009,0.00013999632,0.00009638305,0.0016770274,0.00087063306,0.0006639153,0.00049055996,0.0001099382,0.000028632949],"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.000002286366,0.00006520637,0.000030101623,0.000012671728,0.000006303034,0.0000032452035,0.00093421835,0.0014042604,0.0021352025,0.98342204,0.000019796911,0.011964695],"study_design_scores_gemma":[0.00016622063,0.00008295577,0.00025500817,0.00003254037,0.0000064771266,0.00004116704,0.000029776304,0.7700212,0.00443176,0.22471812,0.00006817594,0.00014660473],"about_ca_topic_score_codex":0.0000017065936,"about_ca_topic_score_gemma":3.8994614e-7,"teacher_disagreement_score":0.7686169,"about_ca_system_score_codex":0.000024119097,"about_ca_system_score_gemma":0.0001331227,"threshold_uncertainty_score":0.57088846},"labels":[],"label_agreement":null},{"id":"W183093845","doi":"10.1007/978-3-319-03841-4_1","title":"On the Upward Planarity of Mixed Plane Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Calgary","funders":"","keywords":"Planarity testing; Planar graph; Mixed graph; Combinatorics; Plane (geometry); Mathematics; Graph; Discrete mathematics; Geometry; Line graph; Voltage graph","score_opus":0.01849744526131878,"score_gpt":0.22624184070054384,"score_spread":0.20774439543922507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183093845","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.0017687163,0.0001494514,0.99154234,0.0015021584,0.0015664787,0.00036086235,0.000008483978,0.00005689764,0.003044633],"genre_scores_gemma":[0.8263395,0.000038984264,0.16997845,0.0026291606,0.0003458613,0.000018756147,0.000023845962,0.000025434192,0.0006000311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973326,0.00005497689,0.0004269361,0.00084159925,0.0010025979,0.0003413416],"domain_scores_gemma":[0.9970326,0.001335702,0.00029082195,0.0010010146,0.0002460256,0.00009383405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000801137,0.00033609662,0.00034831002,0.00063906127,0.00021724842,0.0002449847,0.0023804633,0.00018780779,0.0000656241],"category_scores_gemma":[0.000120567965,0.00023786245,0.00011685295,0.0006351212,0.0004382893,0.00027350683,0.00053850864,0.0005447582,0.00007409478],"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.0000068787053,0.00003697641,0.000015227299,0.000022204365,0.00001592146,0.000014721284,0.00025698807,0.07518229,0.00014046453,0.6503633,0.0005898597,0.27335513],"study_design_scores_gemma":[0.00015657976,0.0002379798,0.00043399926,0.0001657791,0.000005293485,0.000030815398,9.349196e-8,0.25392702,0.003335879,0.74039274,0.00095988525,0.00035392272],"about_ca_topic_score_codex":0.00002422054,"about_ca_topic_score_gemma":0.000030024226,"teacher_disagreement_score":0.8245708,"about_ca_system_score_codex":0.000081436316,"about_ca_system_score_gemma":0.0003019312,"threshold_uncertainty_score":0.96997494},"labels":[],"label_agreement":null},{"id":"W1840234796","doi":"10.1007/978-3-540-77537-9_14","title":"Point-Set Embedding of Trees with Edge Constraints","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Lethbridge","funders":"","keywords":"Embedding; Combinatorics; Vertex (graph theory); Planar graph; Point (geometry); Planar; Mathematics; Set (abstract data type); Graph; Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.019341664457584812,"score_gpt":0.2525299114687582,"score_spread":0.23318824701117338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840234796","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.0006563443,0.0002961154,0.99475545,0.00023880904,0.0006837413,0.0002601405,0.000009088162,0.00007655936,0.0030237446],"genre_scores_gemma":[0.5054192,0.00004595165,0.49350014,0.0004425648,0.00028142848,0.0000046343303,0.000013326626,0.000019905505,0.00027287327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711156,0.000029034398,0.0004821571,0.0010252981,0.00095241424,0.0003995462],"domain_scores_gemma":[0.9979667,0.00042923403,0.00034766222,0.0007505391,0.00037551209,0.00013034616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004650762,0.00038765112,0.00046899944,0.00091321784,0.00019487669,0.00016500814,0.0015970279,0.00017616639,0.000027068578],"category_scores_gemma":[0.000058601458,0.00033319957,0.000098151635,0.00074837514,0.001108082,0.0005689893,0.0004882443,0.0004052805,0.000014366551],"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.000013359767,0.000040504317,0.0000772337,0.000040240455,0.000025522495,0.00012844641,0.0013937813,0.3027556,0.00032162826,0.021092389,0.000107467065,0.67400384],"study_design_scores_gemma":[0.0008391633,0.00069417007,0.00064138905,0.0007934664,0.00001656259,0.0008814417,7.430977e-7,0.94291437,0.008146697,0.042070884,0.0018725106,0.001128582],"about_ca_topic_score_codex":0.0000065481318,"about_ca_topic_score_gemma":0.000045253357,"teacher_disagreement_score":0.6728752,"about_ca_system_score_codex":0.0001248397,"about_ca_system_score_gemma":0.00081335,"threshold_uncertainty_score":0.999912},"labels":[],"label_agreement":null},{"id":"W1842824552","doi":"10.1007/978-3-642-02017-9_47","title":"The Two-Guard Polygon Walk Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Polygon (computer graphics); Simple polygon; Visibility polygon; Guard (computer science); Computer science; Boundary (topology); Visibility; Point (geometry); Computer graphics (images); Regular polygon; Mathematics; Geometry; Physics; Optics; Mathematical analysis","score_opus":0.012368779486296963,"score_gpt":0.24459299905053153,"score_spread":0.23222421956423456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842824552","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.000042277676,0.0010760364,0.98340845,0.003764782,0.0016598882,0.00042175726,0.000001805287,0.00015755289,0.009467435],"genre_scores_gemma":[0.08028948,0.00021021372,0.90684605,0.0049410863,0.0021663404,0.000023746054,0.000017502256,0.000047379377,0.0054582227],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962906,0.000050802148,0.00053988205,0.0012585999,0.0012050533,0.000655047],"domain_scores_gemma":[0.9974565,0.0005971297,0.0002838886,0.0011824577,0.00032334487,0.0001566997],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012396248,0.0004552108,0.00033339148,0.00055129104,0.00075647235,0.0011500969,0.0032641452,0.00018460776,0.000009986068],"category_scores_gemma":[0.00005702237,0.00034008638,0.00014231642,0.00074426224,0.00039769593,0.00056789146,0.0007881329,0.0006966017,0.00008753804],"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.0000033662252,0.000012362047,0.0000027197457,0.0000051481647,0.0000053312774,0.000018683197,0.00016159512,0.055447765,0.00007681705,0.09466545,0.00006114863,0.84953964],"study_design_scores_gemma":[0.00024231637,0.00018412624,0.0000872837,0.000111651556,0.000005717615,0.00009197325,6.91605e-8,0.4059976,0.0011172554,0.56918895,0.022466576,0.0005064979],"about_ca_topic_score_codex":0.000012052241,"about_ca_topic_score_gemma":0.00008976457,"teacher_disagreement_score":0.8490331,"about_ca_system_score_codex":0.00025675696,"about_ca_system_score_gemma":0.0006795415,"threshold_uncertainty_score":0.9999051},"labels":[],"label_agreement":null},{"id":"W1844546726","doi":"10.1007/978-3-642-22300-6_49","title":"Planar Subgraphs without Low-Degree Nodes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Combinatorics; Degree (music); Planar graph; Unit disk graph; Embedding; Mathematics; Planar; Graph; Book embedding; Unit (ring theory); Discrete mathematics; Integer (computer science); Line graph; Computer science; Physics; 1-planar graph","score_opus":0.03057628276226043,"score_gpt":0.24229707503983758,"score_spread":0.21172079227757715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844546726","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.0002106884,0.00050873077,0.98654723,0.00029151537,0.0021325184,0.00031265203,0.0000062295458,0.00020472256,0.009785692],"genre_scores_gemma":[0.37181023,0.00008820425,0.6234388,0.0021945967,0.00094903563,0.000016446307,0.000027043934,0.000054109874,0.0014216008],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961592,0.00003918352,0.0005358429,0.0015905013,0.0010527422,0.00062251015],"domain_scores_gemma":[0.99762267,0.00027671998,0.00029884765,0.0012462863,0.00033555686,0.00021994756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007634351,0.00055928575,0.00049618486,0.0013087585,0.00031641906,0.00046642858,0.0029735717,0.00031433106,0.00004688592],"category_scores_gemma":[0.000060585877,0.0005206837,0.00016285914,0.0008497815,0.0005054362,0.0007639456,0.00065798924,0.00065357756,0.00013369873],"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.000012986703,0.000054811066,0.00020490131,0.000047362817,0.000023025423,0.000091351794,0.0007967381,0.015933461,0.00027754274,0.14137115,0.00007589511,0.84111077],"study_design_scores_gemma":[0.000443704,0.00024106137,0.0012960819,0.00041328114,0.00001533635,0.00016154465,1.1074864e-7,0.25627074,0.0030224745,0.734442,0.0024440663,0.0012495957],"about_ca_topic_score_codex":0.00003067563,"about_ca_topic_score_gemma":0.00009046465,"teacher_disagreement_score":0.83986115,"about_ca_system_score_codex":0.00016036876,"about_ca_system_score_gemma":0.000606161,"threshold_uncertainty_score":0.99972445},"labels":[],"label_agreement":null},{"id":"W1845231118","doi":"10.1007/978-3-540-28629-5_57","title":"Efficient View Point Selection for Silhouettes of Convex Polyhedra","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Silhouette; Polyhedron; Regular polygon; Computer science; Combinatorics; Convex polytope; Set (abstract data type); Point (geometry); Artificial intelligence; Algorithm; Computer vision; Mathematics; Convex set; Convex optimization; Geometry","score_opus":0.013926749587646807,"score_gpt":0.248661362414653,"score_spread":0.2347346128270062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1845231118","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.00038342338,0.0006380942,0.99548423,0.0008189137,0.0014172484,0.00069129077,0.000008224659,0.000094760995,0.00046380353],"genre_scores_gemma":[0.46407372,0.000020142192,0.53436047,0.0009051048,0.00045207178,0.000021561005,0.0000130059,0.000025600395,0.00012833827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970196,0.000024931305,0.0006224792,0.0011006654,0.0007966571,0.00043567826],"domain_scores_gemma":[0.9978531,0.00050271046,0.0003970721,0.00055265334,0.0005799956,0.00011444599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008418239,0.00038671624,0.0005043906,0.0009089323,0.00021653884,0.00019477996,0.0012774654,0.00021838336,0.000021413915],"category_scores_gemma":[0.00011229565,0.00037000937,0.00018540268,0.0008382407,0.00031234277,0.00021536787,0.0003789672,0.00031378012,0.000010867285],"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.000007506779,0.000042983807,0.000007185629,0.000087942055,0.000010874734,0.0000022821994,0.00028343656,0.6472347,0.00088344485,0.10109027,0.000010363583,0.25033906],"study_design_scores_gemma":[0.00038550043,0.0003186975,0.00006850835,0.00031769357,0.000011365991,0.000034387493,9.730479e-8,0.79962933,0.013349198,0.1850277,0.00046132316,0.00039620392],"about_ca_topic_score_codex":0.000016706428,"about_ca_topic_score_gemma":0.000020548976,"teacher_disagreement_score":0.4636903,"about_ca_system_score_codex":0.0003359458,"about_ca_system_score_gemma":0.0009746689,"threshold_uncertainty_score":0.9998752},"labels":[],"label_agreement":null},{"id":"W185444019","doi":"","title":"On (k, l)-Kernels of Orientations of Special Graphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.014002163972422663,"score_gpt":0.25455600148164176,"score_spread":0.2405538375092191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185444019","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.9729582,0.000024188195,0.016595446,0.00013649197,0.0021889964,0.000097557226,0.0000025162171,0.000024856052,0.007971753],"genre_scores_gemma":[0.99764407,0.000010712547,0.0021113234,0.000047536596,0.000021417523,0.000003851609,0.0000060237567,0.0000031357529,0.00015191596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992033,0.000038065584,0.00022647149,0.00015791267,0.00027856155,0.00009564883],"domain_scores_gemma":[0.9992947,0.00013908505,0.00012143165,0.00023431318,0.00017049143,0.000039969167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001360064,0.00006715366,0.00011485812,0.00017032948,0.000049051836,0.000014508133,0.0002754589,0.000029785295,0.000043165346],"category_scores_gemma":[0.00005635125,0.00006896284,0.000057963538,0.00082360057,0.000031935477,0.00017686693,0.00004803964,0.00004848335,0.000016449249],"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.0000090540825,0.00015681915,0.00072648545,0.000003723244,0.000009728307,0.0000020094253,0.00024976765,0.0007946446,0.0005684368,0.99194694,0.0011733827,0.0043589957],"study_design_scores_gemma":[0.0005362186,0.00022296935,0.011465286,0.000012208964,0.0000047381513,0.000003757914,0.000013330969,0.0021389672,0.011076953,0.97354364,0.00090078,0.00008114271],"about_ca_topic_score_codex":0.000008211056,"about_ca_topic_score_gemma":0.0000018367689,"teacher_disagreement_score":0.024685888,"about_ca_system_score_codex":0.0000144542355,"about_ca_system_score_gemma":0.000052148145,"threshold_uncertainty_score":0.2812223},"labels":[],"label_agreement":null},{"id":"W1855112105","doi":"10.4086/cjtcs.2011.004","title":"","year":2011,"lang":"en","type":"article","venue":"Chicago Journal of Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"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; University of Sydney; Australian Government; Australian Research Council; Ontario Innovation Trust","keywords":"Combinatorics; Crossing number (knot theory); Graph; Mathematics; Discrete mathematics","score_opus":0.0203164297664672,"score_gpt":0.24615118020393992,"score_spread":0.22583475043747273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1855112105","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.24751808,0.000074781194,0.74916327,0.0010535906,0.0016824735,0.000094314215,3.2208806e-7,0.000051934334,0.00036126442],"genre_scores_gemma":[0.5662046,0.00000796821,0.43288743,0.000636821,0.00025660187,0.0000010265488,9.8411896e-8,0.0000045945544,8.3173484e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99514574,0.00028564167,0.0012057503,0.00068186666,0.0019362316,0.00074477476],"domain_scores_gemma":[0.9951457,0.00042730285,0.0007060428,0.0008760553,0.001977184,0.00086772215],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0060580014,0.00029629626,0.00046644127,0.0010346355,0.00070273736,0.0006033585,0.0068576913,0.00007774464,0.00002286164],"category_scores_gemma":[0.00052197964,0.00022594705,0.0002855255,0.0033678617,0.0027237642,0.004338728,0.0013822507,0.0005328338,0.000007162104],"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.000057739308,0.00027661028,0.00027469627,0.0000053234694,0.000018042714,0.000097319964,0.0025050554,0.0012989171,0.0027700327,0.9355735,0.0000211123,0.057101652],"study_design_scores_gemma":[0.000973122,0.0020896362,0.020320311,0.00006736764,0.000019299863,0.0024356805,0.00002499299,0.29972732,0.06776171,0.6061062,0.00006975375,0.00040455014],"about_ca_topic_score_codex":0.0000014151842,"about_ca_topic_score_gemma":3.323624e-7,"teacher_disagreement_score":0.32946727,"about_ca_system_score_codex":0.000101006415,"about_ca_system_score_gemma":0.0006083775,"threshold_uncertainty_score":0.9999902},"labels":[],"label_agreement":null},{"id":"W1855377430","doi":"10.20382/jocg.v2i1a1","title":"Connected rectilinear graphs on point sets","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Combinatorics; Mathematics; Orientation (vector space); Vertex (graph theory); Graph; Perpendicular; Pairwise comparison; Point (geometry); Line segment; Geometry","score_opus":0.009102678068484239,"score_gpt":0.21809906452068029,"score_spread":0.20899638645219604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1855377430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6465034,0.000022337339,0.34747234,0.0013814445,0.0016330841,0.000096987955,0.0000073564056,0.00006191541,0.0028211428],"genre_scores_gemma":[0.90720206,0.000010254417,0.09183196,0.0004525429,0.00015241945,1.4218698e-7,0.000012967715,0.000009329866,0.00032833754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821424,0.00012804756,0.00040875914,0.00028186437,0.0007509005,0.00021620556],"domain_scores_gemma":[0.99722713,0.00065580994,0.0004953695,0.00022951096,0.001155077,0.0002371111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052939175,0.00018454612,0.0002641765,0.002095424,0.00022124615,0.00012711206,0.0007763584,0.000113638074,0.00009308441],"category_scores_gemma":[0.00023270588,0.00018894591,0.00023485985,0.0024948188,0.0000646506,0.00086766493,0.000113072696,0.0005872563,0.000035751174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027679923,0.0005839777,0.00086995,0.000021112704,0.00025752452,0.00045696562,0.00030592884,0.394228,0.0040831524,0.5565662,0.00587614,0.036474247],"study_design_scores_gemma":[0.011636327,0.0043641464,0.098826416,0.00021105153,0.0002049359,0.0032282835,0.00044895377,0.4127997,0.011848926,0.23199712,0.2222909,0.0021432457],"about_ca_topic_score_codex":0.000004355454,"about_ca_topic_score_gemma":0.00000419896,"teacher_disagreement_score":0.32456908,"about_ca_system_score_codex":0.0000828335,"about_ca_system_score_gemma":0.00035212247,"threshold_uncertainty_score":0.77049905},"labels":[],"label_agreement":null},{"id":"W1860539286","doi":"10.1007/978-3-540-30479-1_9","title":"Applying Cell-DEVS in 3D Free-Form Shape Modeling","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"DEVS; Computer science; Cellular automaton; Computation; Formalism (music); Automaton; Free space; Conservation law; Theoretical computer science; Algorithm; Computational science; Computer graphics (images); Modeling and simulation; Simulation; Mathematics; Mathematical analysis; Physics","score_opus":0.020557774219677246,"score_gpt":0.2376088692002392,"score_spread":0.21705109498056194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860539286","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.0005336029,0.0005271812,0.9929756,0.00033062443,0.0013163881,0.00063146016,0.0000036100894,0.00013543227,0.0035461267],"genre_scores_gemma":[0.36050677,0.000047957106,0.637426,0.00126858,0.0005075137,0.000044889806,0.0000141491255,0.000032268013,0.00015186823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588245,0.000023296969,0.00069484336,0.0015452984,0.0011693443,0.0006847445],"domain_scores_gemma":[0.9980271,0.00023960829,0.00022359006,0.0011144289,0.00023426987,0.00016101419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092013646,0.00051981385,0.00046633903,0.0014998345,0.0002708591,0.00056325085,0.0031479523,0.00032311716,0.00003020605],"category_scores_gemma":[0.000069846814,0.0005283251,0.000117494754,0.001168216,0.0001706472,0.00096843095,0.0014596888,0.00088108686,0.000042461994],"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.0000023454481,0.00002023192,0.000008142608,0.000025739375,0.0000019447818,0.000035662266,0.00038512034,0.6762911,0.000077571145,0.010421185,0.000002632533,0.31272832],"study_design_scores_gemma":[0.00035564753,0.000057188216,0.0000146645825,0.0002313691,0.0000027231788,0.000023613464,1.7051077e-7,0.76987714,0.0003825528,0.22839779,0.00019945009,0.00045766737],"about_ca_topic_score_codex":0.000056719717,"about_ca_topic_score_gemma":0.00012358263,"teacher_disagreement_score":0.35997316,"about_ca_system_score_codex":0.0006279099,"about_ca_system_score_gemma":0.0010353435,"threshold_uncertainty_score":0.9997168},"labels":[],"label_agreement":null},{"id":"W1863587147","doi":"10.1016/j.tcs.2015.12.017","title":"Towards tight bounds on theta-graphs: More is not always better","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":28,"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; Carleton University","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Discrete mathematics; Disjoint sets; Indifference graph; Matching (statistics); Graph","score_opus":0.027910979404374602,"score_gpt":0.27928977332233107,"score_spread":0.2513787939179565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863587147","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.060766358,0.000025150519,0.91366166,0.013514263,0.0014064693,0.00016522512,0.000004071934,0.00022466661,0.010232146],"genre_scores_gemma":[0.8725687,0.0000020122043,0.11444293,0.012613295,0.0002867559,0.000009386486,0.0000028572115,0.000008995835,0.00006502329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634916,0.00011767606,0.0003211337,0.00095346064,0.0016669477,0.0005916472],"domain_scores_gemma":[0.9978454,0.0001519722,0.00008073896,0.0009559585,0.0004444847,0.00052146375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001646509,0.0002644155,0.00023572904,0.00038887665,0.0004252992,0.0008067334,0.0023499557,0.000074538584,0.00005284907],"category_scores_gemma":[0.00008801377,0.0002056759,0.00011330267,0.0018441295,0.0014986846,0.0008518922,0.00082788494,0.00024213013,0.00031822923],"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.000014577961,0.00007497815,0.000020210548,0.0000025534998,0.000006140733,0.000011416774,0.0010160436,0.0008054794,0.0001847158,0.9349078,0.0020890355,0.06086703],"study_design_scores_gemma":[0.00038336066,0.00044844183,0.00096137344,0.000018137704,0.0000060554526,0.000041679206,0.000006661318,0.57000786,0.017998671,0.40505543,0.0047320877,0.0003402608],"about_ca_topic_score_codex":0.0000036121364,"about_ca_topic_score_gemma":2.41775e-7,"teacher_disagreement_score":0.8118024,"about_ca_system_score_codex":0.00009673403,"about_ca_system_score_gemma":0.00034562495,"threshold_uncertainty_score":0.838722},"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":"W1868235818","doi":"10.1007/978-3-642-22300-6_9","title":"Orthogonal Cartograms with Few Corners Per Face","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Face (sociological concept); Planar graph; Planar; Enhanced Data Rates for GSM Evolution; Graph; Combinatorics; Geometry; Mathematics; Computer science; Artificial intelligence; Computer vision; Computer graphics (images); Sociology","score_opus":0.01986018929487761,"score_gpt":0.22847626956806263,"score_spread":0.208616080273185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1868235818","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.00027850454,0.0003014823,0.9871981,0.0002827328,0.0012089472,0.00034456962,0.000004711594,0.00015709247,0.010223844],"genre_scores_gemma":[0.43690568,0.000037614933,0.5594131,0.0014258468,0.0005555065,0.000016922975,0.000027920947,0.000044315235,0.0015730732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963578,0.00003300329,0.0003980749,0.0015144899,0.0011086401,0.000587995],"domain_scores_gemma":[0.9979761,0.0002105221,0.0002482928,0.0009688577,0.00036949664,0.00022669716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005299162,0.00052730925,0.00042138458,0.0007280629,0.00028730673,0.0004629424,0.002081941,0.00023966604,0.00005191479],"category_scores_gemma":[0.000023220502,0.00043844216,0.00011589821,0.00074547133,0.00057480595,0.0006523545,0.00067381316,0.00063816406,0.00009792928],"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.000015095353,0.000039704475,0.00010793967,0.000023865501,0.000022552531,0.000067075125,0.0010497418,0.10631209,0.000064856926,0.07421684,0.000026091126,0.81805414],"study_design_scores_gemma":[0.0013984843,0.0017737318,0.0024792708,0.00083022425,0.00006173424,0.0010151428,0.0000011599938,0.67100596,0.0024486284,0.2856655,0.029488398,0.003831766],"about_ca_topic_score_codex":0.000021164517,"about_ca_topic_score_gemma":0.00015908178,"teacher_disagreement_score":0.8142224,"about_ca_system_score_codex":0.00017063043,"about_ca_system_score_gemma":0.00084587117,"threshold_uncertainty_score":0.99980676},"labels":[],"label_agreement":null},{"id":"W1869291234","doi":"10.14288/1.0051543","title":"Voronoi diagrams of semi-algebraic sets","year":2009,"lang":"en","type":"preprint","venue":"cIRcle (University of British Columbia)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"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 British Columbia","funders":"","keywords":"Voronoi diagram; Delaunay triangulation; Weighted Voronoi diagram; Mathematics; Bowyer–Watson algorithm; Algebraic number; Computation; Algebraic graph theory; Discrete mathematics; Graph; Combinatorics; Algorithm; Geometry; Mathematical analysis","score_opus":0.00959039373192609,"score_gpt":0.1863220490332988,"score_spread":0.17673165530137272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1869291234","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.7629641,0.00045145364,0.23478004,0.00016144513,0.00039596853,0.00024213799,0.000091280745,0.00008695048,0.0008265719],"genre_scores_gemma":[0.98426807,0.00018361241,0.014983284,0.00004925896,0.000045491764,4.5111867e-7,0.00009884834,0.0000067778583,0.0003642263],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99845153,0.00010049304,0.00021897288,0.00060597656,0.0004182433,0.00020479344],"domain_scores_gemma":[0.99852353,0.000061811195,0.00036461808,0.0005756748,0.00036126107,0.00011310536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027836853,0.00007267356,0.00039079174,0.00010821064,0.00012642429,0.00015724791,0.001149493,0.00022668627,0.000032306296],"category_scores_gemma":[0.000028057106,0.000281545,0.00023075726,0.00042097355,0.000114961855,0.00033432725,0.0008738846,0.0002526097,0.000011143726],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026318285,0.00016566491,0.0006492638,0.00015917263,0.000051366354,0.00005516139,0.00023157803,0.0031388756,0.0000994573,0.000090168105,0.0035875172,0.99176913],"study_design_scores_gemma":[0.00044992968,0.000094813346,0.9606187,0.00029116808,0.000034602668,0.00003194339,0.000052648316,0.021444838,0.000008749191,0.016397908,0.0002723422,0.00030239444],"about_ca_topic_score_codex":0.015418016,"about_ca_topic_score_gemma":0.034201533,"teacher_disagreement_score":0.99146676,"about_ca_system_score_codex":0.00007454785,"about_ca_system_score_gemma":0.0002899345,"threshold_uncertainty_score":0.9999637},"labels":[],"label_agreement":null},{"id":"W1870153077","doi":"10.1145/2850418","title":"The Traveling Salesman Problem for Lines, Balls, and Planes","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Combinatorics; Hyperplane; Mathematics; Constant (computer programming); Plane (geometry); Bottleneck traveling salesman problem; Set (abstract data type); 2-opt; Unit (ring theory); Mathematical optimization; Computer science; Geometry","score_opus":0.02093933631693614,"score_gpt":0.25348487591014757,"score_spread":0.23254553959321142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870153077","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.0010410459,0.00011827456,0.9858696,0.012284203,0.00033868122,0.00022419624,0.000016366288,0.00007796157,0.000029707096],"genre_scores_gemma":[0.44196758,0.0004913753,0.55442905,0.00033936944,0.00026338882,0.00019209502,0.000006725337,0.000016299133,0.0022941101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928546,0.000025680478,0.00015248428,0.00024211744,0.00013506856,0.0001591975],"domain_scores_gemma":[0.9988939,0.00066997414,0.000036268295,0.0002698796,0.00007537078,0.000054587952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022489535,0.00009252522,0.00006902535,0.00005073858,0.00048290065,0.000109983965,0.00029672976,0.00003911841,0.000002637173],"category_scores_gemma":[0.00002361963,0.000054256576,0.000041280764,0.00015021152,0.000033931687,0.0002048402,0.0000070715096,0.000051065053,0.000009421557],"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.000009430184,0.000026489874,0.0000024286205,0.0000046563096,0.00001668204,4.5888788e-7,0.00007965028,0.00068720296,0.00058253197,0.007850338,0.00009544714,0.9906447],"study_design_scores_gemma":[0.0049359184,0.0013087618,0.0038413422,0.00019861477,0.00008449487,0.00022792848,0.000114850875,0.3704905,0.03801477,0.33806017,0.24155825,0.0011644161],"about_ca_topic_score_codex":0.0000055185483,"about_ca_topic_score_gemma":0.00002658272,"teacher_disagreement_score":0.98948026,"about_ca_system_score_codex":0.000016728914,"about_ca_system_score_gemma":0.000040160885,"threshold_uncertainty_score":0.37141302},"labels":[],"label_agreement":null},{"id":"W1871678364","doi":"10.1016/j.adhoc.2016.01.002","title":"On the displacement for covering a d-dimensional cube with randomly placed sensors","year":2016,"lang":"en","type":"article","venue":"Ad Hoc Networks","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":"Cube (algebra); Displacement (psychology); Unit cube; Terrain; Metric (unit); Point (geometry); Cube root; RADIUS; Mathematics; Range (aeronautics); Geometry; Computer science; Combinatorics; Geography; Engineering; Cartography","score_opus":0.0097721108021219,"score_gpt":0.21544715758930383,"score_spread":0.20567504678718193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871678364","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.11625868,0.000121639234,0.87948227,0.003283905,0.0002799383,0.00040255737,0.0000022555928,0.000042266947,0.00012650724],"genre_scores_gemma":[0.9912753,0.000021345597,0.0059464155,0.0010213545,0.00015740968,0.00011707151,0.0000064552723,0.000008964364,0.0014456587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999144,0.000052407155,0.00012132586,0.00025711974,0.00022718414,0.00019795509],"domain_scores_gemma":[0.99826926,0.0013197364,0.00006464627,0.00022856562,0.000069569454,0.000048219896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034339126,0.0001071697,0.000095795294,0.000031931828,0.00020115446,0.00006198763,0.00018901167,0.000029556233,0.000018055975],"category_scores_gemma":[0.000030483074,0.000052126376,0.000045030883,0.0001597216,0.00002389939,0.00013143194,0.000055048,0.00005194551,0.000014389214],"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.0010218789,0.000052860774,0.000058250032,0.000003827415,0.0000796794,0.000004025609,0.000090917914,0.8589889,0.00039968922,0.08167633,0.014066012,0.043557644],"study_design_scores_gemma":[0.003389653,0.0004034332,0.00056182605,0.0000869409,0.000012649654,0.000011188068,0.0000040957,0.97735953,0.00071911723,0.0027452528,0.014513765,0.00019252273],"about_ca_topic_score_codex":5.775701e-7,"about_ca_topic_score_gemma":0.0000057337274,"teacher_disagreement_score":0.8750166,"about_ca_system_score_codex":0.000036380367,"about_ca_system_score_gemma":0.000037221318,"threshold_uncertainty_score":0.21256518},"labels":[],"label_agreement":null},{"id":"W1872209150","doi":"10.1007/3-540-44968-x_29","title":"Tetrahedralization of Two Nested Convex Polyhedra","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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","funders":"","keywords":"Polyhedron; Tetrahedron; Combinatorics; Regular polygon; Integer points in convex polyhedra; Convex polytope; Mathematics; Computer science; Convex set; Linear programming; Algorithm; Convex optimization; Geometry","score_opus":0.014932106861893857,"score_gpt":0.2543513308328067,"score_spread":0.23941922397091284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872209150","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.00043512176,0.0004035051,0.9926799,0.00032511546,0.0011711556,0.00030149618,0.000005723109,0.00010639384,0.00457158],"genre_scores_gemma":[0.63553226,0.00008672292,0.36175305,0.0012707156,0.00060575356,0.000007296067,0.000045033146,0.00003590679,0.00066322467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695766,0.00004212668,0.000627253,0.0010202411,0.0009711025,0.00038161498],"domain_scores_gemma":[0.9980448,0.00031347523,0.000327916,0.00085115473,0.00033867994,0.00012398828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005139197,0.0003770168,0.00045675703,0.0011379371,0.0001554167,0.00024233204,0.0017310509,0.00020198249,0.00008527984],"category_scores_gemma":[0.00004772044,0.00037306544,0.00011607679,0.0011699111,0.00039169856,0.000654404,0.00037089968,0.0003456296,0.00003566549],"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.0000060539674,0.000033427248,0.000051722393,0.000026222784,0.0000094881825,0.000019346475,0.00037521526,0.2658192,0.0004915125,0.09518754,0.000015097984,0.6379652],"study_design_scores_gemma":[0.00042927198,0.0001621433,0.00027211572,0.00021480345,0.000009624873,0.00006519984,6.1228754e-8,0.7129387,0.0059949025,0.2779539,0.0014502765,0.0005090087],"about_ca_topic_score_codex":0.000026528549,"about_ca_topic_score_gemma":0.00003266544,"teacher_disagreement_score":0.6374562,"about_ca_system_score_codex":0.0001342526,"about_ca_system_score_gemma":0.0006276822,"threshold_uncertainty_score":0.99987215},"labels":[],"label_agreement":null},{"id":"W1879246310","doi":"10.46298/dmtcs.2132","title":"Packing Plane Perfect Matchings into a Point Set","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Plane (geometry); General position; Point (geometry); Set (abstract data type); Position (finance); Upper and lower bounds; Geometry; Mathematical analysis; Computer science","score_opus":0.01990092037437162,"score_gpt":0.2769995228043913,"score_spread":0.25709860243001964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1879246310","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.040594593,0.000035783665,0.9542821,0.001583863,0.0006140005,0.00022745665,0.0000023107982,0.0002494872,0.0024104107],"genre_scores_gemma":[0.566182,0.0000011224926,0.43331417,0.00035397534,0.000116388575,0.000007512265,0.0000048565475,0.000008787468,0.000011157558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967324,0.00011725698,0.0004694864,0.00076258037,0.0013479044,0.0005703392],"domain_scores_gemma":[0.99775314,0.0003618365,0.00015254151,0.0008439183,0.00036263594,0.0005259507],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0030046885,0.00028496952,0.00031001473,0.00030304608,0.00045504587,0.0010886529,0.0020556697,0.00006347983,0.000026721978],"category_scores_gemma":[0.0003258113,0.0002291915,0.00009890002,0.0013473018,0.0008781282,0.0011097953,0.0013014047,0.0002322115,0.00017780923],"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.000004619876,0.000054658365,0.00001095636,0.000026001178,0.000007148496,0.000015183635,0.007611844,0.0016690828,0.0006070537,0.9844322,0.00022690376,0.0053343177],"study_design_scores_gemma":[0.00017496725,0.0001399953,0.000017688923,0.000038863218,0.000005363649,0.00009361425,0.00008031552,0.5658732,0.0016543854,0.43161377,0.00009785261,0.00020999297],"about_ca_topic_score_codex":0.0000057218745,"about_ca_topic_score_gemma":9.865511e-7,"teacher_disagreement_score":0.5642041,"about_ca_system_score_codex":0.00010619949,"about_ca_system_score_gemma":0.00026840167,"threshold_uncertainty_score":0.9999483},"labels":[],"label_agreement":null},{"id":"W187936873","doi":"10.1007/978-3-642-40104-6_26","title":"Plane 3-trees: Embeddability and Approximation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Plane (geometry); Embedding; Approximation algorithm; Vertex (graph theory); Point (geometry); Discrete mathematics; Graph; Algorithm; Computer science; Geometry; Artificial intelligence","score_opus":0.014567519663892204,"score_gpt":0.23464193741514788,"score_spread":0.2200744177512557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W187936873","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.00083381106,0.00030765284,0.99438655,0.0006559962,0.00081947935,0.00041225908,0.000003379656,0.00011458065,0.0024662595],"genre_scores_gemma":[0.25714386,0.000048916714,0.74056965,0.00094818894,0.00052135973,0.000020277983,0.00002905555,0.000021172016,0.00069753046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973399,0.000033069264,0.00040539805,0.0011862353,0.00068989536,0.00034550996],"domain_scores_gemma":[0.9982865,0.00038854865,0.00019790122,0.0007474443,0.00023467228,0.00014491903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006720043,0.00034461732,0.00032384062,0.00057503534,0.00020978774,0.0005816069,0.0010552222,0.00021604281,0.000039059476],"category_scores_gemma":[0.0000879224,0.0003162715,0.000054636075,0.00041854187,0.00035709824,0.00084401964,0.00067994,0.00039415553,0.00006288153],"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.0000024101532,0.000021552392,0.000039294082,0.000037764006,0.0000058266473,0.000005553308,0.0004224113,0.03475545,0.00016650303,0.044847697,0.00003954219,0.919656],"study_design_scores_gemma":[0.00014841386,0.00009217917,0.0007146112,0.000081668826,0.0000036318618,0.000039278926,9.340789e-8,0.7072947,0.00065913633,0.2895958,0.0010080383,0.0003624126],"about_ca_topic_score_codex":0.000015722786,"about_ca_topic_score_gemma":0.000027526316,"teacher_disagreement_score":0.9192936,"about_ca_system_score_codex":0.00014718494,"about_ca_system_score_gemma":0.0002675351,"threshold_uncertainty_score":0.99992895},"labels":[],"label_agreement":null},{"id":"W1885355001","doi":"10.1007/s00454-016-9806-2","title":"Lines, Betweenness and Metric Spaces","year":2016,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Concordia University; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Metric space; Real line; Metric (unit); Upper and lower bounds; Intrinsic metric; Omega; Line (geometry); Injective metric space; Euclidean space; Discrete mathematics; Space (punctuation); Mathematical analysis; Geometry; Physics","score_opus":0.012752499103977768,"score_gpt":0.25322697153750856,"score_spread":0.2404744724335308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885355001","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.1810915,0.00064089074,0.81454974,0.0026594792,0.00033301255,0.00012294546,0.000022920163,0.00014991625,0.00042958642],"genre_scores_gemma":[0.9378421,0.0000435062,0.060988337,0.00031036875,0.0002407824,0.000014052106,0.000042386746,0.000012489501,0.0005060238],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99810666,0.00008382575,0.00033922732,0.0005873601,0.0005797533,0.00030315164],"domain_scores_gemma":[0.99828506,0.0008563732,0.00014298123,0.0002585121,0.00026808275,0.00018901617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037893807,0.00021819607,0.00022219594,0.00078145065,0.00022502143,0.00025412583,0.00043677317,0.000074636984,0.000045522742],"category_scores_gemma":[0.00019131064,0.00016018176,0.00007907736,0.0018868409,0.00008669732,0.00089494005,0.0002982133,0.00008522502,0.00009346255],"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.000026115154,0.00012045866,0.014853738,0.000053511347,0.00014722026,0.00002408395,0.00022362947,0.0226317,0.0010730145,0.44131422,0.0021227058,0.5174096],"study_design_scores_gemma":[0.0027948257,0.0003802579,0.6055161,0.00013253669,0.00005120225,0.00018139354,0.000058256668,0.1687232,0.0014479049,0.19190624,0.027411694,0.0013963957],"about_ca_topic_score_codex":0.000009520391,"about_ca_topic_score_gemma":0.0000017491323,"teacher_disagreement_score":0.7567506,"about_ca_system_score_codex":0.000046630033,"about_ca_system_score_gemma":0.00010193621,"threshold_uncertainty_score":0.6532023},"labels":[],"label_agreement":null},{"id":"W1885865461","doi":"10.1007/978-3-642-27848-8_15-2","title":"Applications of Geometric Spanner Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","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":"Spanner; Computer science; Distributed computing","score_opus":0.008183999606666405,"score_gpt":0.22081455285340273,"score_spread":0.21263055324673633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885865461","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.000001885888,0.0013805972,0.7226579,0.00006034449,0.00045800803,0.0002500248,0.000014776021,0.000040085553,0.27513635],"genre_scores_gemma":[0.0037368126,0.0044129365,0.2524793,0.00014886729,0.0027204794,0.00009371171,0.0003301668,0.00007971165,0.735998],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815696,0.000021185657,0.0006505901,0.00045909136,0.00052453356,0.0001876295],"domain_scores_gemma":[0.997885,0.00028316947,0.0006258301,0.0006925899,0.0004127545,0.00010068523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031616265,0.00025996874,0.0004615302,0.0007514055,0.00005839268,0.000021468975,0.0007345591,0.00025938716,0.00009450418],"category_scores_gemma":[0.000030300398,0.00026513523,0.00019779618,0.00049535884,0.00007842677,0.00011382405,0.00023847447,0.00024073811,0.000048980815],"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.0000018301299,0.00003020625,0.000006217483,0.000049660197,0.00005339943,0.00000131956,0.000035413548,0.007107002,0.000001631712,0.31430188,0.0038706523,0.67454076],"study_design_scores_gemma":[0.00023720089,0.00015270388,0.00014499905,0.00006246703,0.000054328502,0.000009398486,0.0000013201875,0.05382084,0.000051539126,0.035734676,0.9093306,0.0003998877],"about_ca_topic_score_codex":0.000008816495,"about_ca_topic_score_gemma":0.0000017989246,"teacher_disagreement_score":0.90546,"about_ca_system_score_codex":0.000029623829,"about_ca_system_score_gemma":0.00013262055,"threshold_uncertainty_score":0.9999801},"labels":[],"label_agreement":null},{"id":"W1891529127","doi":"10.1007/978-3-319-14974-5_9","title":"Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Delaunay triangulation; Combinatorics; Equilateral triangle; Mathematics; Dual graph; Pitteway triangulation; Discrete mathematics; Graph; Geometry; Line graph","score_opus":0.026570902929255697,"score_gpt":0.24799819547102006,"score_spread":0.22142729254176435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1891529127","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.00008279407,0.0029688403,0.9873502,0.0018817924,0.0030214698,0.00047523834,0.000006463464,0.00022683947,0.0039863647],"genre_scores_gemma":[0.40158054,0.0001092829,0.5913774,0.0026186493,0.0011846737,0.000047347123,0.000035822864,0.000079954065,0.0029663926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99518114,0.0000873578,0.0006675095,0.0016879791,0.0016707974,0.0007052124],"domain_scores_gemma":[0.99696815,0.00026686405,0.00027003736,0.0012406943,0.0009401141,0.0003141582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013204262,0.0006221205,0.00058804225,0.0010953087,0.00034410445,0.0006847602,0.0026856,0.00036658748,0.00006918818],"category_scores_gemma":[0.00016778309,0.00053096033,0.00017757012,0.0016605079,0.0015714247,0.00076515344,0.0008601844,0.0007372316,0.00006530291],"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.000020602869,0.000042902113,0.0000067372307,0.00002950399,0.00001743717,0.000056563862,0.00029594815,0.053228103,0.00011551102,0.75255024,0.000242634,0.19339383],"study_design_scores_gemma":[0.00042383838,0.00019668162,0.00002272851,0.00020055233,0.000011955428,0.00005353544,1.3559493e-7,0.2137337,0.0007022833,0.77601075,0.007949119,0.0006947197],"about_ca_topic_score_codex":0.000007071414,"about_ca_topic_score_gemma":0.000022823438,"teacher_disagreement_score":0.40149772,"about_ca_system_score_codex":0.00027058434,"about_ca_system_score_gemma":0.0009923361,"threshold_uncertainty_score":0.9997142},"labels":[],"label_agreement":null},{"id":"W1892594168","doi":"10.3968/j.sms.1923845220120501.1024","title":"The Crossing Numbers of Cartesian Products of Stars with 5-Vertex Graphs","year":2012,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Vertex (graph theory); Stars; Combinatorics; Cartesian coordinate system; Mathematics; Graph; Crossing number (knot theory); Star (game theory); Discrete mathematics; Physics; Astrophysics; Geometry; Geography; Mathematical analysis; Cartography","score_opus":0.059976193452309576,"score_gpt":0.3420398431377183,"score_spread":0.2820636496854087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892594168","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.95565647,0.0018027467,0.037131164,0.00087426696,0.00032728436,0.0002192863,5.6811683e-7,0.00001688146,0.00397132],"genre_scores_gemma":[0.9271649,0.000017339262,0.07275752,0.000012497565,0.00001136402,0.0000062657164,5.3946966e-8,0.0000011168873,0.00002894533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897134,0.000051696272,0.00023097238,0.000133647,0.000407987,0.00020432718],"domain_scores_gemma":[0.99903876,0.0005678402,0.000107469314,0.00014407524,0.00011634914,0.000025512203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001373396,0.00006348098,0.00014207487,0.000057465044,0.00029947437,0.000043815962,0.00034949637,0.0000106082425,0.0000012635168],"category_scores_gemma":[0.0003884148,0.000032945893,0.000019538093,0.0011258054,0.0014247724,0.00032223767,0.00011145202,0.000036796366,0.0000012456038],"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.0000050053454,0.00012819408,0.005523516,0.00013379814,0.000028823551,5.488269e-7,0.015999481,0.00061488844,0.0005083494,0.9653781,0.00013669845,0.011542611],"study_design_scores_gemma":[0.00066850637,0.0007694936,0.04054341,0.0007433176,0.000038085767,0.000050790706,0.020697396,0.028947283,0.026684208,0.87958455,0.00072532677,0.0005476281],"about_ca_topic_score_codex":0.000003937168,"about_ca_topic_score_gemma":0.0000127055555,"teacher_disagreement_score":0.08579353,"about_ca_system_score_codex":0.000012674583,"about_ca_system_score_gemma":0.00006769324,"threshold_uncertainty_score":0.5249633},"labels":[],"label_agreement":null},{"id":"W1893148898","doi":"10.1007/978-3-319-00200-2_11","title":"A Further Generalization of the Colourful Carathéodory Theorem","year":2013,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","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":"McMaster University","funders":"","keywords":"Simplex; Combinatorics; Convex hull; Mathematics; Regular polygon; Generalization; Hull; Geometry; Mathematical analysis","score_opus":0.04171700416157036,"score_gpt":0.2593697935183981,"score_spread":0.21765278935682775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1893148898","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010399249,0.0017187053,0.29831064,0.008790441,0.0012671857,0.0006738352,0.000028596816,0.0000969348,0.68900967],"genre_scores_gemma":[0.19208449,0.0021711518,0.07757693,0.0024158112,0.00037478752,0.00014532416,0.0003566112,0.000053138312,0.72482175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891067,0.00007575698,0.00040029694,0.00023196687,0.0002696022,0.00011173073],"domain_scores_gemma":[0.9962449,0.00011958869,0.0003589548,0.0028619296,0.0003720831,0.000042541233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016571561,0.00018757005,0.00020166225,0.00012483833,0.0002980828,0.00007511641,0.002809944,0.0002680207,0.0001277275],"category_scores_gemma":[0.00004732671,0.00015158347,0.00016431653,0.00016308247,0.0002493831,0.00030146574,0.0010892233,0.00036742122,0.000097293916],"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":[6.874708e-7,0.00002042551,0.0000032002206,0.000010125866,0.000035837274,2.0450615e-7,0.00041096573,0.0018833732,0.000044282835,0.98035824,0.008025529,0.009207119],"study_design_scores_gemma":[0.00015741888,0.000034055407,0.00011166958,0.000121353376,0.000042775748,0.000011281804,0.000007646732,0.02264662,0.00021422145,0.17348653,0.80288976,0.0002766778],"about_ca_topic_score_codex":0.00003774432,"about_ca_topic_score_gemma":0.00020958748,"teacher_disagreement_score":0.8068717,"about_ca_system_score_codex":0.00005047295,"about_ca_system_score_gemma":0.00030560317,"threshold_uncertainty_score":0.61813945},"labels":[],"label_agreement":null},{"id":"W1896735655","doi":"10.1090/s0002-9947-02-03052-0","title":"3-connected planar spaces uniquely embed in the sphere","year":2002,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":32,"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":"Mathematics; Planar; Pure mathematics; Combinatorics; Computer graphics (images)","score_opus":0.0198734766269672,"score_gpt":0.2439697353434263,"score_spread":0.2240962587164591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1896735655","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.17113978,0.000032307653,0.82066256,0.0068094367,0.000039951872,0.00018420478,0.0000032073851,0.000042832682,0.001085739],"genre_scores_gemma":[0.93287504,0.000020469824,0.06629869,0.0005676446,0.000011013373,0.000017125709,4.1824057e-7,0.00000418307,0.00020543442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907416,0.00014958216,0.00020984533,0.00014392575,0.00028092557,0.00014154421],"domain_scores_gemma":[0.99898314,0.00046057743,0.000115110415,0.00037593153,0.00003779528,0.00002745557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026374133,0.000089222674,0.0001567009,0.000020069529,0.00013895062,0.00004606988,0.00066696375,0.000023464107,0.00010502146],"category_scores_gemma":[0.000028491053,0.000052968804,0.00019135863,0.0011370352,0.00018682197,0.00012923649,0.000011223928,0.00016278031,0.000015526233],"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.000039132334,0.0049280906,0.0006224748,0.00043940067,0.00059067656,0.000008797343,0.1090566,0.06623002,0.013476702,0.6114102,0.022559464,0.17063843],"study_design_scores_gemma":[0.00057365734,0.00022957116,0.007434265,0.0000682078,0.000060383314,0.0000620498,0.004225601,0.8537323,0.0024220883,0.12954298,0.0013012128,0.00034772034],"about_ca_topic_score_codex":0.00002836147,"about_ca_topic_score_gemma":0.000011225764,"teacher_disagreement_score":0.7875022,"about_ca_system_score_codex":0.00002353879,"about_ca_system_score_gemma":0.000018052307,"threshold_uncertainty_score":0.21600051},"labels":[],"label_agreement":null},{"id":"W1902053630","doi":"10.1016/j.jda.2011.03.001","title":"Spanners of additively weighted point sets","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Delaunay triangulation; Voronoi diagram; Spanner; Bounded function; Geometric graph theory; Embedding; Dual graph; Graph; Discrete mathematics; Planar graph; Line graph; Geometry; Graph power; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.026122430943131235,"score_gpt":0.25249988215935676,"score_spread":0.22637745121622552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902053630","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.03251408,0.00038306497,0.9631753,0.0004972436,0.0007919101,0.00007313236,0.000016514605,0.000016382615,0.0025323518],"genre_scores_gemma":[0.6562905,0.00004109813,0.34332332,0.00008942444,0.00015245727,9.4742796e-7,0.0000038995845,0.0000058441547,0.000092546026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988177,0.000067714485,0.00046323767,0.00012361984,0.00039033813,0.00013739504],"domain_scores_gemma":[0.9987469,0.00006281694,0.0005079884,0.00014808784,0.00042292144,0.00011130747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039254586,0.000098150515,0.00020022166,0.00024216677,0.000042974545,0.000026077514,0.00040041353,0.00003960344,0.00007786779],"category_scores_gemma":[0.00004425363,0.000077700344,0.00017984363,0.00038652975,0.000038099868,0.0007001752,0.00007567522,0.00012596902,0.00000796193],"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.00036948652,0.0011934728,0.0009024793,0.000104228115,0.0013410354,0.0006221485,0.016245838,0.0019752625,0.010516242,0.12557834,0.030424163,0.8107273],"study_design_scores_gemma":[0.006902484,0.0069075893,0.11570359,0.0006117789,0.00031580104,0.0029216409,0.0012915134,0.3777013,0.24355672,0.23080337,0.01164118,0.0016430198],"about_ca_topic_score_codex":0.000009701832,"about_ca_topic_score_gemma":9.983593e-7,"teacher_disagreement_score":0.8090843,"about_ca_system_score_codex":0.000024489635,"about_ca_system_score_gemma":0.00012275609,"threshold_uncertainty_score":0.3168528},"labels":[],"label_agreement":null},{"id":"W1913337","doi":"10.1139/m91-040","title":"Parallel delaunay refinement mesh generation","year":2004,"lang":"en","type":"article","venue":"Canadian Journal of Microbiology","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Delaunay triangulation; Chew's second algorithm; Polygon mesh; Ruppert's algorithm; Bowyer–Watson algorithm; Computer science; Constrained Delaunay triangulation; Mesh generation; Algorithm; Distributed memory; T-vertices; Partition (number theory); Mathematical optimization; Mathematics; Parallel computing; Shared memory; Computer graphics (images); Finite element method; Combinatorics","score_opus":0.019165911084609633,"score_gpt":0.22146559199313376,"score_spread":0.20229968090852413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913337","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.16933393,0.0009773448,0.8218767,0.005718897,0.0017807647,0.00006356894,0.000005253432,0.000007018831,0.00023651685],"genre_scores_gemma":[0.91590065,0.00001978927,0.082121514,0.0014624258,0.00033135473,0.0000012126578,0.000020178099,0.000003756993,0.00013913059],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932903,0.000048033213,0.00027834703,0.000118587115,0.000039477192,0.00018655145],"domain_scores_gemma":[0.9993065,0.000012304274,0.0001423924,0.00011761993,0.00021459768,0.00020656521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026225488,0.00007356068,0.000111966845,0.0002676021,0.000116216936,0.000051350013,0.00032533292,0.000059556143,0.000040665233],"category_scores_gemma":[0.00003572395,0.00006760819,0.000056661098,0.00018467194,0.00003114117,0.00016365093,0.00001416503,0.00010225218,0.000028830782],"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.000012571746,0.000064131025,0.00031773222,0.000008516013,0.0001342692,0.00035337923,0.0014131363,0.15024884,0.46195072,0.2991758,0.049717583,0.036603305],"study_design_scores_gemma":[0.005706873,0.0019173089,0.0035720451,0.0000870923,0.000059652273,0.010832255,0.00008192353,0.0045675677,0.10460733,0.032120854,0.835427,0.0010201425],"about_ca_topic_score_codex":0.00032948822,"about_ca_topic_score_gemma":0.007503744,"teacher_disagreement_score":0.7857094,"about_ca_system_score_codex":0.00017177341,"about_ca_system_score_gemma":0.0013674729,"threshold_uncertainty_score":0.41872653},"labels":[],"label_agreement":null},{"id":"W1922419250","doi":"10.20382/jocg.v6i1a5","title":"On characterizing terrain visibility graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Terrain; Visibility graph; Visibility; Vertex (graph theory); Combinatorics; Graph; Mathematics; Monotone polygon; Geometry; Geography; Regular polygon; Cartography","score_opus":0.009044944806347294,"score_gpt":0.2073174917531666,"score_spread":0.1982725469468193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1922419250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5735469,0.000022780336,0.42347,0.001225833,0.00043548804,0.00010602707,0.0000029152907,0.00003346984,0.001156651],"genre_scores_gemma":[0.9655716,0.000008494614,0.033103857,0.0008085009,0.000116551535,3.3867767e-7,0.000009970092,0.0000073745623,0.00037330866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981607,0.00017220825,0.00043984153,0.00028335326,0.0007174524,0.0002264414],"domain_scores_gemma":[0.9976445,0.00053072633,0.0005038291,0.00021446573,0.0008899242,0.00021654426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043449595,0.00017850715,0.00026524242,0.0017322394,0.00019563286,0.00019785788,0.00076169684,0.00007621877,0.000143779],"category_scores_gemma":[0.00012088761,0.00017854746,0.00023359097,0.0018899667,0.00005212573,0.0016827798,0.00013350241,0.0002870907,0.00007776645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016268626,0.0009084968,0.002191999,0.000054830136,0.00035783037,0.00023489854,0.00074348244,0.34868762,0.005582803,0.5350142,0.009302574,0.09675859],"study_design_scores_gemma":[0.005627053,0.002718559,0.32497174,0.0002542044,0.00008921204,0.00065206405,0.00041086998,0.20633557,0.0029466532,0.41933823,0.03518532,0.0014705526],"about_ca_topic_score_codex":0.000009251748,"about_ca_topic_score_gemma":5.997997e-7,"teacher_disagreement_score":0.39202476,"about_ca_system_score_codex":0.00016929625,"about_ca_system_score_gemma":0.00021366966,"threshold_uncertainty_score":0.7280954},"labels":[],"label_agreement":null},{"id":"W1923735558","doi":"10.1002/nme.5132","title":"Inserting a surface into an existing unstructured mesh","year":2015,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"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 British Columbia","funders":"Intel Corporation","keywords":"T-vertices; Discretization; Boundary (topology); Surface (topology); Laplacian smoothing; Mesh generation; Triangle mesh; Polygon mesh; Computer science; Scale (ratio); Geometry; Algorithm; Tetrahedron; Mathematics; Finite element method; Mathematical analysis; Engineering; Physics; Structural engineering","score_opus":0.07860360021415741,"score_gpt":0.432526796635047,"score_spread":0.3539231964208896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923735558","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.021799041,0.00011848113,0.97288567,0.00051335956,0.004470358,0.000077597775,8.0304665e-7,0.00007636028,0.00005831901],"genre_scores_gemma":[0.18640555,0.0000028072554,0.8129911,0.00010667526,0.00045093504,0.0000057537704,0.000003962194,0.00001194872,0.000021291444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855685,0.0001380068,0.00044916724,0.0002440109,0.00039168107,0.00022025389],"domain_scores_gemma":[0.9987027,0.00040908862,0.00014088255,0.000121036435,0.0004160241,0.00021028561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017898754,0.0001357148,0.0001701342,0.0002601435,0.00006584769,0.0002885232,0.0007618766,0.000056306926,0.000002975259],"category_scores_gemma":[0.0018978182,0.00013527332,0.000073295014,0.0004045676,0.0000084236635,0.0008254765,0.00012579754,0.00026809872,0.0000014074125],"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.00002300788,0.00003188028,0.00017669848,0.000005738551,0.000027886608,0.00001966417,0.00096786587,0.8138459,0.010155319,0.015391188,0.000040022594,0.15931486],"study_design_scores_gemma":[0.00049473176,0.000077087134,0.00019441836,0.000029591953,0.0000025996535,0.00020925999,0.000047001697,0.96764416,0.005045815,0.020849444,0.005240748,0.00016511939],"about_ca_topic_score_codex":0.000015504527,"about_ca_topic_score_gemma":0.0000010611005,"teacher_disagreement_score":0.16460651,"about_ca_system_score_codex":0.00025929368,"about_ca_system_score_gemma":0.00010567877,"threshold_uncertainty_score":0.5516286},"labels":[],"label_agreement":null},{"id":"W1936812868","doi":"10.1109/robot.1992.220133","title":"A multi-resolution surface model for compact representation of range images","year":2003,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Triangulation; Discontinuity (linguistics); Surface (topology); Range (aeronautics); Representation (politics); Iterative refinement; Point (geometry); Computer science; Resolution (logic); Image (mathematics); Algorithm; Approximation error; Process (computing); Artificial intelligence; Mathematics; Computer vision; Mathematical optimization; Geometry; Mathematical analysis; Engineering","score_opus":0.0731624096281701,"score_gpt":0.32807531270813817,"score_spread":0.25491290307996806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1936812868","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.018916806,0.00007699543,0.97983366,0.00020087187,0.00009927229,0.00024042543,0.000005537489,0.000046028217,0.0005803803],"genre_scores_gemma":[0.54794025,0.0000033935673,0.45112434,0.00003282144,0.0000061853993,0.000003022615,0.000006318192,0.000002084722,0.0008815516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993303,0.00005072316,0.0001774276,0.00019271129,0.00014297417,0.0001058776],"domain_scores_gemma":[0.99940276,0.00011291851,0.00007642909,0.0001777792,0.00019630755,0.000033814722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024418114,0.00006365803,0.00009788098,0.00006127473,0.00006526352,0.000032929525,0.00012815134,0.000025671006,0.00000571106],"category_scores_gemma":[0.00009800358,0.000060356768,0.00005989276,0.00028458514,0.000014155325,0.0003694077,0.00001400012,0.00002344511,0.0000035664398],"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.0000075135804,0.00007385305,0.00028871713,0.000008529171,0.0000072332737,1.06483235e-7,0.00018521035,0.94365114,0.017189365,0.03629642,0.0015399808,0.00075190526],"study_design_scores_gemma":[0.00054265157,0.00002633395,0.0013975546,0.000002936513,0.0000036750084,0.000001783723,0.000009368376,0.9576365,0.03751045,0.0027113855,0.000090905814,0.00006647411],"about_ca_topic_score_codex":0.000019067602,"about_ca_topic_score_gemma":0.000007049045,"teacher_disagreement_score":0.52902347,"about_ca_system_score_codex":0.00001837549,"about_ca_system_score_gemma":0.000054273594,"threshold_uncertainty_score":0.24612775},"labels":[],"label_agreement":null},{"id":"W1949484841","doi":"10.5555/1496770.1496805","title":"On stars and Steiner stars: II","year":2009,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Star (game theory); Combinatorics; Mathematics; Stars; Upper and lower bounds; Steiner system; Point (geometry); Unit (ring theory); Plane (geometry); Matching (statistics); Line (geometry); Discrete mathematics; Geometry; Mathematical analysis; Physics; Astrophysics; Statistics","score_opus":0.010885995448199293,"score_gpt":0.23457460772432623,"score_spread":0.22368861227612694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949484841","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.49330208,0.00005922064,0.49310458,0.0038526887,0.00012426765,0.00006784279,5.780815e-7,0.00009358577,0.00939516],"genre_scores_gemma":[0.9636547,0.0000049575974,0.030934442,0.0027786617,0.000036723923,8.4463056e-7,0.0000022830761,0.0000011298912,0.0025862795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951875,0.000013292716,0.00007355574,0.00016899478,0.00013929816,0.00008608198],"domain_scores_gemma":[0.99974734,0.000032034586,0.00001568376,0.00012644258,0.000032357017,0.00004616184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008457596,0.0000535047,0.000046360594,0.000069846275,0.000092780174,0.00006419211,0.00010941149,0.000016549342,0.000024579718],"category_scores_gemma":[0.000011746042,0.00004406542,0.000012433703,0.00017111313,0.0000057870266,0.00022078321,0.000039431397,0.000034399778,0.000016200493],"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.000005792558,0.00006825891,0.0000116973915,0.0000011362022,0.000003504641,0.0000033550823,0.00021000282,0.003689698,0.0023960257,0.7677077,0.0102271205,0.21567568],"study_design_scores_gemma":[0.001923595,0.0043371385,0.05581417,0.0000329592,0.000008982012,0.00003935704,0.000038959042,0.59035075,0.017912494,0.25073838,0.077978715,0.00082452525],"about_ca_topic_score_codex":0.0000022948307,"about_ca_topic_score_gemma":0.0000021744625,"teacher_disagreement_score":0.58666104,"about_ca_system_score_codex":0.0000088903935,"about_ca_system_score_gemma":0.000017490593,"threshold_uncertainty_score":0.17969356},"labels":[],"label_agreement":null},{"id":"W195330644","doi":"10.1142/s0218195911003536","title":"ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Isosceles triangle; Computer science; Mathematics; Geometry","score_opus":0.02211372973481942,"score_gpt":0.26956698585340366,"score_spread":0.24745325611858424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195330644","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.0339237,0.0005882567,0.9607203,0.00063793734,0.00060195196,0.0003085539,0.000010804103,0.000070372684,0.0031381203],"genre_scores_gemma":[0.8655074,0.000050490766,0.13367684,0.00034006345,0.00028259892,0.000018424367,0.000027262344,0.000013712607,0.000083194485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756604,0.00009702623,0.00091176835,0.00034508595,0.0008874538,0.00019264479],"domain_scores_gemma":[0.9969676,0.0006419113,0.0007853141,0.00018328804,0.0012623322,0.00015953508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667634,0.00020279235,0.00024646072,0.0010692771,0.00021273867,0.00021639591,0.0009565401,0.00008272148,0.00007226484],"category_scores_gemma":[0.00009943786,0.0001978569,0.00014754168,0.00086342666,0.000092333095,0.0006578785,0.00017914567,0.00028210896,0.00003868643],"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.000043712585,0.00060063397,0.0005668987,0.00002094897,0.0003494025,0.000025201922,0.0009025798,0.111266986,0.00027054682,0.62840337,0.00043750543,0.25711223],"study_design_scores_gemma":[0.0023249579,0.0005094387,0.021103477,0.00017614495,0.000055887052,0.0014363722,0.000115507966,0.09301616,0.00088089553,0.8675257,0.012296169,0.00055928814],"about_ca_topic_score_codex":0.0000044217463,"about_ca_topic_score_gemma":5.148612e-7,"teacher_disagreement_score":0.8315837,"about_ca_system_score_codex":0.00009798277,"about_ca_system_score_gemma":0.00017125877,"threshold_uncertainty_score":0.8068371},"labels":[],"label_agreement":null},{"id":"W1957290555","doi":"10.7155/jgaa.00396","title":"The (3,1)-ordering for 4-connected planar triangulations","year":2016,"lang":"en","type":"preprint","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planar graph; Dual polyhedron; Planar; Rectangle; Combinatorics; Mathematical proof; Graph; Mathematics; First order; Computer science; Discrete mathematics; Geometry; Computer graphics (images)","score_opus":0.01957954025613224,"score_gpt":0.2770090639574265,"score_spread":0.2574295237012943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1957290555","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.00047539902,0.002230723,0.99097764,0.0052258917,0.0004548195,0.00049103226,0.000041493982,0.000022479615,0.000080490594],"genre_scores_gemma":[0.12838314,0.004357398,0.85862595,0.00044146946,0.0059096594,0.0013456375,0.00008831586,0.00005504038,0.0007933913],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892807,0.000035401226,0.0004902908,0.00020788121,0.00019720956,0.00014117007],"domain_scores_gemma":[0.99788076,0.0006328199,0.0005763407,0.00028741534,0.00053105736,0.000091631795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051121425,0.00012906155,0.00018693034,0.00021357236,0.0005541172,0.00027864517,0.00053338264,0.00008788109,9.649293e-7],"category_scores_gemma":[0.000055880213,0.00008306942,0.00017135032,0.00025750638,0.000048877624,0.00015199957,0.000114316324,0.0001867129,7.4676854e-7],"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.000015282632,0.000060073893,0.000021354766,0.000032393975,0.00017807413,9.1684063e-7,0.00012865651,0.0017736641,0.00041431407,0.40584767,0.0025731446,0.58895445],"study_design_scores_gemma":[0.0007360646,0.000094383955,0.0013640843,0.00006806171,0.000063711785,0.00006676762,0.000032238728,0.032492653,0.00025127674,0.8097368,0.15486735,0.00022660934],"about_ca_topic_score_codex":0.0000015526806,"about_ca_topic_score_gemma":0.0000030906929,"teacher_disagreement_score":0.58872783,"about_ca_system_score_codex":0.000022699156,"about_ca_system_score_gemma":0.00017041915,"threshold_uncertainty_score":0.42618772},"labels":[],"label_agreement":null},{"id":"W1958364868","doi":"10.11575/cdm.v10i1.62303","title":"Visibility-monotonic polygon deflation","year":2012,"lang":"en","type":"article","venue":"University of Calgary","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":"Polygon (computer graphics); Visibility; Visibility polygon; Star-shaped polygon; Rectilinear polygon; Mathematics; Combinatorics; Monotonic function; Point in polygon; Simple polygon; Polygon covering; Monotone polygon; Regular polygon; Computer science; Geometry; Mathematical analysis; Convex set; Physics; Optics","score_opus":0.010427041535440239,"score_gpt":0.2029178846959114,"score_spread":0.19249084316047116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1958364868","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.22758894,0.00011390659,0.76537603,0.00010474064,0.00012798524,0.000050290062,3.401685e-7,0.00003364914,0.006604133],"genre_scores_gemma":[0.95979995,0.00000705222,0.039691616,0.0000400897,0.000025111643,3.6258168e-8,0.0000054255916,0.0000011239496,0.00042958904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99959767,0.00003783567,0.0000551639,0.00009498945,0.000118778466,0.00009557032],"domain_scores_gemma":[0.99966514,0.0000397627,0.000042187887,0.00014726174,0.000049945338,0.000055674744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001561794,0.000038371683,0.000054077394,0.000081789236,0.00007391618,0.000006457903,0.00017298783,0.000030012634,0.00003117804],"category_scores_gemma":[0.000009675663,0.00004652203,0.000037789898,0.0001979125,0.000019856636,0.00054479414,0.00008396596,0.000037529888,0.000034090812],"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.00006027018,0.00041142292,0.01777014,0.000041513325,0.000047372734,0.0000055624632,0.0039844234,0.0017117187,0.014401296,0.56643116,0.0018570634,0.39327803],"study_design_scores_gemma":[0.0012455471,0.000196952,0.5261788,0.00002374697,0.000036915346,0.000020974976,0.00015471638,0.39033782,0.015307349,0.007308446,0.058733933,0.00045478868],"about_ca_topic_score_codex":0.000027883934,"about_ca_topic_score_gemma":0.0000044875524,"teacher_disagreement_score":0.73221105,"about_ca_system_score_codex":0.000031888976,"about_ca_system_score_gemma":0.00003776384,"threshold_uncertainty_score":0.18971132},"labels":[],"label_agreement":null},{"id":"W1958941591","doi":"10.1007/3-540-40996-3_38","title":"An Improved Algorithm for Subdivision Traversal without Extra Storage","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Subdivision; Tree traversal; Computer science; Pointer (user interface); Algorithm; Running time; Planar; Constant (computer programming); Graph traversal; Computer graphics (images); Artificial intelligence; Programming language","score_opus":0.014245404066485858,"score_gpt":0.258003894340457,"score_spread":0.24375849027397115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1958941591","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.00015362797,0.00020867198,0.9963831,0.00014427186,0.0017264883,0.0007293665,0.00002462416,0.00018146168,0.00044844078],"genre_scores_gemma":[0.06685667,0.00002884491,0.93069184,0.00082699844,0.0010733211,0.000023708337,0.0000667281,0.000041065763,0.0003908395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634683,0.000040456027,0.000497259,0.0017163283,0.00080169056,0.0005974247],"domain_scores_gemma":[0.99790245,0.00029630717,0.00022538567,0.0010312862,0.00029963526,0.0002449452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008801362,0.00051319896,0.00045701562,0.0008306137,0.00038280405,0.00072465034,0.0022490195,0.00031860836,0.000032499644],"category_scores_gemma":[0.000025043117,0.00049837644,0.00015755199,0.0005102323,0.0002697097,0.0010827341,0.0002517938,0.00046722736,0.000017474953],"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.000008918367,0.000040097573,0.0000018750718,0.000010248881,0.0000064287733,0.000011157216,0.00029919005,0.049290247,0.0003582232,0.00378577,0.000009845456,0.946178],"study_design_scores_gemma":[0.00044887944,0.0005061606,0.000060578204,0.000070611786,0.000008529627,0.00003840743,1.0118253e-7,0.92369115,0.0011760634,0.07134885,0.0020910983,0.0005595852],"about_ca_topic_score_codex":0.000013948794,"about_ca_topic_score_gemma":0.000030070805,"teacher_disagreement_score":0.9456184,"about_ca_system_score_codex":0.00022679387,"about_ca_system_score_gemma":0.0006400991,"threshold_uncertainty_score":0.9997468},"labels":[],"label_agreement":null},{"id":"W1962978359","doi":"10.1007/978-3-642-11805-0_30","title":"Drawing Planar 3-Trees with Given Face-Areas","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Planar graph; Outerplanar graph; Combinatorics; Vertex (graph theory); Planar; Planar straight-line graph; Computer science; Face (sociological concept); Graph; Book embedding; Graph drawing; Mathematics; 1-planar graph; Pathwidth; Line graph; Computer graphics (images)","score_opus":0.01253370707415435,"score_gpt":0.22935394521670596,"score_spread":0.2168202381425516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1962978359","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.00037006658,0.00021597471,0.993908,0.0010726579,0.0013180767,0.00031618026,0.000005641052,0.00017094331,0.0026224437],"genre_scores_gemma":[0.27858466,0.000018586741,0.71829563,0.0013112966,0.000845188,0.000011885987,0.000027242624,0.00003974621,0.00086576224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965505,0.00002568007,0.00037502518,0.0013959185,0.0011198494,0.00053301465],"domain_scores_gemma":[0.9980093,0.00038039533,0.00024432287,0.000888033,0.00028161472,0.0001962879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052930054,0.00049057987,0.0004087595,0.00088463596,0.0004055544,0.0006984221,0.0021482904,0.00029979373,0.000024843923],"category_scores_gemma":[0.00005067283,0.0004136351,0.00009014514,0.0007052909,0.00047312203,0.00074811396,0.0005225867,0.00093440944,0.000053816],"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.000016838878,0.000048189457,0.00018778337,0.000034644672,0.000030033347,0.0002107928,0.0011486342,0.16792507,0.0013900927,0.02769676,0.000043974207,0.80126715],"study_design_scores_gemma":[0.0008265868,0.0006584,0.0017422182,0.000646475,0.000026060814,0.0005223429,6.015448e-7,0.7480433,0.009497494,0.21830443,0.017721644,0.002010476],"about_ca_topic_score_codex":0.000018290988,"about_ca_topic_score_gemma":0.0003510532,"teacher_disagreement_score":0.7992567,"about_ca_system_score_codex":0.00014275886,"about_ca_system_score_gemma":0.0006695177,"threshold_uncertainty_score":0.99983156},"labels":[],"label_agreement":null},{"id":"W1963572107","doi":"10.1007/s00366-012-0294-6","title":"A log-barrier method for mesh quality improvement and untangling","year":2012,"lang":"en","type":"article","venue":"Engineering With Computers","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 Waterloo","funders":"","keywords":"Polygon mesh; Mathematical optimization; Solver; Metric (unit); Convergence (economics); Finite element method; Computer science; Algorithm; Mathematics; Quality (philosophy); Geometry; Engineering; Structural engineering","score_opus":0.013358670319560454,"score_gpt":0.26778467678849993,"score_spread":0.2544260064689395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963572107","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.02813975,0.0001378487,0.9704919,0.00019192586,0.0006998469,0.00019693439,0.0000020134264,0.0001290085,0.000010790835],"genre_scores_gemma":[0.35301483,0.0000011828153,0.64661026,0.00015812351,0.00016001702,0.000024684121,0.0000035250048,0.000006902195,0.000020506679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921274,0.000018856246,0.00015254841,0.0002179743,0.00014538776,0.0002524717],"domain_scores_gemma":[0.9993046,0.0003015788,0.000047188285,0.00016562875,0.000053986678,0.00012700382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052422367,0.00012329304,0.00012901465,0.00009704853,0.00007275504,0.00008245796,0.00014785976,0.000028204162,8.2667964e-7],"category_scores_gemma":[0.000029759842,0.00011091972,0.0000312016,0.00018496427,0.000006808259,0.00033906227,0.00007975574,0.00006040875,9.0526316e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032129643,0.000098211916,0.0011022415,0.0002363872,0.0001911426,0.0000026293817,0.0027098828,0.46805677,0.012535237,0.22367895,0.0005298838,0.29082656],"study_design_scores_gemma":[0.00048091312,0.00012840956,0.0025435076,0.000023042556,0.000008788684,0.000016405567,0.000011171823,0.9866384,0.0041353903,0.00014756835,0.0056369603,0.00022938866],"about_ca_topic_score_codex":0.0000060937286,"about_ca_topic_score_gemma":6.710041e-7,"teacher_disagreement_score":0.5185817,"about_ca_system_score_codex":0.00003573706,"about_ca_system_score_gemma":0.000020096239,"threshold_uncertainty_score":0.45231748},"labels":[],"label_agreement":null},{"id":"W1964127017","doi":"10.1142/s0129626406002447","title":"INHERENTLY PARALLEL GEOMETRIC COMPUTATIONS","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Speedup; Computation; Computer science; Polygon (computer graphics); Property (philosophy); Object (grammar); Set (abstract data type); Transformation (genetics); Algorithm; Convex polygon; Regular polygon; Mathematics; Theoretical computer science; Parallel computing; Geometry; Artificial intelligence","score_opus":0.017298382996036202,"score_gpt":0.24480158369137642,"score_spread":0.22750320069534022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964127017","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.026224717,0.00070449134,0.9652174,0.0055652154,0.00025371168,0.00016789688,0.0000013173134,0.00032117098,0.0015440816],"genre_scores_gemma":[0.7114842,0.000004553132,0.28573826,0.002091408,0.00025397926,0.00003647138,0.00004900448,0.000012448324,0.00032966965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825275,0.000062828505,0.0003738851,0.00048517325,0.00045055297,0.0003748099],"domain_scores_gemma":[0.9992648,0.000095276024,0.00017863944,0.00025078465,0.00012982149,0.00008067461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021151685,0.00020372265,0.00017658235,0.00050136197,0.00039647165,0.0005091556,0.00055340386,0.000053091175,0.000014279401],"category_scores_gemma":[0.000024230132,0.00020679683,0.000080971506,0.0017941392,0.000053705466,0.0008298026,0.000105732914,0.00015041717,0.00013958327],"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.000008420526,0.00019415682,0.0011649852,0.00005603431,0.000017625262,0.00002302721,0.00018253158,0.8872837,0.001799898,0.014785001,0.025038308,0.0694463],"study_design_scores_gemma":[0.0017177584,0.000076164506,0.05518393,0.00006123631,0.000026816695,0.00009205159,0.00001821728,0.89764404,0.00044719072,0.017812287,0.025947478,0.00097280875],"about_ca_topic_score_codex":0.000043722623,"about_ca_topic_score_gemma":0.0000062120994,"teacher_disagreement_score":0.68525946,"about_ca_system_score_codex":0.000065769105,"about_ca_system_score_gemma":0.00009049887,"threshold_uncertainty_score":0.843293},"labels":[],"label_agreement":null},{"id":"W1964492068","doi":"10.1007/s00453-012-9679-6","title":"Relative Convex Hulls in Semi-Dynamic Arrangements","year":2012,"lang":"en","type":"article","venue":"Algorithmica","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 Calgary","funders":"","keywords":"Combinatorics; Convex hull; Mathematics; Geodesic; Regular polygon; Simple (philosophy); Line (geometry); Geometry","score_opus":0.011384458024823796,"score_gpt":0.26014593654019524,"score_spread":0.24876147851537145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964492068","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.060841735,0.00038528428,0.93419117,0.0006478892,0.0007796914,0.00017020608,0.0000028582901,0.00006723394,0.0029139407],"genre_scores_gemma":[0.9451616,0.000009233854,0.05378431,0.0002599549,0.000103278326,0.000017239443,0.000015102609,0.0000051217203,0.0006441553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991263,0.000063424486,0.00016624489,0.00019163793,0.00019680508,0.0002555723],"domain_scores_gemma":[0.99955827,0.00008836334,0.000050667353,0.00018419877,0.00004241646,0.000076101096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002737137,0.0000888032,0.00009922404,0.0001456379,0.00005549217,0.000034671197,0.00024041222,0.000043529064,0.000031461077],"category_scores_gemma":[0.00002651746,0.00009033227,0.000031188516,0.00049013615,0.000017035458,0.00082256587,0.000098370576,0.000106751104,0.00022145803],"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.000020942063,0.0009977287,0.012130851,0.000037629856,0.00015646184,0.00003503354,0.009669448,0.0036409101,0.0074729347,0.21789436,0.004356216,0.7435875],"study_design_scores_gemma":[0.0016752691,0.00013708312,0.1368967,0.000052031122,0.000016752241,0.00004207699,0.00010400211,0.7944049,0.007039959,0.029267432,0.029641856,0.0007219074],"about_ca_topic_score_codex":0.000008412517,"about_ca_topic_score_gemma":0.0000028509435,"teacher_disagreement_score":0.88431984,"about_ca_system_score_codex":0.00006566018,"about_ca_system_score_gemma":0.00002986714,"threshold_uncertainty_score":0.3683643},"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":"W1966685253","doi":"10.1007/s00453-001-0114-7","title":"Fast Algorithms for Approximating Distances","year":2002,"lang":"en","type":"article","venue":"Algorithmica","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 British Columbia","funders":"","keywords":"Algorithm; Theory of computation; Computer science; Mathematics","score_opus":0.0375521915516917,"score_gpt":0.2576016958970011,"score_spread":0.2200495043453094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966685253","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.00046922136,0.00031317398,0.9953978,0.0010532673,0.0004692781,0.00020589653,0.000009515064,0.00014924226,0.0019326289],"genre_scores_gemma":[0.080184296,0.00000992686,0.9173981,0.00029661378,0.00047578238,0.00008905263,0.000018164154,0.000009575394,0.0015185181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900603,0.000021559325,0.0002188173,0.00032292915,0.0002029064,0.00022778087],"domain_scores_gemma":[0.99938655,0.00014440074,0.00008154131,0.00022153389,0.00010004347,0.000065922555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017138278,0.00010770705,0.00011684535,0.000076988246,0.00021833823,0.00015368348,0.0003825247,0.000036100108,0.000025617614],"category_scores_gemma":[0.00004811245,0.000103787635,0.00006656511,0.000354817,0.00002194235,0.00039710064,0.00006593213,0.000057604255,0.000048245496],"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":[8.7582777e-7,0.00005312768,0.0000046648674,0.000011434867,0.000012104311,0.0000016593128,0.00030698083,0.00072996825,0.00017405512,0.034172356,0.003021001,0.9615118],"study_design_scores_gemma":[0.00025098576,0.00005733412,0.00003808323,0.000006730034,0.0000035842645,0.000011642858,0.000018209952,0.962313,0.0018836297,0.008803683,0.026464183,0.00014892274],"about_ca_topic_score_codex":0.0000020250523,"about_ca_topic_score_gemma":7.982189e-7,"teacher_disagreement_score":0.961583,"about_ca_system_score_codex":0.000024290086,"about_ca_system_score_gemma":0.000011914988,"threshold_uncertainty_score":0.42323372},"labels":[],"label_agreement":null},{"id":"W1967421215","doi":"10.1016/j.jcta.2006.08.002","title":"On the maximum number of edges in quasi-planar graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Computational Geometry and Mesh Generation","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Planar; Simple (philosophy); Upper and lower bounds; Pairwise comparison; Book embedding; Multiple edges; Matching (statistics); Graph; Discrete mathematics; 1-planar graph; Line graph; Computer science","score_opus":0.007860445494885649,"score_gpt":0.2300400927524089,"score_spread":0.22217964725752323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967421215","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.94736814,0.00019153456,0.037947424,0.0020697718,0.005914647,0.00013404622,0.0000023832508,0.000015159337,0.006356908],"genre_scores_gemma":[0.99858433,0.000012747618,0.0009724721,0.00008179379,0.00024229052,0.000001563672,6.92696e-7,0.000004174241,0.000099959594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874,0.00028029786,0.00042244166,0.00008781514,0.00035470247,0.000114699],"domain_scores_gemma":[0.9986471,0.0006197542,0.00033811782,0.0001706107,0.00019662143,0.000027797676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012514507,0.000091095004,0.0001883042,0.0001435547,0.0000665702,0.00005562294,0.00045797214,0.000043687523,0.000032516222],"category_scores_gemma":[0.00014677807,0.00006201771,0.00009775014,0.00047977382,0.000060842696,0.0003605999,0.00003338783,0.00016513965,0.000004235519],"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.00019566793,0.000186172,0.00020529,0.0000044325907,0.000012840817,0.000011486907,0.00014730281,0.0004427074,0.0003453191,0.99587494,0.0010667015,0.001507162],"study_design_scores_gemma":[0.0005207344,0.0003256677,0.0011654997,0.00003022548,0.000004434642,0.000057068228,0.00005766544,0.00007645039,0.004515385,0.9910859,0.002094828,0.000066144254],"about_ca_topic_score_codex":0.00000761163,"about_ca_topic_score_gemma":0.0000023763207,"teacher_disagreement_score":0.05121618,"about_ca_system_score_codex":0.000025917245,"about_ca_system_score_gemma":0.00008702296,"threshold_uncertainty_score":0.25290087},"labels":[],"label_agreement":null},{"id":"W1967720527","doi":"10.1145/2601097.2601164","title":"Computing layouts with deformable templates","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"King Abdullah University of Science and Technology; National Science Foundation","keywords":"Template; Computer science; Domain (mathematical analysis); Set (abstract data type); Class (philosophy); Algorithm; Theoretical computer science; Computer graphics (images); Artificial intelligence; Mathematics; Programming language","score_opus":0.013849795698140899,"score_gpt":0.22835325814611457,"score_spread":0.21450346244797366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967720527","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.03562681,0.000013643658,0.96230096,0.0010995034,0.00020683135,0.00008233046,0.0000015986682,0.00019242722,0.00047588837],"genre_scores_gemma":[0.90692836,0.000009686712,0.092207275,0.0007302487,0.000033941127,0.0000055400246,0.0000049392816,0.00000709174,0.000072905954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911207,0.000045159184,0.00014823733,0.0002550394,0.0002511378,0.00018835305],"domain_scores_gemma":[0.99908835,0.00022131618,0.0000518213,0.00046213678,0.000103436985,0.00007293831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023161624,0.000118203265,0.0001004181,0.00023873331,0.00041148363,0.00011572898,0.0004284695,0.000047884212,0.0000064168735],"category_scores_gemma":[0.000011683693,0.00009978346,0.00005156562,0.0008629267,0.00003177075,0.0003651068,0.000008902835,0.00016926083,0.000027850714],"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.000036702404,0.00029825873,0.00065767736,0.000035434776,0.000096864525,0.0000048082993,0.00077058305,0.60682213,0.00030517526,0.1221659,0.00027508466,0.26853135],"study_design_scores_gemma":[0.0008534438,0.00059566816,0.003611661,0.000052307405,0.000024746854,0.00008473129,0.000027675604,0.95171267,0.006242533,0.025095258,0.011282598,0.00041671604],"about_ca_topic_score_codex":0.000013387745,"about_ca_topic_score_gemma":0.00003334121,"teacher_disagreement_score":0.87130153,"about_ca_system_score_codex":0.000013605924,"about_ca_system_score_gemma":0.000035673573,"threshold_uncertainty_score":0.4069051},"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":"W1968583908","doi":"10.1007/s10878-010-9310-1","title":"Convex partitions with 2-edge connected dual graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","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":"Combinatorics; Mathematics; Dual graph; Discrete mathematics; Line graph; Graph","score_opus":0.00663102312623348,"score_gpt":0.2194565676998637,"score_spread":0.21282554457363023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968583908","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.053321313,0.00002188534,0.93880564,0.0010906382,0.0060809106,0.00011131816,0.0000014202056,0.00004289437,0.0005239766],"genre_scores_gemma":[0.82336223,0.000008935559,0.17606205,0.0001069462,0.00041676188,0.0000030594015,0.000010458159,0.0000071990203,0.000022360873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989029,0.00007000932,0.00036924813,0.00012849923,0.0004024237,0.0001269145],"domain_scores_gemma":[0.99803156,0.00013210908,0.0004010375,0.00016565251,0.0011135747,0.0001560627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003617865,0.000103324346,0.00017108793,0.00025189258,0.00015153732,0.00017869013,0.00024342899,0.000074924625,0.000048667644],"category_scores_gemma":[0.00023994852,0.00008653193,0.0000618243,0.00072799705,0.000041741365,0.00094148185,0.000031204854,0.0002565794,0.000004107669],"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.00007296516,0.00024862864,0.0002268164,0.0000052263117,0.0000496579,0.00002170464,0.00019883446,0.37118086,0.0020797136,0.6228915,0.0021103444,0.00091378303],"study_design_scores_gemma":[0.010526965,0.0028049287,0.0027210938,0.00007930358,0.00014220196,0.0011431628,0.00005689887,0.71138704,0.0152366385,0.24302416,0.012067478,0.00081011775],"about_ca_topic_score_codex":0.0000013788999,"about_ca_topic_score_gemma":8.8449553e-7,"teacher_disagreement_score":0.7700409,"about_ca_system_score_codex":0.00001933293,"about_ca_system_score_gemma":0.00032280377,"threshold_uncertainty_score":0.35286698},"labels":[],"label_agreement":null},{"id":"W1969775338","doi":"10.1145/2632951.2632966","title":"Surface skeleton extraction and its application for data storage in 3D sensor networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Hubei University","keywords":"Computer science; Skeleton (computer programming); Manifold (fluid mechanics); Minimum bounding box; Hash table; Set (abstract data type); Hash function; Wireless sensor network; Bounding overwatch; Focus (optics); Key (lock); Nonlinear dimensionality reduction; Theoretical computer science; Artificial intelligence; Computer network; Engineering","score_opus":0.030257101036285015,"score_gpt":0.29415893756610173,"score_spread":0.2639018365298167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969775338","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.056052394,0.000083587154,0.9427365,0.00048975885,0.00014561052,0.00027473754,0.0000015902169,0.00004783289,0.00016799662],"genre_scores_gemma":[0.87459,0.00001703592,0.12473485,0.00015353558,0.00012447688,0.000011889769,0.0000887037,0.000003783189,0.00027575393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929434,0.000042062336,0.00013159402,0.0003366701,0.00008927362,0.000106067],"domain_scores_gemma":[0.99936503,0.00019964266,0.00005143155,0.00029453752,0.000054240027,0.00003508937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054946373,0.000062042214,0.00006815432,0.000047974365,0.000065372165,0.000059240738,0.00021867045,0.00004262169,0.0000020838806],"category_scores_gemma":[0.000044352593,0.00006218219,0.000007829412,0.00021185626,0.000004446862,0.000553722,0.00009641575,0.000048960377,0.0000051580387],"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.000012948058,0.000060933024,0.00029972746,0.000022308343,0.000004809755,2.910372e-7,0.00005820084,0.5795166,0.007756528,0.046968058,0.0007668065,0.3645328],"study_design_scores_gemma":[0.00020253942,0.000024693809,0.0023856831,0.000002645484,0.0000017458353,0.0000032674475,0.0000024647281,0.9836598,0.00051874976,0.0004218008,0.012700669,0.00007592166],"about_ca_topic_score_codex":0.000016580701,"about_ca_topic_score_gemma":0.00004606184,"teacher_disagreement_score":0.8185376,"about_ca_system_score_codex":0.000015875436,"about_ca_system_score_gemma":0.000015583826,"threshold_uncertainty_score":0.2535716},"labels":[],"label_agreement":null},{"id":"W1969798688","doi":"10.1007/s11083-006-9028-y","title":"Upward Three-Dimensional Grid Drawings of Graphs","year":2006,"lang":"en","type":"article","venue":"Order","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; Mathematics; Planar graph; Grid; Graph drawing; Upper and lower bounds; Vertex (graph theory); Bounded function; Degeneracy (biology); Directed acyclic graph; Graph; Discrete mathematics; Geometry","score_opus":0.007018406646354243,"score_gpt":0.2113288240303752,"score_spread":0.20431041738402095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969798688","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.35136566,0.00018683849,0.644554,0.00081660016,0.00060706015,0.00007510189,0.000002487735,0.00006455653,0.002327641],"genre_scores_gemma":[0.9183439,7.60372e-7,0.08083485,0.00020463238,0.0001208707,0.0000037659886,0.00001717634,0.0000038518915,0.00047020637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936247,0.000013155021,0.00014042927,0.00016064913,0.0002233322,0.000099979676],"domain_scores_gemma":[0.999582,0.00004005849,0.00005128865,0.0001482621,0.00015658981,0.000021785154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010529216,0.00006036638,0.00007278741,0.00009411344,0.000059931823,0.000025956831,0.00016963715,0.000026610796,0.000046740715],"category_scores_gemma":[0.0000107877695,0.00005588121,0.000038567618,0.00051251997,0.000022836964,0.0001804797,0.000063194086,0.00003883699,0.000037472746],"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.000014783791,0.00030688004,0.007245297,0.00002444891,0.000031431657,0.000011122142,0.00010831054,0.10722631,0.013904282,0.7863723,0.041882683,0.04287214],"study_design_scores_gemma":[0.0013547535,0.00021200062,0.19103515,0.000039815244,0.000019029678,0.00005401565,0.0000040062428,0.3237518,0.031740624,0.39675152,0.054430533,0.00060674956],"about_ca_topic_score_codex":0.000063155254,"about_ca_topic_score_gemma":0.000024606632,"teacher_disagreement_score":0.5669782,"about_ca_system_score_codex":0.000006534787,"about_ca_system_score_gemma":0.00005296208,"threshold_uncertainty_score":0.22787696},"labels":[],"label_agreement":null},{"id":"W1969798922","doi":"10.1007/978-3-540-69903-3_35","title":"Computing the Greedy Spanner in Near-Quadratic Time","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Spanner; Greedy algorithm; Computer science; Dimension (graph theory); Logarithm; Quadratic equation; Time complexity; Euclidean space; Upper and lower bounds; Metric (unit); Combinatorics; Algorithm; Mathematical optimization; Mathematics","score_opus":0.015365779787296101,"score_gpt":0.23340404781381055,"score_spread":0.21803826802651444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969798922","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.001197303,0.0006130483,0.99220574,0.0017452141,0.0012814503,0.00045164174,0.0000019000045,0.000111017805,0.002392706],"genre_scores_gemma":[0.52292734,0.00008106916,0.46877337,0.0048637507,0.001452998,0.000013586229,0.000025161178,0.00006573001,0.0017970211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619776,0.000088224544,0.0006622843,0.0012919588,0.0011195691,0.0006401767],"domain_scores_gemma":[0.9974091,0.0008825856,0.00028759366,0.0010738919,0.00022536905,0.00012147699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011746583,0.00048331975,0.0004746627,0.000706838,0.0005744818,0.00068255776,0.0028625452,0.0002337312,0.00002676332],"category_scores_gemma":[0.0001165985,0.00038111323,0.0001306769,0.0014025852,0.00069424335,0.0005563475,0.001163108,0.000906336,0.00019165596],"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.0000035843673,0.00003142455,0.0000484508,0.000013916597,0.000007431908,0.000113361995,0.0016175001,0.5834046,0.00006533977,0.003887232,0.0001378862,0.41066927],"study_design_scores_gemma":[0.00022798633,0.00008849673,0.00076100655,0.00017445907,0.0000035745663,0.0001849764,1.1978197e-7,0.970917,0.00016727841,0.02461321,0.0023997938,0.00046213478],"about_ca_topic_score_codex":0.000034575132,"about_ca_topic_score_gemma":0.0000763054,"teacher_disagreement_score":0.5234324,"about_ca_system_score_codex":0.0002714762,"about_ca_system_score_gemma":0.0008542317,"threshold_uncertainty_score":0.9998641},"labels":[],"label_agreement":null},{"id":"W1970006986","doi":"10.2320/jinstmet.71.181","title":"Measurement of 3-D Strain Distribution by means of High-Resolution X-ray CT Image and Tracking of Microstructural Features","year":2007,"lang":"en","type":"article","venue":"Journal of the Japan Institute of Metals and Materials","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tracking (education); Materials science; Synchrotron radiation; Deformation (meteorology); Tomography; Ultimate tensile strength; Resolution (logic); Synchrotron; Optics; Composite material; Mineralogy; Physics; Geology; Artificial intelligence; Computer science","score_opus":0.01300374400474567,"score_gpt":0.23619689232815436,"score_spread":0.2231931483234087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970006986","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.9005013,0.0006757942,0.0978422,0.00012532136,0.00064038043,0.00009110246,0.00011727155,0.0000015532371,0.0000050461113],"genre_scores_gemma":[0.9878754,0.000065185384,0.011989838,0.000007853395,0.00004856057,2.2407845e-7,0.0000059549725,0.0000022008164,0.0000048026213],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99864376,0.000087633016,0.0006974243,0.00008490046,0.0003991285,0.00008713079],"domain_scores_gemma":[0.99836177,0.000028112156,0.0010781828,0.000107263186,0.00039059523,0.00003410063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020159394,0.0000872085,0.0003365089,0.00007790257,0.0000508823,0.000030174857,0.00019860946,0.000030014986,0.0000024149615],"category_scores_gemma":[0.00013835853,0.000058261987,0.000069655434,0.00012780575,0.00013930314,0.00039771968,0.00006405986,0.00004541244,1.9563306e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060815735,0.00003406691,0.000020051013,0.00010892858,0.000060641796,4.8665055e-7,0.00012997497,0.0005210702,0.99077713,0.0037565334,0.00007548301,0.004454805],"study_design_scores_gemma":[0.00047884186,0.00012628153,0.050381843,0.00014841954,0.00006145822,0.000060278828,0.000029201028,0.000039286206,0.947452,0.001058793,0.00011246472,0.000051126448],"about_ca_topic_score_codex":0.0000616258,"about_ca_topic_score_gemma":0.000010497231,"teacher_disagreement_score":0.087374054,"about_ca_system_score_codex":0.000020730065,"about_ca_system_score_gemma":0.00005377643,"threshold_uncertainty_score":0.23758548},"labels":[],"label_agreement":null},{"id":"W1971146381","doi":"10.1016/j.cag.2009.03.020","title":"Quality encoding for tetrahedral mesh optimization","year":2009,"lang":"en","type":"article","venue":"Computers & Graphics","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":"Simon Fraser University","funders":"National High-tech Research and Development Program; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Tetrahedron; Vertex (graph theory); Boundary (topology); Algorithm; Energy minimization; Computer science; Topology (electrical circuits); Position (finance); Mesh generation; Mathematics; Finite element method; Geometry; Mathematical analysis; Combinatorics; Physics; Theoretical computer science; Engineering; Structural engineering; Graph","score_opus":0.03779083587851236,"score_gpt":0.30398906453139746,"score_spread":0.2661982286528851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971146381","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.003304229,0.00010037399,0.9929316,0.0018315351,0.0009385203,0.0002605196,0.0000031280447,0.0002419717,0.0003881031],"genre_scores_gemma":[0.5410154,0.000022063183,0.45679694,0.0018618645,0.00021525144,0.00000839685,0.00004417658,0.0000051620036,0.000030767067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866515,0.00007136531,0.0003240609,0.0004078668,0.0002786126,0.0002529209],"domain_scores_gemma":[0.9989771,0.00024428903,0.00012743364,0.000320695,0.00023014113,0.0001003352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050326495,0.00015153931,0.00017076076,0.0002597779,0.00027856513,0.000238371,0.0005279994,0.000075468684,0.0000020984712],"category_scores_gemma":[0.00006169206,0.00016121242,0.0001407875,0.00082555466,0.000024966474,0.0005605881,0.000057932433,0.000097346485,0.0000024051062],"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.000010831304,0.000088100925,0.0000915138,0.000012798112,0.0000156134,0.000001768114,0.00026538852,0.223758,0.0003411568,0.7081693,0.0022719647,0.0649736],"study_design_scores_gemma":[0.00046692617,0.00017264359,0.0027924324,0.000013065039,0.0000054172956,0.00000823415,0.0000049362575,0.9643176,0.00044479172,0.028959252,0.002573756,0.00024092745],"about_ca_topic_score_codex":0.0000021303072,"about_ca_topic_score_gemma":0.0000012187531,"teacher_disagreement_score":0.74055964,"about_ca_system_score_codex":0.00003199216,"about_ca_system_score_gemma":0.00006310879,"threshold_uncertainty_score":0.65740514},"labels":[],"label_agreement":null},{"id":"W197212957","doi":"","title":"Computing the Widest Empty Boomerang.","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Set (abstract data type); Plane (geometry); Chain (unit); Facility location problem; Computer science; Computational geometry; Mathematics; Algorithm; Geometry; Physics","score_opus":0.011665198736003003,"score_gpt":0.2442500236763083,"score_spread":0.2325848249403053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W197212957","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.03160082,0.00011835739,0.9474453,0.009796678,0.00015193672,0.000067092216,1.6195565e-7,0.00012919118,0.010690498],"genre_scores_gemma":[0.9103257,0.0000025557197,0.084767014,0.0032558911,0.00032319917,0.0000015419957,0.0000015180059,0.0000021511944,0.0013203954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993962,0.00003411237,0.00012094524,0.00015660262,0.00016770759,0.000124435],"domain_scores_gemma":[0.9995453,0.00012543504,0.000029276523,0.00021570113,0.000049930295,0.00003439749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002657187,0.000058282872,0.000047344,0.000040023733,0.00021731725,0.0001435666,0.00038588909,0.000015773438,0.000040106224],"category_scores_gemma":[0.000017783681,0.00003825385,0.000032867545,0.00031154728,0.000015385922,0.00027580382,0.00011290412,0.000060633894,0.00021326504],"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.0000010294443,0.000034783694,0.00018975309,0.0000016182771,0.000008402401,0.0000010910045,0.00061893207,0.12380975,0.00022009666,0.21405107,0.013197697,0.6478658],"study_design_scores_gemma":[0.00010358013,0.0000127385165,0.0036600626,0.0000020250025,0.0000012775768,0.000017373919,0.00001136788,0.8844636,0.0010330351,0.0012029979,0.109416954,0.00007495376],"about_ca_topic_score_codex":0.000007702893,"about_ca_topic_score_gemma":0.000009627066,"teacher_disagreement_score":0.87872493,"about_ca_system_score_codex":0.00001599653,"about_ca_system_score_gemma":0.000029943902,"threshold_uncertainty_score":0.2741162},"labels":[],"label_agreement":null},{"id":"W1972171563","doi":"10.1016/j.jda.2012.03.004","title":"On bounded degree plane strong geometric spanners","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"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":"Delaunay triangulation; Spanner; Combinatorics; Degree (music); Pitteway triangulation; Point set triangulation; Mathematics; Plane (geometry); Minimum-weight triangulation; Constrained Delaunay triangulation; Bounded function; Bowyer–Watson algorithm; Geometry; Computer science; Mathematical analysis; Physics","score_opus":0.03682748905994071,"score_gpt":0.28260200490666726,"score_spread":0.24577451584672655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972171563","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.061231494,0.0010413907,0.9332241,0.00076996535,0.0020337286,0.00007168036,0.000005063052,0.000023812012,0.0015988073],"genre_scores_gemma":[0.9162445,0.000033993547,0.082320444,0.00019209698,0.0009467897,0.0000012708306,0.0000060494904,0.000008338894,0.00024653826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841434,0.0000722256,0.0003866242,0.00013134046,0.0006772455,0.00031824614],"domain_scores_gemma":[0.99884224,0.0002092729,0.00034366522,0.00019611178,0.00016068568,0.00024804423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007078011,0.00013603667,0.00019861177,0.000604871,0.00011423823,0.00014183274,0.0004345214,0.00005274223,0.000032137195],"category_scores_gemma":[0.00013135775,0.00010786752,0.0001297164,0.00085889397,0.000022206419,0.0010738254,0.000071410395,0.00023636413,0.00004265042],"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.00016274181,0.0008667367,0.0022354152,0.000041090087,0.00048453847,0.00014083346,0.0012465065,0.029447118,0.0010659939,0.1756121,0.026620477,0.76207644],"study_design_scores_gemma":[0.016292043,0.012525674,0.3386947,0.00060782256,0.000501638,0.0061319266,0.0009551854,0.3743638,0.03880829,0.086934835,0.11976356,0.0044205305],"about_ca_topic_score_codex":0.000004563022,"about_ca_topic_score_gemma":7.159062e-7,"teacher_disagreement_score":0.855013,"about_ca_system_score_codex":0.000088275636,"about_ca_system_score_gemma":0.00008839618,"threshold_uncertainty_score":0.43987098},"labels":[],"label_agreement":null},{"id":"W1972308905","doi":"10.1016/s0304-3975(02)00044-0","title":"Optimal three-dimensional orthogonal graph drawing in the general position model","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"Carleton University","funders":"","keywords":"Combinatorics; Grid; Graph drawing; Mathematics; Lattice graph; Position (finance); General position; Enhanced Data Rates for GSM Evolution; Graph; Upper and lower bounds; Geometry; Computer science; Line graph; Artificial intelligence; Mathematical analysis; Voltage graph","score_opus":0.013384602360184827,"score_gpt":0.2546917651174501,"score_spread":0.2413071627572653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972308905","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.3053157,0.000022121014,0.69270086,0.0008595813,0.0002494218,0.00011917567,7.575759e-7,0.00004078328,0.0006915694],"genre_scores_gemma":[0.6761947,6.012205e-7,0.32261333,0.0011111575,0.000063157546,0.000008150882,0.0000022356235,0.0000032530538,0.0000034165012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739707,0.00020581072,0.00028961946,0.0006233226,0.001005918,0.0004782805],"domain_scores_gemma":[0.998979,0.00022073828,0.000053210984,0.00045399924,0.00016589859,0.00012718517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024778133,0.00017094197,0.00013610083,0.0002862793,0.0005561354,0.00043191793,0.0013184685,0.000047402333,0.000016123038],"category_scores_gemma":[0.00005720771,0.00012498426,0.00007544685,0.0018136092,0.00076117425,0.00077643926,0.0002559422,0.00022638516,0.000020062334],"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.0000032019757,0.000048633137,0.000028607688,9.574399e-7,0.0000011197485,0.0000080188065,0.00013758319,0.3461746,0.0004048226,0.65117073,0.000019921023,0.002001782],"study_design_scores_gemma":[0.0001651365,0.00006617828,0.0012486668,0.0000072165567,0.0000019950273,0.00010219986,0.0000015602523,0.7387579,0.0007401282,0.25876334,0.000013626966,0.000132006],"about_ca_topic_score_codex":0.0000017619649,"about_ca_topic_score_gemma":0.000002291473,"teacher_disagreement_score":0.3925833,"about_ca_system_score_codex":0.000050535687,"about_ca_system_score_gemma":0.000275596,"threshold_uncertainty_score":0.50967103},"labels":[],"label_agreement":null},{"id":"W1972657290","doi":"10.1145/1824801.1864430","title":"An Interoperable, Data-Structure-Neutral Component for Mesh Query and Manipulation","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"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 British Columbia","funders":"","keywords":"Computer science; Component (thermodynamics); Interface (matter); Data structure; Interoperability; Application programming interface; Implementation; Software framework; Distributed computing; Common Component Architecture; Component-based software engineering; Overhead (engineering); Software; Data model (GIS); Code (set theory); Reuse; Adaptive mesh refinement; Programming language; Parallel computing; Operating system; Software development; Computational science","score_opus":0.040222518439858024,"score_gpt":0.30143008476094035,"score_spread":0.26120756632108233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972657290","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.091226265,0.0000061432884,0.9073104,0.0006391772,0.00031194312,0.00027980545,0.000063993335,0.00015739384,0.0000048546826],"genre_scores_gemma":[0.435644,0.0000014417166,0.5640174,0.00014369925,0.000048066373,0.000019600684,0.000081540995,0.000007942791,0.000036309586],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989719,0.000035402092,0.00023818314,0.00042165833,0.00016679976,0.00016609856],"domain_scores_gemma":[0.9984242,0.00036516692,0.00004559779,0.00095660234,0.0000832752,0.00012517085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021286368,0.0001403083,0.00014926752,0.000098972596,0.0002648204,0.00019705754,0.000705759,0.00008680644,0.000063025116],"category_scores_gemma":[0.00010150699,0.0001221328,0.000038235266,0.00014487382,0.000039900224,0.00075515057,0.000027636273,0.00020805433,0.000011059696],"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.00006895882,0.0007733286,0.000056700686,0.00023547006,0.00008568418,0.0000037104323,0.0007970393,0.013934077,0.014093266,0.07321881,0.00014323131,0.8965897],"study_design_scores_gemma":[0.00063228566,0.0002641669,0.0012077253,0.000032705524,0.00004466486,0.000091004506,0.000024257371,0.39435318,0.0071828295,0.5946167,0.0012060466,0.00034443283],"about_ca_topic_score_codex":0.000004152618,"about_ca_topic_score_gemma":0.000040177943,"teacher_disagreement_score":0.8962453,"about_ca_system_score_codex":0.000013151423,"about_ca_system_score_gemma":0.000027967792,"threshold_uncertainty_score":0.49804312},"labels":[],"label_agreement":null},{"id":"W1972987151","doi":"10.1145/1268517.1268525","title":"Surface distance maps","year":2007,"lang":"en","type":"article","venue":"Proceedings","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office","keywords":"Distance transform; Surface (topology); Affine transformation; Signed distance function; Computer science; Polygon mesh; Texture mapping; Computation; Manifold (fluid mechanics); Algorithm; Transformation (genetics); Piecewise; Mathematics; Computer vision; Computer graphics (images); Geometry; Image (mathematics)","score_opus":0.013414084782015917,"score_gpt":0.24672379328000824,"score_spread":0.23330970849799232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972987151","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.089023195,0.00011790501,0.8832895,0.00075729005,0.00024663412,0.000064229964,4.681997e-7,0.00015593537,0.026344832],"genre_scores_gemma":[0.8973574,0.000003904262,0.10111758,0.00026817265,0.000105467305,0.0000010802374,0.0000015722526,0.0000032626165,0.0011415726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993118,0.0000012747951,0.000115815965,0.00020197417,0.00019800555,0.00017110449],"domain_scores_gemma":[0.99966705,0.000026208174,0.000043705182,0.000059591745,0.0001411236,0.00006230584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003834098,0.00006181395,0.000052232048,0.000045841814,0.00008807386,0.00010992236,0.00026673148,0.000024336432,0.00000501329],"category_scores_gemma":[0.00003072642,0.00006104739,0.00002112802,0.000499229,0.0000122162555,0.00046242916,0.00006484147,0.000055546054,0.000054967742],"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.000006728717,0.00003194778,0.0022480895,0.000016117207,0.0000044011817,0.0000029793287,0.00056126795,0.00013953702,0.008969562,0.94533044,0.0067209876,0.035967935],"study_design_scores_gemma":[0.00077619095,0.00017058325,0.033590637,0.000046276382,0.000008129567,0.00009105503,0.00014514897,0.076113865,0.14877763,0.15009381,0.5894016,0.0007850671],"about_ca_topic_score_codex":0.000001623636,"about_ca_topic_score_gemma":0.0000012868366,"teacher_disagreement_score":0.8083342,"about_ca_system_score_codex":0.000026864527,"about_ca_system_score_gemma":0.000020544629,"threshold_uncertainty_score":0.24894403},"labels":[],"label_agreement":null},{"id":"W1973037646","doi":"10.1016/j.tcs.2003.05.004","title":"Space-efficient planar convex hull algorithms","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":52,"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":"Convex hull; Algorithm; Orthogonal convex hull; Planar; Output-sensitive algorithm; Convex set; Convex polytope; Hull; Space (punctuation); Point (geometry); Regular polygon; Convex combination; Mathematics; Set (abstract data type); Computer science; Combinatorics; Convex body; Convex optimization; Geometry; Engineering","score_opus":0.009997889783895464,"score_gpt":0.24463024862667818,"score_spread":0.23463235884278272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973037646","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.037257053,0.000040618434,0.9557079,0.0031434891,0.0011750945,0.00017454095,0.0000017264575,0.0002499517,0.0022495945],"genre_scores_gemma":[0.6996235,0.0000020235168,0.2994786,0.0006869979,0.00018694828,0.0000048071406,0.0000016878106,0.000004867716,0.000010549036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727106,0.000058985846,0.00027682705,0.0008122354,0.0010003726,0.0005805169],"domain_scores_gemma":[0.99853605,0.00013677777,0.000069381436,0.00064621586,0.00025944263,0.0003521554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011128003,0.00019875292,0.0001906844,0.00029937123,0.00054305926,0.0004893106,0.0017923838,0.000052932355,0.000027190463],"category_scores_gemma":[0.00006392615,0.00017178619,0.00007139888,0.00183911,0.0013476454,0.00044079134,0.00050715427,0.00018271277,0.00027422182],"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.000003277324,0.00008604465,0.000003308475,0.0000028827417,0.0000028572063,0.0000184259,0.0003211837,0.04701877,0.0010403747,0.9390397,0.00003484434,0.012428337],"study_design_scores_gemma":[0.0004136304,0.00020450604,0.00046368025,0.000018274697,0.0000031074567,0.00009340591,0.000004930808,0.7582689,0.013219667,0.22674121,0.00031310134,0.00025562162],"about_ca_topic_score_codex":0.000004288762,"about_ca_topic_score_gemma":3.683934e-7,"teacher_disagreement_score":0.7122985,"about_ca_system_score_codex":0.00012971583,"about_ca_system_score_gemma":0.00033096896,"threshold_uncertainty_score":0.70052373},"labels":[],"label_agreement":null},{"id":"W1973111922","doi":"10.1007/s00454-009-9169-z","title":"Schnyder Woods for Higher Genus Triangulated Surfaces, with Applications to Encoding","year":2009,"lang":"en","type":"article","venue":"Discrete & 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 British Columbia","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Genus; Triangulation; Combinatorics; Mathematics; Encoding (memory); Traverse; ENCODE; Computer science; Geometry; Artificial intelligence; Geography; Biology; Zoology","score_opus":0.02141033322352696,"score_gpt":0.29123669885686976,"score_spread":0.2698263656333428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973111922","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.02551192,0.00021937658,0.9684699,0.0032520988,0.00020683942,0.0010086315,0.00004077598,0.00026234603,0.0010280863],"genre_scores_gemma":[0.66701895,0.0000016511221,0.33037356,0.0014183994,0.00020856257,0.00012578888,0.0002602313,0.000013833068,0.00057902915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978412,0.000049073715,0.00040711576,0.0007069008,0.0005922905,0.00040346265],"domain_scores_gemma":[0.9984358,0.00031469634,0.00015408582,0.00036255797,0.00048849307,0.00024435067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033186201,0.00026614827,0.00026186596,0.00056347245,0.0004005538,0.00032032604,0.0005902108,0.00008549581,0.000035615096],"category_scores_gemma":[0.000037579714,0.00024802107,0.0001097967,0.0025483593,0.000029944216,0.0005212692,0.00007763031,0.0001269577,0.000063902226],"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.00006826661,0.00012390604,0.0001481485,0.00001600524,0.000062399486,0.0000038095716,0.00014213403,0.72487223,0.00066726503,0.211974,0.0014569798,0.060464866],"study_design_scores_gemma":[0.0048530726,0.0017109197,0.11270868,0.000110573,0.000102392805,0.000086982334,0.000068224625,0.64758056,0.002172842,0.09857552,0.1300059,0.0020243505],"about_ca_topic_score_codex":0.000004713599,"about_ca_topic_score_gemma":0.0000016093697,"teacher_disagreement_score":0.641507,"about_ca_system_score_codex":0.00009082623,"about_ca_system_score_gemma":0.00017441572,"threshold_uncertainty_score":0.9999972},"labels":[],"label_agreement":null},{"id":"W1973455746","doi":"10.1016/j.dam.2005.02.003","title":"A note on 3D orthogonal graph drawing","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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","keywords":"Mathematics; Graph; Vertex (graph theory); Combinatorics; Graph drawing","score_opus":0.014098558613001643,"score_gpt":0.25672371548179274,"score_spread":0.2426251568687911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973455746","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.014178813,0.000017673756,0.9565012,0.0005585698,0.0000989969,0.00017928901,0.0000027615843,0.00015920667,0.028303474],"genre_scores_gemma":[0.48565775,0.000003267999,0.51342547,0.0005725657,0.0001633559,0.00002519455,0.00001198433,0.000009989839,0.00013042081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881035,0.000009551497,0.00026931684,0.00028868587,0.0004004123,0.00022168987],"domain_scores_gemma":[0.99924713,0.0001491918,0.000102916245,0.00038045415,0.00003897006,0.000081346465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022855353,0.00015712067,0.00015249634,0.0001397563,0.00016185748,0.00013641317,0.00038139935,0.000051562914,0.000027566208],"category_scores_gemma":[0.000021316617,0.00014032252,0.00006791301,0.0003851016,0.00002348498,0.0001818902,0.0001093309,0.00011978026,0.0002914586],"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.000003984069,0.00009105235,0.0000012782795,0.000021650361,0.00001192669,0.0000018370582,0.0010608957,0.016062247,0.0026763643,0.91681594,0.00036468782,0.06288813],"study_design_scores_gemma":[0.00082056737,0.00009469803,0.00021333036,0.000059382113,0.000025919897,0.000027180788,0.00006646128,0.77821124,0.015812492,0.18795043,0.016053837,0.0006644796],"about_ca_topic_score_codex":2.9715412e-7,"about_ca_topic_score_gemma":0.0000019614722,"teacher_disagreement_score":0.762149,"about_ca_system_score_codex":0.00003015414,"about_ca_system_score_gemma":0.000041590436,"threshold_uncertainty_score":0.5722186},"labels":[],"label_agreement":null},{"id":"W1973850282","doi":"10.1080/16864360.2007.10738520","title":"Algorithms for Designing Clamshell Molds","year":2007,"lang":"en","type":"article","venue":"Computer-Aided Design and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Computer science","score_opus":0.043179257858709956,"score_gpt":0.29431520776138254,"score_spread":0.2511359499026726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973850282","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.00017637647,0.00030036233,0.9976085,0.00034203113,0.00016004496,0.0009976589,0.0000022978027,0.00021778919,0.00019496982],"genre_scores_gemma":[0.030219126,0.000023480574,0.9680857,0.0007328185,0.0005177858,0.00023859681,0.000021731006,0.000011838133,0.00014888821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872124,0.00004159963,0.00030706558,0.00048421233,0.00015803859,0.00028782847],"domain_scores_gemma":[0.998232,0.0010063141,0.000098399985,0.00032602868,0.00017806418,0.00015920537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084047933,0.00015558906,0.00014787789,0.00019029989,0.00039342674,0.00020194631,0.0003905228,0.00007467828,0.0000020157552],"category_scores_gemma":[0.000014447399,0.00016225177,0.000057782516,0.00053776265,0.000038284394,0.00027537937,0.00010713286,0.000079742575,0.00001702729],"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.000007956929,0.00008119861,0.000008925182,0.000016143795,0.000017086619,0.0000015613007,0.00011410403,0.008547615,0.0036085625,0.21693332,0.002234477,0.76842904],"study_design_scores_gemma":[0.0005997631,0.00018684445,0.00049238396,0.000012718902,0.000014178706,0.000034453635,0.000012048833,0.8765707,0.0116535695,0.049319226,0.06078587,0.00031823257],"about_ca_topic_score_codex":0.000001909286,"about_ca_topic_score_gemma":4.9396994e-7,"teacher_disagreement_score":0.8680231,"about_ca_system_score_codex":0.000030040166,"about_ca_system_score_gemma":0.00006300499,"threshold_uncertainty_score":0.66164356},"labels":[],"label_agreement":null},{"id":"W1974074904","doi":"10.1007/s00454-009-9158-2","title":"Cuttings for Disks and Axis-Aligned Rectangles in Three-Space","year":2009,"lang":"en","type":"article","venue":"Discrete & 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 Calgary","funders":"Massachusetts Institute of Technology; National Science Foundation","keywords":"Combinatorics; Rectangle; Mathematics; Disjoint sets; Spanning tree; Simplex; Tree (set theory); Space (punctuation); Plane (geometry); Upper and lower bounds; Geometry; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.014208607201156805,"score_gpt":0.270826414557728,"score_spread":0.2566178073565712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974074904","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.21119478,0.0004663304,0.78304213,0.004281785,0.00015342352,0.0003414125,0.000015945674,0.000101156395,0.00040303782],"genre_scores_gemma":[0.84445035,0.0000091703505,0.15442006,0.0007677544,0.00012286933,0.00002553836,0.00011056506,0.0000092166465,0.00008449764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824756,0.00005036693,0.00038193044,0.00059193483,0.00039097585,0.0003372088],"domain_scores_gemma":[0.99883944,0.00051829923,0.00014013212,0.00019994755,0.00017821147,0.00012395658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045227702,0.000218873,0.00024380186,0.0005380705,0.00020804946,0.00023843926,0.0003514511,0.0000816917,0.0000052114433],"category_scores_gemma":[0.00015989794,0.00022293298,0.00008827871,0.0012309625,0.00004405294,0.0006064174,0.000088923596,0.00009525359,0.000007829996],"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.0001239837,0.00020569623,0.0038683852,0.00005368,0.000041411244,0.000015443366,0.0010607287,0.11934691,0.000842902,0.70236415,0.0009631438,0.1711136],"study_design_scores_gemma":[0.0009930412,0.0002700901,0.11959618,0.00004199154,0.000008024052,0.000025299996,0.000031916014,0.53957635,0.00034786432,0.33724082,0.0015094791,0.000358932],"about_ca_topic_score_codex":0.000013653801,"about_ca_topic_score_gemma":0.000013435736,"teacher_disagreement_score":0.63325554,"about_ca_system_score_codex":0.000059519367,"about_ca_system_score_gemma":0.000088636305,"threshold_uncertainty_score":0.90909433},"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":"W1975248037","doi":"10.5555/545381.545489","title":"Approximate distance oracles for geometric graphs","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":51,"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":"Spanner; Combinatorics; Enhanced Data Rates for GSM Evolution; Binary logarithm; Mathematics; Path (computing); Shortest path problem; Time complexity; Preprocessor; Graph; Data structure; Polynomial; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.03038832750984929,"score_gpt":0.24089869049831295,"score_spread":0.21051036298846365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975248037","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.002361775,0.00039120627,0.9923234,0.0005601304,0.00022924076,0.00015796981,0.0000028244895,0.00014510128,0.0038283532],"genre_scores_gemma":[0.7324571,0.000030418641,0.26364955,0.0003612334,0.000054517364,0.000042488704,0.000006608016,0.0000046513023,0.0033934517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993095,0.000011617943,0.00013024006,0.00023696371,0.00015348429,0.00015822664],"domain_scores_gemma":[0.99950975,0.00011524894,0.00004047737,0.00019643272,0.00008832031,0.00004978996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001309438,0.00007157801,0.000073581105,0.00022761278,0.00012497134,0.00012177927,0.00028839725,0.000022507638,0.000052303283],"category_scores_gemma":[0.00004562014,0.00006321052,0.000052353334,0.0012478221,0.000011914867,0.0003555094,0.000043384847,0.000027439042,0.000043365257],"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.0000017274034,0.00007385611,0.00008672078,0.000014236025,0.000007411435,8.403456e-7,0.000060865415,0.0013850003,0.00014161986,0.77766997,0.010533013,0.21002473],"study_design_scores_gemma":[0.00030776364,0.00006678155,0.00060675206,0.0000031802256,0.0000029577159,0.0000062807576,0.0000052764594,0.90287685,0.0023723599,0.045633852,0.04794841,0.00016951768],"about_ca_topic_score_codex":0.0000015078326,"about_ca_topic_score_gemma":0.000002308996,"teacher_disagreement_score":0.9014919,"about_ca_system_score_codex":0.000012315368,"about_ca_system_score_gemma":0.0000058969094,"threshold_uncertainty_score":0.25776502},"labels":[],"label_agreement":null},{"id":"W1975951981","doi":"10.1007/s00454-006-1279-2","title":"Incidence Theorems for Pseudoflats","year":2007,"lang":"en","type":"article","venue":"Discrete & 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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bounded function; Class (philosophy); Algebraic number; Combinatorics; Incidence (geometry); Discrete mathematics; Type (biology); Degree (music); Computer science; Artificial intelligence; Geometry","score_opus":0.013175561921324621,"score_gpt":0.29046009244640403,"score_spread":0.2772845305250794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975951981","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.056130216,0.00022395013,0.93995786,0.0007287037,0.00073133496,0.0003576302,0.000018066425,0.00020221877,0.0016499948],"genre_scores_gemma":[0.7492218,0.000002896231,0.24896002,0.0010553563,0.00030807097,0.000022052736,0.00014311571,0.000014081064,0.0002725882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977082,0.000042694293,0.0005014407,0.0005975704,0.00068142504,0.0004686881],"domain_scores_gemma":[0.9975867,0.0012179246,0.00018936173,0.0003258276,0.00048435913,0.00019578909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013470809,0.0002285846,0.00021071822,0.0005558614,0.00035467578,0.00022018525,0.00073305453,0.00009408936,0.000031262305],"category_scores_gemma":[0.00023964449,0.00022763254,0.00017095038,0.0014640565,0.000072353985,0.00073406176,0.00019255461,0.00014134661,0.00007805355],"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.000049594302,0.00007973391,0.00085085817,0.000027287571,0.000047019996,0.0000112039515,0.00027362877,0.12280946,0.0005704392,0.81657845,0.0021859074,0.056516394],"study_design_scores_gemma":[0.0011713145,0.00026896448,0.060011655,0.00002959685,0.000016394531,0.00009733663,0.00005702843,0.49186486,0.0023683826,0.42938852,0.014020091,0.0007058437],"about_ca_topic_score_codex":0.0000063186803,"about_ca_topic_score_gemma":0.0000045868587,"teacher_disagreement_score":0.69309163,"about_ca_system_score_codex":0.00008265236,"about_ca_system_score_gemma":0.00014993905,"threshold_uncertainty_score":0.9282586},"labels":[],"label_agreement":null},{"id":"W1976067517","doi":"10.1016/j.dam.2007.05.036","title":"Problems related to a de Bruijn–Erdös theorem","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","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":"Concordia University","funders":"","keywords":"De Bruijn sequence; Mathematics; Generalization; Metric space; Combinatorics; De Bruijn graph; Discrete mathematics; Set (abstract data type); Plane (geometry); Geometry; Mathematical analysis; Computer science","score_opus":0.010794055965107775,"score_gpt":0.25584033915541904,"score_spread":0.24504628319031127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976067517","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.038402177,0.00002074326,0.92240536,0.00033885456,0.00008657383,0.00037850428,0.0000012261211,0.00019742417,0.03816914],"genre_scores_gemma":[0.56844175,0.0000018161127,0.4307845,0.00033105645,0.000034873345,0.000024793451,0.0000070744427,0.000012530937,0.00036160086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987233,0.000010450258,0.0003499727,0.00027347877,0.00030426876,0.0003384736],"domain_scores_gemma":[0.999122,0.0001655812,0.000098385506,0.00039522853,0.000057519777,0.00016127576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010121404,0.00014390737,0.00015077392,0.00015056385,0.00011980977,0.000113934446,0.00047336158,0.00006951183,0.000018050521],"category_scores_gemma":[0.000046319394,0.00012933013,0.000049307797,0.0007220006,0.000022176317,0.00011035887,0.0001663227,0.00010916163,0.00019895713],"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.000003549661,0.000055443805,0.000006067038,0.000034653807,0.000014483281,0.0000035876424,0.004287652,0.0041034888,0.0129809985,0.96597725,0.00031014986,0.012222698],"study_design_scores_gemma":[0.0004523637,0.000079956255,0.0004932437,0.000050591178,0.000016750502,0.0000533231,0.00031641542,0.09530148,0.022105198,0.8767279,0.003957738,0.0004450805],"about_ca_topic_score_codex":0.0000015032169,"about_ca_topic_score_gemma":0.0000034307723,"teacher_disagreement_score":0.5300396,"about_ca_system_score_codex":0.00005370399,"about_ca_system_score_gemma":0.000049890354,"threshold_uncertainty_score":0.5273929},"labels":[],"label_agreement":null},{"id":"W1976501503","doi":"10.1090/s0002-9939-08-09173-9","title":"A central set of dimension $2$","year":2008,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Hausdorff dimension; Domain (mathematical analysis); Dimension (graph theory); Set (abstract data type); Mathematics; Planar; Minkowski–Bouligand dimension; Packing dimension; Zero (linguistics); Dimension function; Effective dimension; Combinatorics; Computer science; Fractal dimension; Mathematical analysis; Fractal","score_opus":0.017496116493035688,"score_gpt":0.24197207481438876,"score_spread":0.2244759583213531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976501503","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.93313086,0.000014141369,0.06511769,0.00088571006,0.000031862368,0.000104382605,0.0000013411052,0.000029008352,0.0006849814],"genre_scores_gemma":[0.8859511,0.000012213632,0.11377989,0.00014986796,0.00002830136,0.000003234717,2.1696553e-7,0.0000033444344,0.0000718133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991389,0.000005380373,0.00022395367,0.00013797516,0.00035048963,0.00014330936],"domain_scores_gemma":[0.9993111,0.00007799743,0.0002973397,0.000100788784,0.00016671482,0.000046094705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015901239,0.0000735574,0.0001926716,0.000015246811,0.000088089924,0.000009577724,0.0004362117,0.000016592818,0.000004748055],"category_scores_gemma":[0.00009060135,0.000049151575,0.00019091947,0.00061317935,0.00027653304,0.00013888933,0.00022047161,0.00006702195,0.0000019471893],"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.000038837425,0.00072472513,0.011941297,0.00063535926,0.00022640868,6.432247e-7,0.02721108,0.00082017423,0.24833612,0.67267245,0.02623647,0.011156441],"study_design_scores_gemma":[0.0007885805,0.0005187367,0.07855973,0.0002101486,0.000065879874,0.00016955502,0.0012415661,0.3895868,0.31148526,0.21593268,0.0008925615,0.0005484858],"about_ca_topic_score_codex":0.0000039320644,"about_ca_topic_score_gemma":2.251999e-8,"teacher_disagreement_score":0.45673975,"about_ca_system_score_codex":0.000019253888,"about_ca_system_score_gemma":0.000033965684,"threshold_uncertainty_score":0.2004343},"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":"W1977150669","doi":"10.1016/j.jda.2013.03.008","title":"All-maximum and all-minimum problems under some measures","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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":"Mathematics; Combinatorics; Perimeter; Measure (data warehouse); Line (geometry); Pi; RADIUS; Plane (geometry); Product (mathematics); Point (geometry); Set (abstract data type); Geometry; Computer science","score_opus":0.027468210880338385,"score_gpt":0.2626702243679236,"score_spread":0.2352020134875852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977150669","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.05567641,0.00295155,0.92345685,0.01628162,0.0010281906,0.00025474743,0.0000025678964,0.0000419964,0.00030605638],"genre_scores_gemma":[0.8829159,0.00058883236,0.112590596,0.002480656,0.00096762285,0.000013037262,0.000006070194,0.000020896745,0.0004163685],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984492,0.00008046772,0.0004572949,0.00020521629,0.00056649564,0.00024130031],"domain_scores_gemma":[0.99887264,0.000092555216,0.00030242774,0.00017774849,0.0003362943,0.00021834589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047445475,0.00015155903,0.00021679173,0.00020605973,0.00008446228,0.0003601085,0.00038497054,0.00006261689,0.000021795937],"category_scores_gemma":[0.00003946332,0.00011599061,0.000095517295,0.00020540155,0.00004268932,0.001804358,0.0001273036,0.00019920328,0.000024768575],"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.000057302634,0.0006527903,0.0006091504,0.00014352943,0.0019879842,0.00012582162,0.0051011834,0.055811044,0.058860872,0.07285215,0.047977533,0.75582063],"study_design_scores_gemma":[0.0032265477,0.0014159486,0.017658722,0.0001476547,0.00014960689,0.0011014136,0.0002692215,0.35190728,0.004542124,0.58961624,0.029035084,0.0009301519],"about_ca_topic_score_codex":0.000020631862,"about_ca_topic_score_gemma":0.0000021885185,"teacher_disagreement_score":0.8272395,"about_ca_system_score_codex":0.0000363932,"about_ca_system_score_gemma":0.00008873206,"threshold_uncertainty_score":0.47299597},"labels":[],"label_agreement":null},{"id":"W1977405062","doi":"10.1007/s00153-003-0205-z","title":"Matrix identities and the pigeonhole principle","year":2004,"lang":"en","type":"article","venue":"Archive for Mathematical Logic","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 Toronto; McMaster University","funders":"","keywords":"Pigeonhole principle; Mathematical proof; Mathematics; Bounded function; Matrix (chemical analysis); Algebra over a field; Discrete mathematics; Pure mathematics; Calculus (dental); Mathematical analysis","score_opus":0.017284694571035035,"score_gpt":0.28818060043467947,"score_spread":0.2708959058636444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977405062","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.011169289,0.00009747954,0.9839668,0.0022551683,0.00005856585,0.00032081525,0.0000040313485,0.000046416557,0.002081381],"genre_scores_gemma":[0.5813611,0.000012204942,0.4172597,0.00047772174,0.00007388512,0.0001056667,0.0000075157973,0.000005039049,0.0006971402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994062,0.000028555,0.00015411738,0.00015192377,0.00012977261,0.00012939154],"domain_scores_gemma":[0.9992053,0.0005237085,0.000041180356,0.00016173895,0.000029362198,0.000038690854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032900175,0.000068981426,0.000106424835,0.000039444327,0.00018083227,0.000116977986,0.0002457544,0.000014974417,0.0000067250044],"category_scores_gemma":[0.00018299236,0.000041552754,0.000059717728,0.00008819613,0.00012361366,0.00013497882,0.00015058962,0.000046021778,0.000040663894],"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.0000076050724,0.00002502077,0.0000013727348,0.000026385303,0.0000068013987,7.865316e-7,0.00042295502,0.0010730433,0.00007183831,0.9977427,0.00004716259,0.00057434285],"study_design_scores_gemma":[0.0007071772,0.00005073543,0.00013905944,0.000009156813,0.0000062998274,0.000029730007,0.000014881439,0.035341945,0.00023330543,0.96286696,0.00054370286,0.000057064393],"about_ca_topic_score_codex":0.0000011139114,"about_ca_topic_score_gemma":0.0000012935582,"teacher_disagreement_score":0.57019186,"about_ca_system_score_codex":0.000008290408,"about_ca_system_score_gemma":0.000023990666,"threshold_uncertainty_score":0.1694472},"labels":[],"label_agreement":null},{"id":"W1978321932","doi":"10.1007/s00453-004-1093-2","title":"An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":39,"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":"Theory of computation; Minification; Constant (computer programming); Algorithm; Mathematics; Running time; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Mathematical optimization; Telecommunications","score_opus":0.01570207297804851,"score_gpt":0.272842290635547,"score_spread":0.2571402176574985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978321932","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.024305653,0.00006022948,0.97405386,0.0003802018,0.00060825684,0.0003544787,0.000014414457,0.00017567459,0.000047255806],"genre_scores_gemma":[0.2136779,0.0000010242471,0.78558457,0.00028890287,0.00022437307,0.000049328657,0.00009404208,0.000012136297,0.0000677445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860036,0.00003950743,0.00028534266,0.0004877845,0.00026957536,0.00031740597],"domain_scores_gemma":[0.99902874,0.00018473106,0.00010575857,0.00034381973,0.0002111543,0.00012578501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025016602,0.0001569729,0.00015424541,0.00015250548,0.00045477046,0.0005824783,0.0003691264,0.000080938466,0.000007696576],"category_scores_gemma":[0.00007853617,0.00015939304,0.00008198352,0.00047926424,0.000043149896,0.0005547781,0.000042430896,0.00007626771,0.000017533419],"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.0000063165016,0.0002819901,0.0000020751945,0.0000058815394,0.000015852918,0.0000043473774,0.0006153013,0.31127846,0.0021252658,0.005504111,0.00013367007,0.6800267],"study_design_scores_gemma":[0.00094992906,0.00017251853,0.00024014943,0.000013387,0.000009677368,0.000020230309,0.000016387743,0.95717937,0.031678483,0.008208467,0.0012948792,0.0002165441],"about_ca_topic_score_codex":0.000020650328,"about_ca_topic_score_gemma":0.0000021853793,"teacher_disagreement_score":0.67981017,"about_ca_system_score_codex":0.0000885485,"about_ca_system_score_gemma":0.00021358083,"threshold_uncertainty_score":0.6499859},"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":"W1978730351","doi":"10.1007/s10288-011-0169-5","title":"Locating a general minisum ‘circle’ on the plane","year":2011,"lang":"en","type":"article","venue":"4OR","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unit circle; Norm (philosophy); Mathematics; Combinatorics; Regular polygon; Euclidean geometry; Convex body; Euclidean distance; Scaling; Boundary (topology); Unit sphere; Plane (geometry); Great circle; Geometry; Mathematical analysis; Convex hull","score_opus":0.05103679673092494,"score_gpt":0.23230245744426906,"score_spread":0.1812656607133441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978730351","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.48547614,0.00007437826,0.48932016,0.00231649,0.0008018996,0.00017408702,0.0000020888083,0.00012736575,0.021707417],"genre_scores_gemma":[0.9725483,9.934614e-7,0.025242904,0.0013755964,0.0001731915,0.000011040549,0.0000029743828,0.000002964254,0.00064200594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994858,0.00003540725,0.00008610668,0.00015007613,0.00013543975,0.00010720352],"domain_scores_gemma":[0.9996254,0.00006414694,0.00003424657,0.0002157346,0.000030263927,0.000030223366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017547769,0.000050402774,0.00004071323,0.000036592646,0.00011376432,0.000044995006,0.00030606383,0.000020308962,0.000045645935],"category_scores_gemma":[0.000029317785,0.00003744951,0.000021775551,0.00017499582,0.000012697668,0.000084783096,0.00005403081,0.0000606962,0.00019552524],"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.000017453021,0.00017797558,0.00039037893,0.00001192207,0.000025100342,0.000022235205,0.0037623292,0.0014600185,0.0039015948,0.688497,0.009321704,0.29241225],"study_design_scores_gemma":[0.0011187223,0.001015648,0.14708224,0.00007010289,0.00002251593,0.00014007145,0.00019311154,0.54688406,0.19238475,0.062063914,0.04800187,0.001022992],"about_ca_topic_score_codex":0.000015116577,"about_ca_topic_score_gemma":0.0000032479327,"teacher_disagreement_score":0.62643313,"about_ca_system_score_codex":0.000008365511,"about_ca_system_score_gemma":0.000027749218,"threshold_uncertainty_score":0.25131467},"labels":[],"label_agreement":null},{"id":"W1979810293","doi":"10.1002/nme.926","title":"Automated refinement of conformal quadrilateral and hexahedral meshes","year":2004,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Compute Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Centres de Recerca de Catalunya","keywords":"Hexahedron; Quadrilateral; Polygon mesh; Conformal map; Vertex (graph theory); Metric (unit); Topology (electrical circuits); Computer science; Discretization; Algorithm; Mathematics; Finite element method; Geometry; Computational science; Mathematical analysis; Theoretical computer science; Engineering; Combinatorics; Structural engineering","score_opus":0.02120972807587513,"score_gpt":0.37755174072555536,"score_spread":0.35634201264968024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979810293","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.026177438,0.00010499144,0.97141457,0.0006702962,0.0014890976,0.00006402648,0.0000020106602,0.000053511787,0.000024040337],"genre_scores_gemma":[0.3092671,0.000012366001,0.6905657,0.00005097061,0.00008492427,0.0000057643956,0.0000020218308,0.000004100822,0.000007055385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991097,0.000027654842,0.00038658682,0.00012191053,0.00021616126,0.00013802503],"domain_scores_gemma":[0.9994512,0.00017422106,0.00010222182,0.000058423033,0.00015089776,0.00006300345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056288094,0.000089059795,0.00014393705,0.0002647042,0.00002912237,0.0000804471,0.00028993684,0.00003398716,0.000003495199],"category_scores_gemma":[0.0002263517,0.00008314698,0.00005829622,0.00017277319,0.000010901361,0.0003619964,0.00008029362,0.00011494014,3.7098468e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032115116,0.000058438163,0.00016310051,0.000018819994,0.000064513064,0.000013393814,0.00041985442,0.8605924,0.012649953,0.057258584,0.000022631455,0.068706155],"study_design_scores_gemma":[0.0010092615,0.00012530456,0.0032536995,0.00006140423,0.0000037018362,0.00023477644,0.00001169768,0.97264403,0.014652666,0.005980306,0.0018976625,0.00012551378],"about_ca_topic_score_codex":0.000009024666,"about_ca_topic_score_gemma":3.7486373e-7,"teacher_disagreement_score":0.28308967,"about_ca_system_score_codex":0.00008710239,"about_ca_system_score_gemma":0.000043121418,"threshold_uncertainty_score":0.33906353},"labels":[],"label_agreement":null},{"id":"W1979867394","doi":"10.1007/s00454-009-9159-1","title":"On the Exact Maximum Complexity of Minkowski Sums of Polytopes","year":2009,"lang":"en","type":"article","venue":"Discrete & 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":"McGill University","funders":"Tel Aviv University; Israel Science Foundation","keywords":"Polytope; Combinatorics; Mathematics; Minkowski space; Minkowski addition; Bounded function; Mathematical analysis; Geometry","score_opus":0.02933775667041619,"score_gpt":0.27031486102212404,"score_spread":0.24097710435170785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979867394","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.37560663,0.00015746125,0.6173787,0.0033293678,0.00020857328,0.00022530174,0.00004146365,0.00005017851,0.0030023044],"genre_scores_gemma":[0.9722078,0.00000415223,0.02667417,0.0008802479,0.0000650642,0.000004266724,0.00008047762,0.0000065584018,0.000077298835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997856,0.00013712386,0.00054494845,0.00036782929,0.0008588237,0.00023526007],"domain_scores_gemma":[0.99798566,0.00082862796,0.0003409657,0.00042655077,0.00033636426,0.000081805316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049138785,0.00020253539,0.000294994,0.00039954865,0.00016418388,0.00006486836,0.00081716664,0.00005976779,0.0000935115],"category_scores_gemma":[0.00016403236,0.00015515466,0.00018588277,0.0014469519,0.00019059557,0.00027763052,0.00011692469,0.00015797635,0.000023543842],"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.00003685503,0.00015356396,0.00022307856,0.000015839969,0.00004213667,0.000002378953,0.00021049235,0.104628585,0.00090604235,0.8774599,0.000875958,0.015445155],"study_design_scores_gemma":[0.0005435193,0.0005624327,0.15991983,0.00006022058,0.000015039752,0.000016102338,0.00004862061,0.18561979,0.007266481,0.64536947,0.00028905983,0.0002894309],"about_ca_topic_score_codex":0.000016286589,"about_ca_topic_score_gemma":0.000001451432,"teacher_disagreement_score":0.5966011,"about_ca_system_score_codex":0.00003149433,"about_ca_system_score_gemma":0.00011974562,"threshold_uncertainty_score":0.63270235},"labels":[],"label_agreement":null},{"id":"W1980197133","doi":"10.1145/335305.335339","title":"Approximation algorithms for geometric shortest path problems","year":2000,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"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":"Citation; Computer science; Bulgarian; Algorithm; Library science; Shortest path problem; Theoretical computer science","score_opus":0.027789897244294568,"score_gpt":0.2526524067234931,"score_spread":0.22486250947919853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980197133","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.004473089,0.00008435079,0.9893809,0.00041495034,0.00014962685,0.0004005902,0.0000030867354,0.00016896942,0.004924449],"genre_scores_gemma":[0.41413656,0.000026508282,0.57845634,0.00042167728,0.0002243905,0.00016314357,0.00008454628,0.000008505633,0.006478346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991198,0.00001633069,0.00019107434,0.00028760373,0.00021088701,0.00017428075],"domain_scores_gemma":[0.9995098,0.000090307054,0.00003465462,0.00019495153,0.00011190206,0.00005836815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027244983,0.00008777815,0.000084596184,0.00019678035,0.00012753843,0.00015189225,0.00026263873,0.000037646696,0.00014102382],"category_scores_gemma":[0.000023566225,0.000078648955,0.000049796254,0.0011005062,0.000008348258,0.00050690613,0.000023523313,0.000036847472,0.00008626746],"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.0000019649249,0.00008447304,0.000029190216,0.0000084101375,0.0000067758046,3.6196346e-7,0.0000792401,0.03309431,0.0001432222,0.024029728,0.0022465447,0.9402758],"study_design_scores_gemma":[0.00027548402,0.000115752824,0.0010298324,0.000004088181,0.0000032218272,0.000009211375,0.0000029370697,0.96013725,0.0010577706,0.009803869,0.027421802,0.00013878291],"about_ca_topic_score_codex":0.0000064004976,"about_ca_topic_score_gemma":0.000001448477,"teacher_disagreement_score":0.94013697,"about_ca_system_score_codex":0.000023871564,"about_ca_system_score_gemma":0.00003921985,"threshold_uncertainty_score":0.32072112},"labels":[],"label_agreement":null},{"id":"W1980802338","doi":"10.1007/s00366-006-0015-0","title":"A comparison of two optimization methods for mesh quality improvement","year":2006,"lang":"en","type":"article","venue":"Engineering With Computers","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":63,"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":"Sandia National Laboratories; Advanced Scientific Computing Research; Office of Science; University of British Columbia","keywords":"Polygon mesh; Mathematics; Vertex (graph theory); Coordinate descent; Metric (unit); Mathematical optimization; Tetrahedron; Algorithm; Series (stratigraphy); Harmonic mean; Block (permutation group theory); Computer science; Combinatorics; Geometry; Engineering","score_opus":0.020588232117529772,"score_gpt":0.34972847955993397,"score_spread":0.3291402474424042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980802338","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.005493736,0.000064743144,0.9934382,0.000095584415,0.00048720193,0.00025982066,0.0000016268192,0.00012864891,0.000030463747],"genre_scores_gemma":[0.2734982,3.2583583e-7,0.72635186,0.000019831656,0.000066539396,0.000022425089,0.000018109347,0.0000065523886,0.00001614668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990778,0.0000319547,0.00033439376,0.00024069389,0.00015933567,0.00015584013],"domain_scores_gemma":[0.99914616,0.0003183441,0.00014210337,0.00021018952,0.00014614138,0.00003706163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039176652,0.00012107376,0.0002097076,0.00013957615,0.000048139365,0.000056625086,0.0002383569,0.000024364306,0.0000010617275],"category_scores_gemma":[0.000019990244,0.00011515088,0.00005199961,0.00036389625,0.000010298658,0.00018569511,0.000053902175,0.000047945825,2.8735658e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056992553,0.00004990214,0.00007737864,0.000036227644,0.00001746951,1.1696558e-7,0.00007299566,0.9280365,0.0035812112,0.041710705,0.00010593995,0.026305865],"study_design_scores_gemma":[0.0005796749,0.00017475217,0.000531009,0.000020227719,0.0000069791054,0.0000013929384,0.000002746439,0.97647506,0.02122566,0.00024916572,0.0005909099,0.00014243231],"about_ca_topic_score_codex":0.000019707413,"about_ca_topic_score_gemma":0.0000013298072,"teacher_disagreement_score":0.26800445,"about_ca_system_score_codex":0.00004052692,"about_ca_system_score_gemma":0.00003357464,"threshold_uncertainty_score":0.46957165},"labels":[],"label_agreement":null},{"id":"W1981160608","doi":"10.1007/s00453-011-9551-0","title":"Augmenting the Edge Connectivity of Planar Straight Line Graphs to Three","year":2011,"lang":"en","type":"article","venue":"Algorithmica","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 Calgary","funders":"","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Planar graph; Mathematics; Planar; Theory of computation; Line (geometry); Computer science; Graph; Geometry; Algorithm; Artificial intelligence; Computer graphics (images)","score_opus":0.038526654281998925,"score_gpt":0.24257025766374965,"score_spread":0.20404360338175073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981160608","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.08252461,0.00004742488,0.91437566,0.00046386,0.00033868427,0.00014973954,0.0000054455836,0.00004151553,0.0020530652],"genre_scores_gemma":[0.88479745,0.0000012741442,0.11482048,0.00020713934,0.00008625342,0.00000978031,0.0000031924628,0.000003691434,0.00007076038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999279,0.000037126207,0.00016206247,0.00020297071,0.00017852121,0.00014030791],"domain_scores_gemma":[0.9993969,0.00011022953,0.0000697045,0.00027630245,0.000095462485,0.00005136085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030454624,0.00007661431,0.000093079434,0.000086412416,0.00011182783,0.000025272897,0.0004469079,0.00002553112,0.000028533243],"category_scores_gemma":[0.000033842727,0.000057233436,0.000047207985,0.00046836108,0.000026133632,0.00015445283,0.00010091298,0.000066860644,0.000019408026],"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.000016013057,0.00022156935,0.0005640938,0.000013228126,0.000077281155,0.000008273167,0.0022278249,0.00046235943,0.004724571,0.5082112,0.0014607124,0.4820129],"study_design_scores_gemma":[0.0011317212,0.0011151384,0.18079089,0.000066164226,0.000058028454,0.00006531275,0.00010969166,0.25746328,0.24102612,0.30946115,0.007906138,0.0008063829],"about_ca_topic_score_codex":0.000045258086,"about_ca_topic_score_gemma":0.000039936618,"teacher_disagreement_score":0.8022728,"about_ca_system_score_codex":0.0000085367055,"about_ca_system_score_gemma":0.000037009417,"threshold_uncertainty_score":0.23339118},"labels":[],"label_agreement":null},{"id":"W1982128583","doi":"10.1007/s00454-008-9127-1","title":"Traversing a Set of Points with a Minimum Number of Turns","year":2008,"lang":"en","type":"article","venue":"Discrete & 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":"Carleton University","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Path (computing); Mathematical analysis","score_opus":0.018935165917497356,"score_gpt":0.2642083172706151,"score_spread":0.24527315135311775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982128583","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.52339506,0.00004883065,0.47526088,0.00018139754,0.000081791964,0.00009420801,0.000025081412,0.000028394634,0.000884313],"genre_scores_gemma":[0.84144115,0.0000050790813,0.15821858,0.00009591507,0.000051428306,0.00000387138,0.00008657408,0.000009096873,0.00008831836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981338,0.00007321648,0.00044906093,0.0003539409,0.0007782718,0.00021170531],"domain_scores_gemma":[0.9985867,0.0003209716,0.0002981573,0.00024786041,0.00044594705,0.00010036565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002091179,0.0001753954,0.0002939269,0.00036317605,0.00010438435,0.000023032037,0.0003897632,0.000056452292,0.000064863074],"category_scores_gemma":[0.000046730253,0.00016113426,0.00011831185,0.0015997345,0.00015536847,0.0004359826,0.0001077916,0.00010810363,0.000019844],"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.00049214374,0.00078286964,0.068296604,0.00051704503,0.00070592784,0.00016063113,0.013093231,0.65880734,0.0018362942,0.23846395,0.0019414533,0.014902495],"study_design_scores_gemma":[0.0045016618,0.00086758315,0.38071138,0.0002823829,0.000076674114,0.0014855126,0.00042284714,0.55791146,0.006277516,0.045041632,0.0013164869,0.0011048843],"about_ca_topic_score_codex":0.000019151592,"about_ca_topic_score_gemma":0.0000014895396,"teacher_disagreement_score":0.31804603,"about_ca_system_score_codex":0.00003124532,"about_ca_system_score_gemma":0.0002541782,"threshold_uncertainty_score":0.65708643},"labels":[],"label_agreement":null},{"id":"W1982991648","doi":"10.5555/365411.365430","title":"Optimal covering tours with turn costs","year":2001,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":27,"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":"Arc routing; Travelling salesman problem; Mathematical optimization; Computer science; Routing (electronic design automation); Approximation algorithm; Path (computing); Computational geometry; Polynomial-time approximation scheme; Class (philosophy); Completeness (order theory); Arc (geometry); Time complexity; Mathematics; Algorithm; Artificial intelligence; Geometry","score_opus":0.009435230428336246,"score_gpt":0.22386164187228225,"score_spread":0.214426411443946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982991648","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.25817508,0.000017718598,0.72970885,0.00043529313,0.00008345208,0.000036349073,1.3899336e-7,0.00007281663,0.011470313],"genre_scores_gemma":[0.86145926,0.0000044602434,0.13634607,0.00033885814,0.0000657809,0.0000030905992,0.0000021973515,0.0000023600346,0.0017779056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951184,0.0000098122755,0.00006165862,0.00015209983,0.00015356178,0.00011103335],"domain_scores_gemma":[0.99972534,0.000027526194,0.00001944243,0.00012705817,0.00005158971,0.000049054495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006631308,0.000053325635,0.000044767738,0.000050791754,0.00006171329,0.00010550449,0.00016837676,0.000013828541,0.00004059494],"category_scores_gemma":[0.0000056262375,0.00004206554,0.000013527837,0.00031043572,0.00000773496,0.00035135527,0.00004852973,0.000035126694,0.000043020522],"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.000040249382,0.00011289337,0.0036905764,0.0000047278427,0.00003101132,0.000111331916,0.00034587047,0.61671585,0.0017542818,0.16463237,0.0042267507,0.20833406],"study_design_scores_gemma":[0.00085438846,0.0003411852,0.018227635,0.000018780593,0.000005401648,0.00041918765,0.00004780451,0.92199516,0.008366284,0.00058131333,0.048756655,0.00038618266],"about_ca_topic_score_codex":0.000012912481,"about_ca_topic_score_gemma":0.000013888762,"teacher_disagreement_score":0.6032842,"about_ca_system_score_codex":0.000025444442,"about_ca_system_score_gemma":0.000035431272,"threshold_uncertainty_score":0.1715383},"labels":[],"label_agreement":null},{"id":"W198326635","doi":"","title":"Geometric spanners with few edges and degree five","year":2006,"lang":"en","type":"article","venue":"Computing: The Australasian Theory Symposium","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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":"Combinatorics; Degree (music); Vertex (graph theory); Integer (computer science); Mathematics; Set (abstract data type); Graph; Point (geometry); Discrete mathematics; Computer science; Physics; Geometry","score_opus":0.012887919714954454,"score_gpt":0.21939387482442727,"score_spread":0.2065059551094728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198326635","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.26447636,0.0006462112,0.7235093,0.00430074,0.0004954998,0.00037394167,0.0000030461608,0.0002654618,0.0059294435],"genre_scores_gemma":[0.9876117,0.000013134712,0.009393043,0.00023873593,0.00038431617,0.000005921797,0.000010656505,0.00001634357,0.0023261611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982238,0.00023081034,0.00027499816,0.0005286393,0.00032257944,0.00041919778],"domain_scores_gemma":[0.9985525,0.00052085967,0.00017524301,0.00051528256,0.0001284154,0.00010767951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000738956,0.000262489,0.00020544534,0.00031558372,0.0004987433,0.00040531493,0.0007921161,0.00007160807,0.000007158536],"category_scores_gemma":[0.00002909717,0.00018134333,0.00006433138,0.0013532767,0.00020834999,0.00031511908,0.0002721802,0.00021714022,0.000030251811],"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.00008539984,0.00022054647,0.0029689814,0.000063572865,0.00013899652,0.00006713215,0.0016218335,0.11301948,0.0016664983,0.6350294,0.006064261,0.23905393],"study_design_scores_gemma":[0.005942905,0.0024379827,0.48128054,0.00040646616,0.0003994917,0.0030887923,0.0014889651,0.18168133,0.04244266,0.24734703,0.029562024,0.0039218166],"about_ca_topic_score_codex":0.000026648811,"about_ca_topic_score_gemma":0.00000826361,"teacher_disagreement_score":0.72313535,"about_ca_system_score_codex":0.000042697622,"about_ca_system_score_gemma":0.000077901626,"threshold_uncertainty_score":0.73949665},"labels":[],"label_agreement":null},{"id":"W1983271670","doi":"10.1016/j.jda.2006.09.004","title":"Computing the maximum clique in the visibility graph of a simple polygon","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Visibility graph; Simple polygon; Clique graph; Visibility polygon; Mathematics; Vertex (graph theory); Polygon covering; Graph; Block graph; Regular polygon; Discrete mathematics; Graph power; Line graph; 1-planar graph; Geometry","score_opus":0.010632268095251732,"score_gpt":0.26875956718571214,"score_spread":0.2581272990904604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983271670","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.32500947,0.00039974492,0.6715477,0.002483695,0.00020915498,0.00011131534,0.0000027709832,0.0000057280454,0.00023039385],"genre_scores_gemma":[0.98035187,0.000010108394,0.019147264,0.00020845931,0.0002691719,8.107384e-7,0.00000232383,0.0000031426173,0.00000684142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983537,0.00028154752,0.000610318,0.0001273606,0.00047001638,0.00015702227],"domain_scores_gemma":[0.99871814,0.0003787979,0.0004426748,0.00025538067,0.00017873863,0.000026248195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020167436,0.00009217698,0.00017154093,0.00014690627,0.0001068255,0.000094635,0.00070329354,0.00003402119,0.000002790743],"category_scores_gemma":[0.00005804719,0.0000501892,0.00015270057,0.00077743485,0.000053299416,0.00029911593,0.000084619365,0.00023505658,7.3866863e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017070358,0.0014156977,0.020719321,0.00011797858,0.00019094933,0.00018792036,0.009331082,0.35637066,0.008683556,0.15134315,0.0067569464,0.444712],"study_design_scores_gemma":[0.0012499643,0.00059283816,0.277503,0.00006760098,0.000029755898,0.0003666459,0.0005674788,0.3599653,0.0041159536,0.35366848,0.0016232248,0.00024975147],"about_ca_topic_score_codex":0.0001519966,"about_ca_topic_score_gemma":0.000040675408,"teacher_disagreement_score":0.6553424,"about_ca_system_score_codex":0.000024462985,"about_ca_system_score_gemma":0.00008939828,"threshold_uncertainty_score":0.20466562},"labels":[],"label_agreement":null},{"id":"W1983527657","doi":"10.1007/s11750-012-0248-6","title":"Locating an axis-parallel rectangle on a Manhattan plane","year":2012,"lang":"en","type":"article","venue":"Top","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":"Royal Military College of Canada; Group for Research in Decision Analysis","funders":"","keywords":"Rectangle; Plane (geometry); Computer science; Geometry; Computer graphics (images); Mathematics; Combinatorics","score_opus":0.028607151975653985,"score_gpt":0.27747706825262436,"score_spread":0.24886991627697036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983527657","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.4248011,0.00015413438,0.5562516,0.0005629409,0.00070820947,0.00011032546,0.0000012061574,0.00017955436,0.017230907],"genre_scores_gemma":[0.9435997,6.886597e-7,0.054303348,0.0005178859,0.00038134048,0.000007045331,0.000013825378,0.000003897392,0.0011722756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993783,0.000041832023,0.00009347855,0.00015057648,0.00015628367,0.00017950378],"domain_scores_gemma":[0.9995798,0.000046851274,0.000034344266,0.00022257761,0.000025183324,0.00009127186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021722593,0.0000652377,0.000056963785,0.00006382598,0.000094247975,0.00005610308,0.00020861946,0.000026931473,0.00005372491],"category_scores_gemma":[0.000019547335,0.0000618415,0.00001670184,0.00020176826,0.0000065726977,0.0004124712,0.000040859213,0.000058374568,0.00032246832],"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.000031640007,0.000533723,0.0022947802,0.000022291864,0.000018430208,0.000009090974,0.0041980986,0.014355523,0.005500897,0.40989769,0.0064468035,0.55669105],"study_design_scores_gemma":[0.0024744947,0.0030092876,0.16493881,0.000108923705,0.000030534513,0.00036704764,0.00041148133,0.45157698,0.050524503,0.018139018,0.30625275,0.00216619],"about_ca_topic_score_codex":0.00000831556,"about_ca_topic_score_gemma":0.0000035348835,"teacher_disagreement_score":0.55452484,"about_ca_system_score_codex":0.000024013023,"about_ca_system_score_gemma":0.000018533923,"threshold_uncertainty_score":0.41447854},"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":"W1984973771","doi":"10.1016/j.cma.2004.11.018","title":"An analysis of simplex shape measures for anisotropic meshes","year":2005,"lang":"en","type":"article","venue":"Computer Methods in Applied Mechanics and Engineering","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":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simplex; Polygon mesh; Equivalence (formal languages); Mathematics; Measure (data warehouse); Euclidean space; Shape analysis (program analysis); Visualization; Computer science; Mathematical optimization; Applied mathematics; Mathematical analysis; Geometry; Artificial intelligence; Discrete mathematics; Data mining","score_opus":0.028722197541505377,"score_gpt":0.3169112438785348,"score_spread":0.2881890463370294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984973771","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.007030515,0.00014956034,0.992428,0.000037836868,0.00013521496,0.00014706618,0.0000023234409,0.00005928912,0.000010191329],"genre_scores_gemma":[0.3080179,0.000014640902,0.6918146,0.00004977135,0.0000711395,0.000019010293,0.0000063128673,0.0000058721344,7.058424e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907446,0.0000324313,0.00028406028,0.00031963678,0.000116653246,0.0001727646],"domain_scores_gemma":[0.9993658,0.00022195152,0.0000598856,0.0002377764,0.000048317022,0.00006623501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000774399,0.0001270426,0.0002909203,0.0004908069,0.00003719524,0.000060039838,0.00027893586,0.000057613717,0.000002295612],"category_scores_gemma":[0.00001417802,0.00013381992,0.00006412379,0.00076464075,0.0000033834863,0.00012525372,0.0000876943,0.00006297543,1.4269365e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018775481,0.000015575763,0.00000233048,0.000010752549,0.000040109586,9.851438e-8,0.00012349064,0.39761898,0.009398267,0.23921105,0.0000018488955,0.35357562],"study_design_scores_gemma":[0.00021302157,0.00004085957,0.00048311564,0.0000046095524,0.000044262364,8.539656e-7,0.0000060480384,0.9867148,0.0057459534,0.004892283,0.0017166991,0.00013750647],"about_ca_topic_score_codex":0.0000015681392,"about_ca_topic_score_gemma":0.0000029734615,"teacher_disagreement_score":0.58909583,"about_ca_system_score_codex":0.000025997328,"about_ca_system_score_gemma":0.000016113592,"threshold_uncertainty_score":0.5457018},"labels":[],"label_agreement":null},{"id":"W1985300487","doi":"10.1016/j.tcs.2014.06.026","title":"Following a curve with the discrete Fréchet distance","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","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 Alberta","funders":"","keywords":"Mathematics; Combinatorics; Geometry","score_opus":0.005718607776081057,"score_gpt":0.2320523624921879,"score_spread":0.22633375471610687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985300487","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.030617535,0.000021274498,0.9615997,0.0046781804,0.0004055902,0.00012994235,4.836114e-7,0.00012781782,0.0024194485],"genre_scores_gemma":[0.8782331,5.8785525e-7,0.12052737,0.0010393901,0.00016149803,0.000009221196,9.788769e-7,0.0000050959743,0.000022808006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792624,0.00015558652,0.00016222258,0.0005990568,0.0007375524,0.00041934394],"domain_scores_gemma":[0.9984759,0.00043673164,0.0000615027,0.00073060347,0.00013164744,0.00016362287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001840092,0.00015843067,0.00014751927,0.0000871104,0.00076047116,0.0006644744,0.0019994592,0.000024013269,0.0000073033634],"category_scores_gemma":[0.000075704025,0.000090278896,0.00006500975,0.0014654613,0.0011599021,0.0006924017,0.0005127507,0.00015956008,0.000036834583],"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.0000044320254,0.0000136268745,0.000054312237,0.0000018048455,0.000003746225,0.0000026995651,0.0002626115,0.0026931525,0.00011525514,0.9753233,0.0000662632,0.021458775],"study_design_scores_gemma":[0.00019588174,0.00019351055,0.0014674861,0.000018146486,0.0000053453123,0.000020571923,0.0000046346154,0.8798138,0.0010652554,0.115047865,0.0019710974,0.00019641004],"about_ca_topic_score_codex":0.0000016986316,"about_ca_topic_score_gemma":0.0000022690865,"teacher_disagreement_score":0.8771206,"about_ca_system_score_codex":0.00003202412,"about_ca_system_score_gemma":0.000087943576,"threshold_uncertainty_score":0.6407542},"labels":[],"label_agreement":null},{"id":"W1986000260","doi":"10.4171/aihpd/14","title":"Tensor models from the viewpoint of matrix models: the cases of loop models on random surfaces and of the Gaussian distribution","year":2015,"lang":"en","type":"article","venue":"Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Statistical physics; Loop (graph theory); Distribution (mathematics); Tensor (intrinsic definition); Gaussian; Gaussian network model; Mathematics; Matrix (chemical analysis); Physics; Mathematical analysis; Geometry; Combinatorics; Materials science; Quantum mechanics","score_opus":0.0494717526748837,"score_gpt":0.26855404102068026,"score_spread":0.21908228834579657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986000260","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.5559226,0.001870382,0.4393138,0.0015459319,0.00034408388,0.00030059848,0.0002529478,0.000014621637,0.0004349909],"genre_scores_gemma":[0.9991769,0.0003739985,0.00022132274,0.00009979813,0.000043478143,0.000016426435,0.000026548203,0.000006546776,0.00003496298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988344,0.00018907187,0.00035078876,0.00021929663,0.00026368813,0.00014279102],"domain_scores_gemma":[0.9979947,0.0007683662,0.0003201589,0.000454413,0.0003993016,0.00006301279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035474423,0.00016892582,0.0002551241,0.000034365323,0.0002820088,0.00007379239,0.0004398279,0.00004136406,4.809291e-7],"category_scores_gemma":[0.00005633964,0.00009146602,0.00012790148,0.0003946747,0.00021132991,0.0006119265,0.00023278329,0.0001970127,3.6906778e-7],"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.000044627966,0.00016490337,0.000057906826,0.00001433504,0.00006989752,4.8590886e-7,0.0019458943,0.31026873,0.00019435375,0.68520826,0.00025417816,0.0017764488],"study_design_scores_gemma":[0.00034720844,0.00005874192,0.00012677768,0.000060285634,0.000023381372,0.000011029969,0.0002816645,0.5427269,0.0020874564,0.45400962,0.00020430279,0.00006264022],"about_ca_topic_score_codex":0.000386341,"about_ca_topic_score_gemma":0.00004218333,"teacher_disagreement_score":0.4432543,"about_ca_system_score_codex":0.000038499584,"about_ca_system_score_gemma":0.00016345762,"threshold_uncertainty_score":0.3729876},"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":"W1988380958","doi":"10.1016/j.cagd.2006.05.002","title":"Conditions for use of a non-selfintersection conjecture","year":2006,"lang":"en","type":"article","venue":"Computer Aided Geometric Design","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":"Université de Montréal","funders":"","keywords":"Conjecture; Mathematics; Graphics; Basis (linear algebra); Algebra over a field; Pure mathematics; Computer science; Geometry; Computer graphics (images)","score_opus":0.03620947269084067,"score_gpt":0.2555323432208075,"score_spread":0.2193228705299668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988380958","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.013644293,0.0000665519,0.98439604,0.000115693874,0.0009706198,0.00062547514,0.000015218781,0.00012455528,0.000041538013],"genre_scores_gemma":[0.5384181,0.000002436137,0.46092764,0.0001331156,0.00024340286,0.00004601989,0.000052819814,0.000008758237,0.00016765992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985316,0.00008360746,0.0004328864,0.00043051897,0.00026634877,0.00025506038],"domain_scores_gemma":[0.9978012,0.001167331,0.00021762881,0.0003545507,0.00039515767,0.000064136126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003433957,0.00017950378,0.00025134333,0.0013521629,0.00015219994,0.00019893816,0.00037847122,0.000090431015,0.000010156472],"category_scores_gemma":[0.00006291004,0.00018102788,0.00016042357,0.0028526718,0.00003568167,0.0006398336,0.00009022659,0.00008356034,0.000014585379],"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.000042882086,0.00039276163,0.00020870472,0.00006310989,0.00009222989,0.00000827943,0.00010522642,0.79326934,0.00393408,0.029375104,0.089567356,0.08294096],"study_design_scores_gemma":[0.0010447692,0.0006007652,0.009718083,0.000022949243,0.000023384664,0.000040535702,0.0000017480099,0.9608864,0.012606737,0.010750521,0.0040385514,0.00026552586],"about_ca_topic_score_codex":0.000034753215,"about_ca_topic_score_gemma":0.0000020538077,"teacher_disagreement_score":0.52477384,"about_ca_system_score_codex":0.00005720768,"about_ca_system_score_gemma":0.000096166674,"threshold_uncertainty_score":0.73821026},"labels":[],"label_agreement":null},{"id":"W1988573007","doi":"10.1007/s00453-009-9329-9","title":"Minimum Weight Convex Steiner Partitions","year":2009,"lang":"en","type":"article","venue":"Algorithmica","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; Steiner tree problem; Mathematics; Partition (number theory); Regular polygon; Upper and lower bounds; Convex hull; Binary logarithm; Minimum spanning tree; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.009273704788841874,"score_gpt":0.23402277050136605,"score_spread":0.22474906571252418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988573007","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.010793287,0.00016050828,0.9748167,0.0077878884,0.00056500017,0.000112784764,0.000004010579,0.00019799452,0.0055618277],"genre_scores_gemma":[0.90495723,0.00000957426,0.090441264,0.0023864834,0.00044377116,0.000010052233,0.000020796733,0.000004038225,0.0017268002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992026,0.000030364256,0.00016010801,0.00023953902,0.00019254931,0.00017484448],"domain_scores_gemma":[0.9994835,0.00004713918,0.000040556817,0.00025452973,0.00008927332,0.00008497889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009667939,0.000086215325,0.00009226715,0.00008885545,0.00012307911,0.00008736716,0.00028293463,0.000037150603,0.00005456509],"category_scores_gemma":[0.000016151807,0.00008217174,0.00004771793,0.0003937114,0.000016185182,0.00032649102,0.000036718477,0.00006574427,0.00022798555],"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.00000538573,0.00029206628,0.000056530742,0.000004144735,0.000025398971,0.0000360954,0.0003166961,0.001259661,0.003707175,0.32026327,0.058757,0.6152766],"study_design_scores_gemma":[0.0009830365,0.0004203341,0.009062534,0.00001882339,0.00001872215,0.00008738013,0.000013306899,0.56223494,0.030249298,0.14460254,0.25172204,0.0005870431],"about_ca_topic_score_codex":0.0000018990887,"about_ca_topic_score_gemma":7.2454134e-7,"teacher_disagreement_score":0.8941639,"about_ca_system_score_codex":0.000016913891,"about_ca_system_score_gemma":0.000050639723,"threshold_uncertainty_score":0.33508664},"labels":[],"label_agreement":null},{"id":"W1988754041","doi":"10.1017/s0963548308009127","title":"On a Question of Bourgain about Geometric Incidences","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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 Calgary; University of British Columbia","funders":"","keywords":"Omega; Euclidean space; Euclidean geometry; Combinatorics; Line (geometry); Set (abstract data type); Space (punctuation); Mathematics; Computer science; Geometry; Physics","score_opus":0.027631551208523907,"score_gpt":0.2659481453081043,"score_spread":0.2383165940995804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988754041","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.5557876,0.00019080196,0.44255668,0.00010518063,0.00051838026,0.00017841897,5.767503e-7,0.00011333012,0.00054900016],"genre_scores_gemma":[0.97854626,0.000014905394,0.02125167,0.000080854385,0.000049845083,0.000005057726,0.000005059145,0.00000658545,0.00003978137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775136,0.00025456923,0.0005487086,0.0005093908,0.0006600485,0.00027591528],"domain_scores_gemma":[0.9976884,0.0008534128,0.00031407306,0.0005127049,0.000527621,0.00010376425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014690474,0.00017496357,0.00027284576,0.00046290056,0.00035362903,0.000050125138,0.000683126,0.00008480033,0.00000416387],"category_scores_gemma":[0.0012760342,0.00017854816,0.00010094963,0.0028239395,0.00009501703,0.00032719813,0.000294092,0.00021216705,0.000015511181],"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.000009321262,0.0006936077,0.009088297,0.00007594789,0.000015179633,0.000010271985,0.000573118,0.036977507,0.00011944149,0.928404,0.00025856151,0.023774793],"study_design_scores_gemma":[0.0006732534,0.0006194421,0.09538814,0.00010495151,0.000006612982,0.00005739024,0.000007984644,0.26199308,0.00517051,0.6353985,0.00019361392,0.00038649593],"about_ca_topic_score_codex":0.000027157606,"about_ca_topic_score_gemma":9.18577e-7,"teacher_disagreement_score":0.4227586,"about_ca_system_score_codex":0.00016900849,"about_ca_system_score_gemma":0.00022726518,"threshold_uncertainty_score":0.7280983},"labels":[],"label_agreement":null},{"id":"W1989681946","doi":"10.1016/j.jda.2003.12.003","title":"Packing two disks into a polygonal environment","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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":"Polygon (computer graphics); Combinatorics; Simple polygon; RADIUS; Computation; Algebraic number; Mathematics; Randomized algorithm; Tree (set theory); Time complexity; Polygonal chain; Running time; Simple (philosophy); Computational geometry; Regular polygon; Computer science; Algorithm; Geometry; Mathematical analysis","score_opus":0.010991902919686066,"score_gpt":0.26512032313862094,"score_spread":0.2541284202189349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989681946","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.040403243,0.000643182,0.9552356,0.003013201,0.00049923017,0.00004914478,0.0000014563838,0.0000132721925,0.00014168586],"genre_scores_gemma":[0.71463335,0.000051272324,0.28461888,0.00016782848,0.00048018407,0.0000013021712,0.000002348203,0.0000055954583,0.000039232236],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986846,0.00004087781,0.00038471702,0.00016157831,0.0005568411,0.00017141661],"domain_scores_gemma":[0.9993009,0.00004173321,0.0002751268,0.0001655273,0.00007139073,0.00014533692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003655637,0.00011533554,0.00015748636,0.00016524106,0.00012228517,0.00012951507,0.00038601583,0.000029673805,0.000017495207],"category_scores_gemma":[0.000023590856,0.00009444629,0.00013740528,0.00021852517,0.000031674335,0.0007102678,0.000119830926,0.00017591905,0.000022619],"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.000046757945,0.0003795343,0.00036463662,0.000019905463,0.00022581547,0.00033161353,0.0034880051,0.35773575,0.016043616,0.07780059,0.00038363965,0.54318017],"study_design_scores_gemma":[0.010979771,0.0028255738,0.021780247,0.00035670155,0.00014483974,0.0029525217,0.00039107195,0.1920401,0.06397812,0.67912996,0.023902474,0.0015186318],"about_ca_topic_score_codex":0.000017298147,"about_ca_topic_score_gemma":0.000002154991,"teacher_disagreement_score":0.6742301,"about_ca_system_score_codex":0.00013322677,"about_ca_system_score_gemma":0.00013181994,"threshold_uncertainty_score":0.3851408},"labels":[],"label_agreement":null},{"id":"W1989811697","doi":"10.1109/iccsa.2010.35","title":"I/O-Efficient Rectangular Segment Search","year":2010,"lang":"en","type":"article","venue":"","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 New Brunswick","funders":"","keywords":"Combinatorics; Set (abstract data type); Space (punctuation); Line (geometry); Computer science; Range (aeronautics); Binary logarithm; Discrete mathematics; Algorithm; Mathematics; Geometry; Programming language","score_opus":0.012642325668822138,"score_gpt":0.255732438583888,"score_spread":0.24309011291506585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989811697","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.27283075,0.000011071815,0.7183777,0.0008724897,0.0005146699,0.00006485357,2.245976e-7,0.00008746543,0.0072407816],"genre_scores_gemma":[0.830652,5.0354384e-7,0.16780306,0.0002483275,0.000095253745,0.0000043447667,0.0000017920393,0.0000020101163,0.0011927359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993222,0.000019502619,0.00008588474,0.00019314644,0.0002504316,0.00012886398],"domain_scores_gemma":[0.9995602,0.000036055702,0.000012012241,0.00024534558,0.00007918933,0.00006721153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029354545,0.000049849736,0.000041234245,0.00008087904,0.00008965362,0.000085970314,0.0002672993,0.00002520874,0.00013839366],"category_scores_gemma":[0.000016292759,0.000042733158,0.000026626423,0.00032296102,0.00001173026,0.000051873496,0.00010790588,0.00009965962,0.0001870035],"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.0000021073365,0.00012812034,0.0000986308,0.000003840441,0.000007642797,0.000007351987,0.00035184968,0.05033571,0.12169223,0.66975844,0.0017326204,0.15588145],"study_design_scores_gemma":[0.00012089861,0.000031218944,0.001770535,0.0000011192359,8.7003355e-7,0.00001822913,0.000008111936,0.93991077,0.047602557,0.0012117969,0.009227527,0.00009634027],"about_ca_topic_score_codex":0.000007862907,"about_ca_topic_score_gemma":0.000005800695,"teacher_disagreement_score":0.88957506,"about_ca_system_score_codex":0.000010536658,"about_ca_system_score_gemma":0.0000538682,"threshold_uncertainty_score":0.2403614},"labels":[],"label_agreement":null},{"id":"W1990097285","doi":"10.1007/s00453-005-1204-8","title":"A Dynamic Dictionary for Priced Information withApplication","year":2005,"lang":"en","type":"article","venue":"Algorithmica","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":"Theory of computation; Computer science; Set (abstract data type); Element (criminal law); Function (biology); Algorithm; Dynamic programming; Line (geometry); Mathematical optimization; Mathematics; Programming language","score_opus":0.00443896283111874,"score_gpt":0.23127863551334263,"score_spread":0.22683967268222388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990097285","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.0018583878,0.000039782393,0.99371177,0.0031301323,0.00016224124,0.00033959973,0.000007820196,0.000157733,0.0005925596],"genre_scores_gemma":[0.31449246,0.0000061818505,0.6839761,0.00077072624,0.0001439379,0.00019392036,0.0001788996,0.000004098448,0.00023363806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999366,0.000010633974,0.00019022905,0.00015190686,0.00015963386,0.00012160548],"domain_scores_gemma":[0.99947554,0.000058309473,0.000084353596,0.00018381934,0.00015424092,0.000043748605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013781947,0.00007325332,0.00006024177,0.00012522213,0.00013978095,0.00008333025,0.00022113555,0.000038863756,0.000005806462],"category_scores_gemma":[0.00001981126,0.00007525904,0.000038001857,0.00030667044,0.000009473295,0.0013748263,0.000040951043,0.000042183292,0.00010483952],"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.000006722721,0.000040282688,0.000003825831,0.0000070686533,0.000010091289,6.4458035e-8,0.00016830635,0.0071152537,0.00048666698,0.047158863,0.002317912,0.94268495],"study_design_scores_gemma":[0.000282521,0.000041073643,0.0010474481,0.0000023027312,0.000003377597,0.000010063619,0.000005203301,0.8420659,0.0009384344,0.0035818208,0.15193315,0.000088730405],"about_ca_topic_score_codex":0.0000018718882,"about_ca_topic_score_gemma":0.0000013710803,"teacher_disagreement_score":0.9425962,"about_ca_system_score_codex":0.000067650464,"about_ca_system_score_gemma":0.000057299312,"threshold_uncertainty_score":0.30689746},"labels":[],"label_agreement":null},{"id":"W1990498982","doi":"10.4153/cmb-2009-046-2","title":"Covering Discs in Minkowski Planes","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Homothetic transformation; Minkowski space; Combinatorics; Regular polygon; Simple (philosophy); Lemma (botany); Mathematical proof; Unit (ring theory); Inscribed figure; Cover (algebra); Geometry; Unit circle; Pure mathematics","score_opus":0.007491105220760263,"score_gpt":0.2053484224211864,"score_spread":0.19785731720042612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990498982","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.1458847,0.00022733201,0.68147874,0.078171104,0.00031271114,0.00047899192,0.000009220181,0.00016236008,0.09327482],"genre_scores_gemma":[0.975654,0.0000016455296,0.021525886,0.0018715062,0.000053028823,0.0000035043072,0.0000059774065,0.0000032441008,0.00088119565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925417,0.000022635937,0.0001691329,0.00018047223,0.00012978278,0.0002438351],"domain_scores_gemma":[0.99947214,0.0000878576,0.000020422334,0.00017516843,0.000019087809,0.00022530102],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017247818,0.00008097561,0.00010610986,0.00016655179,0.000054453067,0.000098635384,0.0002702637,0.000042022326,0.0005818343],"category_scores_gemma":[0.000107878004,0.000079224505,0.00002545799,0.00024054162,0.000012022654,0.00006254437,0.000017208875,0.00007846791,0.0017404367],"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.0000019297859,0.000046712852,0.00004152243,0.000016491438,0.0000028575023,0.00011697034,0.0003923812,0.0014535093,0.00011056479,0.9632259,0.008848779,0.025742378],"study_design_scores_gemma":[0.0007257993,0.00015949005,0.011094571,0.00014774535,0.000006018594,0.00018111314,0.000060973904,0.12991205,0.00078769337,0.65245974,0.20374541,0.00071940443],"about_ca_topic_score_codex":0.00014293847,"about_ca_topic_score_gemma":0.0006783903,"teacher_disagreement_score":0.8297693,"about_ca_system_score_codex":0.00007598754,"about_ca_system_score_gemma":0.00011329277,"threshold_uncertainty_score":0.99903685},"labels":[],"label_agreement":null},{"id":"W1990570114","doi":"10.1111/j.1467-8659.2008.01288.x","title":"Motorcycle Graphs: Canonical Quad Mesh Partitioning","year":2008,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polygon mesh; Quadrilateral; Computer science; Volume mesh; T-vertices; Graph; Mathematics; Mesh generation; Algorithm; Theoretical computer science; Computer graphics (images); Finite element method","score_opus":0.022174387345186848,"score_gpt":0.2382703697498122,"score_spread":0.21609598240462535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990570114","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.078106046,0.00021169437,0.91830254,0.0012413143,0.0012246969,0.00015427484,0.0000031482562,0.0003191694,0.00043713217],"genre_scores_gemma":[0.94383293,0.00007737064,0.053661056,0.0020239165,0.00023116716,0.00002647598,0.000029416437,0.000013136426,0.00010451521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981243,0.00009001535,0.0003567995,0.0005269287,0.00045080116,0.00045112587],"domain_scores_gemma":[0.9988684,0.00012780432,0.00010504553,0.00051381433,0.00018876356,0.00019616455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022869546,0.00020130392,0.00020396448,0.00033611513,0.00064586074,0.00014468703,0.00068785873,0.000098267315,0.00001197003],"category_scores_gemma":[0.0000123836935,0.00020893624,0.00019177397,0.0011275668,0.00011136747,0.0006531923,0.00030743022,0.0002214442,0.00005546988],"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.0000058140245,0.00013733898,0.007345057,0.0000087949575,0.000042640593,0.000057667905,0.0003014635,0.0029238435,0.000079392725,0.9603597,0.018934458,0.0098038325],"study_design_scores_gemma":[0.0007532618,0.0002873357,0.032689415,0.000030426274,0.000009847436,0.0003415177,0.000008301178,0.8717963,0.00076114264,0.061732724,0.03101569,0.00057404913],"about_ca_topic_score_codex":0.000037204663,"about_ca_topic_score_gemma":0.00003156556,"teacher_disagreement_score":0.898627,"about_ca_system_score_codex":0.000029428023,"about_ca_system_score_gemma":0.00014866471,"threshold_uncertainty_score":0.8520172},"labels":[],"label_agreement":null},{"id":"W1991315286","doi":"10.1016/j.jda.2008.07.007","title":"Light orthogonal networks with constant geometric dilation","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Spatial network; Dilation (metric space); Spanner; Euclidean geometry; Constant (computer programming); Plane (geometry); Euclidean distance; Graph; Geometry; Computer science","score_opus":0.01306487721437632,"score_gpt":0.22650260851156517,"score_spread":0.21343773129718885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991315286","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.032303844,0.0010197512,0.96467674,0.0008322446,0.0004748486,0.00007120743,0.0000014291466,0.000021635655,0.00059828017],"genre_scores_gemma":[0.8797886,0.00019074694,0.11922866,0.00013539396,0.0005223758,0.000001553907,0.000004760668,0.000007703171,0.000120228804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984754,0.000061391955,0.0004403872,0.00017158873,0.0006530933,0.00019816711],"domain_scores_gemma":[0.99867684,0.00011394834,0.00043637087,0.0001630899,0.00045814944,0.00015162467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037092326,0.00013155882,0.00021438183,0.00044513275,0.00019130901,0.00008304257,0.00030888812,0.000050741775,0.000016042968],"category_scores_gemma":[0.00003824966,0.00009370355,0.00010139703,0.0014433314,0.000033999946,0.00086172257,0.000054254975,0.00021668282,0.000005323465],"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.0003006563,0.0005045652,0.012698671,0.000028717946,0.0005397906,0.0017300592,0.0011104614,0.7098727,0.001081351,0.029869663,0.009875281,0.23238806],"study_design_scores_gemma":[0.003227482,0.0022772239,0.075080894,0.00013121605,0.000077089804,0.009454312,0.000054432316,0.8920151,0.0022959518,0.0028956481,0.011769998,0.0007206682],"about_ca_topic_score_codex":0.0000015847104,"about_ca_topic_score_gemma":0.0000012434357,"teacher_disagreement_score":0.8474847,"about_ca_system_score_codex":0.000047700345,"about_ca_system_score_gemma":0.00021532836,"threshold_uncertainty_score":0.38211197},"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":"W1992110345","doi":"10.1016/j.tcs.2011.04.048","title":"Advances in discrete geometry","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"Université du Québec à Montréal","funders":"","keywords":"Geometry; Discrete geometry; Mathematics; Computer science","score_opus":0.012261837496204514,"score_gpt":0.25486463940089926,"score_spread":0.24260280190469474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992110345","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.0258557,0.00013741419,0.9591692,0.00016612587,0.0005915469,0.00009606561,4.174111e-7,0.00010423737,0.013879269],"genre_scores_gemma":[0.77886915,0.000018778728,0.2207923,0.00024312342,0.000059724884,0.0000050758813,4.8387005e-7,0.0000029696891,0.000008433337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816805,0.00006826365,0.00024564355,0.00058502814,0.00050912215,0.0004238791],"domain_scores_gemma":[0.999097,0.00011367887,0.000048270027,0.00046214086,0.0001082526,0.00017068087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010577806,0.00012966729,0.00013710475,0.00043840517,0.00020619704,0.00014978614,0.001625929,0.00003243534,0.00006163653],"category_scores_gemma":[0.00006442318,0.00010984949,0.00003908874,0.0025013178,0.00091520563,0.0017610817,0.0006140717,0.00013693771,0.000075121236],"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.0000044771664,0.00003980122,0.00024805265,0.0000023672064,4.8963517e-7,0.000009075025,0.00030861533,0.00039440542,0.00007518406,0.8918911,0.000004507908,0.10702193],"study_design_scores_gemma":[0.00019715435,0.00016539513,0.0109492205,0.000018568946,0.0000011658584,0.00002682005,0.0000045759093,0.47233748,0.0043858127,0.5113877,0.0003042482,0.00022184344],"about_ca_topic_score_codex":0.000002830612,"about_ca_topic_score_gemma":0.0000014330575,"teacher_disagreement_score":0.75301343,"about_ca_system_score_codex":0.00004229149,"about_ca_system_score_gemma":0.00008967358,"threshold_uncertainty_score":0.44795322},"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":"W1992739211","doi":"10.1016/j.jctb.2003.05.001","title":"Arrangements, circular arrangements and the crossing number of C7×C","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"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 Prince Edward Island","funders":"","keywords":"Conjecture; Crossing number (knot theory); Cartesian product; Combinatorics; Mathematics; Generalization; Level crossing; Planar; Product (mathematics); Geometry; Mathematical analysis; Computer science; Intersection (aeronautics); Engineering","score_opus":0.008694649643631898,"score_gpt":0.24731996633464864,"score_spread":0.23862531669101675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992739211","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.6284646,0.0015868318,0.35271022,0.0005526204,0.009895429,0.00024877666,0.0000015332905,0.000016985749,0.0065230466],"genre_scores_gemma":[0.99482584,0.00003686445,0.0047021224,0.000119798606,0.00019046389,0.0000016649045,2.9258996e-7,0.000004952925,0.000117988035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985684,0.00043367376,0.0004051967,0.00009755573,0.00038074647,0.00011442167],"domain_scores_gemma":[0.9988244,0.00023359068,0.00041602552,0.00017215635,0.00030366622,0.000050150724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022725272,0.00009446279,0.00022109,0.00006292478,0.00021856422,0.0002016662,0.00030627192,0.000034046592,0.000035817484],"category_scores_gemma":[0.00029182376,0.000066152556,0.000092700204,0.00026246448,0.00021428437,0.0006476469,0.000056044126,0.000116153824,0.0000017307547],"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.00019290054,0.000055381584,0.00030159138,0.000013211169,0.00007974564,0.0000044502103,0.0008911433,0.0001150176,0.00058833807,0.995483,0.00012841,0.002146808],"study_design_scores_gemma":[0.003280492,0.00010943646,0.00040845352,0.000031167452,0.000032278673,0.00014004823,0.00014947046,0.00009053555,0.005628148,0.96501184,0.025025588,0.00009256293],"about_ca_topic_score_codex":8.825205e-7,"about_ca_topic_score_gemma":7.834128e-8,"teacher_disagreement_score":0.3663613,"about_ca_system_score_codex":0.000020105643,"about_ca_system_score_gemma":0.00010586756,"threshold_uncertainty_score":0.2697623},"labels":[],"label_agreement":null},{"id":"W1992775084","doi":"10.1145/2614217.2633398","title":"PolyMerge","year":2014,"lang":"en","type":"article","venue":"","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 British Columbia","funders":"","keywords":"Computer science","score_opus":0.004875877417388413,"score_gpt":0.19914032615996594,"score_spread":0.19426444874257753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992775084","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.0035045757,0.000013179872,0.9422668,0.0009568221,0.00019456548,0.000011521011,2.7693838e-8,0.00008121136,0.05297125],"genre_scores_gemma":[0.92783886,5.376188e-7,0.068381794,0.0009308127,0.00007639191,0.0000011987034,8.10747e-7,8.260401e-7,0.0027687864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973834,0.000013555238,0.00004235795,0.00008345291,0.00007037837,0.000051947012],"domain_scores_gemma":[0.9998146,0.000024154784,0.000008475889,0.00011061,0.000016864937,0.000025245306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008105635,0.000022955703,0.000022175558,0.000032434822,0.000034119275,0.000033030625,0.00013925383,0.000008100481,0.000041005667],"category_scores_gemma":[0.000011998062,0.000019624256,0.000012241773,0.00014389175,0.0000028026575,0.00013164231,0.000035105786,0.000012764756,0.00016070479],"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":[1.2076974e-7,0.000005504077,0.00003150639,3.5206e-7,7.0108644e-7,7.69119e-8,0.000013460613,0.00026359342,0.0007127728,0.86548305,0.0019271767,0.13156167],"study_design_scores_gemma":[0.00014266817,0.000043786582,0.0061847647,0.0000010325226,6.95715e-7,0.0000064539763,0.0000013444978,0.7837075,0.013903699,0.03691219,0.15898907,0.00010680502],"about_ca_topic_score_codex":0.0000025746067,"about_ca_topic_score_gemma":0.0000010064227,"teacher_disagreement_score":0.9243343,"about_ca_system_score_codex":0.000002384575,"about_ca_system_score_gemma":0.000007452195,"threshold_uncertainty_score":0.20655885},"labels":[],"label_agreement":null},{"id":"W1993463637","doi":"10.1016/j.jcta.2012.03.011","title":"Piercing quasi-rectangles—On a problem of Danzer and Rogers","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","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":"Simon Fraser University","funders":"","keywords":"Rectangle; Square (algebra); Unit square; Combinatorics; Mathematics; Center (category theory); Unit (ring theory); Rotation (mathematics); Trajectory; Geometry; Physics; Crystallography","score_opus":0.00868938134234849,"score_gpt":0.2312529134461897,"score_spread":0.22256353210384122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993463637","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.86574143,0.0013392267,0.12390156,0.0005667694,0.0058263466,0.0001702401,0.000001630725,0.000025677184,0.0024271486],"genre_scores_gemma":[0.98886806,0.00002780819,0.010525299,0.00005242101,0.0004577881,0.0000012964855,3.5659718e-7,0.000005435891,0.00006152243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989292,0.0001889329,0.0003473076,0.00008097784,0.0003052306,0.00014835803],"domain_scores_gemma":[0.9989406,0.00027382493,0.00035795607,0.00011654923,0.00020562123,0.00010544805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014631491,0.00009473512,0.00021121433,0.0001548432,0.00007706736,0.000051244042,0.0002195958,0.000045278895,0.0000087445915],"category_scores_gemma":[0.000121601915,0.00007782915,0.000068220485,0.00026629036,0.00004666558,0.0009690243,0.00006660903,0.00012784502,0.0000011864311],"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.00022661591,0.00016551223,0.00022914015,0.00001646065,0.00003675878,0.0000025599666,0.0014288417,0.00013830305,0.002021767,0.98161006,0.00015784478,0.013966163],"study_design_scores_gemma":[0.0018701017,0.0027282177,0.0014706634,0.0001568207,0.00004307545,0.00034504003,0.0003704171,0.0003595868,0.034598764,0.94164306,0.016138341,0.00027591543],"about_ca_topic_score_codex":8.192689e-7,"about_ca_topic_score_gemma":1.03073006e-7,"teacher_disagreement_score":0.12312667,"about_ca_system_score_codex":0.00003020006,"about_ca_system_score_gemma":0.00007240921,"threshold_uncertainty_score":0.31737807},"labels":[],"label_agreement":null},{"id":"W1993464679","doi":"10.1016/j.jda.2006.03.004","title":"On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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":"Queen's University","funders":"","keywords":"Heuristics; Travelling salesman problem; Heuristic; Consistent heuristic; Mathematics; Null-move heuristic; Algorithm; Mathematical optimization; Probabilistic logic; Matching (statistics); Set (abstract data type); Hamiltonian (control theory); Combinatorics; Computer science; Search algorithm; Incremental heuristic search","score_opus":0.012738928510713957,"score_gpt":0.24941058678552908,"score_spread":0.23667165827481512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993464679","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.025446257,0.00018801261,0.97163665,0.0016973591,0.00056188094,0.00026963346,0.00003633871,0.000012315973,0.00015153941],"genre_scores_gemma":[0.67830664,0.0000067443657,0.32063657,0.00013599779,0.00057876075,0.000017612128,0.000010324813,0.00001410317,0.00029324426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984437,0.00007932357,0.0005754763,0.00017659701,0.00052080967,0.00020408374],"domain_scores_gemma":[0.99826366,0.0004656183,0.0005148775,0.00023172685,0.0004578073,0.00006631137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006867942,0.0001416856,0.0002362637,0.00017010457,0.00013210125,0.00009943222,0.0005244955,0.000046812802,0.000009047376],"category_scores_gemma":[0.00013509126,0.00009381625,0.00021891348,0.00034045853,0.00006052176,0.00023043832,0.000053115593,0.00015922669,0.0000022393906],"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.00016372382,0.0014785773,0.00031349942,0.00009994859,0.0002581569,0.00013425124,0.00069887924,0.071622856,0.001809543,0.40836132,0.02250918,0.49255008],"study_design_scores_gemma":[0.0015920801,0.0022474711,0.013209831,0.0001304614,0.000110620465,0.00027897538,0.00006075991,0.7602439,0.0032631168,0.21729878,0.0012255907,0.00033840616],"about_ca_topic_score_codex":0.000017815983,"about_ca_topic_score_gemma":0.0000039643014,"teacher_disagreement_score":0.68862104,"about_ca_system_score_codex":0.000052964133,"about_ca_system_score_gemma":0.00015661714,"threshold_uncertainty_score":0.38257155},"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":"W199381118","doi":"","title":"An interactive modification data structure for 3D surfaces","year":2003,"lang":"en","type":"article","venue":"Machine Graphics & Vision International Journal archive","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 Manitoba","funders":"","keywords":"Computer science; Polyhedron; Data structure; Vertex (graph theory); Computer graphics (images); Limiting; Zoom; Theoretical computer science; Algorithm; Mathematics; Programming language; Geometry; Graph","score_opus":0.027336378612840242,"score_gpt":0.3535276807838417,"score_spread":0.3261913021710015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W199381118","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.024105588,0.000119750795,0.97175384,0.0012586687,0.0019310013,0.00019334194,0.000388517,0.00004043624,0.00020888263],"genre_scores_gemma":[0.72601074,0.000077435725,0.27243453,0.00044927542,0.00026169844,0.000005561853,0.0007220846,0.000011632394,0.000027002137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978857,0.00027322446,0.00043060878,0.0005273935,0.00068537565,0.00019772309],"domain_scores_gemma":[0.99788934,0.00038583775,0.00034798827,0.0005408172,0.0006739169,0.00016207765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007697056,0.00018741365,0.00014796552,0.00054536277,0.0003712973,0.00071716885,0.0021368838,0.000049949118,0.00004231867],"category_scores_gemma":[0.0003043462,0.00016323235,0.00008734154,0.00029329545,0.000044302764,0.0016207107,0.00021095875,0.0003718301,0.000004929449],"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.00029671355,0.00064328575,0.0012880354,0.000013134994,0.00039437323,0.00002715611,0.001814806,0.058754787,0.02064639,0.71603715,0.003944429,0.19613974],"study_design_scores_gemma":[0.00062202965,0.00018429544,0.0029627942,0.000018886944,0.000011272503,0.00020626877,0.00002445721,0.78176457,0.0005825905,0.18628734,0.027155844,0.00017965728],"about_ca_topic_score_codex":0.00001680053,"about_ca_topic_score_gemma":0.000047173013,"teacher_disagreement_score":0.72300977,"about_ca_system_score_codex":0.000045945304,"about_ca_system_score_gemma":0.00014016585,"threshold_uncertainty_score":0.69156754},"labels":[],"label_agreement":null},{"id":"W1993831518","doi":"10.1007/s00371-002-0197-4","title":"Shrinkwrap: An efficient adaptive algorithm for triangulating an iso-surface","year":2004,"lang":"en","type":"article","venue":"The Visual Computer","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":35,"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":"Triangulation; Algorithm; Surface (topology); Triangle mesh; Surface triangulation; Mathematics; Curvature; Delaunay triangulation; Invariant (physics); Bowyer–Watson algorithm; Computer graphics; Topology (electrical circuits); Computer science; Polygon mesh; Geometry; Combinatorics; Artificial intelligence","score_opus":0.03307056687020102,"score_gpt":0.3142576831164072,"score_spread":0.2811871162462062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993831518","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.22404738,0.00003521922,0.77455705,0.0002551171,0.000546592,0.00037479238,0.000004054553,0.00015440585,0.000025383448],"genre_scores_gemma":[0.50047785,4.1225255e-7,0.49844092,0.0004371969,0.0005793678,0.000010995615,0.00001734556,0.0000102001895,0.000025723582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985118,0.00013971489,0.00025882985,0.00047188325,0.00031659572,0.00030115765],"domain_scores_gemma":[0.9990477,0.0001657924,0.000105493324,0.00037000322,0.00018785884,0.00012316435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065422046,0.00017971656,0.00016215439,0.00007810496,0.0004393218,0.00027505017,0.00065525173,0.00005354943,0.0000039490224],"category_scores_gemma":[0.000007607914,0.00013790552,0.000087112196,0.00043899842,0.000039515046,0.00041300379,0.00018135137,0.000112065994,0.00002151868],"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.0000134649335,0.00017665623,0.0000011499504,0.0000016564127,0.00001373122,0.0000017562372,0.0011226403,0.7101864,0.00029765605,0.024528062,0.000028080638,0.26362872],"study_design_scores_gemma":[0.0009130252,0.00112158,0.0005072445,0.0000106420375,0.000007741576,0.000016554524,0.000037605307,0.9904161,0.0018593606,0.004620363,0.00028623134,0.00020351411],"about_ca_topic_score_codex":0.000025653742,"about_ca_topic_score_gemma":0.000004994455,"teacher_disagreement_score":0.28022972,"about_ca_system_score_codex":0.000060099566,"about_ca_system_score_gemma":0.00010094484,"threshold_uncertainty_score":0.5623624},"labels":[],"label_agreement":null},{"id":"W1994065834","doi":"10.1007/978-3-540-73951-7_27","title":"On a Family of Strong Geometric Spanners That Admit Local Routing Strategies","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Lambda; Combinatorics; Graph; Degree (music); Unit disk graph; Mathematics; Discrete mathematics; Physics; Computer science; Quantum mechanics","score_opus":0.03851076679963982,"score_gpt":0.27603752910532187,"score_spread":0.23752676230568204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994065834","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.0009956378,0.00043559435,0.98913395,0.000100106125,0.0013885071,0.00027715685,0.00000499685,0.00009406673,0.00757],"genre_scores_gemma":[0.85236603,0.000017815988,0.1467388,0.00049181306,0.00024031344,0.0000026275036,0.0000087627295,0.000019920266,0.00011389696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958462,0.000035509645,0.0006011363,0.0012514801,0.0016366194,0.000629049],"domain_scores_gemma":[0.99721134,0.0010176951,0.00044718705,0.0008209412,0.00033711383,0.00016572609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012766116,0.0004875221,0.0005152263,0.0027335312,0.00022241687,0.00041594857,0.0020245067,0.00029268625,0.000012999142],"category_scores_gemma":[0.0000983962,0.00046109155,0.00016242795,0.0019670015,0.0005101283,0.00072520156,0.0006529747,0.0007038962,0.000020213154],"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.0000073049505,0.000021774085,0.000009858899,0.000018697694,0.000008807548,0.00002591542,0.0001573874,0.43869534,0.00004116052,0.104967415,0.0000078105095,0.45603853],"study_design_scores_gemma":[0.00041366386,0.00059031806,0.0006263365,0.00045710243,0.000012006807,0.00003911361,0.000003913249,0.8827401,0.0033968608,0.1106248,0.00032190414,0.00077387557],"about_ca_topic_score_codex":0.000036339654,"about_ca_topic_score_gemma":0.000037696158,"teacher_disagreement_score":0.8513704,"about_ca_system_score_codex":0.00031792166,"about_ca_system_score_gemma":0.0009329476,"threshold_uncertainty_score":0.99978405},"labels":[],"label_agreement":null},{"id":"W1994213977","doi":"10.1145/2261250.2261293","title":"Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set","year":2012,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"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":"Combinatorics; Upper and lower bounds; Mathematics; Dimension (graph theory); Space (punctuation); Set (abstract data type); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.043986439300049335,"score_gpt":0.29176955417130496,"score_spread":0.24778311487125562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994213977","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.14910014,0.00004568934,0.8493506,0.00053938344,0.00009200731,0.0003237066,0.0000073253996,0.000029912542,0.00051127427],"genre_scores_gemma":[0.5816133,0.0000019558454,0.41805094,0.000085570646,0.000060861323,0.000035189674,0.000007299722,0.0000034996608,0.00014135921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993379,0.00002391183,0.00013796422,0.00016530832,0.00019611843,0.00013880552],"domain_scores_gemma":[0.9994511,0.00011455424,0.000059390713,0.00019059016,0.00010283296,0.000081543476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039982508,0.00007050434,0.000095421135,0.000109403016,0.00006181049,0.00004840803,0.00017269996,0.000023870823,0.0000031490163],"category_scores_gemma":[0.00006722452,0.000055788285,0.000015603422,0.00022907268,0.000012391682,0.00042013082,0.00012334745,0.000027083406,0.0000014802469],"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.00038095596,0.00019761898,0.0057739406,0.0001793067,0.00013363724,0.0000016652257,0.012939087,0.003844882,0.014992599,0.85697937,0.002888832,0.1016881],"study_design_scores_gemma":[0.005393673,0.0029093705,0.09019776,0.00016086921,0.0000637359,0.00013065993,0.0009613093,0.46619993,0.39241785,0.024972511,0.0154457195,0.0011466024],"about_ca_topic_score_codex":0.000011346184,"about_ca_topic_score_gemma":0.00001336475,"teacher_disagreement_score":0.8320069,"about_ca_system_score_codex":0.000020169091,"about_ca_system_score_gemma":0.000021691945,"threshold_uncertainty_score":0.22749802},"labels":[],"label_agreement":null},{"id":"W1995123299","doi":"10.1007/s00454-001-0045-8","title":"Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes","year":2001,"lang":"en","type":"article","venue":"Discrete & 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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Polytope; Mathematics; Triangulation; Point set triangulation; Convex polytope; Regular polygon; Tetrahedron; Minimum-weight triangulation; Pitteway triangulation; Delaunay triangulation; Discrete mathematics; Convex set; Bowyer–Watson algorithm; Convex optimization; Geometry","score_opus":0.022846532477707314,"score_gpt":0.2893487290770637,"score_spread":0.2665021965993564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995123299","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.09772447,0.0001364587,0.89924115,0.000954901,0.00038838564,0.0005074906,0.00005799417,0.000098841556,0.00089031574],"genre_scores_gemma":[0.86603934,0.0000052158957,0.13263424,0.00026803155,0.00026208887,0.00006240616,0.0005022358,0.00001316919,0.00021329639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807155,0.000068279616,0.0006263599,0.00043920122,0.00052235916,0.00027224675],"domain_scores_gemma":[0.9980837,0.00066226086,0.00031748106,0.00027147992,0.0005588109,0.00010625573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040891318,0.00019615638,0.00029494867,0.000578649,0.0002441299,0.00011614487,0.00044889978,0.00009113154,0.000056045843],"category_scores_gemma":[0.00021392343,0.00020470115,0.00019661797,0.0015030175,0.000066090804,0.0006283848,0.00010284049,0.00008205815,0.000019338791],"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.00011227724,0.00023379693,0.001200652,0.000067831235,0.00010647586,0.0000024368237,0.0004779076,0.4309294,0.001454568,0.49419594,0.0016696265,0.0695491],"study_design_scores_gemma":[0.0012551368,0.00017757792,0.022044102,0.0000186681,0.000023537463,0.000021976984,0.000054076132,0.88784647,0.0008578839,0.084147826,0.0032662195,0.00028649898],"about_ca_topic_score_codex":0.000009269034,"about_ca_topic_score_gemma":0.0000024511887,"teacher_disagreement_score":0.76831484,"about_ca_system_score_codex":0.00004650402,"about_ca_system_score_gemma":0.0001737282,"threshold_uncertainty_score":0.8347471},"labels":[],"label_agreement":null},{"id":"W1995705554","doi":"10.1006/jctb.2001.2065","title":"On Essential and Inessential Polygons in Embedded Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","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":"Rollins College","keywords":"Contractible space; Combinatorics; Embedding; Pairwise comparison; Mathematics; Disjoint sets; Polygon (computer graphics); Bounded function; Simple (philosophy); Graph; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0069220900155023725,"score_gpt":0.22165195834114562,"score_spread":0.21472986832564325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995705554","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.9541173,0.0004723979,0.033279195,0.0009916608,0.009490652,0.00010358666,0.000001163447,0.000024595338,0.001519425],"genre_scores_gemma":[0.9983625,0.000056988585,0.0010208924,0.00008560828,0.000345814,0.000001187897,4.7774677e-7,0.0000049309365,0.00012163088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887854,0.00019961548,0.00035185766,0.0001296536,0.00030432735,0.00013602928],"domain_scores_gemma":[0.999223,0.0002305173,0.00020406893,0.00013199962,0.00013246301,0.00007793523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055395195,0.00010656885,0.00019192605,0.00034232638,0.00008761221,0.0001275637,0.0002823681,0.00005504555,0.00005926113],"category_scores_gemma":[0.00017646248,0.00009534636,0.00006569939,0.0004589628,0.000057977206,0.0007627479,0.00006796704,0.00018696391,0.0000037560687],"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.0001789725,0.00016065768,0.000028688872,0.000004614543,0.0000176368,0.000039926406,0.0005392078,0.00040157238,0.000979755,0.99335253,0.00051236677,0.0037840821],"study_design_scores_gemma":[0.0016487278,0.0005687267,0.00051126996,0.000029501973,0.000008657291,0.00016105785,0.00004664101,0.0014815726,0.004029496,0.99038976,0.0009913427,0.00013327082],"about_ca_topic_score_codex":8.54593e-7,"about_ca_topic_score_gemma":7.439204e-7,"teacher_disagreement_score":0.044245146,"about_ca_system_score_codex":0.000020595577,"about_ca_system_score_gemma":0.00003506724,"threshold_uncertainty_score":0.38881117},"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":"W1996052195","doi":"10.1006/jcta.2000.3143","title":"New Codes from Old; A New Geometric Construction","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","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":"Royal Military College of Canada; Western University","funders":"","keywords":"Computer science; Engineering drawing; Mathematics; Engineering","score_opus":0.0095552161052839,"score_gpt":0.22841441317189198,"score_spread":0.21885919706660809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996052195","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.1013573,0.0007842747,0.88407207,0.0009752419,0.011859794,0.0000714384,0.000001463653,0.000041639832,0.0008368023],"genre_scores_gemma":[0.7803009,0.00045045538,0.20739968,0.00033281208,0.007959162,0.0000013069921,0.00000716076,0.00001986031,0.0035286313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855024,0.00016071873,0.00047710416,0.00016446895,0.00047906462,0.00016842161],"domain_scores_gemma":[0.9984379,0.00035829755,0.00045029246,0.00021356982,0.0003022247,0.0002377137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057966425,0.00013858314,0.00027210143,0.00039205005,0.00012160673,0.00025780208,0.0005396232,0.00007907986,0.00022334159],"category_scores_gemma":[0.00032849272,0.00012536359,0.00013195515,0.0012348929,0.00003416612,0.0013954717,0.00008860028,0.00019453197,0.000015859348],"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.0003819956,0.000047115787,0.00023233265,0.0000017748785,0.00007407764,0.000034515182,0.00029108394,0.0006051989,0.00065913814,0.85914814,0.0047810394,0.13374358],"study_design_scores_gemma":[0.0015312361,0.00045870378,0.0009133795,0.000023372952,0.000025145337,0.00043906106,0.00006655983,0.00015359987,0.0037555024,0.9291226,0.06336414,0.00014668939],"about_ca_topic_score_codex":0.000038239214,"about_ca_topic_score_gemma":0.0000017137135,"teacher_disagreement_score":0.67894363,"about_ca_system_score_codex":0.00006948077,"about_ca_system_score_gemma":0.0004723312,"threshold_uncertainty_score":0.5112179},"labels":[],"label_agreement":null},{"id":"W1996514690","doi":"10.1016/j.dam.2003.11.013","title":"The geometry of carpentry and joinery","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":"Carpentry; Mathematics; Geometry; Combinatorics; Engineering; Civil engineering","score_opus":0.008359718409636167,"score_gpt":0.22227404046640922,"score_spread":0.21391432205677305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996514690","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.10067543,0.00026364974,0.89329165,0.00042481,0.0000860188,0.00016089267,0.0000019061877,0.00003823272,0.0050574294],"genre_scores_gemma":[0.8626223,0.000045992976,0.13716419,0.00006212259,0.00003183465,0.000012208572,0.0000029504072,0.000005184951,0.000053182463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993198,0.0000048001943,0.0002125776,0.0001324765,0.00021232251,0.00011801959],"domain_scores_gemma":[0.9993923,0.00014852844,0.000101497186,0.0002802218,0.000037832036,0.000039655602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022326343,0.000079108126,0.00010764086,0.000049925493,0.00013225243,0.000071292816,0.00025644217,0.000027466223,0.0000013838121],"category_scores_gemma":[0.000023025053,0.0000542138,0.00002830595,0.00027507334,0.0000583759,0.00008127379,0.00014604242,0.000054646905,0.000006997537],"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.0000013498749,0.000021513823,0.0000043568966,0.00003500658,0.000011439138,4.5677797e-7,0.00045338875,0.0012363717,0.0031773539,0.9884675,0.000036319987,0.0065549277],"study_design_scores_gemma":[0.0009596831,0.00007634317,0.0012744182,0.000050719016,0.00002905373,0.00003974386,0.0006042805,0.021332214,0.060369093,0.91306597,0.0018614428,0.00033703688],"about_ca_topic_score_codex":0.0000022801594,"about_ca_topic_score_gemma":0.0000018706131,"teacher_disagreement_score":0.7619469,"about_ca_system_score_codex":0.00001171828,"about_ca_system_score_gemma":0.000037692076,"threshold_uncertainty_score":0.22107746},"labels":[],"label_agreement":null},{"id":"W1996923782","doi":"10.1016/j.jda.2010.12.002","title":"On the number of shortest descending paths on the surface of a convex terrain","year":2010,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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":"Terrain; Regular polygon; Mathematics; Surface (topology); Combinatorics; Computer science; Geometry; Geography; Cartography","score_opus":0.016868138799955253,"score_gpt":0.2749265895926963,"score_spread":0.25805845079274103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996923782","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.8799485,0.000028273134,0.11346004,0.0045987447,0.0007772321,0.000113934795,0.000008428424,0.000006008027,0.0010588437],"genre_scores_gemma":[0.9868428,0.000008450622,0.012703449,0.00022255316,0.00015007526,8.900472e-7,7.772487e-7,0.0000055048,0.000065468696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986814,0.0001247289,0.00040998036,0.00011072022,0.0005490651,0.00012406237],"domain_scores_gemma":[0.99805033,0.00090921397,0.00048010543,0.00027914066,0.00022809068,0.000053133404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012313118,0.00010170554,0.0001817333,0.000059482823,0.00009898957,0.000057054593,0.0006084563,0.000041272593,0.00006774898],"category_scores_gemma":[0.0002469986,0.00005245344,0.00013770134,0.0003159139,0.00007847511,0.0001837161,0.000067579356,0.00035890978,0.000006068832],"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.00015217693,0.0007118726,0.0037489303,0.000038293663,0.00039096372,0.00005258275,0.006117199,0.023160653,0.14934729,0.74136865,0.0076780696,0.06723332],"study_design_scores_gemma":[0.0017703259,0.001884933,0.034380432,0.000553711,0.00009828135,0.0005810286,0.001003417,0.64758205,0.22422683,0.08467245,0.0026132744,0.0006332484],"about_ca_topic_score_codex":0.000007680881,"about_ca_topic_score_gemma":0.0000023829296,"teacher_disagreement_score":0.6566962,"about_ca_system_score_codex":0.000013709355,"about_ca_system_score_gemma":0.000091926224,"threshold_uncertainty_score":0.21389893},"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":"W1998526928","doi":"10.1007/s00454-006-1278-3","title":"Lines Tangent to Four Triangles in Three-Dimensional Space","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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; National Science Foundation","keywords":"Tangent; Mathematics; Disjoint sets; General position; Combinatorics; Tangent cone; Tangent space; Tangent vector; Position (finance); Geometry; Space (punctuation); Computer science","score_opus":0.02448682600550685,"score_gpt":0.2819633764569991,"score_spread":0.25747655045149226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998526928","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.34671363,0.00020617762,0.649609,0.0022122324,0.00053376186,0.00026882775,0.000013300288,0.000094367555,0.00034867288],"genre_scores_gemma":[0.8004864,0.000001343604,0.19775176,0.0011256263,0.00031089206,0.000016783943,0.000098553624,0.000015304535,0.00019337957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971504,0.00006564245,0.00061176927,0.0006870688,0.00097268063,0.00051242404],"domain_scores_gemma":[0.9982348,0.00069116073,0.00014146093,0.00030933638,0.00033138474,0.00029184335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011642523,0.000272436,0.0002796589,0.0013005921,0.00017880752,0.00016426107,0.00058370654,0.000098188466,0.000054782733],"category_scores_gemma":[0.00022995559,0.00027511365,0.00013139442,0.003128594,0.00003703064,0.0004682919,0.0003193169,0.00020171888,0.0001864572],"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.00008198932,0.00014736966,0.0044238335,0.00001509114,0.00003341526,0.00009198392,0.00020693045,0.88670135,0.00034771572,0.06780082,0.001170666,0.038978852],"study_design_scores_gemma":[0.0014328236,0.0002540374,0.4324212,0.000073242874,0.000010266517,0.000086110245,0.0000394955,0.5183375,0.00074101554,0.03994992,0.0059391162,0.00071527594],"about_ca_topic_score_codex":0.000056839952,"about_ca_topic_score_gemma":0.00025476492,"teacher_disagreement_score":0.45377272,"about_ca_system_score_codex":0.0001509602,"about_ca_system_score_gemma":0.00018253064,"threshold_uncertainty_score":0.9999701},"labels":[],"label_agreement":null},{"id":"W1998583115","doi":"10.1016/s0166-218x(00)00270-5","title":"On the visibility graph of convex translates","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Regular polygon; Visibility; Graph; Visibility graph; Geometry; Geography","score_opus":0.01896582713069101,"score_gpt":0.24632823553742678,"score_spread":0.22736240840673577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998583115","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.14130975,0.000021921403,0.8454682,0.0005691391,0.000046172685,0.00022853489,0.0000024287656,0.000044862776,0.012308969],"genre_scores_gemma":[0.9550983,0.000008243768,0.044613663,0.00019218854,0.000016417895,0.000019200348,0.0000040754703,0.0000049543833,0.00004297363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991835,0.000015838144,0.0002462513,0.00017249613,0.00026467303,0.00011728606],"domain_scores_gemma":[0.99895453,0.00043370633,0.000099339006,0.00043632207,0.000044316912,0.00003180546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003466902,0.00009783077,0.00013841219,0.000053508367,0.00008166463,0.000039842023,0.0003993054,0.00003153218,0.00003915778],"category_scores_gemma":[0.000029135472,0.00006346665,0.000064608175,0.0003998659,0.000052530173,0.000063341125,0.00004033855,0.00007030881,0.000026168778],"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.0000048259762,0.00007251327,0.00000468043,0.000022998734,0.000012841152,4.5902377e-7,0.00090626173,0.00080525514,0.0028953538,0.9908493,0.000111174726,0.0043143225],"study_design_scores_gemma":[0.00020335961,0.000049255854,0.0001756334,0.000016462222,0.000009931992,0.0000041519406,0.00011392815,0.069536716,0.019497894,0.90993905,0.0003303958,0.00012324612],"about_ca_topic_score_codex":0.0000010400433,"about_ca_topic_score_gemma":9.756945e-7,"teacher_disagreement_score":0.81378853,"about_ca_system_score_codex":0.000006330349,"about_ca_system_score_gemma":0.00001931748,"threshold_uncertainty_score":0.25880948},"labels":[],"label_agreement":null},{"id":"W1998920351","doi":"10.1142/s0218195912500094","title":"ON THE DISCRETE UNIT DISK COVER PROBLEM","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":49,"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 New Brunswick; University of Waterloo","funders":"","keywords":"Cover (algebra); Unit disk; Mathematics; Cardinality (data modeling); Combinatorics; Set cover problem; Constant (computer programming); Unit (ring theory); Set (abstract data type); Unit disk graph; Plane (geometry); Approximation algorithm; Point (geometry); Discrete mathematics; Geometry; Computer science","score_opus":0.018088765245865952,"score_gpt":0.2930174984656583,"score_spread":0.27492873321979233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998920351","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.008441183,0.00036530697,0.97998446,0.0065263608,0.00072651135,0.00037101857,0.000030733663,0.00004380356,0.0035106344],"genre_scores_gemma":[0.9422493,0.000031233118,0.05392894,0.0018998306,0.0013440604,0.000102026905,0.000059498398,0.000015472373,0.00036962272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971399,0.00013607004,0.0007222705,0.00022422467,0.0015014192,0.00027614547],"domain_scores_gemma":[0.99600124,0.0014715625,0.00066361,0.00028913503,0.0013746636,0.00019980982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009841848,0.00020511042,0.00019062521,0.0006127727,0.0002708685,0.00030578653,0.0016992963,0.000062612344,0.00018684113],"category_scores_gemma":[0.000115833434,0.00015294855,0.00021526769,0.0011080577,0.00008570745,0.0010815719,0.00020954307,0.00034289045,0.00033931682],"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.00002583741,0.00034611067,0.00062055554,0.000004971482,0.00019671995,0.00000260297,0.0001506325,0.16006507,0.00007807089,0.8084623,0.003949546,0.026097596],"study_design_scores_gemma":[0.0012245674,0.00022671117,0.01923792,0.00007213274,0.00006056692,0.0005634896,0.00008583475,0.029345224,0.0008370029,0.4948973,0.45290008,0.0005491565],"about_ca_topic_score_codex":0.0000020680152,"about_ca_topic_score_gemma":2.80502e-7,"teacher_disagreement_score":0.93380815,"about_ca_system_score_codex":0.00012910234,"about_ca_system_score_gemma":0.00021324144,"threshold_uncertainty_score":0.62370604},"labels":[],"label_agreement":null},{"id":"W1999315130","doi":"10.1137/080716931","title":"Paths with No Small Angles","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Conjecture; Travelling salesman problem; Path (computing); Constant (computer programming); Plane (geometry); Set (abstract data type); Discrete mathematics; Geometry; Algorithm; Graph; Computer science","score_opus":0.015618670685422333,"score_gpt":0.2381191567294982,"score_spread":0.22250048604407588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999315130","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.03660376,0.0000805484,0.94818306,0.0015755241,0.00021757068,0.000110229055,0.0000014003771,0.00007230979,0.013155604],"genre_scores_gemma":[0.48287192,0.00003429873,0.5146014,0.001061831,0.00034685124,0.0000024610158,0.0000035015826,0.000011606531,0.0010661122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989257,0.000037919304,0.00026869006,0.00016283155,0.00039943162,0.00020543954],"domain_scores_gemma":[0.9991477,0.00008749208,0.0001936648,0.0002598722,0.00017565569,0.00013562775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030965614,0.00014775092,0.00015943918,0.00013261713,0.0001832415,0.0003414087,0.00042166427,0.000035975274,0.000021715736],"category_scores_gemma":[0.00006192135,0.00009953613,0.000071710805,0.00028453587,0.00001600113,0.00027668563,0.000028668674,0.00019666222,0.00010360181],"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.000067725225,0.0008140695,0.000050689865,0.000071330884,0.00009871404,0.0003479006,0.0029111635,0.018222343,0.00224691,0.8460146,0.004586905,0.12456763],"study_design_scores_gemma":[0.0028767427,0.007399766,0.003803334,0.0010001722,0.00007634787,0.003512421,0.00028598512,0.44321048,0.0069168806,0.50591975,0.02345284,0.0015452632],"about_ca_topic_score_codex":1.6079974e-7,"about_ca_topic_score_gemma":5.805516e-7,"teacher_disagreement_score":0.44626817,"about_ca_system_score_codex":0.000033025728,"about_ca_system_score_gemma":0.000070108785,"threshold_uncertainty_score":0.40589657},"labels":[],"label_agreement":null},{"id":"W1999380033","doi":"10.1007/s00453-001-0112-9","title":"Some Aperture-Angle Optimization Problems","year":2002,"lang":"en","type":"article","venue":"Algorithmica","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":"McGill University; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Regular polygon; Tangent; Upper and lower bounds; Aperture (computer memory); Plane (geometry); Binary logarithm; Computational geometry; Theory of computation; Cone (formal languages); Geometry; Algorithm; Physics; Mathematical analysis","score_opus":0.01788439358824686,"score_gpt":0.2086579147907819,"score_spread":0.19077352120253505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999380033","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.00013934734,0.00074488646,0.99382335,0.002925217,0.00039127024,0.00012608456,0.0000019281679,0.00018005887,0.0016678284],"genre_scores_gemma":[0.1320378,0.00018372608,0.85788554,0.003575745,0.0010879426,0.000061030325,0.00006180403,0.000022140259,0.005084275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916744,0.000031393123,0.00014988061,0.0002665293,0.00021743265,0.00016734074],"domain_scores_gemma":[0.9995057,0.0000689576,0.0000490906,0.00023684949,0.00007348961,0.00006588895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008658044,0.00009231968,0.00008148285,0.00010185025,0.00012566736,0.0001198811,0.00030777673,0.00004709038,0.00010162231],"category_scores_gemma":[0.00003445103,0.00008864652,0.00004041394,0.00041653408,0.0000143875195,0.00065402366,0.00007438124,0.000068535344,0.00024141265],"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.000001462268,0.00029644358,0.000014361973,0.000016602962,0.000036891597,0.000013029505,0.00063201314,0.6013463,0.00087105064,0.0967896,0.021950731,0.2780315],"study_design_scores_gemma":[0.00016604218,0.000042755844,0.000029143777,0.000004270143,0.000002366862,0.000016506096,0.0000016345341,0.9695846,0.00041666106,0.0033451868,0.026271734,0.000119102086],"about_ca_topic_score_codex":0.0000030986687,"about_ca_topic_score_gemma":3.4193465e-7,"teacher_disagreement_score":0.3682383,"about_ca_system_score_codex":0.000026111096,"about_ca_system_score_gemma":0.000012410881,"threshold_uncertainty_score":0.36149004},"labels":[],"label_agreement":null},{"id":"W1999445910","doi":"10.1006/eujc.2001.0447","title":"On Traces ofd-stresses in the Skeletons of Lower Dimensions of Piecewise-lineard-manifolds","year":2001,"lang":"en","type":"article","venue":"European Journal of Combinatorics","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":"Fields Institute for Research in Mathematical Sciences; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Manifold (fluid mechanics); Piecewise; Piecewise linear function; Class (philosophy); Polynomial; Pure mathematics; Piecewise linear manifold; Realization (probability); Construct (python library); Combinatorics; Planar; Simplicial complex; Geometry; Mathematical analysis; Computer science","score_opus":0.017333373654724277,"score_gpt":0.24411360096390353,"score_spread":0.22678022730917924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999445910","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.9386882,0.00050963106,0.055442,0.00085216196,0.0007592764,0.00006918451,0.0000016991714,0.0000072139605,0.0036705842],"genre_scores_gemma":[0.9984288,0.00020346783,0.0011298619,0.000097626275,0.000057288926,2.324901e-7,7.066008e-7,0.0000063380558,0.000075635326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983325,0.00041280538,0.00054679724,0.00009963993,0.00049559143,0.00011267776],"domain_scores_gemma":[0.9985069,0.00041992095,0.00044424756,0.00024442593,0.0003369103,0.000047601316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011794596,0.00009265607,0.00018084871,0.00025864935,0.000053365085,0.00003393873,0.0007069575,0.000015627762,0.000007585575],"category_scores_gemma":[0.00020012591,0.000059935093,0.000098990946,0.00086517143,0.000034102624,0.00020417802,0.00006057572,0.00019066948,0.000004907699],"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.00022460056,0.004992249,0.0027217641,0.000071596616,0.00012901356,0.0014847603,0.0040238663,0.1128125,0.0051469207,0.81896555,0.010971879,0.03845533],"study_design_scores_gemma":[0.019363374,0.033828143,0.3896036,0.002557497,0.00036222325,0.003019192,0.0018216957,0.05950372,0.038467187,0.23194887,0.21721463,0.0023098544],"about_ca_topic_score_codex":0.0000011669891,"about_ca_topic_score_gemma":8.761308e-7,"teacher_disagreement_score":0.58701664,"about_ca_system_score_codex":0.000015272675,"about_ca_system_score_gemma":0.00007024693,"threshold_uncertainty_score":0.24440822},"labels":[],"label_agreement":null},{"id":"W1999588824","doi":"10.1016/j.endm.2011.09.046","title":"Asymptotically settling Zarankiewiczʼs Conjecture in finite time, for each m","year":2011,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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 Waterloo","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Counterexample; Bipartite graph; Integer (computer science); Discrete mathematics; Graph","score_opus":0.01887409142288788,"score_gpt":0.25315188209365974,"score_spread":0.23427779067077187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999588824","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.034953173,0.00022889684,0.9630798,0.00036209697,0.000079505015,0.00042384458,0.000003847918,0.000063506195,0.00080532616],"genre_scores_gemma":[0.7523588,0.000010958187,0.24719971,0.00016519024,0.00004808191,0.000055838602,0.000019743464,0.000016130503,0.00012557773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985225,0.000047723628,0.00041637282,0.00032517515,0.00019632668,0.00049186894],"domain_scores_gemma":[0.99867827,0.0008002631,0.000104876795,0.00032080003,0.000051126517,0.000044643522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070379203,0.00017344991,0.00024460265,0.00021568459,0.000055314445,0.00006129525,0.0004922371,0.00009589661,0.00003111037],"category_scores_gemma":[0.00041983236,0.0001627037,0.00007168094,0.0005482803,0.000027616552,0.00022797778,0.00009432915,0.00023166738,0.000035691675],"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.000043159438,0.0004264345,0.0003119798,0.00021469599,0.00005413474,0.000013231212,0.009714058,0.027237602,0.0014092579,0.94619465,0.000071023926,0.014309746],"study_design_scores_gemma":[0.00052797544,0.00015562837,0.00020809741,0.00005806851,0.0000071194845,0.000009517691,0.0000085184565,0.69988835,0.0024565142,0.2962148,0.0002642494,0.0002011779],"about_ca_topic_score_codex":0.0000044573676,"about_ca_topic_score_gemma":0.000029369929,"teacher_disagreement_score":0.7174056,"about_ca_system_score_codex":0.000103044906,"about_ca_system_score_gemma":0.00017785106,"threshold_uncertainty_score":0.6634864},"labels":[],"label_agreement":null},{"id":"W1999899863","doi":"10.1016/j.jda.2012.04.013","title":"Generating simple convex Venn diagrams","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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":"University of Victoria","funders":"","keywords":"Venn diagram; Isometry (Riemannian geometry); Monotone polygon; Simple (philosophy); Mathematics; Isometry group; Symmetry (geometry); Combinatorics; Regular polygon; Geometry; Pure mathematics","score_opus":0.018870069576207245,"score_gpt":0.27755810722365803,"score_spread":0.2586880376474508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999899863","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.06422093,0.0016848849,0.9317791,0.0006025831,0.0013905424,0.0000529607,0.0000023395958,0.000020464488,0.00024622955],"genre_scores_gemma":[0.8179683,0.00003884786,0.17949456,0.00033271938,0.0020406162,0.0000018405998,0.0000057577704,0.0000076121364,0.00010973967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872386,0.000083712875,0.00040823684,0.000104498926,0.00041621662,0.00026345204],"domain_scores_gemma":[0.999001,0.00010502717,0.0003260137,0.00016195625,0.0002004488,0.00020551725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007241864,0.00010814385,0.0001823552,0.00012649434,0.00012498135,0.00013630172,0.0003328132,0.00004267953,0.000020796952],"category_scores_gemma":[0.00008564784,0.00008797437,0.00012433271,0.00032538254,0.000019195346,0.0012396009,0.00009083226,0.00016469952,0.000017747176],"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.0000272879,0.0004818171,0.007408374,0.00004528451,0.00031684324,0.00008632905,0.0040064286,0.03844609,0.020675346,0.041764654,0.024234375,0.86250716],"study_design_scores_gemma":[0.0019121796,0.0008071746,0.016977768,0.00006421154,0.00007979416,0.0011777831,0.00024164954,0.8559885,0.020129964,0.0134411715,0.08838681,0.00079298246],"about_ca_topic_score_codex":0.0000034156014,"about_ca_topic_score_gemma":6.671187e-7,"teacher_disagreement_score":0.8617142,"about_ca_system_score_codex":0.00004006153,"about_ca_system_score_gemma":0.00007272863,"threshold_uncertainty_score":0.35874906},"labels":[],"label_agreement":null},{"id":"W199998079","doi":"","title":"On Bases of the Cycle and Cut Spaces in Digraphs.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Pure mathematics","score_opus":0.0073699426454666,"score_gpt":0.21905994319724464,"score_spread":0.21169000055177806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W199998079","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.9966751,0.000107671665,0.000479196,0.00026250473,0.0005719315,0.000067532164,3.941589e-7,0.000009648392,0.0018260553],"genre_scores_gemma":[0.9994023,0.000007803927,0.00042542012,0.000111394365,0.0000011389044,0.0000030589545,2.5263208e-7,0.0000016746467,0.00004697821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995113,0.00007400756,0.00008860046,0.000123482,0.00013063323,0.00007195151],"domain_scores_gemma":[0.99960715,0.00014229197,0.000038886345,0.00016620677,0.000025377954,0.000020090041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015655777,0.000048385118,0.000060005517,0.00006657977,0.000046636913,0.000027844282,0.00014615971,0.000018077339,0.0000028167874],"category_scores_gemma":[0.000090900896,0.00003687982,0.000019621952,0.00042951314,0.00002375295,0.000107066364,0.000038075523,0.000046236408,0.0000016212724],"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.0000012406467,0.000049661096,0.0048313476,0.000002891693,0.00000192214,5.7987904e-7,0.000128728,0.0006265029,0.00012904989,0.9931731,0.00016007228,0.00089488423],"study_design_scores_gemma":[0.00039539303,0.00006611983,0.040455926,0.000019680268,0.0000015342468,0.0000027947065,0.0000134364645,0.0038564778,0.012523119,0.94184935,0.0007471812,0.00006899441],"about_ca_topic_score_codex":0.0000119223305,"about_ca_topic_score_gemma":0.000009290107,"teacher_disagreement_score":0.051323775,"about_ca_system_score_codex":0.000007930828,"about_ca_system_score_gemma":0.000028111906,"threshold_uncertainty_score":0.15039155},"labels":[],"label_agreement":null},{"id":"W2000579002","doi":"10.5555/644108.644242","title":"Sublinear-time approximation of Euclidean minimum spanning tree","year":2003,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"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 Toronto","funders":"","keywords":"Minimum spanning tree; Euclidean minimum spanning tree; Spanning tree; Bounding overwatch; Combinatorics; Euclidean geometry; Sublinear function; Mathematics; Euclidean distance; Minimum bounding box; Point (geometry); Set (abstract data type); Tree (set theory); Minimum weight; Approximation algorithm; Range (aeronautics); Constant (computer programming); Minimum degree spanning tree; Computer science; Geometry","score_opus":0.015604146601124112,"score_gpt":0.23358909249909185,"score_spread":0.21798494589796774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000579002","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.0682525,0.000033752724,0.902137,0.00020552045,0.00012557275,0.00007776276,3.53392e-7,0.00006280019,0.02910478],"genre_scores_gemma":[0.72470456,0.0000011766608,0.2727663,0.00009479173,0.00003068753,0.0000028686975,0.0000073396523,0.0000032423047,0.00238904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992416,0.00005805939,0.00021221384,0.00017741726,0.00020282059,0.00010788205],"domain_scores_gemma":[0.99948573,0.00007979037,0.0000803084,0.00019204563,0.0001212504,0.000040879204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035443198,0.00006678238,0.00009327801,0.00013555182,0.000048888844,0.000050523795,0.000179501,0.000029122613,0.00007295841],"category_scores_gemma":[0.00010117077,0.00006254617,0.000040505354,0.0005256207,0.000012783294,0.0003647956,0.000031550575,0.000034734294,0.00006285416],"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.000006561499,0.00017676584,0.00046660614,0.000025965388,0.000023682434,0.0000023625703,0.00059340725,0.0122798355,0.047183413,0.8583111,0.0036593191,0.07727095],"study_design_scores_gemma":[0.0004678132,0.000102376376,0.0016963121,0.000010247054,0.000005413421,0.000015060685,0.000026083875,0.84528786,0.13330665,0.013093877,0.005800542,0.00018775383],"about_ca_topic_score_codex":0.0000026327314,"about_ca_topic_score_gemma":0.0000010026661,"teacher_disagreement_score":0.8452172,"about_ca_system_score_codex":0.000011215548,"about_ca_system_score_gemma":0.000055047625,"threshold_uncertainty_score":0.25505587},"labels":[],"label_agreement":null},{"id":"W2001019475","doi":"10.1007/s00454-010-9310-z","title":"Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs","year":2010,"lang":"en","type":"article","venue":"Discrete & 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 Waterloo","funders":"","keywords":"Pathwidth; Chordal graph; Combinatorics; Planar graph; Outerplanar graph; Mathematics; 1-planar graph; Indifference graph; Planar; Book embedding; Clique-sum; Discrete mathematics; Series (stratigraphy); Graph; Computer science; Line graph; Computer graphics (images)","score_opus":0.013783665333972583,"score_gpt":0.23815582210133418,"score_spread":0.2243721567673616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001019475","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.6458119,0.00031208384,0.3507937,0.00077696686,0.0007649471,0.00030144886,0.00011358675,0.00018530746,0.00094004784],"genre_scores_gemma":[0.8252449,0.000017376004,0.17355329,0.00074424525,0.00006200237,0.000019461126,0.00017152354,0.000024264948,0.00016291917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975525,0.00008683395,0.00061233784,0.000711285,0.0006442602,0.0003927862],"domain_scores_gemma":[0.998408,0.00031515327,0.00031720876,0.00043179342,0.00028795114,0.00023984897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049120537,0.00034870236,0.00038434536,0.0010045089,0.0002898431,0.00021219329,0.000708651,0.00015972146,0.000047103567],"category_scores_gemma":[0.00007008442,0.0003433358,0.00019484852,0.0016294168,0.00024916814,0.0006436804,0.00018141435,0.00035451842,0.000018098139],"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.00005520098,0.00011416044,0.015905682,0.000064173444,0.00013638315,0.000014049541,0.0005231761,0.0112156635,0.0018670706,0.9628653,0.00078064686,0.0064584776],"study_design_scores_gemma":[0.0017047424,0.0004246402,0.16644086,0.00006369123,0.00005567103,0.00032995682,0.0001019249,0.06387415,0.0008550401,0.7558579,0.009259636,0.00103182],"about_ca_topic_score_codex":0.0000891164,"about_ca_topic_score_gemma":0.000056080473,"teacher_disagreement_score":0.20700745,"about_ca_system_score_codex":0.000012705104,"about_ca_system_score_gemma":0.00013839212,"threshold_uncertainty_score":0.9999019},"labels":[],"label_agreement":null},{"id":"W2001098316","doi":"10.4153/cmb-2013-031-0","title":"Equilateral Sets and a Schütte Theorem forthe 4-norm","year":2013,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Equilateral triangle; Combinatorics; Cardinality (data modeling); Constructive proof; Upper and lower bounds; Norm (philosophy); Interval (graph theory); Discrete mathematics; Euclidean space; Geometry; Mathematical analysis","score_opus":0.008209181070627257,"score_gpt":0.2014579032587303,"score_spread":0.19324872218810304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001098316","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.56605446,0.00017896682,0.33187154,0.05474452,0.00022751123,0.00079222914,0.000008535089,0.00016390815,0.04595832],"genre_scores_gemma":[0.9613796,0.000002099757,0.034215085,0.002654485,0.000049731207,0.000037475875,0.0000050494928,0.000008198863,0.0016483117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991386,0.000032225573,0.00016956145,0.00022266977,0.00013959476,0.0002973648],"domain_scores_gemma":[0.9991386,0.00011137831,0.000029005607,0.00022667243,0.000067038025,0.00042729065],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001976248,0.00010736509,0.00011400751,0.00011813235,0.00013124068,0.00035635178,0.00026042564,0.00005226802,0.0035772617],"category_scores_gemma":[0.000085875814,0.000090798916,0.000031649477,0.00014643124,0.00004690667,0.0001295957,0.000073705705,0.00008493161,0.0058443034],"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":[7.803366e-7,0.00001586425,0.000042234657,0.000027721379,0.0000117520785,0.000014565794,0.0003615683,0.00003420936,0.000091020614,0.94785535,0.01890867,0.032636248],"study_design_scores_gemma":[0.00030163687,0.00006614363,0.0018405092,0.000044033022,0.0000069789053,0.00015262637,0.000032836913,0.10184778,0.00016592955,0.83172756,0.06347492,0.0003390674],"about_ca_topic_score_codex":0.00037458917,"about_ca_topic_score_gemma":0.00014525288,"teacher_disagreement_score":0.3953251,"about_ca_system_score_codex":0.00004033423,"about_ca_system_score_gemma":0.00009292415,"threshold_uncertainty_score":0.9973336},"labels":[],"label_agreement":null},{"id":"W2001552595","doi":"10.1007/s00454-006-1275-6","title":"Multi-Pass Geometric Algorithms","year":2006,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":55,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convex hull; Regular polygon; Geometric programming; Algorithm; Computational geometry; Combinatorics; Linear programming; Mathematical optimization; Geometry","score_opus":0.014879910241498168,"score_gpt":0.26032009529383554,"score_spread":0.24544018505233736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001552595","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.026608286,0.0006960067,0.96881974,0.00070095283,0.0008062808,0.000258255,0.00003783391,0.0003904123,0.0016822125],"genre_scores_gemma":[0.6222526,0.000005254102,0.37556165,0.00036649348,0.0003497509,0.000027182283,0.00038685734,0.000019533258,0.0010306697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968008,0.00010973398,0.0006389147,0.0008463837,0.0010596727,0.00054450566],"domain_scores_gemma":[0.9982723,0.00041185765,0.00024060695,0.00044480368,0.00044952024,0.00018093157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004787654,0.00034745547,0.000309568,0.0014658974,0.00040601785,0.0004444686,0.00089607097,0.00012580688,0.00009458861],"category_scores_gemma":[0.00009606362,0.00035594663,0.00021739297,0.004807756,0.00007816735,0.00095417775,0.0003243939,0.00024262107,0.0003942313],"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.00001100181,0.0004272768,0.0032248173,0.000030565017,0.00007293951,0.000047624955,0.00006717235,0.83890796,0.00044764805,0.104733884,0.005849234,0.046179887],"study_design_scores_gemma":[0.001012148,0.00008317483,0.20902526,0.0000132663035,0.000013938272,0.00006779417,0.000013745809,0.76052934,0.0003606658,0.021261334,0.0070770006,0.00054230925],"about_ca_topic_score_codex":0.000088087865,"about_ca_topic_score_gemma":0.0000066399025,"teacher_disagreement_score":0.5956443,"about_ca_system_score_codex":0.00013117226,"about_ca_system_score_gemma":0.00017895953,"threshold_uncertainty_score":0.99988925},"labels":[],"label_agreement":null},{"id":"W2001939018","doi":"10.1007/s10998-006-0018-z","title":"Calgary Workshop in Discrete Geometry (Friday, May 13, 2005 to Saturday, May 14, 2005)","year":2006,"lang":"en","type":"article","venue":"Periodica Mathematica Hungarica","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":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Honor; Mathematics; Schedule; Discrete geometry; Geometry; Mathematics education; Library science; Computer science","score_opus":0.012919687117986136,"score_gpt":0.2597534998319075,"score_spread":0.24683381271392135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001939018","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.056940146,0.00082766823,0.8978906,0.017706037,0.000669458,0.0010298454,0.000019750118,0.00044602365,0.024470448],"genre_scores_gemma":[0.7419559,0.000034366047,0.23941009,0.0011482238,0.00044900138,0.00020334452,0.00004908549,0.00005165501,0.016698357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99614495,0.00016243402,0.0008762302,0.00090834394,0.00090900186,0.0009990402],"domain_scores_gemma":[0.99782646,0.0005231026,0.00019931272,0.0009732268,0.000105855725,0.00037206287],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009870988,0.0004225725,0.0005383987,0.0008277814,0.00034027934,0.00062521757,0.0011896816,0.00019494304,0.0004272837],"category_scores_gemma":[0.00035517756,0.00039773824,0.00017967926,0.0017597665,0.000103639046,0.00053133344,0.00056505186,0.00042868737,0.00079900946],"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.00015200989,0.0025594705,0.0019243574,0.00045920964,0.00017065626,0.00042790925,0.0058451053,0.027814548,0.004485014,0.48853773,0.402534,0.065089986],"study_design_scores_gemma":[0.0027973244,0.00032960047,0.04536064,0.00061948615,0.00010770558,0.00038215116,0.00028579767,0.31263155,0.0035321994,0.07724068,0.5532402,0.0034727028],"about_ca_topic_score_codex":0.000098099226,"about_ca_topic_score_gemma":0.0002837182,"teacher_disagreement_score":0.68501574,"about_ca_system_score_codex":0.00020803175,"about_ca_system_score_gemma":0.0002286897,"threshold_uncertainty_score":0.99997896},"labels":[],"label_agreement":null},{"id":"W2002285779","doi":"10.1007/s10898-006-9065-5","title":"Extremal problems for convex polygons","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","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":"HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Mathematics; Regular polygon; Polygon (computer graphics); Combinatorics; Convex polygon; Perimeter; Series (stratigraphy); Linear programming; Mathematical optimization; Discrete mathematics; Geometry; Computer science","score_opus":0.009376869784567364,"score_gpt":0.23537802414068654,"score_spread":0.22600115435611917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002285779","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.002375325,0.0002699571,0.994694,0.0012309318,0.0005579142,0.00012051207,0.0000045092115,0.000019399722,0.00072744815],"genre_scores_gemma":[0.43980157,0.000009172181,0.55956686,0.00013369987,0.00036364485,0.0000027173508,0.0000105959325,0.000003234631,0.000108475855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991795,0.000026659225,0.00035316887,0.00010066621,0.00022667434,0.00011332021],"domain_scores_gemma":[0.99901193,0.000039264974,0.00032057535,0.000078537676,0.00050420174,0.000045480276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023896349,0.000070600334,0.000114233706,0.00006327617,0.00007868997,0.000120342425,0.00021244158,0.000040286737,0.000007037004],"category_scores_gemma":[0.00004379816,0.000063904474,0.00008332209,0.00039157187,0.000011323211,0.0005973676,0.000022910317,0.00003632909,0.0000016632579],"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.000011341105,0.00005706804,0.00027728901,0.0000049850187,0.000007987781,0.0000014664671,0.0000090902,0.94524765,0.00012358687,0.048421793,0.0029724843,0.002865253],"study_design_scores_gemma":[0.0007272386,0.00019467775,0.0016606373,0.000016346594,0.000014173984,0.00012499934,0.0000037557122,0.9818587,0.00021634079,0.011197956,0.0038912222,0.00009399408],"about_ca_topic_score_codex":0.0000047181,"about_ca_topic_score_gemma":0.0000034632021,"teacher_disagreement_score":0.43742627,"about_ca_system_score_codex":0.00008766773,"about_ca_system_score_gemma":0.00013563594,"threshold_uncertainty_score":0.26059487},"labels":[],"label_agreement":null},{"id":"W2002322113","doi":"","title":"In-place 2-d nearest neighbor search","year":2008,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"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":"Nearest neighbor search; k-nearest neighbors algorithm; Computer science; Computational geometry; Preprocessor; Point (geometry); Set (abstract data type); Fixed-radius near neighbors; Permutation (music); Boundary (topology); Best bin first; Point location; Curse of dimensionality; Constant (computer programming); Regular polygon; Algorithm; Combinatorics; Mathematics; Data mining; Artificial intelligence; Geometry; Cluster analysis","score_opus":0.02888498650252969,"score_gpt":0.26385657604580826,"score_spread":0.23497158954327857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002322113","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.27970284,0.000055053453,0.7018894,0.0031290045,0.00025202346,0.00008030546,2.7978984e-7,0.00006681648,0.0148242675],"genre_scores_gemma":[0.9568696,0.00001392301,0.03618111,0.00078019494,0.000075731885,0.0000035983894,0.0000016873204,0.0000020921404,0.0060720793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994048,0.00002995271,0.00009152534,0.00016730292,0.00017971656,0.00012669495],"domain_scores_gemma":[0.9996885,0.000061664505,0.000009242029,0.00015034672,0.000045075933,0.000045156543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012002778,0.00004510739,0.00004881302,0.00011377977,0.00007355422,0.000032305168,0.00022787822,0.000019647949,0.00008734211],"category_scores_gemma":[0.000013940744,0.0000417974,0.000016435917,0.00054195174,0.000013814448,0.00041139327,0.00007882325,0.000059308262,0.00024299388],"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.000019261603,0.00033226813,0.008397889,0.0000135217515,0.000011000767,0.00033036302,0.0025144466,0.10447003,0.0036871447,0.7968729,0.049997266,0.03335388],"study_design_scores_gemma":[0.0007261873,0.00010807411,0.07988965,0.000005336497,6.490395e-7,0.00019947224,0.000018035826,0.85791576,0.012664479,0.0029526923,0.04524934,0.0002703353],"about_ca_topic_score_codex":0.000043628614,"about_ca_topic_score_gemma":0.000017632365,"teacher_disagreement_score":0.7939202,"about_ca_system_score_codex":0.000020521848,"about_ca_system_score_gemma":0.00009518954,"threshold_uncertainty_score":0.31232756},"labels":[],"label_agreement":null},{"id":"W2003947532","doi":"10.1163/15685520152756660","title":"Packing fraction and measures of disorder of ultradense irregular packings of equal spheres. II. Transition from dense random packing","year":2001,"lang":"en","type":"article","venue":"Advanced Powder Technology","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":"Mount Allison University","funders":"","keywords":"SPHERES; Atomic packing factor; Hexagonal crystal system; Lattice (music); Close-packing of equal spheres; Hexagonal lattice; Combinatorics; Condensed matter physics; Sphere packing; Lattice constant; Materials science; Orientation (vector space); Physics; Mathematics; Crystallography; Chemistry; Geometry; Quantum mechanics","score_opus":0.011855855949698063,"score_gpt":0.2356222235240016,"score_spread":0.22376636757430354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003947532","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.53262776,0.001073981,0.4657746,0.00029379,0.00006528459,0.000098228986,0.000004148806,0.00004744522,0.0000147399705],"genre_scores_gemma":[0.97342247,0.00024296346,0.026245633,0.00003311169,0.000019947653,0.000008135866,0.000012717449,0.000009303509,0.0000057292095],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987607,0.000061178725,0.00042958147,0.00031944292,0.00025821256,0.00017091272],"domain_scores_gemma":[0.998914,0.00018561943,0.00034180025,0.0002995892,0.00023025011,0.000028745128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015353394,0.00014199757,0.00034166125,0.00030620908,0.00008788438,0.000009036312,0.00020014333,0.00015923116,0.000012556535],"category_scores_gemma":[0.0001355682,0.0001455497,0.000063738786,0.0007381646,0.00015647302,0.0004034087,0.0000617589,0.00013536574,4.798503e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020210707,0.00015811557,0.0032824727,0.00003716076,0.000074752264,0.0000069359626,0.0010696441,0.009036309,0.6318676,0.0112394625,0.000009216566,0.34301624],"study_design_scores_gemma":[0.0049805283,0.0005616616,0.0070456224,0.00024228655,0.0000762726,0.00008273322,0.001103462,0.017727708,0.83845454,0.12796783,0.0013569356,0.0004004095],"about_ca_topic_score_codex":0.00006109539,"about_ca_topic_score_gemma":0.00005720207,"teacher_disagreement_score":0.44079468,"about_ca_system_score_codex":0.000018431203,"about_ca_system_score_gemma":0.00003207503,"threshold_uncertainty_score":0.59353447},"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":"W2004640854","doi":"10.1137/120872310","title":"Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard","year":2013,"lang":"en","type":"preprint","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS; European Science Foundation","keywords":"Book embedding; Planar graph; Crossing number (knot theory); Planarity testing; Combinatorics; Planar straight-line graph; Planar; Mathematics; 1-planar graph; Graph drawing; Outerplanar graph; Embedding; Polyhedral graph; Pathwidth; Graph; Discrete mathematics; Computer science; Line graph","score_opus":0.040510224570431054,"score_gpt":0.29268103438269155,"score_spread":0.2521708098122605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004640854","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.513966,0.00023293859,0.4809519,0.0013120996,0.0024490303,0.00023524916,0.0000071921163,0.00011817733,0.00072740536],"genre_scores_gemma":[0.743589,0.00002107827,0.25364578,0.0012853863,0.0013095821,0.000004032121,0.000014305213,0.000023783223,0.000107110594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970584,0.00023288516,0.00070286804,0.00078014034,0.0006993256,0.00052638166],"domain_scores_gemma":[0.9979073,0.00037052028,0.0005345743,0.00040585725,0.00034854695,0.00043322064],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011888712,0.0003985334,0.0004939652,0.0004822917,0.0012768313,0.0040773354,0.00083646155,0.00021305104,0.00002719181],"category_scores_gemma":[0.00014745168,0.0004058401,0.0001647607,0.0004266706,0.00005332349,0.00036316254,0.0008702753,0.001435044,0.000101737875],"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.000084942185,0.000442457,0.009172551,0.00044357002,0.00052833266,0.00025535643,0.007212163,0.2572948,0.002100705,0.09909428,0.023624787,0.59974605],"study_design_scores_gemma":[0.0018244383,0.00054659374,0.116818495,0.0051215854,0.00010448766,0.0025824904,0.00016007895,0.71866614,0.0015256414,0.12660487,0.023098864,0.002946296],"about_ca_topic_score_codex":0.0000281244,"about_ca_topic_score_gemma":0.0000035931425,"teacher_disagreement_score":0.59679973,"about_ca_system_score_codex":0.00015140702,"about_ca_system_score_gemma":0.00026658384,"threshold_uncertainty_score":0.99983937},"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":"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":"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":"W2007700787","doi":"10.1007/s00366-009-0143-4","title":"Two-dimensional Delaunay-based anisotropic mesh adaptation","year":2009,"lang":"en","type":"article","venue":"Engineering With Computers","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":"Delaunay triangulation; Metric (unit); Polygon mesh; Mathematics; Chew's second algorithm; Topology (electrical circuits); Laplacian smoothing; Mesh generation; Constrained Delaunay triangulation; Computer science; Algorithm; Mathematical optimization; Geometry; Combinatorics; Finite element method; Physics","score_opus":0.007111143027322116,"score_gpt":0.19496822534289576,"score_spread":0.18785708231557366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007700787","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.043728035,0.00005077019,0.9545832,0.000654763,0.00048557526,0.00010430433,5.8578195e-7,0.0003459492,0.00004676308],"genre_scores_gemma":[0.56993794,2.0914085e-7,0.42953962,0.00041534513,0.00007588229,0.0000031009063,0.000011796262,0.0000047395183,0.000011363054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989896,0.000019617712,0.00015795261,0.00030279963,0.00031754325,0.00021250414],"domain_scores_gemma":[0.9994268,0.00010270849,0.000049217848,0.00022983996,0.00009191191,0.00009955501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009613535,0.0001585226,0.00012019397,0.00020440343,0.00008302944,0.00011134321,0.00026824643,0.00002867008,0.0000032606415],"category_scores_gemma":[0.000011020529,0.0001498877,0.000041343064,0.00050804025,0.000008187542,0.00032381102,0.0000251627,0.000098930126,0.000014348884],"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.0000063167604,0.000027803504,0.000013686378,0.000003459599,0.000009040502,0.000014404171,0.000060670103,0.9654889,0.0006823765,0.02042445,0.00021208538,0.013056804],"study_design_scores_gemma":[0.00062997785,0.00023522814,0.0038855986,0.000035356257,0.0000045145857,0.000023677856,0.0000011219107,0.9932422,0.0011002719,0.00021890692,0.00042665028,0.00019648462],"about_ca_topic_score_codex":0.000003941246,"about_ca_topic_score_gemma":9.381259e-7,"teacher_disagreement_score":0.5262099,"about_ca_system_score_codex":0.000053291267,"about_ca_system_score_gemma":0.00008677305,"threshold_uncertainty_score":0.6112243},"labels":[],"label_agreement":null},{"id":"W2008147283","doi":"10.1007/s00371-014-0936-3","title":"Optimizing line-of-sight using simplified regular terrains","year":2014,"lang":"en","type":"article","venue":"The Visual Computer","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Mitacs","keywords":"Terrain; Computer science; Subdivision; Raised-relief map; Residual; Line-of-sight; Line (geometry); Terrain rendering; Set (abstract data type); Algorithm; A priori and a posteriori; Triangulation; Sight; Scheme (mathematics); Data mining; Computer vision; Rendering (computer graphics); Mathematics","score_opus":0.03365001007169213,"score_gpt":0.29789942268027747,"score_spread":0.26424941260858537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008147283","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.15179437,0.000036650832,0.8469769,0.00034153083,0.00048958434,0.000096971955,3.9378156e-7,0.000069164154,0.00019448399],"genre_scores_gemma":[0.80439675,0.0000012046739,0.19443409,0.0005375557,0.00056127284,0.0000018943122,0.0000037395519,0.0000077532795,0.000055731405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988223,0.00017666277,0.00027226532,0.00026536486,0.0002684523,0.00019495374],"domain_scores_gemma":[0.9990998,0.00021129679,0.0001311329,0.00038374405,0.000119296565,0.000054753895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005170855,0.00013027103,0.00016503468,0.00012546706,0.00019407248,0.000115620795,0.00060155545,0.000044791534,0.0000063502507],"category_scores_gemma":[0.000018439174,0.00009551063,0.00008198367,0.00044003114,0.000050865252,0.00022803637,0.00033509868,0.000099895144,0.000013403883],"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.00001843956,0.00014364312,0.000036309048,0.000033171025,0.00006035232,0.0000030435713,0.002132678,0.6911966,0.028506188,0.10016909,0.0006291056,0.17707133],"study_design_scores_gemma":[0.00020633367,0.00014324232,0.00023659853,0.000018981144,0.000007414571,0.00001439537,0.0000040863806,0.9823937,0.011036497,0.0031686402,0.0026440672,0.00012608143],"about_ca_topic_score_codex":0.000007791577,"about_ca_topic_score_gemma":0.0000013312751,"teacher_disagreement_score":0.6526024,"about_ca_system_score_codex":0.000018654717,"about_ca_system_score_gemma":0.000040267943,"threshold_uncertainty_score":0.38948104},"labels":[],"label_agreement":null},{"id":"W2008282466","doi":"10.1016/j.endm.2009.07.107","title":"On the Plane-Width of Graphs","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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 Toronto","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Graph; Plane (geometry); Wheel graph; Geometric graph theory; Planar graph; Discrete mathematics; Graph power; Geometry; Line graph","score_opus":0.011238106260361282,"score_gpt":0.24772357197820116,"score_spread":0.23648546571783988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008282466","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.24095465,0.00016544384,0.7532551,0.002592844,0.00006192805,0.00022810757,0.0000014921227,0.000042991134,0.002697437],"genre_scores_gemma":[0.9863641,0.000015765218,0.0133197475,0.0002364511,0.00001438351,0.000005002006,0.0000031469215,0.0000033042995,0.0000380874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991102,0.00004050343,0.00023426715,0.00014616009,0.00024651858,0.00022232202],"domain_scores_gemma":[0.9988855,0.00062388973,0.00009972216,0.00034594664,0.00002566044,0.000019255665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039953628,0.000095239004,0.0001234639,0.00010738134,0.000048206704,0.000033387,0.00046970297,0.000030154599,0.000013850119],"category_scores_gemma":[0.00018195363,0.00006472163,0.000048974358,0.00048489694,0.000021691101,0.00008503316,0.000032679476,0.00014150028,0.0000099167855],"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.0000028539257,0.00006392516,0.0000088447805,0.0000062569347,0.000005117423,5.7029285e-7,0.00032711765,0.0027157285,0.0005529694,0.99121106,0.00005916675,0.005046402],"study_design_scores_gemma":[0.00012116,0.0002162672,0.0003656095,0.000029972905,0.000002674208,0.0000050425124,0.0000067021842,0.07427834,0.009724703,0.9151214,0.000048490565,0.000079681275],"about_ca_topic_score_codex":0.0000015806319,"about_ca_topic_score_gemma":0.0000070536153,"teacher_disagreement_score":0.7454095,"about_ca_system_score_codex":0.00003245012,"about_ca_system_score_gemma":0.000059906048,"threshold_uncertainty_score":0.26392716},"labels":[],"label_agreement":null},{"id":"W2008393295","doi":"10.4153/cmb-2009-042-6","title":"Transversals with Residue in Moderately Overlapping <i>T</i>(<i>k</i>)-Families of Translates","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hungarian Science Foundation; Hungarian Scientific Research Fund","keywords":"Disjoint sets; Mathematics; Combinatorics; Integer (computer science); Regular polygon; Unit (ring theory); Transversal (combinatorics); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.008583624803701177,"score_gpt":0.20061357293346546,"score_spread":0.1920299481297643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008393295","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.28902432,0.00026316644,0.67317176,0.017808868,0.000037559388,0.0003841061,0.000011379284,0.00006096014,0.019237842],"genre_scores_gemma":[0.965772,0.000008299495,0.033270627,0.0007933128,0.000013429456,0.0000055292294,0.0000032336234,0.000004857309,0.0001287354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901026,0.000041868752,0.00027571103,0.00021879334,0.0001946578,0.00025867487],"domain_scores_gemma":[0.9994119,0.00012319298,0.000038033908,0.00019368342,0.00005778906,0.00017539256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023472836,0.000116915944,0.00021086453,0.00026126142,0.000049099548,0.000052333922,0.000261943,0.000054710195,0.0001708207],"category_scores_gemma":[0.000035015044,0.000104503335,0.000038012276,0.00044404334,0.0000352941,0.000098528515,0.0000048789616,0.00009546987,0.00008253771],"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.00007067441,0.00022117425,0.00006737906,0.00017634057,0.000031582775,0.00022961959,0.0055786646,0.026869647,0.0036608358,0.9206171,0.0021941497,0.040282857],"study_design_scores_gemma":[0.004724012,0.0013870776,0.010431997,0.0013718229,0.00005446366,0.00031554227,0.0005453,0.24670406,0.03790606,0.6644373,0.030194871,0.0019275128],"about_ca_topic_score_codex":0.0003630438,"about_ca_topic_score_gemma":0.0015188208,"teacher_disagreement_score":0.6767476,"about_ca_system_score_codex":0.000039068724,"about_ca_system_score_gemma":0.00021485983,"threshold_uncertainty_score":0.42615223},"labels":[],"label_agreement":null},{"id":"W2008520454","doi":"10.1007/s00454-003-0011-x","title":"The Complexity of Hyperplane Depth in the Plane","year":2003,"lang":"en","type":"article","venue":"Discrete & 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":"McGill University","funders":"","keywords":"Hyperplane; Mathematics; Combinatorics; Dimension (graph theory); Point (geometry); Set (abstract data type); Half-space; Plane (geometry); Discrete mathematics; Geometry; Computer science","score_opus":0.035452492252876534,"score_gpt":0.2746656796004278,"score_spread":0.2392131873475513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008520454","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.1982862,0.001042483,0.786169,0.003139937,0.00060793327,0.00046270894,0.000029195475,0.000059500642,0.010203071],"genre_scores_gemma":[0.97870743,0.000013590467,0.020626012,0.00043165963,0.00004613607,0.000016112266,0.00008510997,0.0000057506227,0.00006818264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791884,0.00035396087,0.00043833285,0.0002971543,0.0007236664,0.00026801863],"domain_scores_gemma":[0.99801517,0.0012552346,0.00016777738,0.00036568017,0.00014554865,0.00005056833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011686602,0.00015332631,0.00016964595,0.00020925657,0.00032026213,0.00015308458,0.0008621722,0.000045175584,0.000016384238],"category_scores_gemma":[0.00020686137,0.00009849067,0.00008363545,0.0015240513,0.00023390455,0.00022755521,0.00007912269,0.00019400958,0.000025811452],"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.000011664406,0.00007826786,0.0025411497,0.00001013228,0.000020588845,0.0000066395082,0.00033442507,0.08783851,0.000035623754,0.9022554,0.0005515143,0.006316063],"study_design_scores_gemma":[0.0011575453,0.0002084498,0.3961146,0.000028921188,0.000014487737,0.00022259603,0.000444549,0.17757536,0.00045265435,0.40554437,0.017810713,0.00042573398],"about_ca_topic_score_codex":0.000025795563,"about_ca_topic_score_gemma":0.00004520747,"teacher_disagreement_score":0.78042126,"about_ca_system_score_codex":0.000029617655,"about_ca_system_score_gemma":0.00013794603,"threshold_uncertainty_score":0.4016333},"labels":[],"label_agreement":null},{"id":"W2008562682","doi":"10.1142/s179383091250036x","title":"BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Carleton University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Planar graph; Combinatorics; Geometric graph theory; Mathematics; Line graph; Planar straight-line graph; 1-planar graph; Discrete mathematics; Spanning tree; Outerplanar graph; Pathwidth; Graph; Graph power","score_opus":0.02056900812021606,"score_gpt":0.2729444623559385,"score_spread":0.25237545423572244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008562682","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.0140516255,0.00047278838,0.98372936,0.00013416227,0.00006740726,0.0003366994,0.00002049672,0.000047909096,0.0011395621],"genre_scores_gemma":[0.5920753,0.00011547867,0.40725574,0.00005167787,0.00010384241,0.0001772963,0.00007530779,0.000009910264,0.00013547842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990987,0.000016793498,0.00030192974,0.00017565294,0.00023404222,0.00017283809],"domain_scores_gemma":[0.99921924,0.00013941355,0.00017388765,0.00027417205,0.00008958533,0.00010373243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028554103,0.00011030297,0.00014417198,0.00025316133,0.00017074798,0.000073709714,0.00021439565,0.000041120595,0.000007830284],"category_scores_gemma":[0.000017595337,0.000102177844,0.000048148075,0.0009198013,0.000045025117,0.0003733847,0.00006122772,0.00005476931,0.000013463709],"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":[6.4459675e-7,0.00017411688,0.00011582663,0.000062026644,0.000027082971,8.211344e-8,0.0008619697,0.00005320726,0.0006197257,0.94717133,0.00011933789,0.05079467],"study_design_scores_gemma":[0.0017971252,0.00022975894,0.015707124,0.000076284596,0.00018796952,0.000093974886,0.0014483127,0.29514697,0.020944962,0.6403438,0.022836974,0.0011867732],"about_ca_topic_score_codex":0.000005921385,"about_ca_topic_score_gemma":6.0705344e-7,"teacher_disagreement_score":0.5780236,"about_ca_system_score_codex":0.000015114149,"about_ca_system_score_gemma":0.000021296677,"threshold_uncertainty_score":0.41666916},"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":"W2009319947","doi":"10.1016/s0012-365x(01)00108-x","title":"On the existence of a point subset with a specified number of interior points","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","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":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Convex hull; Point (geometry); Boundary (topology); Plane (geometry); Set (abstract data type); Finite set; Interior point method; Regular polygon; Discrete mathematics; Geometry; Mathematical analysis; Algorithm","score_opus":0.027464334030066536,"score_gpt":0.26784157861687574,"score_spread":0.2403772445868092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009319947","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.4992602,0.0000056114804,0.49279994,0.00053722865,0.000035294408,0.00012895493,0.0000035308296,0.000014143539,0.007215111],"genre_scores_gemma":[0.91699255,0.000003910552,0.082700394,0.00008675392,0.000013349432,0.0000075289227,0.0000023368877,0.000005182344,0.00018802307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991734,0.000033737084,0.0002599105,0.00013273026,0.00030135334,0.000098846715],"domain_scores_gemma":[0.99905753,0.00025653178,0.00014757688,0.00040121717,0.000109371984,0.000027796268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025608207,0.00009065429,0.00015267884,0.000043466844,0.00003525848,0.000030117557,0.0003803417,0.000018962912,0.000062991596],"category_scores_gemma":[0.00007741703,0.000053179476,0.000050304865,0.00035166196,0.00006037909,0.000105351384,0.00007869526,0.00005429372,0.00002028475],"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.000038907547,0.000085293446,0.00011865897,0.00006322954,0.00002973734,0.0000063234684,0.0030731622,0.00015209995,0.0010978208,0.9938899,0.00024175964,0.0012030939],"study_design_scores_gemma":[0.0012152931,0.00094315637,0.0035230962,0.0011950693,0.00005672638,0.00044343073,0.001839164,0.2647711,0.08846625,0.63629204,0.00059179106,0.0006628483],"about_ca_topic_score_codex":0.0000024548426,"about_ca_topic_score_gemma":0.0000031338946,"teacher_disagreement_score":0.41773233,"about_ca_system_score_codex":0.000010305909,"about_ca_system_score_gemma":0.000025180327,"threshold_uncertainty_score":0.21685961},"labels":[],"label_agreement":null},{"id":"W2010081197","doi":"10.1016/j.endm.2008.06.007","title":"Morphing Planar Graph Drawings with Bent Edges","year":2008,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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 Waterloo","funders":"","keywords":"Planarity testing; Bent molecular geometry; Morphing; Combinatorics; Mathematics; Vertex (graph theory); Planar graph; Planar; Graph; Enhanced Data Rates for GSM Evolution; Time complexity; Discrete mathematics; Computer science; Computer graphics (images); Artificial intelligence","score_opus":0.014839004252097807,"score_gpt":0.23082402342235814,"score_spread":0.21598501917026033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010081197","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.25245747,0.00024417907,0.7463034,0.0004541466,0.000043632375,0.00013648068,7.1828174e-7,0.00007367382,0.00028634263],"genre_scores_gemma":[0.8958277,0.000051810304,0.10384388,0.00009960876,0.000052498963,0.000019070261,0.0000080815325,0.000011712769,0.00008563906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986769,0.00002937735,0.00025738194,0.00028489402,0.0003479991,0.00040343314],"domain_scores_gemma":[0.99925035,0.00022120493,0.000103642946,0.00032795593,0.000044554414,0.00005226705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002498226,0.00016229415,0.00018478437,0.00019710636,0.00016377511,0.000064845444,0.00043184755,0.000042045725,0.000007902167],"category_scores_gemma":[0.00006070024,0.00013441195,0.000046724588,0.00063848105,0.00005014962,0.0003310558,0.00006476947,0.00019833076,0.000014648876],"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.000027800299,0.00041987977,0.0022050648,0.00015045678,0.00011400294,0.00012857158,0.010576337,0.04585697,0.0036360864,0.9264212,0.00035731352,0.010106301],"study_design_scores_gemma":[0.0018152003,0.0008926919,0.0043422277,0.00030649747,0.000035052224,0.0009339722,0.00012880113,0.37784517,0.042840254,0.5683696,0.0012327906,0.0012577418],"about_ca_topic_score_codex":0.000012040237,"about_ca_topic_score_gemma":0.00003526258,"teacher_disagreement_score":0.6433703,"about_ca_system_score_codex":0.00008766134,"about_ca_system_score_gemma":0.00015786069,"threshold_uncertainty_score":0.548116},"labels":[],"label_agreement":null},{"id":"W2010369728","doi":"10.1007/s00453-004-1101-6","title":"A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons","year":2004,"lang":"en","type":"article","venue":"Algorithmica","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":"Memorial University of Newfoundland","funders":"","keywords":"Triangulation; Theory of computation; Polygon (computer graphics); Mathematics; Regular polygon; Minimum-weight triangulation; Convex polygon; Scheme (mathematics); Polygon covering; Delaunay triangulation; Combinatorics; Approximation algorithm; Convex combination; Algorithm; Mathematical optimization; Convex optimization; Computer science; Bowyer–Watson algorithm; Geometry; Mathematical analysis","score_opus":0.01231174919954155,"score_gpt":0.24676557071402974,"score_spread":0.23445382151448818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010369728","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.012432724,0.00006701872,0.98525685,0.0013935794,0.00023203985,0.0003686491,0.000011481999,0.0000780708,0.00015958164],"genre_scores_gemma":[0.26828077,0.0000020720267,0.7310416,0.000111144764,0.00024339222,0.0000395153,0.00008969159,0.000008116159,0.00018368236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909055,0.000027651102,0.00028154542,0.00024279075,0.00020977738,0.0001476745],"domain_scores_gemma":[0.9992922,0.000083138475,0.00014279973,0.00021906865,0.00021159799,0.00005118014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028110418,0.000097433745,0.00014908219,0.00015427326,0.00008846142,0.000031590404,0.00022723457,0.000064661595,0.000010813286],"category_scores_gemma":[0.000075141164,0.000098593664,0.00008288579,0.00044191992,0.000023911549,0.00035857875,0.000044929468,0.000046378485,0.000032354506],"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.00012258656,0.0007234294,0.00003395515,0.00014439684,0.0001416422,0.000003836557,0.0013959901,0.026424082,0.13334009,0.3655921,0.0011215856,0.4709563],"study_design_scores_gemma":[0.0015852378,0.00014204484,0.00027515893,0.00002020406,0.000011236174,0.0000095554715,0.000005064685,0.82132447,0.1062016,0.0685033,0.0017656949,0.00015643678],"about_ca_topic_score_codex":0.0000068031663,"about_ca_topic_score_gemma":4.9086304e-7,"teacher_disagreement_score":0.79490036,"about_ca_system_score_codex":0.000042156713,"about_ca_system_score_gemma":0.00012749006,"threshold_uncertainty_score":0.4020533},"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":"W2010561968","doi":"10.1007/s00453-009-9357-5","title":"Crossing Number and Weighted Crossing Number of Near-Planar Graphs","year":2009,"lang":"en","type":"article","venue":"Algorithmica","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":"Simon Fraser University","funders":"","keywords":"Crossing number (knot theory); Combinatorics; Planar graph; Mathematics; Planar; Book embedding; Theory of computation; Graph; Discrete mathematics; 1-planar graph; Line graph; Computer science; Algorithm","score_opus":0.010159103720011614,"score_gpt":0.271349627299671,"score_spread":0.2611905235796594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010561968","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.64539385,0.00010125811,0.35223904,0.00039972196,0.000216823,0.000075667005,0.0000039849947,0.00007782198,0.0014918415],"genre_scores_gemma":[0.7292034,0.0000023237892,0.27016655,0.00045208263,0.00006741486,0.0000011990437,0.0000061801647,0.000004392556,0.000096447686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989771,0.000039473023,0.00024677202,0.0002968851,0.00023608793,0.0002036718],"domain_scores_gemma":[0.9994102,0.000071793635,0.00010114762,0.00021306175,0.00012132203,0.000082448176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017130074,0.000120210636,0.00015469026,0.000050316266,0.00049693446,0.0007129096,0.00020671065,0.00006155238,0.000025626825],"category_scores_gemma":[0.000015800304,0.00011807872,0.00004947224,0.0005238831,0.00015457792,0.00046188646,0.000041861156,0.00009390765,0.000027342941],"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.00002216195,0.00019636945,0.0049113026,0.00002436686,0.000045864974,0.000036924495,0.0023045854,0.00020806576,0.00844357,0.09196893,0.0016145995,0.89022326],"study_design_scores_gemma":[0.0019202093,0.00018250049,0.1317202,0.0001241489,0.000038545855,0.00070199074,0.00003695425,0.55230266,0.029506555,0.25471646,0.027838897,0.00091086555],"about_ca_topic_score_codex":0.000028473138,"about_ca_topic_score_gemma":0.0000010553174,"teacher_disagreement_score":0.8893124,"about_ca_system_score_codex":0.000014600814,"about_ca_system_score_gemma":0.00011064349,"threshold_uncertainty_score":0.68746036},"labels":[],"label_agreement":null},{"id":"W2010870819","doi":"10.1007/s11390-013-1327-3","title":"Exact Computation of the Topology and Geometric Invariants of the Voronoi Diagram of Spheres in 3D","year":2013,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","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 New Brunswick","funders":"","keywords":"Voronoi diagram; Bowyer–Watson algorithm; Delaunay triangulation; Mathematics; Weighted Voronoi diagram; Computation; Power diagram; Polynomial; Discrete mathematics; Combinatorics; Algorithm; Geometry; Mathematical analysis","score_opus":0.007804314696087489,"score_gpt":0.2280808822904212,"score_spread":0.2202765675943337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010870819","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.7323736,0.0002735567,0.2655742,0.0013802284,0.0002874203,0.000094002186,2.2779402e-7,0.0000028413888,0.000013955227],"genre_scores_gemma":[0.9755635,0.00003079683,0.024322942,0.000061027793,0.000017275479,9.3520424e-7,2.8237256e-8,0.0000013273722,0.0000021686258],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988713,0.00006574649,0.0004590987,0.00014231204,0.00033494795,0.00012654466],"domain_scores_gemma":[0.9984595,0.00013623334,0.00058455154,0.00019897327,0.0005931564,0.000027589367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005693951,0.000068797766,0.000218215,0.0007545873,0.00006798962,0.000029558902,0.00084462477,0.00006215825,0.0000020025466],"category_scores_gemma":[0.00019203659,0.00004093116,0.000030367652,0.0032626095,0.00071638316,0.00042937783,0.00050719985,0.0001421836,1.8386554e-7],"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.0000053901686,0.00015500991,0.092412196,0.000039696493,0.000019224555,0.0000016125342,0.00039824063,0.0057968176,0.013984827,0.027974151,0.00013030367,0.8590825],"study_design_scores_gemma":[0.00066619966,0.00058707455,0.69409186,0.00010250663,0.000009611176,0.00022554139,0.00008925636,0.23014194,0.033730168,0.040216744,0.000043167634,0.00009592129],"about_ca_topic_score_codex":0.00004478614,"about_ca_topic_score_gemma":0.00001729171,"teacher_disagreement_score":0.8589866,"about_ca_system_score_codex":0.00001885334,"about_ca_system_score_gemma":0.00022386826,"threshold_uncertainty_score":0.26395437},"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":"W2014176749","doi":"10.1007/s00357-007-0014-x","title":"Algorithms for ℓ1-Embeddability and Related Problems","year":2007,"lang":"en","type":"article","venue":"Journal of Classification","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Heuristics; Constructive; Tabu search; Quadratic equation; Combinatorics; Variable (mathematics); Column generation; Algorithm; Mathematical optimization; Discrete mathematics; Computer science; Geometry; Process (computing); Mathematical analysis","score_opus":0.046190332217472735,"score_gpt":0.31476854169308316,"score_spread":0.2685782094756104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014176749","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.058744665,0.00018693009,0.9385704,0.0016248196,0.00041918736,0.00013562948,5.349564e-7,0.000013809316,0.0003040479],"genre_scores_gemma":[0.8866874,0.000019747058,0.112986445,0.000043416872,0.00012498599,0.0000022597876,0.000002694937,0.0000028877507,0.00013013392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912786,0.00002972722,0.00043876516,0.00011971115,0.00019188324,0.00009207302],"domain_scores_gemma":[0.998796,0.00021145145,0.00036819172,0.00010963807,0.00044709886,0.00006766256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001900075,0.000053152493,0.00009289204,0.00014542509,0.00007480118,0.00006014186,0.0001496777,0.000049556846,0.00000212375],"category_scores_gemma":[0.00016041019,0.000045538694,0.00004777572,0.00026205607,0.000021871741,0.00046016023,0.000015556037,0.00008190021,0.0000013914773],"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.00003700943,0.00019518052,0.0010764825,0.000046625053,0.000041717907,0.0000021389274,0.0009659808,0.0017114361,0.03307602,0.109164394,0.00085757865,0.85282546],"study_design_scores_gemma":[0.0015824339,0.0006248697,0.31227788,0.000045944984,0.000032518048,0.0003380637,0.000111715744,0.52235544,0.008101582,0.12863344,0.025659837,0.0002362603],"about_ca_topic_score_codex":4.634946e-7,"about_ca_topic_score_gemma":9.1295067e-7,"teacher_disagreement_score":0.8525892,"about_ca_system_score_codex":0.00004599901,"about_ca_system_score_gemma":0.000065864224,"threshold_uncertainty_score":0.1857014},"labels":[],"label_agreement":null},{"id":"W2014385756","doi":"10.1142/s0219876213500618","title":"HIERARCHICAL DOMAIN DECOMPOSITION WITH PARALLEL MESH REFINEMENT FOR BILLIONS-OF-DOF SCALE FINITE ELEMENT ANALYSES","year":2013,"lang":"en","type":"article","venue":"International Journal of Computational Methods","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Core Research for Evolutional Science and Technology; Ministry of Economy, Trade and Industry","keywords":"Polygon mesh; Domain decomposition methods; Computer science; Mesh generation; Finite element method; Parallel computing; Computational science; Supercomputer; Adaptive mesh refinement; Degrees of freedom (physics and chemistry); Domain (mathematical analysis); Parallel algorithm; Algorithm; Computer graphics (images); Mathematics","score_opus":0.048993689078733145,"score_gpt":0.4265657570560932,"score_spread":0.37757206797736004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014385756","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.023785833,0.0001262774,0.9699211,0.00505655,0.00062153145,0.00030056262,0.000014544788,0.000018112709,0.00015548909],"genre_scores_gemma":[0.20583247,0.000013873123,0.7934132,0.0003698936,0.00024123542,0.00003862992,0.000051243824,0.000008932354,0.000030525724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997078,0.00035446134,0.0010496137,0.0002665037,0.0010650648,0.00018637825],"domain_scores_gemma":[0.9941305,0.0017774267,0.00087754475,0.00015456244,0.0029215477,0.00013845458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012575103,0.00018690401,0.00033705225,0.0007352591,0.00010304223,0.00017696609,0.0007857605,0.00005229339,0.00008645473],"category_scores_gemma":[0.00015039076,0.00014807512,0.00023805506,0.00044801214,0.00007241603,0.00070238626,0.000113463764,0.00015411866,0.000004395429],"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.00022352593,0.00038854877,0.00022395725,0.000018382962,0.0005069426,0.00000687465,0.00031088878,0.8237122,0.0046573966,0.057191916,0.0008827689,0.11187656],"study_design_scores_gemma":[0.0028476063,0.0010722138,0.009857605,0.000134355,0.000059993396,0.00022218683,0.00007427632,0.59278667,0.007909602,0.3803992,0.004333292,0.00030301267],"about_ca_topic_score_codex":0.000011159599,"about_ca_topic_score_gemma":0.0000023426908,"teacher_disagreement_score":0.3232073,"about_ca_system_score_codex":0.000114258706,"about_ca_system_score_gemma":0.00028509216,"threshold_uncertainty_score":0.60383284},"labels":[],"label_agreement":null},{"id":"W2014439009","doi":"10.1007/s10998-004-0518-7","title":"Constructions from empty polygons","year":2004,"lang":"en","type":"article","venue":"Periodica Mathematica Hungarica","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":"Mathematics; Combinatorics; Vertex (graph theory); Regular polygon; Polygon (computer graphics); General position; Plane (geometry); Set (abstract data type); Convex polygon; Position (finance); Geometry; Graph; Computer science","score_opus":0.011828956158968852,"score_gpt":0.23108089843942847,"score_spread":0.21925194228045963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014439009","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.04288783,0.00008972687,0.9372955,0.004635964,0.00034547845,0.00016921549,0.000014987772,0.00033262774,0.01422867],"genre_scores_gemma":[0.58921325,0.000007703986,0.41016132,0.00032281133,0.000112809095,0.000028139362,0.000014026006,0.000007817414,0.000132138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986465,0.00003782116,0.00032192623,0.00038961702,0.0003558465,0.00024829898],"domain_scores_gemma":[0.99894786,0.0001486312,0.00010377914,0.0005582337,0.000082613755,0.00015890252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012813254,0.00016113161,0.00020403149,0.00014063763,0.00043296785,0.00031314418,0.000554743,0.00006795006,0.00037090658],"category_scores_gemma":[0.00012858557,0.00015206756,0.00010292706,0.00052927254,0.00011493648,0.0003631673,0.00017130334,0.00014926067,0.00057132053],"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.0000048982724,0.0003783366,0.00007383458,0.000019295285,0.00008103239,0.000018875071,0.004581878,0.0011165321,0.0047845896,0.96622765,0.0012097738,0.021503316],"study_design_scores_gemma":[0.001492281,0.00015733007,0.0051375306,0.00007420781,0.00006767516,0.00025580882,0.00029328506,0.028870255,0.008912757,0.9203186,0.033583507,0.00083677296],"about_ca_topic_score_codex":0.00003810053,"about_ca_topic_score_gemma":0.000008398402,"teacher_disagreement_score":0.5463254,"about_ca_system_score_codex":0.00006719808,"about_ca_system_score_gemma":0.000230682,"threshold_uncertainty_score":0.734336},"labels":[],"label_agreement":null},{"id":"W2014523799","doi":"10.1145/2582112.2582149","title":"On triple intersections of three families of unit circles","year":2014,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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 British Columbia","funders":"","keywords":"Conjecture; Combinatorics; Unit (ring theory); Plane (geometry); Mathematics; Geometry","score_opus":0.023072125330282186,"score_gpt":0.2441261538264158,"score_spread":0.22105402849613362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014523799","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.25165257,0.0000051861543,0.7389544,0.000094699986,0.0001720638,0.000030451549,6.724654e-7,0.000019826053,0.009070087],"genre_scores_gemma":[0.9884739,0.0000015098586,0.011189982,0.00006391399,0.000018292623,0.0000017266872,0.0000017570757,0.0000012891888,0.00024760704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995955,0.00002286971,0.00013035841,0.000091549555,0.00011383264,0.000045889134],"domain_scores_gemma":[0.99954903,0.00013576302,0.000049919523,0.00016125699,0.00008749656,0.000016508737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012400784,0.000036128073,0.000069547204,0.00014867728,0.000028264218,0.000008550549,0.00016718256,0.000015458621,0.000021498308],"category_scores_gemma":[0.000055194807,0.000032212596,0.000033022618,0.00030930794,0.000020838277,0.000091705035,0.000039939052,0.000025152453,0.0000081558155],"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.0000052760834,0.00007058214,0.00040192998,0.000010235931,0.000010370998,5.4213434e-8,0.00018088233,0.010570286,0.004312652,0.9021672,0.0004547275,0.08181583],"study_design_scores_gemma":[0.0007554304,0.00091501314,0.074464224,0.00004192986,0.000009346409,0.0000041416743,0.00012443593,0.6153668,0.12540221,0.17969933,0.0030205534,0.00019654522],"about_ca_topic_score_codex":0.000041745276,"about_ca_topic_score_gemma":0.00009582509,"teacher_disagreement_score":0.73682135,"about_ca_system_score_codex":0.0000037453867,"about_ca_system_score_gemma":0.000017574117,"threshold_uncertainty_score":0.13135916},"labels":[],"label_agreement":null},{"id":"W2014917542","doi":"10.1007/pl00013388","title":"Approximate Shape Quality Mesh Generation","year":2001,"lang":"en","type":"article","venue":"Engineering With Computers","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 Waterloo","funders":"","keywords":"Quality (philosophy); Mathematics; Computer science; Engineering drawing; Engineering; Physics","score_opus":0.021198705711677576,"score_gpt":0.2334416915816198,"score_spread":0.21224298586994222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014917542","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.11666526,0.000048171645,0.8816224,0.0003638957,0.00069354125,0.000106482905,5.24282e-7,0.00035389196,0.00014583295],"genre_scores_gemma":[0.68666166,0.000007077775,0.3127249,0.00020318403,0.00028700437,0.000014051678,0.000018579562,0.0000102658805,0.00007331492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892735,0.000029207893,0.000200106,0.00033701208,0.00028305742,0.00022327228],"domain_scores_gemma":[0.9993992,0.00007438879,0.00005664157,0.0002956566,0.000080974125,0.00009315269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024347224,0.00015268712,0.00013375375,0.00014903517,0.00009103394,0.00018444078,0.00032238677,0.00003582628,0.000007960539],"category_scores_gemma":[0.000017532773,0.0001420958,0.000037808502,0.0005653172,0.0000096537115,0.00046106562,0.00007619226,0.000093280214,0.000016727858],"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.000006206151,0.00004330587,0.00020464396,0.000017200751,0.000033281398,0.00002229552,0.00024327316,0.89857596,0.0036322752,0.05337109,0.0007949588,0.04305548],"study_design_scores_gemma":[0.00027259276,0.000056839555,0.0035105017,0.000014558827,0.0000026945797,0.00005630283,0.0000016350172,0.991065,0.0009922525,0.000056875306,0.003759187,0.00021152732],"about_ca_topic_score_codex":0.0000042829433,"about_ca_topic_score_gemma":0.0000015473612,"teacher_disagreement_score":0.56999636,"about_ca_system_score_codex":0.000045793175,"about_ca_system_score_gemma":0.00003387506,"threshold_uncertainty_score":0.5794499},"labels":[],"label_agreement":null},{"id":"W2015734384","doi":"10.1016/s0304-3975(98)00132-7","title":"Three-dimensional weak visibility: Complexity and applications","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"Polyhedron; Disjoint sets; Visibility; Time complexity; Simple (philosophy); Combinatorics; Mathematics; Set (abstract data type); Space (punctuation); Computational complexity theory; Computer science; Algorithm; Discrete mathematics; Physics; Optics","score_opus":0.016896025729502356,"score_gpt":0.262296979198557,"score_spread":0.24540095346905463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015734384","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.04666879,0.000049638213,0.948922,0.0013042695,0.000116770345,0.00023566077,0.0000024701433,0.00016396248,0.0025364885],"genre_scores_gemma":[0.74324256,0.0000020478926,0.2559538,0.0006065305,0.0001562409,0.000013922685,0.000004100428,0.000003580457,0.00001726946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802047,0.00005003864,0.0002342536,0.00077156106,0.0005830484,0.00034059843],"domain_scores_gemma":[0.99876887,0.0001746469,0.000034122062,0.0005916621,0.00016565171,0.00026507373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091008836,0.00014414512,0.00014545809,0.00014420488,0.00067103765,0.0003624299,0.00096114655,0.00003690572,0.00032121816],"category_scores_gemma":[0.000014324992,0.00012675906,0.00003986078,0.0012111488,0.0022206444,0.00058926916,0.00046053663,0.00013210581,0.0001440117],"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.0000034031987,0.00004157632,0.000027103306,0.0000018740204,0.0000015447556,6.971401e-7,0.000022062228,0.00067171693,0.00008477225,0.7212788,0.000046922563,0.27781957],"study_design_scores_gemma":[0.0001084062,0.00005794853,0.0035838014,0.0000037233835,0.0000018411775,0.000036428235,3.3461708e-7,0.57412934,0.00022647803,0.42061007,0.0011279918,0.00011365611],"about_ca_topic_score_codex":0.0000065777053,"about_ca_topic_score_gemma":0.00000425848,"teacher_disagreement_score":0.69657373,"about_ca_system_score_codex":0.00003370883,"about_ca_system_score_gemma":0.000091564114,"threshold_uncertainty_score":0.81820565},"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":"W2016411822","doi":"10.1142/s0219467801000141","title":"COMPUTING LINE INTERSECTIONS","year":2001,"lang":"en","type":"article","venue":"International Journal of Image and Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"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 Calgary","funders":"","keywords":"Intersection (aeronautics); Line (geometry); Algorithm; Point (geometry); Computation; Subroutine; Floating point; Computer science; Binary number; Mathematics; Arithmetic; Geometry","score_opus":0.015543154640741812,"score_gpt":0.2920000189865417,"score_spread":0.2764568643457999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016411822","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.15949881,0.00020085681,0.8357034,0.0031624108,0.0010185998,0.000017907874,8.623989e-7,0.000012936792,0.00038420912],"genre_scores_gemma":[0.9672928,0.0003551017,0.031095203,0.0007023768,0.0004920633,2.1329707e-7,0.0000020055356,0.0000027928502,0.00005742934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992509,0.00002750776,0.00027350872,0.0000902397,0.0002858655,0.00007201482],"domain_scores_gemma":[0.9988819,0.000091981055,0.00018064283,0.00006212515,0.0007246632,0.000058695827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002852763,0.00006095211,0.000079365185,0.00037288966,0.00006513918,0.00018492527,0.00034617793,0.000023673469,0.00000864739],"category_scores_gemma":[0.00008111169,0.000054691453,0.00006978467,0.00026112408,0.000031837986,0.00063611765,0.00009101921,0.00013816089,0.0000027088045],"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.00016634032,0.000636198,0.013067731,0.000016675916,0.0006895932,0.0012435397,0.003016093,0.005582853,0.017083172,0.27457497,0.0072485805,0.67667425],"study_design_scores_gemma":[0.004879965,0.0013468515,0.08335232,0.00034558427,0.000080293015,0.022672713,0.00047958238,0.6050993,0.008593918,0.14269926,0.1295614,0.00088877225],"about_ca_topic_score_codex":0.0000062882427,"about_ca_topic_score_gemma":0.000005554214,"teacher_disagreement_score":0.807794,"about_ca_system_score_codex":0.000014662793,"about_ca_system_score_gemma":0.000038392525,"threshold_uncertainty_score":0.22302526},"labels":[],"label_agreement":null},{"id":"W2016629560","doi":"10.1088/1755-1315/22/2/022020","title":"Comparison of Two Mesh Smoothing Techniques for Unstructured Grids","year":2014,"lang":"en","type":"article","venue":"IOP Conference Series Earth and Environmental Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Smoothing; Smoothness; Finite volume method; Laplacian smoothing; Applied mathematics; Computer science; Mathematical optimization; Unstructured grid; Mathematics; Polygon mesh; Algorithm; Mesh generation; Grid; Mathematical analysis; Geometry; Finite element method; Engineering; Structural engineering","score_opus":0.01647919519110117,"score_gpt":0.26142531246145484,"score_spread":0.24494611727035367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016629560","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.59917367,0.00003257562,0.3997851,0.00015960085,0.00013497671,0.00014392014,0.0000060906555,0.000034363842,0.0005296969],"genre_scores_gemma":[0.90012676,0.000013520253,0.09967578,0.000070268106,0.000031435546,0.000008556159,0.000007088172,0.000002262302,0.00006435349],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99897945,0.000023603083,0.00019033113,0.0003250165,0.00028223146,0.00019939551],"domain_scores_gemma":[0.9995446,0.000045846755,0.00009946726,0.00018810431,0.000026268504,0.000095715775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034551488,0.000102947226,0.00014687415,0.00008556805,0.00028807163,0.00013762845,0.00038222555,0.000027012342,0.000012922424],"category_scores_gemma":[0.000032596134,0.00009394332,0.00002457027,0.00019403826,0.0005079067,0.0008234206,0.00017091344,0.000053721687,0.0000011610001],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010866225,0.000027601249,0.0011727242,0.000014064032,0.0000027720528,1.4136342e-7,0.0007799129,0.00034403327,0.5067998,0.12619855,0.000012869821,0.3646367],"study_design_scores_gemma":[0.00019447164,0.00033278027,0.012985229,0.000013171029,0.0000036226634,0.000009597328,0.000112567395,0.081591375,0.8944217,0.006994088,0.0031815546,0.0001598753],"about_ca_topic_score_codex":0.0000097994125,"about_ca_topic_score_gemma":0.000010289407,"teacher_disagreement_score":0.38762188,"about_ca_system_score_codex":0.00001179263,"about_ca_system_score_gemma":0.000046623456,"threshold_uncertainty_score":0.38308975},"labels":[],"label_agreement":null},{"id":"W2016780725","doi":"10.1007/s00454-012-9429-1","title":"The Art Gallery Theorem for Polyominoes","year":2012,"lang":"en","type":"article","venue":"Discrete & 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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Polyomino; Combinatorics; Mathematics; Art gallery; Discrete mathematics; Regular polygon; Geometry; Art history; Art","score_opus":0.01631502397956291,"score_gpt":0.2707261965360722,"score_spread":0.2544111725565093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016780725","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.011824395,0.00085206435,0.97989,0.0026069898,0.0013972609,0.00035355313,0.000021340104,0.00013839555,0.0029160145],"genre_scores_gemma":[0.91466415,0.000016933163,0.08159621,0.00088593434,0.0007745105,0.00009808325,0.00017983833,0.00001805026,0.0017662839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980961,0.00009481218,0.0003741953,0.00033378694,0.00056008506,0.0005410385],"domain_scores_gemma":[0.997362,0.0016874039,0.0001604225,0.00033921943,0.00026696394,0.00018394843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009994298,0.00020775599,0.00016318103,0.00021259354,0.0007863506,0.0003445601,0.0006868453,0.000065054475,0.000026125488],"category_scores_gemma":[0.00021274132,0.00015489927,0.0001861056,0.00077615434,0.000091762005,0.00080768194,0.00019529843,0.00012591989,0.00018454119],"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.00003484022,0.000091582224,0.0010249119,0.0000148297295,0.00008537571,6.5021504e-7,0.0002742943,0.03193636,0.00009502269,0.89677316,0.021600218,0.048068777],"study_design_scores_gemma":[0.0011145015,0.00018533376,0.068229,0.000023830667,0.000033759414,0.0000737739,0.00015711559,0.4142858,0.0008121424,0.20775637,0.30655542,0.0007729519],"about_ca_topic_score_codex":0.000001387446,"about_ca_topic_score_gemma":0.0000011846492,"teacher_disagreement_score":0.9028398,"about_ca_system_score_codex":0.000054905373,"about_ca_system_score_gemma":0.00011210634,"threshold_uncertainty_score":0.6316609},"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":"W2017073655","doi":"10.1016/s0377-2217(03)00389-8","title":"A mixed integer formulation for maximal covering by inclined parallelograms","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parallelogram; Integer (computer science); Mathematics; Combinatorics; Integer programming; Mathematical optimization; Computer science; Artificial intelligence","score_opus":0.12250108941023673,"score_gpt":0.3605759589767022,"score_spread":0.23807486956646545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017073655","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.037111104,0.00019850295,0.9590776,0.0011882568,0.0002997579,0.00018507447,0.0000038471007,0.000009892805,0.0019259702],"genre_scores_gemma":[0.88579917,0.000017749477,0.11316704,0.00013482702,0.00021042067,0.0000055044884,0.000021854015,0.0000109638995,0.00063245255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99748504,0.0007989931,0.0004915562,0.00018773561,0.00079876394,0.00023792741],"domain_scores_gemma":[0.9976162,0.00045770002,0.00012910349,0.00013425102,0.0015337422,0.00012903086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062357397,0.00009122516,0.00012142903,0.00027584558,0.00033710827,0.0003730639,0.00044345792,0.000021358146,0.000033272438],"category_scores_gemma":[0.0012494631,0.00007946992,0.00008747608,0.00044705177,0.00002439485,0.0008121111,0.000076572076,0.00025247494,0.000026581673],"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.0002748756,0.00041861372,0.0002831651,0.000030043788,0.000106744155,0.00005507302,0.00072235544,0.06767704,0.037544645,0.77803,0.056459446,0.058397997],"study_design_scores_gemma":[0.0051086918,0.0028109062,0.0043167877,0.000095746844,0.000012379007,0.00039538054,0.00014363973,0.33696055,0.020882027,0.017348295,0.611417,0.00050859293],"about_ca_topic_score_codex":8.682323e-7,"about_ca_topic_score_gemma":7.802111e-7,"teacher_disagreement_score":0.84868807,"about_ca_system_score_codex":0.00007990059,"about_ca_system_score_gemma":0.00029237295,"threshold_uncertainty_score":0.35974637},"labels":[],"label_agreement":null},{"id":"W2017228186","doi":"10.7155/jgaa.00317","title":"More on Generalized Jewels and the PointPlacement Problem","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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 Windsor","funders":"","keywords":"Point (geometry); Computer science; Mathematics; Calculus (dental); Geometry; Orthodontics; Medicine","score_opus":0.007711995862403725,"score_gpt":0.24300440033588805,"score_spread":0.23529240447348432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017228186","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.008551965,0.00042514643,0.9818769,0.008556876,0.00005332486,0.00020375701,0.0000012432902,0.0000092380005,0.00032156656],"genre_scores_gemma":[0.61105317,0.0011246033,0.3831038,0.0033662901,0.00089126517,0.00014606907,0.0000055973424,0.000012194259,0.00029701728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934006,0.000052874435,0.00022776135,0.00011584113,0.00018880049,0.00007466565],"domain_scores_gemma":[0.9993597,0.00014009312,0.00017910026,0.00012875463,0.0001242923,0.000068038105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058157125,0.00006823975,0.000114160866,0.00010548027,0.00021124327,0.00011395389,0.00017208085,0.000019503941,0.0000016635292],"category_scores_gemma":[0.00001034506,0.000041494106,0.000047006928,0.00023435909,0.00006866129,0.0001204631,0.0000415917,0.000086888154,0.0000010321437],"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.000015082892,0.000048722097,0.000030354997,0.000005534932,0.000026351408,3.0603815e-7,0.00019681192,0.0013460628,0.0001523326,0.76027733,0.0006411132,0.23726001],"study_design_scores_gemma":[0.005442839,0.00049728865,0.0064167283,0.00004148719,0.00006617485,0.0002838606,0.000111227506,0.32175198,0.00061770726,0.5228723,0.14161596,0.00028245084],"about_ca_topic_score_codex":0.0000027761457,"about_ca_topic_score_gemma":5.0310547e-7,"teacher_disagreement_score":0.6025012,"about_ca_system_score_codex":0.000005963934,"about_ca_system_score_gemma":0.000017942955,"threshold_uncertainty_score":0.16920805},"labels":[],"label_agreement":null},{"id":"W2017232301","doi":"10.1145/1230040.1230069","title":"Comparing interest management algorithms for massively multiplayer games","year":2006,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Massively parallel; Distributed computing; Visibility; Algorithm; Parallel computing","score_opus":0.05807698449448591,"score_gpt":0.2795179095012167,"score_spread":0.2214409250067308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017232301","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.012261373,0.000031918444,0.9790305,0.00045600225,0.00033205174,0.00021030079,0.0000010003622,0.0001139878,0.007562873],"genre_scores_gemma":[0.62021756,9.652276e-7,0.37631413,0.00012061631,0.00009638644,0.000029896928,0.000012554437,0.0000029124112,0.0032049923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933386,0.000011104775,0.00015686272,0.0002421298,0.00010797604,0.00014807272],"domain_scores_gemma":[0.99966955,0.000054756132,0.00004059943,0.0001429533,0.000063597494,0.00002852339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010472685,0.00008016863,0.0000786642,0.0001091278,0.000089823836,0.00014470653,0.00026200514,0.000018319119,0.00000866061],"category_scores_gemma":[0.0000036888753,0.00007338322,0.00004602625,0.00016919125,0.000008851888,0.00023244068,0.00012237974,0.000027190612,0.000029301988],"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.000007288093,0.00011528768,0.00054399454,0.000024921535,0.000026630885,0.0000056656413,0.00004285431,0.027182948,0.00058215077,0.8505343,0.0152879115,0.10564604],"study_design_scores_gemma":[0.0005831469,0.000032188895,0.013751955,0.000008965995,0.0000046594373,0.0000045471425,0.00001579831,0.9382024,0.0045873257,0.011608705,0.03105308,0.00014724456],"about_ca_topic_score_codex":0.000015222583,"about_ca_topic_score_gemma":0.00002447919,"teacher_disagreement_score":0.91101944,"about_ca_system_score_codex":0.000025009364,"about_ca_system_score_gemma":0.000007974211,"threshold_uncertainty_score":0.2992481},"labels":[],"label_agreement":null},{"id":"W2017352617","doi":"10.1007/978-3-540-24595-7_32","title":"Experiments with the Fixed-Parameter Approach for Two-Layer Planarization","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Chemical-mechanical planarization; Layer (electronics); Integer programming; Linear programming; Integer (computer science); Algorithm; Running time; Mathematical optimization; Parallel computing; Theoretical computer science; Mathematics; Programming language","score_opus":0.02651714170800634,"score_gpt":0.2639572316062054,"score_spread":0.23744008989819904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017352617","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.000084083775,0.00016579781,0.9961761,0.00076773413,0.00059575174,0.00087192847,0.000005263171,0.00007989422,0.0012534454],"genre_scores_gemma":[0.22427358,0.0000032528103,0.772792,0.0019710448,0.0004719414,0.000073717005,0.000050864724,0.000026478987,0.00033714756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972995,0.000026253228,0.0003040398,0.0011385217,0.00081451976,0.00041714948],"domain_scores_gemma":[0.99823153,0.00039706248,0.00022732123,0.00078746927,0.00026677013,0.00008982874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005170249,0.0003903232,0.0002886839,0.00042715637,0.00041169053,0.0005909666,0.0017265694,0.00014726605,0.0000074586355],"category_scores_gemma":[0.00003347286,0.00026552766,0.00008755394,0.00056355726,0.00030412799,0.0005051616,0.00035161333,0.00033091716,0.000006630397],"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.000016094327,0.00003734933,0.0000062448185,0.000019582687,0.000017780709,0.0000061158858,0.0006852754,0.831861,0.00021669336,0.058221646,0.00004171417,0.10887048],"study_design_scores_gemma":[0.0006897562,0.0002746574,0.00002860102,0.000080021295,0.000012553737,0.000050732833,3.6333958e-7,0.9312911,0.0054860474,0.06073637,0.00085380016,0.00049600593],"about_ca_topic_score_codex":0.000008959405,"about_ca_topic_score_gemma":0.000011618411,"teacher_disagreement_score":0.22418949,"about_ca_system_score_codex":0.00023056038,"about_ca_system_score_gemma":0.00052925985,"threshold_uncertainty_score":0.9999797},"labels":[],"label_agreement":null},{"id":"W2017440808","doi":"10.1007/s00453-001-0014-x","title":"A One-Step Crust and Skeleton Extraction Algorithm","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":80,"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; Université Laval","funders":"","keywords":"Voronoi diagram; Skeleton (computer programming); Algorithm; Vertex (graph theory); Computer science; Crust; Topology (electrical circuits); Combinatorics; Mathematics; Geology; Geometry; Theoretical computer science; Graph; Geophysics","score_opus":0.015919686652957406,"score_gpt":0.25864024643772116,"score_spread":0.24272055978476376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017440808","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.008277969,0.00025895156,0.9877921,0.001342098,0.0004110251,0.00012376983,0.0000019990152,0.00014747166,0.0016446488],"genre_scores_gemma":[0.15241908,0.0001994368,0.84449714,0.0006781601,0.00071649876,0.000028050046,0.000024617322,0.000014031066,0.0014229828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893963,0.00004396546,0.0001816102,0.0003669022,0.00025861466,0.00020925423],"domain_scores_gemma":[0.9994122,0.00008332985,0.0000653859,0.00023475058,0.00009537812,0.00010897834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017754296,0.00011275744,0.00011498044,0.00014742652,0.00017425409,0.00015959489,0.00020864335,0.0000648767,0.000028829996],"category_scores_gemma":[0.00002134471,0.00012599929,0.00003694196,0.00046072507,0.000026762034,0.00060460053,0.000098645076,0.00011717696,0.00007038559],"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.0000021686237,0.000056204673,0.000019180778,0.0000026027774,0.000010953996,0.000012053157,0.00005674234,0.00007349928,0.00060783065,0.0051482716,0.00045818128,0.9935523],"study_design_scores_gemma":[0.0005306557,0.00014214577,0.007109091,0.000014574632,0.00001279158,0.000278943,0.000020127996,0.882218,0.002514835,0.006888985,0.09996653,0.00030332603],"about_ca_topic_score_codex":0.00003941803,"about_ca_topic_score_gemma":0.0000050040194,"teacher_disagreement_score":0.993249,"about_ca_system_score_codex":0.00003538219,"about_ca_system_score_gemma":0.000042686443,"threshold_uncertainty_score":0.51381016},"labels":[],"label_agreement":null},{"id":"W2017477785","doi":"10.1007/s00454-002-2707-6","title":"The Size of Spanning Disks for Polygonal Curves","year":2002,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"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":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Integer (computer science); Piecewise linear function; Geometry; Computer science","score_opus":0.022293254525976927,"score_gpt":0.2664097479403711,"score_spread":0.24411649341439418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017477785","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.0164325,0.004724623,0.9720744,0.004706812,0.0005518018,0.00036459087,0.000051298397,0.00008238095,0.0010116297],"genre_scores_gemma":[0.93823755,0.00010740002,0.059821982,0.0006760933,0.00019040852,0.000049873383,0.00006412986,0.0000130882745,0.00083945034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981372,0.0000709609,0.00047844407,0.00036525197,0.0006449438,0.00030322315],"domain_scores_gemma":[0.9962946,0.002684798,0.00024914055,0.00028598116,0.00039119314,0.000094280396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004912458,0.00017454271,0.00020163265,0.00014860214,0.00046748447,0.00013732268,0.000696041,0.000047278954,0.0000535671],"category_scores_gemma":[0.0005070472,0.00013985904,0.00019202565,0.0009971248,0.00010667725,0.0003901752,0.00016006292,0.00011369442,0.00001975695],"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.00005370598,0.00026700093,0.001505074,0.0002757038,0.00026321388,0.000004503369,0.0005982632,0.2743934,0.0004886386,0.55221957,0.03168896,0.13824198],"study_design_scores_gemma":[0.0007078263,0.00018832971,0.024987614,0.00010450954,0.00002337147,0.000024395827,0.00004024639,0.91727763,0.000430867,0.044639643,0.011242744,0.00033281904],"about_ca_topic_score_codex":0.000004873062,"about_ca_topic_score_gemma":0.0000012848702,"teacher_disagreement_score":0.9218051,"about_ca_system_score_codex":0.000029869196,"about_ca_system_score_gemma":0.00006108386,"threshold_uncertainty_score":0.5703286},"labels":[],"label_agreement":null},{"id":"W2017601359","doi":"10.1090/tran/6585","title":"Quantitative visibility estimates for unrectifiable sets in the plane","year":2015,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Defense Science and Engineering Graduate; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Defense; National Science Foundation","keywords":"Mathematics; Visibility; Plane (geometry); Geometry; Statistics; Geography; Meteorology","score_opus":0.05321020391888198,"score_gpt":0.3341455620645362,"score_spread":0.28093535814565423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017601359","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.08477436,0.000023187727,0.9125304,0.0021272148,0.000059787446,0.00030050275,0.000009975618,0.000022767532,0.00015180741],"genre_scores_gemma":[0.6733872,0.0000015454901,0.32635662,0.0001719761,0.0000061862297,0.00004345868,0.0000013619577,0.0000029528273,0.000028699274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991773,0.00008881372,0.00021061403,0.00015189007,0.00024312819,0.00012828573],"domain_scores_gemma":[0.9982648,0.0011850992,0.00011019408,0.000310531,0.000095938594,0.000033427015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008466397,0.000076864926,0.0001654124,0.000018036124,0.0001172982,0.000036169822,0.00048194348,0.000017875846,0.0000041567796],"category_scores_gemma":[0.00014503552,0.00004528889,0.00015758399,0.00068925874,0.0001938662,0.00014289984,0.000014247685,0.00009504888,0.0000037602556],"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.00027633982,0.004114657,0.00073778594,0.00060450746,0.00048639165,0.0000011102958,0.08742282,0.47485057,0.0058747805,0.36741495,0.008720837,0.04949528],"study_design_scores_gemma":[0.00030623248,0.0002569333,0.0010749594,0.000017947776,0.000027334469,0.000008449984,0.0023668688,0.76336646,0.0016299901,0.23071815,0.00012828462,0.00009837646],"about_ca_topic_score_codex":0.000052465795,"about_ca_topic_score_gemma":0.000008457894,"teacher_disagreement_score":0.58861285,"about_ca_system_score_codex":0.000039159684,"about_ca_system_score_gemma":0.00007948386,"threshold_uncertainty_score":0.18468273},"labels":[],"label_agreement":null},{"id":"W2017740827","doi":"10.1002/nme.3138","title":"Tetrahedral mesh generation using Delaunay refinement with non‐standard quality measures","year":2011,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":19,"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 British Columbia","funders":"","keywords":"Delaunay triangulation; Polygon mesh; Dihedral angle; Tetrahedron; Bowyer–Watson algorithm; Measure (data warehouse); Chew's second algorithm; Ruppert's algorithm; Mesh generation; Computer science; Constrained Delaunay triangulation; Algorithm; Mathematics; Topology (electrical circuits); Geometry; Combinatorics; Finite element method; Data mining; Physics","score_opus":0.13819606947837026,"score_gpt":0.41863026613174986,"score_spread":0.2804341966533796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017740827","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.012895783,0.000072690396,0.98425704,0.00017275564,0.0023633088,0.0001271679,0.0000038021187,0.000037974823,0.00006945612],"genre_scores_gemma":[0.21880807,0.000009068528,0.78071404,0.00007719524,0.00034574408,0.000015929572,0.0000038812323,0.000011554417,0.000014488843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835175,0.00012302613,0.00051314774,0.00026160592,0.0005228291,0.00022761499],"domain_scores_gemma":[0.99896044,0.00017577934,0.00016931647,0.00013285995,0.0004547917,0.00010683022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016661368,0.00015792236,0.00020333462,0.00034512783,0.00008937369,0.00016030594,0.0004952596,0.00005308057,0.000015016383],"category_scores_gemma":[0.00035358683,0.0001379997,0.00009628111,0.00033388342,0.000012362966,0.0005356387,0.00006922237,0.00022096092,7.361454e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022038403,0.00015862322,0.000877777,0.000019110921,0.00023581201,0.000047731173,0.0011626029,0.6287608,0.066719614,0.03074076,0.000104372186,0.2709524],"study_design_scores_gemma":[0.0008088681,0.00019240764,0.0014734062,0.00004738692,0.000011468522,0.00019552062,0.000019502977,0.9535282,0.03898072,0.0019983116,0.002488063,0.0002561064],"about_ca_topic_score_codex":0.000022120113,"about_ca_topic_score_gemma":0.0000036329259,"teacher_disagreement_score":0.32476744,"about_ca_system_score_codex":0.00028572857,"about_ca_system_score_gemma":0.0001030691,"threshold_uncertainty_score":0.56274647},"labels":[],"label_agreement":null},{"id":"W2018403223","doi":"10.1142/s1793830910000899","title":"A SUCCINCT 3D VISIBILITY SKELETON","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","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 Victoria; McGill University","funders":"","keywords":"Visibility; Skeleton (computer programming); Set (abstract data type); Computer science; Rest (music); Theoretical computer science; Algorithm; Artificial intelligence; Geography","score_opus":0.00903917616466114,"score_gpt":0.2646601547034648,"score_spread":0.25562097853880367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018403223","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.013518671,0.00004068669,0.9830445,0.0005758885,0.000075724485,0.00035040366,0.0000112508205,0.00010478886,0.0022780814],"genre_scores_gemma":[0.25365967,0.00001576317,0.745465,0.0001111538,0.00021196745,0.00021715218,0.000030873452,0.000009643333,0.00027878242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911124,0.0000108817,0.00023072172,0.00032091775,0.00018031785,0.00014594592],"domain_scores_gemma":[0.99909157,0.00011575461,0.00008532337,0.00050140737,0.000100010904,0.00010591779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028414433,0.0001152194,0.00012053801,0.00006903502,0.00024589506,0.00019998834,0.00030350927,0.000052229378,0.000021246651],"category_scores_gemma":[0.000027328075,0.00010126842,0.000040660103,0.00033823913,0.000047629896,0.00020916887,0.0001367026,0.00013800764,0.000032634714],"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":[3.8915528e-7,0.00012380807,0.000041763724,0.000034507186,0.0000107278975,4.6698742e-7,0.00030056006,0.0000670241,0.0028862625,0.81739575,0.000089832014,0.17904893],"study_design_scores_gemma":[0.00023936013,0.000032919488,0.0018115992,0.000006998482,0.000014642418,0.00003653404,0.000040999388,0.7629975,0.0014032684,0.19972797,0.033408422,0.00027977696],"about_ca_topic_score_codex":0.0000071780973,"about_ca_topic_score_gemma":0.000009239053,"teacher_disagreement_score":0.7629305,"about_ca_system_score_codex":0.000007358518,"about_ca_system_score_gemma":0.000036500365,"threshold_uncertainty_score":0.41296065},"labels":[],"label_agreement":null},{"id":"W2018648493","doi":"10.1109/hpcsim.2013.6641459","title":"2D Triangulation of Polygons on CUDA","year":2013,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"CUDA; Computer science; General-purpose computing on graphics processing units; Polygon (computer graphics); Parallel computing; Triangulation; Graphics processing unit; Graphics; Massively parallel; Computer graphics (images); Computational science; Mathematics","score_opus":0.01571585455390943,"score_gpt":0.23952291150902877,"score_spread":0.22380705695511935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018648493","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.13614282,0.000013045111,0.84901714,0.001218751,0.0001910564,0.000113867165,3.2673043e-7,0.00004677598,0.013256188],"genre_scores_gemma":[0.9653782,7.7337893e-7,0.032594033,0.0002682748,0.000042069194,0.000005914026,0.0000032718585,0.0000013713632,0.0017060876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956656,0.000020288804,0.00011378628,0.00010425365,0.00013519508,0.000059920254],"domain_scores_gemma":[0.99964845,0.00006334755,0.000038177917,0.0001478081,0.000074377785,0.00002786657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007071919,0.000038023627,0.00004855742,0.00009517749,0.000029095178,0.000032922148,0.00013066395,0.000017932833,0.00016485964],"category_scores_gemma":[0.000022112301,0.00003174352,0.00002578837,0.00026145362,0.000006242767,0.00025171062,0.000025696832,0.00002120952,0.00017720938],"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.0000033889655,0.000093919276,0.0001870635,0.0000043991454,0.000008789143,2.731745e-7,0.00018743514,0.0108542,0.012488423,0.69994783,0.00786618,0.2683581],"study_design_scores_gemma":[0.0007127798,0.00031345282,0.098333254,0.000012512159,0.000003946799,0.00000461711,0.000024924804,0.7525777,0.09141876,0.052504048,0.0038775245,0.00021648033],"about_ca_topic_score_codex":0.0000332389,"about_ca_topic_score_gemma":0.0000016813427,"teacher_disagreement_score":0.8292354,"about_ca_system_score_codex":0.0000079003385,"about_ca_system_score_gemma":0.000021214566,"threshold_uncertainty_score":0.22777273},"labels":[],"label_agreement":null},{"id":"W2019038833","doi":"10.1007/s00493-014-2967-9","title":"Erratum to: Commentary for “On planarity of compact, locally connected, metric spaces”","year":2014,"lang":"en","type":"erratum","venue":"COMBINATORICA","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":"Mathematics; Planarity testing; Metric space; Metric (unit); Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.018324183717083123,"score_gpt":0.2670987992344801,"score_spread":0.248774615517397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019038833","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.00026052754,0.0012314108,0.8730053,0.018999627,0.07702231,0.002014095,0.00021237506,0.00032646736,0.026927928],"genre_scores_gemma":[0.79066306,0.0003628384,0.03944377,0.04107713,0.0066266544,0.0004923464,0.0072841705,0.00035567692,0.11369437],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972479,0.00018695243,0.00058615307,0.0007747922,0.00076025474,0.00044398423],"domain_scores_gemma":[0.99677086,0.00092180085,0.00046649037,0.00095401815,0.00059503823,0.0002917897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005566819,0.00043828637,0.00081706175,0.0009454571,0.0002275719,0.00016601056,0.0015792393,0.00035442525,0.000011501028],"category_scores_gemma":[0.00039148727,0.0004456264,0.00024202272,0.0019060161,0.000041615298,0.00014784819,0.00026726216,0.00057745783,0.000037342943],"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.00003892305,0.00030789291,0.000013413817,0.00016739426,0.00007760485,0.0000038154935,0.000067420806,0.00084128045,0.000013180749,0.06424136,0.93171364,0.0025140757],"study_design_scores_gemma":[0.0009734297,0.0017425353,0.0004577625,0.00016479661,0.000045968707,0.000006296236,0.000006359631,0.025384884,0.0003316499,0.020041415,0.9503042,0.00054067525],"about_ca_topic_score_codex":0.00006685334,"about_ca_topic_score_gemma":0.000011250825,"teacher_disagreement_score":0.8335615,"about_ca_system_score_codex":0.0002508354,"about_ca_system_score_gemma":0.00032928964,"threshold_uncertainty_score":0.99979955},"labels":[],"label_agreement":null},{"id":"W2020768255","doi":"","title":"Distribution-sensitive point location in convex subdivisions","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Point location; Subdivision; Regular polygon; Point (geometry); Computer science; Point distribution model; Planar; Distribution (mathematics); Tree (set theory); Data structure; Algorithm; Mathematics; Combinatorics; Geometry; Artificial intelligence; Geography; Computer graphics (images); Mathematical analysis","score_opus":0.011030668313369931,"score_gpt":0.2568006801313277,"score_spread":0.24577001181795774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020768255","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.06438673,0.000015848864,0.93205684,0.0010089525,0.00018728945,0.00009060566,0.0000014357477,0.000058016547,0.0021942907],"genre_scores_gemma":[0.9874916,0.0000021764647,0.011909604,0.00028619214,0.000042107455,0.0000022221589,0.000057916342,0.0000016294495,0.0002065257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99928707,0.000027178354,0.00018392963,0.00019158577,0.00016199354,0.00014823886],"domain_scores_gemma":[0.99942213,0.00016657675,0.000033761196,0.00014163721,0.00018092581,0.000054942488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005583896,0.00005825224,0.00006167719,0.0001099807,0.00006514499,0.00004506472,0.00012163999,0.000031820255,0.000012287218],"category_scores_gemma":[0.00008453798,0.00005624179,0.000019201887,0.00089270907,0.000015356976,0.0003210833,0.00005592901,0.00006011499,0.000075849646],"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.000007661279,0.00011345503,0.0012688037,0.000003627222,0.0000044985486,0.000017550785,0.00035529115,0.00509262,0.001023801,0.92335796,0.0014053117,0.06734941],"study_design_scores_gemma":[0.00068251044,0.0001201947,0.6071634,0.000023900773,0.0000028039192,0.00003584934,0.00018213363,0.33424735,0.034674868,0.017970536,0.0045761685,0.00032026673],"about_ca_topic_score_codex":0.000039623184,"about_ca_topic_score_gemma":0.00010355645,"teacher_disagreement_score":0.9231049,"about_ca_system_score_codex":0.00007140096,"about_ca_system_score_gemma":0.00005431196,"threshold_uncertainty_score":0.22934738},"labels":[],"label_agreement":null},{"id":"W2020827550","doi":"10.1007/s00454-012-9464-y","title":"A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing","year":2012,"lang":"en","type":"article","venue":"Discrete & 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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hyperplane; Planar graph; Lemma (botany); Transversal (combinatorics); Vertex (graph theory); Discrete mathematics; Center (category theory); Graph; Mathematical analysis","score_opus":0.015975049501925086,"score_gpt":0.2745048794931883,"score_spread":0.2585298299912632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020827550","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.035880834,0.00031153226,0.96132183,0.0009879395,0.00026278483,0.00057211233,0.00007562006,0.000107142965,0.00048018983],"genre_scores_gemma":[0.843952,0.0000048557067,0.15427178,0.0009100011,0.0003634537,0.00017335652,0.00023463642,0.000012933359,0.000077003424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864346,0.00004193661,0.00025953117,0.00037772508,0.00031858173,0.00035875675],"domain_scores_gemma":[0.99893206,0.00041003947,0.00006493872,0.00018234109,0.00015144103,0.0002591792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034015047,0.00017816675,0.00016428085,0.00041715408,0.00032332077,0.00016741347,0.00029550956,0.000053026466,0.0000119990345],"category_scores_gemma":[0.000032231903,0.00017591956,0.00009245678,0.00084563054,0.00004089054,0.0005993588,0.00009897605,0.00007703148,0.00003091332],"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.000038327573,0.00013560781,0.0043904805,0.000059993297,0.00007959515,7.1001466e-7,0.0012133392,0.04261942,0.00040884296,0.8522779,0.00066664774,0.09810919],"study_design_scores_gemma":[0.004769364,0.0006322907,0.1510684,0.00011017276,0.00013678256,0.00036332113,0.00060413044,0.27998987,0.0017098003,0.36756843,0.19052799,0.0025194325],"about_ca_topic_score_codex":0.0000030232356,"about_ca_topic_score_gemma":9.753555e-7,"teacher_disagreement_score":0.80807114,"about_ca_system_score_codex":0.000027907357,"about_ca_system_score_gemma":0.000041271313,"threshold_uncertainty_score":0.71737915},"labels":[],"label_agreement":null},{"id":"W2020867214","doi":"10.1002/nme.2063","title":"Eikonal equation‐based front propagation for arbitrary complex configurations","year":2007,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Eikonal equation; Tangent; Classification of discontinuities; Offset (computer science); Geometry; Regular polygon; Cartesian coordinate system; Wedge (geometry); Mathematics; Front (military); Mathematical analysis; Engineering; Computer science","score_opus":0.0768975785314768,"score_gpt":0.41282462005742854,"score_spread":0.33592704152595176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020867214","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.00031840632,0.000055389042,0.99427205,0.00176262,0.0030402287,0.0003626868,0.0000118587595,0.00006676801,0.00011001342],"genre_scores_gemma":[0.079032026,0.000002076433,0.91971165,0.00039213902,0.0006711105,0.0000694176,0.000064904576,0.000014465989,0.00004218395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984132,0.00006084799,0.0006244646,0.00024692205,0.0003870282,0.00026753012],"domain_scores_gemma":[0.9973529,0.001675537,0.0001870172,0.00010783367,0.0005617402,0.00011497101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052705,0.00014542989,0.00017153975,0.00055761647,0.0001223837,0.00020655732,0.0005253193,0.000066941844,0.000022080558],"category_scores_gemma":[0.0011242323,0.00014980401,0.0001553371,0.00028565156,0.000012800295,0.00049947115,0.000035319877,0.00019822102,0.0000025761142],"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.000103876395,0.00014485285,0.00007104275,0.000022481918,0.00006574917,0.000008374536,0.00016147552,0.66162777,0.032359745,0.11622089,0.00036192161,0.18885183],"study_design_scores_gemma":[0.0008578972,0.00009214655,0.0019568787,0.00002918529,0.0000059039758,0.00004379315,0.000008994871,0.9574597,0.009971062,0.011281875,0.018120717,0.00017185078],"about_ca_topic_score_codex":0.0000025562035,"about_ca_topic_score_gemma":0.0000011716078,"teacher_disagreement_score":0.29583195,"about_ca_system_score_codex":0.00025796422,"about_ca_system_score_gemma":0.00012974972,"threshold_uncertainty_score":0.610883},"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":"W2022062611","doi":"10.1016/j.jcta.2013.06.004","title":"Extensions of a result of Elekes and Rónyai","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Cartesian product; Combinatorics; Conjecture; Mathematics; Cartesian coordinate system; Product (mathematics); Graph; Line (geometry); Discrete geometry; Discrete mathematics; Geometry","score_opus":0.006129390363911423,"score_gpt":0.21493981736942236,"score_spread":0.20881042700551095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022062611","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.9617333,0.00062732154,0.033918027,0.00067434885,0.0023201967,0.00011000291,0.0000017409333,0.000008582901,0.0006065225],"genre_scores_gemma":[0.99002594,0.00006607326,0.009634586,0.000029500923,0.00014666848,0.0000010463203,3.046408e-7,0.000003022179,0.000092874914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899733,0.00013989247,0.0004525543,0.00007540543,0.00025509385,0.00007972004],"domain_scores_gemma":[0.9982491,0.00031546075,0.00046766613,0.00014251725,0.00076283945,0.00006242473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006642918,0.00006826821,0.0002243543,0.00014106803,0.000047365167,0.0000363108,0.00024717575,0.00003829447,0.000019707579],"category_scores_gemma":[0.00035876676,0.000054393884,0.00006651959,0.00025055514,0.000083903244,0.00070130394,0.000087703025,0.000086533,8.5912586e-7],"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.00012097044,0.000079045865,0.000045107143,0.000015853935,0.000033528613,0.0000024446633,0.0005320447,0.00014630768,0.027364884,0.96410817,0.0005405695,0.007011097],"study_design_scores_gemma":[0.00081641984,0.0009069875,0.002477304,0.000055968714,0.0000143505285,0.0000918075,0.00015684993,0.0004103038,0.040107287,0.95319164,0.0016945038,0.0000765921],"about_ca_topic_score_codex":0.000003839316,"about_ca_topic_score_gemma":1.8706899e-7,"teacher_disagreement_score":0.028292665,"about_ca_system_score_codex":0.000008013512,"about_ca_system_score_gemma":0.00009451015,"threshold_uncertainty_score":0.22181183},"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":"W2022307052","doi":"10.1145/336154.336216","title":"Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus","year":2000,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Annulus (botany); Citation; Cylinder; Computer science; Computer graphics (images); Mathematics; Library science; Geometry; Materials science","score_opus":0.010799545470557748,"score_gpt":0.21245503513366787,"score_spread":0.20165548966311012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022307052","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.17948858,0.00037477262,0.802263,0.001505208,0.00016355552,0.00018134162,8.980002e-7,0.00010539717,0.015917214],"genre_scores_gemma":[0.7625372,0.000035966466,0.23456573,0.001089491,0.00013222013,0.000011348555,0.0000038295284,0.000005626453,0.0016186119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989677,0.000070941474,0.00022982503,0.000312389,0.00021789341,0.00020126316],"domain_scores_gemma":[0.99931216,0.00025066992,0.000053733125,0.0002698537,0.00004618837,0.000067419634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037221648,0.00011815985,0.00010388638,0.000058448582,0.00034109474,0.00032999626,0.0003275271,0.000037822585,0.00012472026],"category_scores_gemma":[0.000037043937,0.000083521874,0.000036700552,0.00035756026,0.00004665666,0.0003182502,0.00007496016,0.00009170884,0.000030063891],"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.0000040247496,0.000038301343,0.00030844548,0.0000079067895,0.000011796195,0.0000034978282,0.0009619087,0.0028872802,0.0006505174,0.013639549,0.00043962235,0.98104715],"study_design_scores_gemma":[0.0005276093,0.00011154893,0.006005939,0.000024639337,0.000010778189,0.00010983972,0.000090508875,0.9604646,0.0032922756,0.022826802,0.0062050973,0.00033039483],"about_ca_topic_score_codex":0.000020355435,"about_ca_topic_score_gemma":0.000009967864,"teacher_disagreement_score":0.98071676,"about_ca_system_score_codex":0.000013059328,"about_ca_system_score_gemma":0.000037704704,"threshold_uncertainty_score":0.34059232},"labels":[],"label_agreement":null},{"id":"W2022451101","doi":"10.1016/j.ejc.2011.09.002","title":"Connectivity augmentation in planar straight line graphs","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"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","keywords":"Combinatorics; Planar graph; Book embedding; Planar straight-line graph; Mathematics; Polyhedral graph; Embedding; Planar; Outerplanar graph; Line graph; Graph; Discrete mathematics; 1-planar graph; Pathwidth; Computer science; Artificial intelligence","score_opus":0.03723774661021497,"score_gpt":0.23406813937796137,"score_spread":0.1968303927677464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022451101","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.39475542,0.00016018802,0.5950436,0.00014288307,0.0011872081,0.000054936783,6.600312e-7,0.000019102119,0.008635986],"genre_scores_gemma":[0.9913644,0.000027972344,0.008425326,0.00007632347,0.00004831614,2.3676479e-7,0.0000012064369,0.000005885738,0.000050285817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998811,0.00034106584,0.00037538857,0.00011026856,0.00025364695,0.00010862716],"domain_scores_gemma":[0.99926674,0.00006379197,0.00028276234,0.00012214879,0.00018788975,0.00007667644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011412615,0.00008094267,0.00011941666,0.00030599424,0.000046371075,0.000042712676,0.00038698205,0.000013410439,0.000014031755],"category_scores_gemma":[0.000060233633,0.00007591503,0.000052784715,0.0005661819,0.000014229329,0.00052349985,0.00003579633,0.00017005362,0.000012068611],"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.00007677371,0.0008328388,0.0052126423,0.00001784156,0.00004419462,0.0008397561,0.0032962535,0.0014657306,0.0014573148,0.94379926,0.0012972523,0.04166017],"study_design_scores_gemma":[0.0065918206,0.0035044532,0.62309384,0.00013770458,0.00003354244,0.0005602705,0.00015397274,0.0107921995,0.013767784,0.33569708,0.005012519,0.0006547832],"about_ca_topic_score_codex":0.0000013188519,"about_ca_topic_score_gemma":0.0000012932544,"teacher_disagreement_score":0.61788124,"about_ca_system_score_codex":0.000037760874,"about_ca_system_score_gemma":0.00005372659,"threshold_uncertainty_score":0.3095725},"labels":[],"label_agreement":null},{"id":"W2022467326","doi":"10.1007/s00454-001-0038-7","title":"Locked and Unlocked Polygonal Chains in Three Dimensions","year":2001,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University; National Science Foundation","keywords":"Polygonal chain; Combinatorics; Mathematics; Regular polygon; Convex polygon; Simple (philosophy); Chain (unit); Polygon (computer graphics); Plane (geometry); Planar; Polytope; Convex polytope; Simple polygon; Projection (relational algebra); Geometry; Convex set; Algorithm; Computer science; Convex optimization; Computer graphics (images)","score_opus":0.014836212412967925,"score_gpt":0.25402744485809237,"score_spread":0.23919123244512444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022467326","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.494498,0.00035730767,0.50286555,0.0013744158,0.00019569187,0.0001564191,0.000007912282,0.00008437352,0.00046027382],"genre_scores_gemma":[0.9585799,0.000027643358,0.04018155,0.00073404255,0.0001221172,0.000020951635,0.0001093787,0.000013612974,0.0002108012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978648,0.00008035875,0.00043753308,0.0006293139,0.0005933333,0.0003946609],"domain_scores_gemma":[0.99887043,0.00038793604,0.0001143863,0.00026948622,0.0001619203,0.00019581932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036187377,0.00024465247,0.00025037857,0.00082455203,0.0002486881,0.00017234073,0.00039076462,0.00009075938,0.000048436556],"category_scores_gemma":[0.000087893415,0.00024969535,0.000078516416,0.00213253,0.00008912144,0.00058296736,0.0003085332,0.00022064411,0.000050634582],"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.00006390816,0.00027402028,0.04549062,0.000023391449,0.000070191956,0.0001249715,0.0005890211,0.3198875,0.0004236932,0.59371006,0.00033202808,0.039010603],"study_design_scores_gemma":[0.00082687545,0.00007759535,0.2926776,0.000025128149,0.0000058997393,0.000118669566,0.00003650084,0.6370692,0.00003111379,0.06793947,0.000884559,0.00030734125],"about_ca_topic_score_codex":0.000041074105,"about_ca_topic_score_gemma":0.000059466976,"teacher_disagreement_score":0.5257706,"about_ca_system_score_codex":0.00007202214,"about_ca_system_score_gemma":0.00015303327,"threshold_uncertainty_score":0.9999955},"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":"W2024283988","doi":"10.1007/s00453-013-9764-5","title":"Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations","year":2013,"lang":"en","type":"article","venue":"Algorithmica","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":"University of Waterloo","funders":"","keywords":"Polygon (computer graphics); Rectilinear polygon; Planar graph; Mathematics; Combinatorics; Point in polygon; Planar; Rectangle; Star-shaped polygon; Polygon mesh; Representation (politics); Time complexity; Algorithm; Graph; Regular polygon; Simple polygon; Geometry; Computer science; Convex set","score_opus":0.020965985535776083,"score_gpt":0.2780481533725133,"score_spread":0.2570821678367372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024283988","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.0042119557,0.00006575585,0.98827785,0.004794353,0.00050322677,0.0009779293,0.000051228035,0.0002546491,0.00086303824],"genre_scores_gemma":[0.03130924,0.000008730685,0.9616539,0.00070441,0.0010328451,0.00065294764,0.00035863376,0.000026337664,0.00425294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982566,0.000059183327,0.00040600047,0.0005589737,0.000399535,0.0003197048],"domain_scores_gemma":[0.99813724,0.0002989974,0.0001506021,0.0006234333,0.00063518697,0.00015453587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002845524,0.00018001787,0.00019139326,0.00021148656,0.0003019585,0.00019983413,0.00069066056,0.00008477021,0.000145111],"category_scores_gemma":[0.00024213638,0.00017413222,0.00015743918,0.0006385191,0.000041973908,0.0008329893,0.00017453774,0.00012747484,0.00031534958],"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.00004193315,0.0008792798,0.00020454574,0.000055317338,0.00033949452,0.000018308478,0.000518797,0.010440025,0.018468464,0.0961769,0.22356594,0.649291],"study_design_scores_gemma":[0.0010283772,0.00023216507,0.0030139475,0.0000109945895,0.00001682219,0.00003536417,0.000019826984,0.9258035,0.008845075,0.049530435,0.011137455,0.0003260811],"about_ca_topic_score_codex":0.00007069371,"about_ca_topic_score_gemma":0.000002482928,"teacher_disagreement_score":0.91536343,"about_ca_system_score_codex":0.000040194347,"about_ca_system_score_gemma":0.00015742422,"threshold_uncertainty_score":0.7100906},"labels":[],"label_agreement":null},{"id":"W2024343945","doi":"10.1016/j.dam.2014.06.015","title":"A decision algorithm for reversible pairs of polygons","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Regular polygon; Combinatorics; Algorithm; Geometry","score_opus":0.013131921075011557,"score_gpt":0.25040557663786406,"score_spread":0.23727365556285251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024343945","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.001482627,0.000015441572,0.9947245,0.000076416945,0.00011649825,0.0002653975,0.000007422579,0.00005055874,0.0032611275],"genre_scores_gemma":[0.082671255,0.000002717078,0.91705763,0.00006593679,0.00004924854,0.000032345633,0.000013104181,0.0000075026105,0.0001002508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918294,0.000007102955,0.00026056377,0.0001892652,0.00022332493,0.00013680012],"domain_scores_gemma":[0.9989701,0.00043482205,0.00013437243,0.00033185398,0.00007846485,0.000050374427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037789205,0.00009397397,0.0001702014,0.000096546384,0.00007938138,0.000037275615,0.00033315012,0.000041879517,0.000005950091],"category_scores_gemma":[0.000061948485,0.00008388455,0.00007135544,0.0002723938,0.000020396632,0.000095573094,0.0000976385,0.00003544177,0.000013136456],"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.0000022465306,0.000057662477,8.3365114e-7,0.0000574688,0.00001260748,7.1714325e-8,0.0003697361,0.0008177034,0.0024260094,0.6989897,0.0010218306,0.29624414],"study_design_scores_gemma":[0.0003647754,0.000058529826,0.00002009505,0.000022954238,0.000011872155,0.000002138611,0.000047519075,0.7232168,0.0106522385,0.26289457,0.002595338,0.0001131925],"about_ca_topic_score_codex":7.734048e-7,"about_ca_topic_score_gemma":5.913331e-7,"teacher_disagreement_score":0.72239906,"about_ca_system_score_codex":0.000011696823,"about_ca_system_score_gemma":0.000028552651,"threshold_uncertainty_score":0.34207126},"labels":[],"label_agreement":null},{"id":"W2024580030","doi":"10.1016/j.cad.2013.05.009","title":"Generalizing the advancing front method to composite surfaces in the context of meshing constraints topology","year":2013,"lang":"en","type":"article","venue":"Computer-Aided Design","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":"École de Technologie Supérieure; Université du Québec à Trois-Rivières","funders":"","keywords":"Topology (electrical circuits); Context (archaeology); Mesh generation; Geometry; Boundary (topology); Computer science; Computation; Boundary representation; T-vertices; Front (military); Representation (politics); Parametric statistics; Finite element method; Composite number; Surface (topology); Mathematics; Algorithm; Mathematical analysis; Mechanical engineering; Structural engineering; Engineering; Combinatorics; Geology","score_opus":0.03417420325902941,"score_gpt":0.2918245359002147,"score_spread":0.25765033264118525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024580030","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.047296807,0.00024674254,0.9478104,0.003297651,0.0004438854,0.0007215897,0.0000011962421,0.000043311047,0.00013837726],"genre_scores_gemma":[0.5040337,0.0000032098378,0.49329692,0.0025459845,0.00007203865,0.000030330888,0.0000018380814,0.000004593539,0.000011388343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970574,0.0013850455,0.000500652,0.00039699563,0.00031364415,0.00034628258],"domain_scores_gemma":[0.9968356,0.0022445591,0.00017646479,0.00047726944,0.00019154315,0.00007458236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022035537,0.0001852203,0.00029489663,0.00018271696,0.00021023591,0.00024464718,0.0012322237,0.000056285997,0.000023177798],"category_scores_gemma":[0.00006474113,0.00012294992,0.00007483415,0.00050781464,0.00008152887,0.00041928765,0.00026321702,0.00018289381,0.00003850242],"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.000012447373,0.000088328175,0.00021298362,0.000016699976,0.000043616576,0.000013244287,0.009133701,0.48449618,0.030530116,0.058523253,0.004877522,0.41205192],"study_design_scores_gemma":[0.00045378658,0.00020669751,0.005666557,0.00005207353,0.000008940556,0.00007719065,0.00044729485,0.96553266,0.01556016,0.010974942,0.00078547734,0.00023420971],"about_ca_topic_score_codex":0.00023775932,"about_ca_topic_score_gemma":0.000024758992,"teacher_disagreement_score":0.48103648,"about_ca_system_score_codex":0.00004960071,"about_ca_system_score_gemma":0.00009300634,"threshold_uncertainty_score":0.5013752},"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":"W2025023583","doi":"10.1109/hpcs.2008.42","title":"Performance Measurements of a Contact Searching Algorithm for Solving Large Deformation Problems","year":2008,"lang":"en","type":"article","venue":"Proceedings/Proceedings (International Symposium on High Performance Computing Systems and Applications)","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":"Université Laval","funders":"","keywords":"Computer science; Task (project management); Domain (mathematical analysis); Constraint (computer-aided design); Decomposition; Domain decomposition methods; Degrees of freedom (physics and chemistry); Function (biology); Object (grammar); Algorithm; Mathematical optimization; Artificial intelligence; Mathematics; Engineering; Finite element method; Geometry","score_opus":0.023670533497765822,"score_gpt":0.24884854060388958,"score_spread":0.22517800710612376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025023583","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.73166674,0.00007359192,0.2646712,0.00019581134,0.00039847335,0.0013324113,0.000015268643,0.00018692562,0.0014595734],"genre_scores_gemma":[0.97705984,0.00014661576,0.021466758,0.00008201456,0.00063952274,0.00043339908,0.000045194407,0.000026616497,0.00010002152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971225,0.000006023766,0.0008454305,0.0006723551,0.00090504985,0.00044862577],"domain_scores_gemma":[0.99730426,0.00008151077,0.0007175778,0.00012606801,0.001640155,0.00013044024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012109681,0.0003157676,0.00035239075,0.0003670697,0.0010391794,0.00032282204,0.000720588,0.00009807843,0.0000012021193],"category_scores_gemma":[0.000028744767,0.0003111802,0.000079366124,0.00056671613,0.000048267215,0.0015570774,0.0002187223,0.00020651253,0.000008441816],"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.0002948438,0.0020994733,0.1566197,0.0072614574,0.0008377953,0.0000012265368,0.012712593,0.06457199,0.20046295,0.24393125,0.0022083279,0.30899838],"study_design_scores_gemma":[0.0011384106,0.00033292797,0.012808125,0.00042109986,0.00001499817,0.000114221315,0.0000698496,0.9707394,0.0116915535,0.00006754213,0.0022481997,0.0003536427],"about_ca_topic_score_codex":0.000015711552,"about_ca_topic_score_gemma":1.5729167e-7,"teacher_disagreement_score":0.90616745,"about_ca_system_score_codex":0.0001968107,"about_ca_system_score_gemma":0.00006193562,"threshold_uncertainty_score":0.999934},"labels":[],"label_agreement":null},{"id":"W2025130628","doi":"10.1007/s00453-001-0027-5","title":"Approximating Shortest Paths on Weighted Polyhedral Surfaces","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":68,"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; Shortest path problem; Combinatorics; Dijkstra's algorithm; Mathematics; Regular polygon; Bounded function; Theory of computation; Context (archaeology); Domain (mathematical analysis); Euclidean shortest path; Computational geometry; Face (sociological concept); Discrete mathematics; K shortest path routing; Graph; Algorithm; Geometry","score_opus":0.014708090250501082,"score_gpt":0.2418008765560288,"score_spread":0.22709278630552773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025130628","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.21372634,0.00009866416,0.7788544,0.0014118508,0.0005336082,0.00014599491,0.0000030410479,0.00025813875,0.004967917],"genre_scores_gemma":[0.8422137,0.000009084931,0.15648094,0.0004811617,0.00026867806,0.000011090276,0.000021477941,0.000008156997,0.00050571235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883956,0.00004978744,0.00021842174,0.0003431015,0.00030700743,0.00024212484],"domain_scores_gemma":[0.99936056,0.00013181343,0.000070513255,0.0002784132,0.00007424351,0.00008447018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020200876,0.00012859586,0.000119421835,0.000119000935,0.00018407677,0.00014717034,0.00038058346,0.000046863115,0.000030475238],"category_scores_gemma":[0.00003032604,0.00011879749,0.00004851003,0.00059011637,0.00001928392,0.00032721277,0.00008878561,0.00010948769,0.00013999367],"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.000010502103,0.00024488432,0.00056976813,0.0000056736567,0.000031269046,0.00006696973,0.00041472533,0.0049466924,0.0023649146,0.06359894,0.0014739041,0.92627174],"study_design_scores_gemma":[0.0002325364,0.00012895721,0.0030956678,0.00001344324,0.0000037198201,0.00005196036,0.000014689636,0.9795106,0.0044143233,0.006335245,0.0059858677,0.00021299157],"about_ca_topic_score_codex":0.000013759418,"about_ca_topic_score_gemma":0.0000021771184,"teacher_disagreement_score":0.9745639,"about_ca_system_score_codex":0.00003046344,"about_ca_system_score_gemma":0.000044863016,"threshold_uncertainty_score":0.4844421},"labels":[],"label_agreement":null},{"id":"W2025569303","doi":"10.1007/s00454-007-1311-1","title":"Which n-Venn Diagrams Can Be Drawn with Convex k-Gons?","year":2007,"lang":"en","type":"article","venue":"Discrete & 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 Victoria","funders":"","keywords":"Venn diagram; Mathematics; Combinatorics; Diagram; Simple (philosophy); Quadrilateral; Regular polygon; Discrete mathematics; Geometry; Statistics; Physics; Thermodynamics","score_opus":0.012103804645428972,"score_gpt":0.25586705555086003,"score_spread":0.24376325090543105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025569303","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.1993608,0.000123946,0.79429775,0.0026367395,0.0004328669,0.00026904617,0.000028206041,0.00024034225,0.0026102758],"genre_scores_gemma":[0.9147327,0.000003759578,0.08252026,0.0015508306,0.0002916748,0.000019256751,0.00047000844,0.000026730808,0.00038477735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99665266,0.00008880361,0.00055595255,0.0008220951,0.0012316485,0.0006488431],"domain_scores_gemma":[0.99745,0.00070480804,0.0002465144,0.00047537664,0.00075722364,0.00036608352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008852894,0.00036550008,0.00033139094,0.0006985585,0.00058078667,0.0005569709,0.0007729345,0.00012507499,0.0000744828],"category_scores_gemma":[0.00012360707,0.0003341133,0.00011525126,0.0035508333,0.00015627393,0.00065550534,0.0002319402,0.0003188493,0.00007137534],"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.00016126693,0.0004423419,0.018277412,0.00008127214,0.00033120986,0.00014118727,0.002082436,0.45079425,0.0004509878,0.46763858,0.002735238,0.056863803],"study_design_scores_gemma":[0.0037124907,0.0010682936,0.4810015,0.00012470101,0.00008504563,0.00053540576,0.00044202025,0.43785816,0.0029703944,0.04649539,0.023444487,0.0022621204],"about_ca_topic_score_codex":0.000060658433,"about_ca_topic_score_gemma":0.00024812922,"teacher_disagreement_score":0.7153719,"about_ca_system_score_codex":0.00013060545,"about_ca_system_score_gemma":0.00047831217,"threshold_uncertainty_score":0.99991107},"labels":[],"label_agreement":null},{"id":"W2025673372","doi":"10.1016/j.ipl.2014.09.021","title":"A simple algorithm for computing positively weighted straight skeletons of monotone polygons","year":2014,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"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; Austrian Science Fund","keywords":"Monotone polygon; Polygon (computer graphics); Combinatorics; Simple (philosophy); Rectilinear polygon; Simple polygon; Algorithm; Mathematics; SIMPLE algorithm; Polygon covering; Computational geometry; Computer science; Geometry","score_opus":0.0069810991131492636,"score_gpt":0.2381842154663723,"score_spread":0.23120311635322305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025673372","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.015893996,0.000010079144,0.98164827,0.001676844,0.00019191299,0.00020929138,0.000013892339,0.00010951178,0.00024621323],"genre_scores_gemma":[0.4954108,2.2531592e-7,0.50253487,0.0018428458,0.000099121,0.000010749277,0.00009128292,0.0000037858445,0.000006339941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989714,0.000030283543,0.00042562964,0.00013879483,0.0002392523,0.0001946145],"domain_scores_gemma":[0.9990619,0.000118724,0.0003312293,0.00015395904,0.00028008097,0.000054095537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031158904,0.000113924696,0.00013870928,0.00026119483,0.00025235256,0.00020001704,0.0003457957,0.00004034727,0.000002591672],"category_scores_gemma":[0.000052627634,0.000114920986,0.00005812478,0.0004568432,0.000033498098,0.0018857396,0.00007449457,0.00006643073,0.000005851604],"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.0000040009913,0.00002428625,0.000017653403,0.000068534246,0.000013322361,1.205124e-7,0.0011488483,0.008704562,0.0029253766,0.0054469667,0.0012731784,0.98037314],"study_design_scores_gemma":[0.00044761656,0.000049809903,0.00089512195,0.000029473647,0.0000067189426,0.000006316572,0.000019214642,0.98490405,0.007538993,0.0011708988,0.0047922614,0.00013954457],"about_ca_topic_score_codex":0.000005646534,"about_ca_topic_score_gemma":3.7946472e-7,"teacher_disagreement_score":0.9802336,"about_ca_system_score_codex":0.00003125392,"about_ca_system_score_gemma":0.00007563991,"threshold_uncertainty_score":0.4686342},"labels":[],"label_agreement":null},{"id":"W2025920119","doi":"10.1007/s00454-011-9381-5","title":"The Shape of Orthogonal Cycles in Three Dimensions","year":2011,"lang":"en","type":"article","venue":"Discrete & 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":"University of Victoria; University of Waterloo; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Combinatorics; Geometry","score_opus":0.0304768645177658,"score_gpt":0.25908404196421614,"score_spread":0.22860717744645034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025920119","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.56634104,0.0004728709,0.43076134,0.00028732486,0.00031664636,0.00017027844,0.0000112916205,0.000049413622,0.0015898179],"genre_scores_gemma":[0.9532368,0.000015689806,0.04647689,0.0001318784,0.000045453107,0.000017927128,0.000031301628,0.000008671855,0.00003536764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981815,0.00008763423,0.00051945157,0.0003597695,0.00057331246,0.00027830503],"domain_scores_gemma":[0.99855256,0.0006215477,0.0001909905,0.00030920317,0.00023948027,0.000086234024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053907634,0.00016320299,0.0001832495,0.000379185,0.00024511313,0.00006264129,0.00069909333,0.00005738579,0.000053337102],"category_scores_gemma":[0.00011062649,0.0001285198,0.00011436236,0.0015087742,0.00012881837,0.00038813316,0.0002801663,0.00016267074,0.00003374629],"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.000038537226,0.00015557696,0.024028404,0.000012376179,0.0000494953,0.00001171479,0.0005165557,0.05961885,0.00012304475,0.8757265,0.00011336271,0.03960559],"study_design_scores_gemma":[0.0002783246,0.00006388264,0.49894527,0.000017655742,0.0000047323606,0.000012792598,0.00003638312,0.31690124,0.0001646573,0.18326229,0.00016580524,0.00014697264],"about_ca_topic_score_codex":0.000030151952,"about_ca_topic_score_gemma":0.00005722161,"teacher_disagreement_score":0.69246423,"about_ca_system_score_codex":0.000030397136,"about_ca_system_score_gemma":0.00016223351,"threshold_uncertainty_score":0.5240885},"labels":[],"label_agreement":null},{"id":"W2026714149","doi":"10.4171/jems/87","title":"Sum-product theorems and incidence geometry","year":2007,"lang":"en","type":"article","venue":"Journal of the European Mathematical Society","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"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; Hungarian Scientific Research Fund","keywords":"Mathematics; Product (mathematics); Geometry; Incidence (geometry); Pure mathematics","score_opus":0.013924921970708347,"score_gpt":0.24693487000269973,"score_spread":0.23300994803199138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026714149","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.21574163,0.00025629805,0.77939546,0.0011974792,0.00027716733,0.000051446492,2.0437359e-7,0.000014040399,0.003066257],"genre_scores_gemma":[0.90924853,0.000023938404,0.08957073,0.00047717965,0.00041320894,8.693113e-8,7.298469e-8,0.000006775394,0.00025946225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987749,0.00015122662,0.0003836435,0.000118938086,0.00042437203,0.00014692236],"domain_scores_gemma":[0.99892473,0.00032745398,0.00026558788,0.00023718491,0.00015115553,0.000093866984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005321623,0.00008372116,0.00012581667,0.000033523844,0.00015277459,0.00011210153,0.00065143756,0.000017233704,0.000008413355],"category_scores_gemma":[0.0004299932,0.000049028862,0.0001720888,0.0003880425,0.00008826789,0.00027227812,0.00031814954,0.00022730115,0.000015746282],"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.00003184851,0.0006379468,0.002635798,0.00026927513,0.0003132395,0.00010313079,0.011446938,0.0018508758,0.037785567,0.62311834,0.024367651,0.29743943],"study_design_scores_gemma":[0.0017071174,0.0003646351,0.19235812,0.00049332617,0.0001312559,0.0040458036,0.00065293256,0.03071367,0.023768617,0.73016626,0.01477533,0.0008229116],"about_ca_topic_score_codex":2.1101778e-7,"about_ca_topic_score_gemma":1.0903198e-7,"teacher_disagreement_score":0.6935069,"about_ca_system_score_codex":0.000027709251,"about_ca_system_score_gemma":0.000028385535,"threshold_uncertainty_score":0.1999339},"labels":[],"label_agreement":null},{"id":"W2027273244","doi":"10.1145/1721837.1721858","title":"A fast algorithm to generate open meandric systems and meanders","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"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 Guelph; University of Waterloo","funders":"","keywords":"Algorithm; Planar; Equivalence (formal languages); Simple (philosophy); Line segment; Mathematics; Line (geometry); Minor (academic); Computer science; Plane (geometry); Geometry; Discrete mathematics; Computer graphics (images)","score_opus":0.025273569158704493,"score_gpt":0.28004874856602513,"score_spread":0.25477517940732064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027273244","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.004023167,0.00004899422,0.9907494,0.0022004123,0.0020052854,0.00050021365,0.000021077689,0.00012341874,0.0003280147],"genre_scores_gemma":[0.22961794,0.000032310927,0.7673067,0.0008003223,0.000220076,0.00017935621,0.0000093092785,0.000020861864,0.0018131618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854994,0.00006309587,0.0002426941,0.0005652244,0.00031787722,0.00026116197],"domain_scores_gemma":[0.9987331,0.00011093221,0.000052200645,0.00068552245,0.00014841063,0.00026983075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036479425,0.00019046477,0.00018979465,0.00029736743,0.00043107668,0.0007866448,0.00096490997,0.00008522576,0.000028407732],"category_scores_gemma":[0.000022486207,0.00018192625,0.000046527708,0.0007932069,0.000030437932,0.0006328168,0.00006995828,0.00026735922,0.00008456143],"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.000005907172,0.000097720564,0.0000020926914,0.0000049505707,0.00003559309,0.000007061569,0.00037352555,0.016831711,0.0016358682,0.0026477273,0.000263771,0.97809404],"study_design_scores_gemma":[0.0012231818,0.00037735055,0.00062322855,0.00002424755,0.000028399367,0.00022259347,0.00012260671,0.9712955,0.0067680175,0.0034107047,0.0153138405,0.0005903796],"about_ca_topic_score_codex":0.00013152137,"about_ca_topic_score_gemma":0.00006028075,"teacher_disagreement_score":0.9775037,"about_ca_system_score_codex":0.000029889721,"about_ca_system_score_gemma":0.00008585025,"threshold_uncertainty_score":0.7585634},"labels":[],"label_agreement":null},{"id":"W2027276065","doi":"10.1145/2766905","title":"Practical hex-mesh optimization via edge-cone rectification","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"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":"Polygon mesh; Hexahedron; Mathematical optimization; Volume mesh; Computer science; Solver; Algorithm; Robustness (evolution); Mathematics; Finite element method; Mesh generation; Geometry","score_opus":0.06507108894805766,"score_gpt":0.30494604404483766,"score_spread":0.23987495509678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027276065","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.0008757308,0.000030394558,0.98855853,0.008619885,0.0010478473,0.0002072612,0.0000030877816,0.00025483672,0.00040242146],"genre_scores_gemma":[0.5462233,0.00007097265,0.4524503,0.0008334529,0.000100399666,0.00005293526,0.00003762242,0.000013800735,0.00021722513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985158,0.00014399418,0.00027733605,0.0004138356,0.0004588283,0.00019022418],"domain_scores_gemma":[0.99829954,0.00025020426,0.000102974875,0.0007226505,0.00043876734,0.00018587126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004874253,0.00014877845,0.00012072705,0.00038951013,0.0002630436,0.00015635748,0.00038442772,0.00012379103,0.000020022972],"category_scores_gemma":[0.00018349104,0.00015785337,0.00008024557,0.00153832,0.000046450965,0.0009359598,0.000011729544,0.00026720332,0.000076967845],"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.00011351446,0.0012546076,0.000043557156,0.000019728257,0.00011474202,0.0000129416985,0.0009926818,0.7629683,0.001395838,0.065210156,0.0062216506,0.16165231],"study_design_scores_gemma":[0.0010307813,0.00048930635,0.0003506744,0.000018332286,0.000054506556,0.0001476149,0.000069501584,0.9463523,0.013541813,0.028049555,0.009410503,0.00048513492],"about_ca_topic_score_codex":0.000010780868,"about_ca_topic_score_gemma":0.000015753965,"teacher_disagreement_score":0.5453476,"about_ca_system_score_codex":0.00006996533,"about_ca_system_score_gemma":0.00019577639,"threshold_uncertainty_score":0.64370733},"labels":[],"label_agreement":null},{"id":"W2027783832","doi":"10.1016/s0304-3975(01)00408-x","title":"Embedding problems for paths with direction constrained edges","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"McGill University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Consiglio Nazionale delle Ricerche; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Reachability; Embedding; Planar graph; Graph embedding; Path (computing); Mathematics; Book embedding; Graph; Planar; Context (archaeology); Characterization (materials science); Combinatorics; Algorithm; Computer science; Topology (electrical circuits); Discrete mathematics; Artificial intelligence; Pathwidth; Line graph","score_opus":0.017630980161791848,"score_gpt":0.24552910943419673,"score_spread":0.22789812927240488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027783832","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.009555604,0.000040062358,0.9865281,0.001057156,0.0004870955,0.00031810036,0.0000015242526,0.00021618283,0.0017962012],"genre_scores_gemma":[0.71146226,0.0000026475313,0.28811678,0.00021198521,0.0001406642,0.000024234585,0.0000011420126,0.0000044664343,0.00003583705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832034,0.000044547578,0.00019444774,0.0005915794,0.0004601371,0.00038896487],"domain_scores_gemma":[0.998872,0.00027378128,0.00006539879,0.00032299373,0.0003030622,0.00016277871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000733909,0.00014450533,0.00013920538,0.00018945702,0.0005383721,0.00044999862,0.0007468617,0.000033579003,0.000029203553],"category_scores_gemma":[0.00006425677,0.00011174052,0.000043428292,0.0010646945,0.00089505955,0.0007045555,0.00017120909,0.00008674565,0.000020918638],"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.0000043211217,0.000058303012,0.0000092100245,0.000011486639,0.0000041114026,0.0000018193114,0.0003641605,0.013172953,0.0007611296,0.8406317,0.00010790903,0.14487286],"study_design_scores_gemma":[0.00030934595,0.00039622132,0.000089914916,0.000025323452,0.0000040125833,0.000059543036,0.0000035101925,0.9553248,0.0035326616,0.03935725,0.0007170197,0.00018038793],"about_ca_topic_score_codex":5.4377205e-7,"about_ca_topic_score_gemma":2.7995614e-7,"teacher_disagreement_score":0.94215184,"about_ca_system_score_codex":0.00004311061,"about_ca_system_score_gemma":0.000052146384,"threshold_uncertainty_score":0.4556646},"labels":[],"label_agreement":null},{"id":"W2029101538","doi":"10.4153/cmb-2011-112-x","title":"On Zindler Curves in Normed Planes","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Harbin University of Science and Technology; National Natural Science Foundation of China; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Euclidean geometry; Characterization (materials science); Plane (geometry); Constant (computer programming); Geometry; Mathematical analysis; Pure mathematics","score_opus":0.027471587569606586,"score_gpt":0.20477670195892406,"score_spread":0.17730511438931748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029101538","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.22278436,0.00052151614,0.2427441,0.03059602,0.0007551304,0.0011804987,0.000021874888,0.00026039142,0.5011361],"genre_scores_gemma":[0.9769363,0.000008829116,0.015242118,0.0059007565,0.0000371707,0.000032779863,0.00000901329,0.000008411566,0.001824639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922395,0.000038330927,0.00017018284,0.00019219248,0.00014335198,0.00023201059],"domain_scores_gemma":[0.99935937,0.00014446105,0.000024202585,0.00020936076,0.000028172139,0.0002344418],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021978756,0.000086665685,0.00010790585,0.00019778295,0.000044170432,0.000028640912,0.0003049543,0.000042985088,0.0041819112],"category_scores_gemma":[0.00019156092,0.00007969387,0.00002585827,0.00022264075,0.000021223383,0.000043348995,0.000022705835,0.00009133867,0.0066366014],"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.000004641415,0.00009734212,0.00007647692,0.00007675643,0.0000063062266,0.00010455702,0.00067482516,0.00006047632,0.000010102456,0.9519586,0.043203194,0.0037267304],"study_design_scores_gemma":[0.0012224892,0.0004034452,0.02256571,0.0011301709,0.000013865604,0.00015916109,0.00007468912,0.023021802,0.0013675675,0.8438135,0.10503961,0.0011880194],"about_ca_topic_score_codex":0.00045470535,"about_ca_topic_score_gemma":0.0012184907,"teacher_disagreement_score":0.75415194,"about_ca_system_score_codex":0.000052709034,"about_ca_system_score_gemma":0.00012382596,"threshold_uncertainty_score":0.9967284},"labels":[],"label_agreement":null},{"id":"W2029141310","doi":"10.1006/jctb.2001.2074","title":"Colouring Eulerian Triangulations","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":34,"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":"Eulerian path; Triangulation; Representativeness heuristic; Mathematics; Combinatorics; Computer science; Geometry; Mathematical analysis; Lagrangian; Statistics","score_opus":0.015674503192297753,"score_gpt":0.22511098912072197,"score_spread":0.20943648592842423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029141310","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.17233531,0.0015596407,0.7671582,0.005146538,0.033489555,0.00029570228,0.000003152717,0.00014532066,0.019866547],"genre_scores_gemma":[0.98489755,0.000032620635,0.012846761,0.00009163698,0.0010812829,0.0000015700584,5.629998e-7,0.0000061228557,0.0010418805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988825,0.00019395705,0.000391709,0.000096150834,0.0003066207,0.00012908354],"domain_scores_gemma":[0.99892205,0.00021705168,0.00030606575,0.00016964466,0.00029251515,0.0000926947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007835409,0.00008918828,0.00017350182,0.00018529067,0.00017201922,0.0001575227,0.00042997012,0.000047140475,0.0001834273],"category_scores_gemma":[0.00026529338,0.00008124035,0.000106673484,0.00042460306,0.000033135893,0.0011483853,0.00006225433,0.00013591407,0.000016670892],"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.00005285937,0.000083820916,0.000015159129,0.0000028916336,0.000029917623,0.000017463937,0.000465169,0.0008657879,0.00058345974,0.98497456,0.0015336868,0.011375211],"study_design_scores_gemma":[0.0016765159,0.000623178,0.0005134613,0.000023784136,0.000019431942,0.00028461165,0.00006638154,0.0034769827,0.0041643893,0.9104718,0.078494534,0.00018495234],"about_ca_topic_score_codex":2.5493352e-7,"about_ca_topic_score_gemma":1.5319286e-7,"teacher_disagreement_score":0.8125622,"about_ca_system_score_codex":0.000043189393,"about_ca_system_score_gemma":0.00004779998,"threshold_uncertainty_score":0.33128855},"labels":[],"label_agreement":null},{"id":"W2029731475","doi":"10.1016/s0196-6774(03)00004-x","title":"Elastic labels around the perimeter of a map","year":2003,"lang":"en","type":"article","venue":"Journal of Algorithms","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; University of New Brunswick","funders":"","keywords":"Panning (audio); Rectangle; Perimeter; Clipping (morphology); Zoom; Mathematics; Boundary (topology); Time complexity; Achromatic lens; Artificial intelligence; Computer science; Computer vision; Combinatorics; Geometry; Mathematical analysis","score_opus":0.01757324017823872,"score_gpt":0.255436192997203,"score_spread":0.23786295281896427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029731475","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.023732707,0.00073071563,0.97343993,0.0006738522,0.0010348172,0.000039548857,5.7374365e-7,0.0000040831665,0.00034377532],"genre_scores_gemma":[0.7337946,0.000015532396,0.26545456,0.00014389439,0.00024323222,7.7717834e-7,2.019538e-7,0.0000037055572,0.00034349185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913126,0.00009070175,0.0002918473,0.00006993312,0.00032547137,0.000090754984],"domain_scores_gemma":[0.99913,0.00017830006,0.00024811027,0.00013161183,0.0002688359,0.000043137366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058944954,0.00005893461,0.0001148173,0.00009936578,0.00005809636,0.000060904964,0.00028313094,0.00002199969,0.000022247204],"category_scores_gemma":[0.000081483086,0.00003711261,0.00008270921,0.00028215407,0.000021698657,0.00026769607,0.000026780415,0.00010899356,0.00000811323],"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.0000775921,0.0010419575,0.0011915037,0.00011381113,0.0007601956,0.00019577624,0.0060831294,0.09099606,0.038517904,0.42829397,0.016678805,0.4160493],"study_design_scores_gemma":[0.005592915,0.0042803953,0.017457401,0.00029375296,0.00023866324,0.00481045,0.0007951738,0.3886511,0.1619434,0.21969138,0.19518673,0.0010586096],"about_ca_topic_score_codex":0.0000010192211,"about_ca_topic_score_gemma":2.2723475e-7,"teacher_disagreement_score":0.7100619,"about_ca_system_score_codex":0.000018267125,"about_ca_system_score_gemma":0.00011923223,"threshold_uncertainty_score":0.15134084},"labels":[],"label_agreement":null},{"id":"W2030083434","doi":"10.1016/s0012-365x(03)00287-5","title":"Generalized cover-free families","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":99,"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; University of Waterloo","funders":"","keywords":"Cover (algebra); Generalization; Mathematics; Set (abstract data type); Combinatorics; Set cover problem; Discrete mathematics; Computer science","score_opus":0.01802210635800287,"score_gpt":0.25065760863665953,"score_spread":0.23263550227865668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030083434","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.016130777,0.00011747094,0.94209033,0.00020276142,0.00026352907,0.00011766611,0.00000413063,0.00011166038,0.040961687],"genre_scores_gemma":[0.21873954,0.000032149157,0.77790487,0.00037605502,0.00005663705,0.0000208989,0.000011560185,0.00001274521,0.0028455388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990729,0.00004953296,0.00022159581,0.00019730345,0.00028711552,0.00017153716],"domain_scores_gemma":[0.99910593,0.00009987775,0.000077404264,0.00058520975,0.00006915357,0.00006241183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025201842,0.000118158925,0.00013819922,0.00008393375,0.000111981106,0.00014478962,0.00048189642,0.000036599125,0.00004668858],"category_scores_gemma":[0.0002324752,0.00010317889,0.00006689468,0.00034727078,0.000022583923,0.0002522054,0.00010582669,0.000053948675,0.0001394739],"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":[5.911749e-7,0.000034977715,0.000010818407,0.000020863441,0.000011748703,0.0000017779971,0.00058421004,0.001917536,0.00047357442,0.9916904,0.0044234293,0.00083006633],"study_design_scores_gemma":[0.0009625249,0.00006984621,0.000083898354,0.000027172484,0.000018379258,0.00005238354,0.00014704489,0.2687305,0.017033983,0.64280075,0.069625534,0.00044798694],"about_ca_topic_score_codex":0.0000014783826,"about_ca_topic_score_gemma":0.0000010597957,"teacher_disagreement_score":0.34888965,"about_ca_system_score_codex":0.000019009884,"about_ca_system_score_gemma":0.000050832292,"threshold_uncertainty_score":0.4207513},"labels":[],"label_agreement":null},{"id":"W2030187589","doi":"10.1093/comjnl/bxm053","title":"Parameterized Complexity of Geometric Problems","year":2007,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Parameterized complexity; Computer science; Theoretical computer science; Computational geometry; Graph; Geometric modeling; Computational complexity theory; Algorithm; Mathematical optimization; Mathematics; Geometry","score_opus":0.060789546934819444,"score_gpt":0.2733559608578666,"score_spread":0.21256641392304718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030187589","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.093035944,0.00020493058,0.90465164,0.0008009416,0.00088250556,0.00010487007,6.2459367e-7,0.000034741533,0.00028380827],"genre_scores_gemma":[0.7462589,0.000014973895,0.25292143,0.00034070548,0.00041919108,7.8481156e-7,0.0000013829618,0.000004303206,0.000038277372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985207,0.00012949303,0.00047719205,0.0001587765,0.00045415136,0.00025971627],"domain_scores_gemma":[0.99868363,0.00032536878,0.00030868468,0.00030823034,0.00026935092,0.00010474583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002306503,0.000111026544,0.00017641472,0.00036776808,0.00025383022,0.00017216882,0.0010019909,0.000033566237,0.000017356833],"category_scores_gemma":[0.00003081437,0.00007474455,0.00011791963,0.0012637549,0.00010383118,0.00030164767,0.00023808391,0.00024637606,0.000015351447],"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.00005083762,0.0003406148,0.0006378393,0.000032489574,0.00015375065,0.00003803589,0.0014947718,0.038833376,0.004610004,0.11182932,0.00434675,0.83763224],"study_design_scores_gemma":[0.0025866653,0.0009920497,0.11874471,0.00007999324,0.000037626727,0.003257528,0.000028171788,0.61543745,0.014094504,0.22979546,0.014336412,0.0006094343],"about_ca_topic_score_codex":0.000003983018,"about_ca_topic_score_gemma":0.0000016027915,"teacher_disagreement_score":0.8370228,"about_ca_system_score_codex":0.000033652508,"about_ca_system_score_gemma":0.00006300297,"threshold_uncertainty_score":0.30479944},"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":"W2031207101","doi":"10.1007/s00454-015-9663-4","title":"Average Stretch Factor: How Low Does It Go?","year":2015,"lang":"en","type":"article","venue":"Discrete & 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; University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Graph; Euclidean geometry; Omega; Dimension (graph theory); Discrete mathematics; Geometry; Mathematical analysis; Physics","score_opus":0.024092420459902182,"score_gpt":0.26712992377713934,"score_spread":0.24303750331723717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031207101","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.1659756,0.0001688907,0.82537377,0.005180284,0.0012986948,0.00023445202,0.00007567345,0.00025830316,0.0014343115],"genre_scores_gemma":[0.9505515,0.0000071671134,0.04604974,0.0011316034,0.0004180419,0.00002082542,0.00034819223,0.000022445764,0.001450496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683756,0.00015639639,0.00041271283,0.0007798884,0.0013403909,0.00047303695],"domain_scores_gemma":[0.997874,0.00036379806,0.0002209416,0.00047389691,0.0006292082,0.00043813683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041657317,0.0003509392,0.000312262,0.0005548951,0.00023821651,0.00071916066,0.00090964325,0.00012702636,0.0001333375],"category_scores_gemma":[0.00023382122,0.00029714854,0.00017505049,0.0015598263,0.000077791075,0.0014099539,0.00038193224,0.00026462623,0.00030732842],"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.00004990932,0.00031222057,0.0040058955,0.00007716984,0.00019529705,0.000083178275,0.0026961344,0.81367975,0.00027550408,0.09492284,0.021102905,0.062599175],"study_design_scores_gemma":[0.0014857339,0.00021972369,0.01729396,0.00004773037,0.0000133156245,0.000060779388,0.0002590348,0.90496635,0.0010477116,0.05242797,0.021289404,0.00088826363],"about_ca_topic_score_codex":0.000012094103,"about_ca_topic_score_gemma":0.000009061185,"teacher_disagreement_score":0.7845759,"about_ca_system_score_codex":0.00016553934,"about_ca_system_score_gemma":0.00039758236,"threshold_uncertainty_score":0.9999481},"labels":[],"label_agreement":null},{"id":"W2031397195","doi":"10.1007/s00493-008-2099-1","title":"Near optimal bounds for the Erdős distinct distances problem in high dimensions","year":2008,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":53,"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 Hospital","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Set (abstract data type)","score_opus":0.018005790983252574,"score_gpt":0.24024051087477719,"score_spread":0.2222347198915246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031397195","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.29398218,0.00096935296,0.699911,0.0029266027,0.0010728781,0.00052745827,0.0000055456344,0.000112168564,0.0004928476],"genre_scores_gemma":[0.97116995,0.000026093778,0.028140044,0.00008837301,0.000045522618,0.000103715945,0.000009651606,0.0000056550216,0.00041100662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909604,0.000037178273,0.00018732205,0.00026207327,0.00020778677,0.00020960887],"domain_scores_gemma":[0.9991151,0.000401928,0.00006126355,0.00027423337,0.00009638207,0.000051111703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018799848,0.00009941212,0.0001152776,0.000048266764,0.0006501177,0.00010294881,0.00045302277,0.00003115759,0.0000038968046],"category_scores_gemma":[0.000058098933,0.00007386631,0.000048899168,0.00065765943,0.00007011553,0.0002287068,0.0001227111,0.00009054718,0.000010112061],"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.000028293716,0.00039361723,0.0032138743,0.000019167066,0.000023587429,0.000020811345,0.0012367322,0.023459254,0.00007203709,0.94827825,0.012541288,0.010713077],"study_design_scores_gemma":[0.0020983284,0.0004754686,0.08597033,0.000029455634,0.000016715185,0.000050758543,0.000032725777,0.5711783,0.00048779265,0.14371029,0.19542348,0.0005263565],"about_ca_topic_score_codex":0.000024839934,"about_ca_topic_score_gemma":0.000006585833,"teacher_disagreement_score":0.804568,"about_ca_system_score_codex":0.00006249382,"about_ca_system_score_gemma":0.00012886919,"threshold_uncertainty_score":0.50002456},"labels":[],"label_agreement":null},{"id":"W2032913111","doi":"10.1145/2582112.2582166","title":"On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures","year":2014,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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":"Constant (computer programming); Algorithm; Computational geometry; Computer science; Work (physics); Asymptotically optimal algorithm; Mathematics; Mathematical optimization","score_opus":0.04676412212482476,"score_gpt":0.30485216577589913,"score_spread":0.25808804365107435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032913111","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.17289586,0.00004649766,0.8259453,0.0001945052,0.00017154684,0.000069144015,0.0000060668094,0.00004016651,0.00063089404],"genre_scores_gemma":[0.95369494,0.0000013702031,0.045885354,0.00032144715,0.000021711283,0.0000010268582,0.000053749987,0.000002424279,0.000018003539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990552,0.000059727383,0.00016910746,0.00036705314,0.00022179059,0.00012710206],"domain_scores_gemma":[0.9988548,0.00059001247,0.000045640427,0.00041875945,0.000029907917,0.00006088078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002932337,0.000091691014,0.00012463827,0.00041616347,0.000059324575,0.00012534202,0.00045835576,0.000031843734,0.00001856508],"category_scores_gemma":[0.0001710621,0.00007292063,0.000010080153,0.0007384941,0.000024467221,0.00019307931,0.00015484274,0.00007891675,0.0000044804483],"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.000014809431,0.00021057537,0.04354768,0.000022427414,0.000017877264,0.0000038261473,0.0001764914,0.09896024,0.00020566494,0.523232,0.0041748453,0.32943356],"study_design_scores_gemma":[0.00034883368,0.000081603255,0.054226987,0.0000038693015,0.0000014696609,9.027897e-7,0.000008720879,0.937271,0.0011712237,0.005684153,0.0010928654,0.00010835944],"about_ca_topic_score_codex":0.00004644733,"about_ca_topic_score_gemma":0.000035536494,"teacher_disagreement_score":0.8383108,"about_ca_system_score_codex":0.0000151742015,"about_ca_system_score_gemma":0.000046756533,"threshold_uncertainty_score":0.2973617},"labels":[],"label_agreement":null},{"id":"W203304312","doi":"10.1007/bfb0006784","title":"The ellipsoid method and its predecessors","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","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":"Ellipsoid; Geology; Computer science; Geodesy","score_opus":0.013040703906622389,"score_gpt":0.2619758292109404,"score_spread":0.24893512530431805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203304312","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.00004456073,0.004989573,0.95774585,0.006243197,0.00026174053,0.00027981575,0.000006563299,0.00003208167,0.03039661],"genre_scores_gemma":[0.9139361,0.008273033,0.055084374,0.013895229,0.0008976262,0.00007758844,0.000031145617,0.000017564256,0.00778739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988235,0.000038990984,0.00036431276,0.00021830617,0.00038575276,0.0001691078],"domain_scores_gemma":[0.9984412,0.001033923,0.00023020367,0.00012065898,0.00012261304,0.000051364794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011430494,0.00016737237,0.00016940456,0.00024715732,0.000474724,0.000686437,0.00037411414,0.0001279113,0.00000775176],"category_scores_gemma":[0.0002124187,0.00010772171,0.0000322379,0.00016038097,0.0001065742,0.0020363524,0.00009145412,0.00019308191,0.000011640889],"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.0000054908996,0.0000012539944,0.000004603045,0.000008374796,0.000006398047,1.772859e-7,0.00032484555,0.025347713,0.000006735235,0.2920505,0.000029325984,0.68221456],"study_design_scores_gemma":[0.00032069412,0.00007636272,0.00014734309,0.000029692086,0.000006607309,0.000021908241,0.0000027667736,0.70572263,0.000072605886,0.09010672,0.20330721,0.0001854471],"about_ca_topic_score_codex":0.0000038040266,"about_ca_topic_score_gemma":0.0000356414,"teacher_disagreement_score":0.9138915,"about_ca_system_score_codex":0.000019423007,"about_ca_system_score_gemma":0.0001078121,"threshold_uncertainty_score":0.6619328},"labels":[],"label_agreement":null},{"id":"W2033123200","doi":"10.1007/s00454-007-9025-y","title":"Tight Bounds for Connecting Sites Across Barriers","year":2008,"lang":"en","type":"article","venue":"Discrete & 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 Calgary","funders":"National Science Foundation","keywords":"Combinatorics; Spanning tree; Mathematics; Disjoint sets; Minimum spanning tree; Tree (set theory); Line segment; Steiner tree problem; Minimum degree spanning tree; K-ary tree; Upper and lower bounds; Regular polygon; Plane (geometry); Line (geometry); Discrete mathematics; Tree structure; Geometry; Binary tree; Mathematical analysis","score_opus":0.0264118285099958,"score_gpt":0.2983841775060861,"score_spread":0.2719723489960903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033123200","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.31771064,0.00021671888,0.68027455,0.00052210543,0.0004447209,0.00021808773,0.00006154738,0.00018725019,0.00036436375],"genre_scores_gemma":[0.8575761,0.000006235509,0.14046322,0.00078162964,0.00031261213,0.00004171463,0.00041003074,0.000020671576,0.00038780234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977008,0.00006436838,0.00045854,0.000666651,0.0006011669,0.00050844747],"domain_scores_gemma":[0.997951,0.0008194202,0.00019586674,0.00029724132,0.00047303853,0.00026348713],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00046842385,0.0002594582,0.00026772186,0.00029137282,0.0014403937,0.00027611648,0.00061685697,0.00009813013,0.000060763003],"category_scores_gemma":[0.00040401903,0.00026982094,0.00021420029,0.0012828674,0.000103746985,0.0008491399,0.00021864129,0.00015631945,0.000061015475],"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.000088053755,0.00013804562,0.008243359,0.00009443256,0.00024251122,0.000046597866,0.0048542754,0.75725234,0.0010787145,0.19293556,0.009855681,0.025170438],"study_design_scores_gemma":[0.0015971917,0.0002520151,0.024758235,0.00002312724,0.000014628027,0.0002676014,0.0002245719,0.90936303,0.0012968864,0.035610728,0.025834644,0.000757351],"about_ca_topic_score_codex":0.00000822156,"about_ca_topic_score_gemma":0.0000037818904,"teacher_disagreement_score":0.53986543,"about_ca_system_score_codex":0.00008388133,"about_ca_system_score_gemma":0.00023970114,"threshold_uncertainty_score":0.9999754},"labels":[],"label_agreement":null},{"id":"W2033449293","doi":"10.1007/s00373-015-1543-4","title":"Monitoring the Plane with Rotating Radars","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Concordia University; Simon Fraser University; Carleton University; University of Waterloo; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Plane (geometry); Radar; Algorithm; Idle; Combinatorics; Mathematics; Set (abstract data type); Point (geometry); Binary logarithm; Physics; Computer science; Geometry; Mathematical analysis; Telecommunications","score_opus":0.02286262453610839,"score_gpt":0.22256370302563683,"score_spread":0.19970107848952845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033449293","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.88868916,0.0012744477,0.1072951,0.000686795,0.0008130017,0.00011850054,4.7200163e-7,0.00009987838,0.0010226496],"genre_scores_gemma":[0.99383706,0.000024029236,0.005975192,0.000049493923,0.000026722553,0.000006704087,9.1601584e-7,0.0000030263595,0.000076863194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994272,0.000026923866,0.00007559514,0.00013775889,0.00022612808,0.00010640234],"domain_scores_gemma":[0.9995976,0.0000627629,0.000039438717,0.0001406781,0.00008808629,0.00007142187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002130869,0.00006605814,0.000057065183,0.0000462097,0.00017070914,0.00014225802,0.00018509397,0.000017341948,2.0036448e-7],"category_scores_gemma":[0.000014204356,0.000042896496,0.000011300389,0.0004679,0.000019630543,0.0001781131,0.000062212515,0.00007379215,0.0000015124123],"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.000008302757,0.00004005849,0.025957836,0.0000070648243,0.000018648194,0.000012940318,0.0014043415,0.0009994778,0.00002629797,0.8987991,0.00046769698,0.07225824],"study_design_scores_gemma":[0.0025010817,0.0010019433,0.06122425,0.00006847543,0.00002885284,0.00023660439,0.0008817284,0.07536983,0.0024854995,0.84363806,0.011922345,0.0006413175],"about_ca_topic_score_codex":0.000011378044,"about_ca_topic_score_gemma":8.3322664e-7,"teacher_disagreement_score":0.1051479,"about_ca_system_score_codex":0.000008179605,"about_ca_system_score_gemma":0.000039958544,"threshold_uncertainty_score":0.17492683},"labels":[],"label_agreement":null},{"id":"W2033843939","doi":"10.1016/j.ejc.2003.07.007","title":"Embedding grids in surfaces","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":35,"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; Consejo Nacional de Ciencia y Tecnología","keywords":"Embedding; Mathematics; Grid; Combinatorics; Surface (topology); Minor (academic); Square tiling; Graph; Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.013193596942656746,"score_gpt":0.24235195760164982,"score_spread":0.2291583606589931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033843939","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.5137477,0.0003558517,0.48214808,0.0005478043,0.0011333163,0.000023756764,1.185259e-7,0.000014506926,0.0020288827],"genre_scores_gemma":[0.98609716,0.000039474304,0.0136450315,0.00008042429,0.00008605697,8.173737e-8,2.9080275e-7,0.0000057782086,0.00004567587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898785,0.00016481134,0.00035156228,0.000092471266,0.0002863989,0.00011691182],"domain_scores_gemma":[0.99939924,0.000049583698,0.00019856477,0.000113523194,0.00016879743,0.0000702928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011331855,0.000071014176,0.000111400586,0.00023062943,0.00004817004,0.00009695004,0.00048371748,0.000010317947,0.0000021485098],"category_scores_gemma":[0.000086031316,0.00006587872,0.000048424252,0.00059593853,0.000010819548,0.00048895687,0.00007718052,0.0001733697,0.000019131992],"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.000011835894,0.00028436055,0.0010309865,0.000012275935,0.000017218943,0.00088277896,0.0013314531,0.6465275,0.0010679669,0.334009,0.00054289895,0.014281698],"study_design_scores_gemma":[0.018955667,0.004326259,0.2204285,0.00081636093,0.000041048777,0.0025488692,0.00038379253,0.08798868,0.01680013,0.5801726,0.0658141,0.0017239777],"about_ca_topic_score_codex":6.176405e-7,"about_ca_topic_score_gemma":2.5264393e-7,"teacher_disagreement_score":0.55853885,"about_ca_system_score_codex":0.0000737348,"about_ca_system_score_gemma":0.00009465468,"threshold_uncertainty_score":0.2686456},"labels":[],"label_agreement":null},{"id":"W2033938169","doi":"10.1145/1412228.1412231","title":"Computing an approximation of the 1-center problem on weighted terrain surfaces","year":2008,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","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":"Combinatorics; Mathematics; Convex hull; Vertex (graph theory); Running time; Approximation algorithm; Minimum bounding box; Graph; Regular polygon; Algorithm; Geometry; Computer science; Artificial intelligence","score_opus":0.025185622867333984,"score_gpt":0.2741900172678776,"score_spread":0.24900439440054364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033938169","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.8894742,0.0001564131,0.109371014,0.00028568454,0.00042989297,0.000110565576,0.0000018436763,0.000011679227,0.00015869075],"genre_scores_gemma":[0.79771495,0.000007876313,0.20200223,0.0001275874,0.00012529726,6.2422805e-7,0.000002851317,0.000004766448,0.000013805085],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987321,0.00011693928,0.00043072947,0.00013637595,0.0004646919,0.00011916717],"domain_scores_gemma":[0.9989854,0.00006412429,0.0004502838,0.000266413,0.00017637032,0.000057392717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028846343,0.000106434025,0.00014959153,0.00010659428,0.00017596035,0.000037020796,0.0008026296,0.000035491532,0.0000040386576],"category_scores_gemma":[0.000021951319,0.0000749342,0.000091201204,0.0002906691,0.00005394119,0.0005121572,0.0001778023,0.00013387196,0.0000014676226],"study_design_candidate":"bench_or_experimental","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.00034461953,0.009148253,0.008787967,0.00006674942,0.00042411295,0.00011403541,0.056121007,0.1119691,0.5662004,0.039278936,0.0036447488,0.20390013],"study_design_scores_gemma":[0.0016781772,0.0012356931,0.0069278874,0.00010773149,0.000007449505,0.0008760221,0.00040565198,0.51953626,0.465963,0.0025429132,0.00047404008,0.00024516197],"about_ca_topic_score_codex":0.00000454542,"about_ca_topic_score_gemma":3.2199637e-7,"teacher_disagreement_score":0.40756717,"about_ca_system_score_codex":0.000059612656,"about_ca_system_score_gemma":0.00007710129,"threshold_uncertainty_score":0.3055728},"labels":[],"label_agreement":null},{"id":"W2034834234","doi":"10.5555/545381.545445","title":"Semi-online maintenance of geometric optima and measures","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hausdorff distance; Convex hull; Rectangle; Sublinear function; Hausdorff space; Object (grammar); Point (geometry); Mathematics; Regular polygon; Center (category theory); Measure (data warehouse); Computer science; Mathematical optimization; Combinatorics; Discrete mathematics; Algorithm; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.030813751681680882,"score_gpt":0.22975681644246282,"score_spread":0.19894306476078194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034834234","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.055964444,0.000896348,0.9393967,0.0007014644,0.000089577814,0.00004970282,0.0000019444635,0.00004014173,0.0028597047],"genre_scores_gemma":[0.89361984,0.00013548492,0.10433801,0.00018532983,0.000030664713,0.0000013271134,0.0000014514156,0.0000018605566,0.0016860067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940264,0.00001622519,0.00013475445,0.0001602666,0.00017874547,0.00010737028],"domain_scores_gemma":[0.9995902,0.00006761333,0.000043089323,0.00014115553,0.00011520065,0.000042732376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013771138,0.000054883552,0.00008158589,0.0002055344,0.000038041457,0.000028669047,0.00016688969,0.000020558275,0.000044307537],"category_scores_gemma":[0.00007342157,0.00004599037,0.000020867139,0.00083512266,0.000020153668,0.0001983859,0.000082994055,0.000034764074,0.000008442515],"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.0000036171639,0.00024865952,0.0020129138,0.000027034406,0.000026027756,0.000005864324,0.00023874769,0.013604867,0.0027216098,0.055125967,0.01017545,0.9158092],"study_design_scores_gemma":[0.0004291125,0.00013116824,0.025531594,0.000012570155,0.0000046769246,0.00004640903,0.000016273527,0.9561772,0.0061734933,0.0018972611,0.009411371,0.0001688948],"about_ca_topic_score_codex":0.0000063453863,"about_ca_topic_score_gemma":0.000002663612,"teacher_disagreement_score":0.9425723,"about_ca_system_score_codex":0.000007403336,"about_ca_system_score_gemma":0.0000071033633,"threshold_uncertainty_score":0.18754329},"labels":[],"label_agreement":null},{"id":"W2035084369","doi":"10.1007/s10898-011-9780-4","title":"Maximal perimeter, diameter and area of equilateral unit-width convex polygons","year":2011,"lang":"en","type":"article","venue":"Journal of Global Optimization","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Agence Nationale de la Recherche","keywords":"Equilateral triangle; Mathematics; Perimeter; Regular polygon; Combinatorics; Maximization; Unit (ring theory); Geometry; Mathematical optimization","score_opus":0.03473081697179394,"score_gpt":0.24398814327124557,"score_spread":0.20925732629945162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035084369","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.14702342,0.00017423404,0.8515993,0.00010521565,0.00037885088,0.00004528505,0.000004224556,0.000008350687,0.0006611378],"genre_scores_gemma":[0.6881655,0.00002887558,0.3116697,0.00007989012,0.000036512836,3.1744915e-7,0.0000016271923,0.0000023102734,0.000015261456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991319,0.00005813041,0.00037303023,0.00010845246,0.0002212749,0.00010722351],"domain_scores_gemma":[0.9990823,0.000026564767,0.0003493103,0.000103939805,0.00035100072,0.00008683966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021190415,0.00008874354,0.00016794667,0.00010533219,0.000041000712,0.000051680614,0.00021081066,0.000046349312,0.000036611866],"category_scores_gemma":[0.00003773038,0.00007701035,0.00006115698,0.00034803955,0.000039049373,0.0006994894,0.000057827117,0.000057970883,9.1817134e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007281482,0.0010755318,0.05981042,0.00008893425,0.00044540563,0.00010903117,0.0030899611,0.79187703,0.006025501,0.05940501,0.0014291018,0.07591593],"study_design_scores_gemma":[0.0017225245,0.0014654509,0.054839514,0.00007720249,0.000078084486,0.00068841025,0.00004476075,0.9263208,0.0067590484,0.0075150104,0.00017711711,0.00031206614],"about_ca_topic_score_codex":0.000008163844,"about_ca_topic_score_gemma":9.981642e-7,"teacher_disagreement_score":0.54114205,"about_ca_system_score_codex":0.000029834351,"about_ca_system_score_gemma":0.00008671771,"threshold_uncertainty_score":0.31403908},"labels":[],"label_agreement":null},{"id":"W2035242697","doi":"10.1007/pl00013390","title":"Guaranteed-Quality Simplical Mesh Generation with Cell Size and Grading Control","year":2001,"lang":"en","type":"article","venue":"Engineering With Computers","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","funders":"","keywords":"Polygon mesh; Mathematical proof; Computer science; Mesh generation; Finite element method; Volume mesh; Algorithm; Grading (engineering); T-vertices; Mathematical optimization; Mathematics; Geometry; Computer graphics (images); Engineering","score_opus":0.00816919185419506,"score_gpt":0.2020289833954478,"score_spread":0.19385979154125274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035242697","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.28965563,0.000051070932,0.70954555,0.00024486927,0.00017032784,0.00012457126,7.850944e-7,0.00015508856,0.000052113508],"genre_scores_gemma":[0.85924953,0.0000047807002,0.14019729,0.00032000194,0.00017516855,0.000011773596,0.00000382908,0.000011008701,0.000026624866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988981,0.00003588553,0.00018766991,0.00038100546,0.000260623,0.00023670646],"domain_scores_gemma":[0.9992371,0.0002944768,0.00006124174,0.0002225887,0.00006910897,0.00011548359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021455459,0.00018238011,0.00018125816,0.00009610644,0.00011276212,0.00019966731,0.00019415637,0.00003865111,0.0000019491497],"category_scores_gemma":[0.000018465782,0.00015204976,0.000025317257,0.0003959878,0.000019233068,0.00032062296,0.00004123081,0.00011647255,0.0000027367653],"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.000041515297,0.000059575563,0.0018033956,0.00003583545,0.000053884218,0.00005913994,0.0004096315,0.96107537,0.011920317,0.016432444,0.0001874102,0.007921484],"study_design_scores_gemma":[0.0012249546,0.00021121134,0.010487828,0.000025624335,0.000009789846,0.00021984933,0.0000048264283,0.9855167,0.00096667366,0.000039869064,0.0010158273,0.00027680694],"about_ca_topic_score_codex":0.000006943383,"about_ca_topic_score_gemma":0.0000026346072,"teacher_disagreement_score":0.5695939,"about_ca_system_score_codex":0.000034757933,"about_ca_system_score_gemma":0.000031922853,"threshold_uncertainty_score":0.62004095},"labels":[],"label_agreement":null},{"id":"W2036493899","doi":"10.1007/s00224-014-9591-3","title":"On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","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":"University of Waterloo; University of Manitoba; Dalhousie University","funders":"","keywords":"Minimum spanning tree; Spanning tree; Mathematics; Parameterized complexity; Disjoint sets; Euclidean minimum spanning tree; Minimum weight; Combinatorics; Connected dominating set; Euclidean geometry; Steiner tree problem; Approximation algorithm; Set (abstract data type); Point (geometry); Mathematical proof; Kruskal's algorithm; Mathematical optimization; Computer science","score_opus":0.010340620752888371,"score_gpt":0.2233376238070862,"score_spread":0.21299700305419783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036493899","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.36277756,0.00019131745,0.63302034,0.00006906904,0.00036803243,0.00011763205,6.722325e-7,0.00008336267,0.0033720185],"genre_scores_gemma":[0.98998433,0.0000015542963,0.009478426,0.00010427899,0.00024160711,0.0000028159757,0.0000031694888,0.000012761128,0.00017104072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998306,0.00038012484,0.00034927862,0.00038901667,0.0003448438,0.00023077613],"domain_scores_gemma":[0.99801606,0.0011296181,0.00026775734,0.00037818844,0.00011881277,0.00008953879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012954565,0.00019076937,0.00031277828,0.00021087285,0.00017064073,0.00012696776,0.00037402188,0.000055187997,0.0000022533486],"category_scores_gemma":[0.000069481175,0.00015390676,0.000040595864,0.00033097598,0.0000776884,0.00015496743,0.000103664126,0.00009951801,0.000008240789],"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.000059682912,0.000062832936,0.0003853079,0.000089425404,0.000048346923,0.000003685261,0.0016356874,0.050236575,0.0008455735,0.9002172,0.00017616921,0.046239562],"study_design_scores_gemma":[0.001104659,0.0010010669,0.0061057084,0.00050708535,0.0000216457,0.0000916009,0.00013615192,0.95076287,0.0013953096,0.037802618,0.0006827927,0.00038849268],"about_ca_topic_score_codex":0.0000063573793,"about_ca_topic_score_gemma":6.939941e-7,"teacher_disagreement_score":0.9005263,"about_ca_system_score_codex":0.000017573979,"about_ca_system_score_gemma":0.00003686078,"threshold_uncertainty_score":0.62761354},"labels":[],"label_agreement":null},{"id":"W2036529526","doi":"10.1007/s00454-008-9125-3","title":"A Polynomial Bound for Untangling Geometric Planar Graphs","year":2008,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada; Universitat Politècnica de Catalunya; Ministerio de Economía y Competitividad","keywords":"Upper and lower bounds; Graph; Planar; Time complexity; Planar graph; Spanning tree","score_opus":0.024040076932284965,"score_gpt":0.26137474662002247,"score_spread":0.2373346696877375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036529526","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.21202469,0.00055470393,0.78489035,0.00049790606,0.00081148365,0.00038449906,0.00007129483,0.00021502314,0.00055006717],"genre_scores_gemma":[0.84912235,0.00002051094,0.14878277,0.00074181875,0.00038756823,0.000067142886,0.00047467233,0.000025474354,0.00037766434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972124,0.00006921146,0.00057779567,0.0007733894,0.00082607364,0.0005411157],"domain_scores_gemma":[0.99785715,0.00087946776,0.0002347771,0.00035426058,0.00043608228,0.00023827712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004337041,0.00032019796,0.00034015166,0.0016211877,0.00088068476,0.0002269131,0.0007710453,0.00012220095,0.000030676696],"category_scores_gemma":[0.00021620095,0.00033762114,0.00029063266,0.0035882483,0.00011163935,0.0008149642,0.00013792625,0.00019174925,0.00007271534],"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.00030739102,0.0006729019,0.011324885,0.00016616596,0.00055178377,0.00015442066,0.001458514,0.66902965,0.00084030966,0.17988302,0.08249956,0.053111386],"study_design_scores_gemma":[0.005264768,0.00089701725,0.11989671,0.000058546775,0.00007108236,0.00079357636,0.00010264603,0.7667894,0.0013488708,0.05885068,0.043956436,0.0019702693],"about_ca_topic_score_codex":0.000021580106,"about_ca_topic_score_gemma":0.000002780777,"teacher_disagreement_score":0.63709766,"about_ca_system_score_codex":0.00011400865,"about_ca_system_score_gemma":0.00033989234,"threshold_uncertainty_score":0.99990755},"labels":[],"label_agreement":null},{"id":"W2036908020","doi":"10.1007/s00373-010-0881-5","title":"Packing and Covering Triangles in Planar Graphs","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Planar; Outerplanar graph; Graph; Pathwidth; Computer science; Line graph; Computer graphics (images)","score_opus":0.010776758511349073,"score_gpt":0.21953694696479698,"score_spread":0.2087601884534479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036908020","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.9775869,0.0018836131,0.019132834,0.00046327585,0.0002408349,0.00008985344,8.529112e-7,0.000057845264,0.00054398],"genre_scores_gemma":[0.99819475,0.00032979983,0.0012463174,0.00019835685,0.0000066023954,0.000002141214,0.0000022202341,0.000001977136,0.00001782574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939424,0.000023965827,0.00012599649,0.00020327247,0.000120630895,0.00013191851],"domain_scores_gemma":[0.9997304,0.00005209318,0.00003581198,0.000100058925,0.000024661796,0.000056959485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017004313,0.00008218071,0.00010346649,0.00022201372,0.000099759374,0.00012168736,0.000105622086,0.00003736749,4.188052e-7],"category_scores_gemma":[0.000014155302,0.00008214567,0.000019947936,0.0006273817,0.00001342112,0.00025200765,0.000028185576,0.00007386369,4.0097024e-7],"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.0000035922176,0.000035063877,0.0039441823,0.0000053498406,0.00000279681,0.000010511621,0.00022958918,0.00006129921,0.00012734739,0.95165676,0.000067017674,0.043856464],"study_design_scores_gemma":[0.0006712221,0.0001474111,0.09964897,0.000017749931,0.000002723902,0.000018510756,0.000025270832,0.009776164,0.00017285509,0.8886704,0.0007007395,0.00014800376],"about_ca_topic_score_codex":0.000007311573,"about_ca_topic_score_gemma":0.000003765992,"teacher_disagreement_score":0.09570479,"about_ca_system_score_codex":0.000008868063,"about_ca_system_score_gemma":0.000013290027,"threshold_uncertainty_score":0.33498034},"labels":[],"label_agreement":null},{"id":"W2037537665","doi":"10.1145/363647.363652","title":"Dynamic planar convex hull operations in near-logarithmic amortized time","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":81,"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":"Convex hull; Amortized analysis; Combinatorics; Binary logarithm; Logarithm; Mathematics; Regular polygon; Tangent; Constant (computer programming); Planar; Set (abstract data type); Time complexity; Computational geometry; Hull; Data structure; Discrete mathematics; Computer science; Algorithm; Geometry; Mathematical analysis","score_opus":0.01096369959703388,"score_gpt":0.2529968227406693,"score_spread":0.24203312314363543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037537665","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.9145103,0.0001331577,0.06740082,0.017039774,0.0005993637,0.00009792042,0.0000010242567,0.000011528145,0.00020610513],"genre_scores_gemma":[0.93193793,0.000028273855,0.06587866,0.00085278077,0.00008705327,0.0000015900001,0.0000014733806,0.0000043091213,0.0012079128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991579,0.000094867224,0.0003035704,0.000089376765,0.0002447159,0.000109545734],"domain_scores_gemma":[0.99920166,0.00008527985,0.00012497303,0.00043038605,0.00011436544,0.000043312426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043191283,0.000062316336,0.00012138808,0.00011315932,0.0001201848,0.00013192261,0.0014123342,0.000030828414,0.000036060123],"category_scores_gemma":[0.00034265057,0.00004358725,0.00007278801,0.0004771765,0.000023987322,0.00037051708,0.00019228642,0.00017020034,0.00004133901],"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.00015032655,0.00057194574,0.0074148816,0.000013286671,0.00014361824,0.00029842943,0.0024371617,0.86455864,0.062165134,0.008178102,0.01823115,0.035837352],"study_design_scores_gemma":[0.0013046152,0.00013121303,0.06978435,0.000046345347,0.000014029385,0.0009298539,0.00001730937,0.89822936,0.00059031753,0.021662557,0.0071396255,0.0001504395],"about_ca_topic_score_codex":0.000009641689,"about_ca_topic_score_gemma":0.000034992452,"teacher_disagreement_score":0.06236947,"about_ca_system_score_codex":0.00006333552,"about_ca_system_score_gemma":0.00017402445,"threshold_uncertainty_score":0.26244918},"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":"W2039266190","doi":"10.1080/00029890.2005.11920166","title":"Figures of Constant Width on a Chessboard","year":2005,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Diagonal; Row; Constant (computer programming); Mathematics; Combinatorics; Row and column spaces; Column (typography); Geometry; Computer science; Connection (principal bundle)","score_opus":0.012638600543893853,"score_gpt":0.2560438259496139,"score_spread":0.24340522540572004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039266190","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.06539278,0.00008514197,0.7310885,0.0038652983,0.00007090068,0.00023275534,0.000009070218,0.00014565735,0.19910985],"genre_scores_gemma":[0.81360495,0.0000025869317,0.18552393,0.000601819,0.00004847623,0.000010084704,0.0000015771029,0.0000044978706,0.00020208267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999034,0.000040352414,0.00026269327,0.00020180855,0.0003072416,0.00015390056],"domain_scores_gemma":[0.999103,0.00032535853,0.0001327233,0.00029705768,0.000060879393,0.00008099745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015230557,0.00010055665,0.00021583126,0.000087157394,0.000038266397,0.000029676597,0.00029705392,0.000017782382,0.000044718534],"category_scores_gemma":[0.00012700363,0.00008283483,0.00006587882,0.00036722483,0.00013923112,0.000120683806,0.000056150926,0.00006512882,0.00011900749],"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.000012166477,0.0002651047,0.000019303227,0.00002056018,0.000019814612,0.0000029839048,0.0004014138,0.00510508,0.00070107094,0.92033136,0.0016278318,0.071493335],"study_design_scores_gemma":[0.00062677235,0.001064388,0.0019060755,0.0001395317,0.00002243929,0.00001403701,0.00010810543,0.51303077,0.021863874,0.4485436,0.012203253,0.00047717427],"about_ca_topic_score_codex":0.0000047842386,"about_ca_topic_score_gemma":0.0000017523504,"teacher_disagreement_score":0.74821216,"about_ca_system_score_codex":0.000023181285,"about_ca_system_score_gemma":0.000042211675,"threshold_uncertainty_score":0.33779064},"labels":[],"label_agreement":null},{"id":"W2039598212","doi":"10.1142/s0218195900000073","title":"COMPUTATIONAL GEOMETRY COLUMN 37","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","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":"Mathematics; Column (typography); Geometry; Combinatorics; Computational geometry; Connection (principal bundle)","score_opus":0.010583747335228775,"score_gpt":0.27916497311766797,"score_spread":0.2685812257824392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039598212","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.022110913,0.00090424117,0.9688978,0.0032379027,0.0008446198,0.0004856056,0.00008510879,0.00014444713,0.00328937],"genre_scores_gemma":[0.70619476,0.00018571912,0.28792828,0.0020887067,0.0018753004,0.00011976907,0.0003435815,0.000039388717,0.0012244731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947737,0.00015476432,0.0015877567,0.0005996201,0.0024766105,0.00040755965],"domain_scores_gemma":[0.9942518,0.00092365994,0.00086082774,0.0004004754,0.0031999222,0.00036332483],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008988314,0.0003742763,0.00045751018,0.0013206641,0.00036463543,0.00062330416,0.002603371,0.000157544,0.0011961396],"category_scores_gemma":[0.000088376764,0.00040294102,0.0004189921,0.0024349964,0.0001586218,0.0016285098,0.00021027162,0.0004870622,0.0006080525],"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.000054950007,0.00051101507,0.00036575488,0.000012166631,0.00030330353,0.00003104316,0.00009092874,0.6585004,0.00004681085,0.064994484,0.003814151,0.271275],"study_design_scores_gemma":[0.0029299578,0.00032408605,0.016270528,0.000078990604,0.00007853309,0.0020078623,0.00005754828,0.15890881,0.0002471876,0.293704,0.5245073,0.0008851893],"about_ca_topic_score_codex":0.000008408396,"about_ca_topic_score_gemma":0.0000015391848,"teacher_disagreement_score":0.6840839,"about_ca_system_score_codex":0.00030810302,"about_ca_system_score_gemma":0.0006938036,"threshold_uncertainty_score":0.9998422},"labels":[],"label_agreement":null},{"id":"W2040030030","doi":"10.1051/snamc/201402203","title":"A generalization of 3D prismatic characteristics along a nonuniform projection mesh","year":2014,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Polygon mesh; Computation; Generalization; Computer science; Projection (relational algebra); Scale (ratio); Computational science; Process (computing); Space (punctuation); Algorithm; Mathematical optimization; Computer graphics (images); Mathematics; Mathematical analysis; Physics","score_opus":0.011079736711948679,"score_gpt":0.22935592235074612,"score_spread":0.21827618563879744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040030030","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.11980944,0.0000041150065,0.87757087,0.00012431918,0.00024117061,0.00013677213,5.5784557e-7,0.00007299769,0.0020397732],"genre_scores_gemma":[0.83879715,0.0000035867606,0.16044545,0.00015471964,0.00010010052,0.0000112381085,0.0000252676,0.0000040012173,0.00045846228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917585,0.000051828436,0.00028628472,0.00016838941,0.00021667202,0.000100975754],"domain_scores_gemma":[0.99937534,0.00004651032,0.00015282517,0.00020470921,0.00018713514,0.000033488584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031399206,0.00007662697,0.000113197806,0.00015325428,0.00006586456,0.000058199144,0.00017438443,0.000037494352,0.000014847988],"category_scores_gemma":[0.000066019056,0.00006924602,0.00002825849,0.0004429969,0.000011433932,0.00034966855,0.000053857373,0.000035220342,0.00001574417],"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.000011702363,0.00023222706,0.0030693798,0.00017473224,0.000035240068,9.548186e-7,0.0015171935,0.004672643,0.010475076,0.6123477,0.0009080804,0.36655506],"study_design_scores_gemma":[0.0001733716,0.00009116586,0.010353306,0.000012293032,0.0000057785246,0.000009053678,0.0000045637603,0.98017836,0.006001155,0.0017703559,0.0013037128,0.000096868665],"about_ca_topic_score_codex":0.000016940687,"about_ca_topic_score_gemma":0.000014163513,"teacher_disagreement_score":0.9755057,"about_ca_system_score_codex":0.000020807209,"about_ca_system_score_gemma":0.000049240665,"threshold_uncertainty_score":0.28237706},"labels":[],"label_agreement":null},{"id":"W2040074412","doi":"10.1007/s00453-005-1148-z","title":"Three-Dimensional Orthogonal Graph Drawing with Optimal Volume","year":2005,"lang":"en","type":"article","venue":"Algorithmica","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":"McGill University; University of Waterloo","funders":"","keywords":"Embedding; Combinatorics; Mathematics; Bounded function; Grid; Graph drawing; Graph; Upper and lower bounds; Theory of computation; Discrete mathematics; Computer science; Geometry; Algorithm","score_opus":0.008670530162049123,"score_gpt":0.2169461656829679,"score_spread":0.20827563552091877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040074412","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.08479751,0.00011391946,0.912343,0.0020512296,0.00017629589,0.00009327371,0.0000031849513,0.00013481492,0.00028674517],"genre_scores_gemma":[0.39012262,7.3424064e-7,0.60863996,0.00051042926,0.00041022827,0.000011414946,0.000020721374,0.000008485126,0.00027539456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987192,0.000020677033,0.00018025351,0.00038770738,0.00043237882,0.00025974415],"domain_scores_gemma":[0.9993839,0.00005381453,0.000060654187,0.0002493735,0.00014078476,0.00011144643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016931289,0.00014156666,0.00011780336,0.0001432313,0.00021839415,0.00011725556,0.00033798572,0.000045110635,0.00007376382],"category_scores_gemma":[0.000008444101,0.00012386637,0.000057891888,0.00051061076,0.00004377511,0.0005862114,0.00011944398,0.00013044014,0.00015892606],"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.000033926568,0.00022810818,0.0006851255,0.000006269757,0.00008986255,0.00005564345,0.00019360476,0.28847787,0.0007370527,0.042473793,0.0071008387,0.6599179],"study_design_scores_gemma":[0.00044541742,0.0001376932,0.0064869723,0.000011320324,0.000008573669,0.0001571172,0.0000024008061,0.975039,0.0012572147,0.0016764288,0.014520527,0.00025732315],"about_ca_topic_score_codex":0.000008682889,"about_ca_topic_score_gemma":0.000021731974,"teacher_disagreement_score":0.68656117,"about_ca_system_score_codex":0.000030360841,"about_ca_system_score_gemma":0.00013408349,"threshold_uncertainty_score":0.50511235},"labels":[],"label_agreement":null},{"id":"W2040746822","doi":"10.1137/s009753970343912x","title":"Dynamic Subgraph Connectivity with Geometric Applications","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"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":"Omega; Combinatorics; Sublinear function; Mathematics; Exponent; Matrix multiplication; Binary logarithm; Simple (philosophy); Graph; Discrete mathematics; Degeneracy (biology)","score_opus":0.007030177447079165,"score_gpt":0.23590775653986001,"score_spread":0.22887757909278084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040746822","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.14771299,0.0001944495,0.8496128,0.0004510735,0.00022093391,0.00013354796,8.2906826e-7,0.00010535155,0.001568069],"genre_scores_gemma":[0.92717654,0.0000056817894,0.07225835,0.00018273813,0.00027743645,0.000004034542,0.0000052792957,0.0000090947215,0.000080846956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985756,0.000087597975,0.00029226844,0.00031450452,0.0004457022,0.00028427062],"domain_scores_gemma":[0.9988307,0.00033438441,0.00025993097,0.00023785386,0.0002392903,0.0000978507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005447072,0.00015253604,0.00015644685,0.0006667955,0.00062243675,0.0003651876,0.0004286911,0.00003996265,0.000006222399],"category_scores_gemma":[0.000021836213,0.00012926095,0.0000785704,0.0022160127,0.00002741001,0.00030920937,0.00006857098,0.0003144176,0.000032680062],"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.000019747273,0.00039135217,0.002740147,0.000016287308,0.000046565397,0.00005549253,0.000059068912,0.61094284,0.0005895425,0.11026512,0.00068949483,0.27418432],"study_design_scores_gemma":[0.0015066921,0.00065619015,0.117811196,0.0000870723,0.000021580294,0.0016421347,0.00002597044,0.83944875,0.0011944725,0.025916208,0.01102208,0.00066764187],"about_ca_topic_score_codex":0.000006560366,"about_ca_topic_score_gemma":0.000007339437,"teacher_disagreement_score":0.7794635,"about_ca_system_score_codex":0.00010174484,"about_ca_system_score_gemma":0.00010415019,"threshold_uncertainty_score":0.5271109},"labels":[],"label_agreement":null},{"id":"W2041021940","doi":"10.1007/s00453-003-1048-z","title":"Testing the Quality of Manufactured Disks and Balls","year":2003,"lang":"en","type":"article","venue":"Algorithmica","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":"Computation; Theory of computation; Object (grammar); Algorithm; Ball (mathematics); Computer science; Mathematics; Quality (philosophy); Boundary (topology); Combinatorics; Geometry; Mathematical analysis; Physics; Artificial intelligence","score_opus":0.04788007247890287,"score_gpt":0.29217789794346827,"score_spread":0.2442978254645654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041021940","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.16134626,0.00020117663,0.83537257,0.00054908876,0.00018472034,0.00010613023,0.0000023253383,0.000030861018,0.0022068596],"genre_scores_gemma":[0.88859946,0.0000016160589,0.11118587,0.00012518934,0.000025265112,0.0000027465212,0.0000010355158,0.0000016323876,0.000057195233],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993943,0.000098953504,0.00014564725,0.00013805927,0.00014177365,0.00008126628],"domain_scores_gemma":[0.99929535,0.0003759559,0.000067697154,0.0001724784,0.00006155878,0.0000269342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041440933,0.000050847564,0.000069713205,0.000024455514,0.000087267625,0.000037949125,0.00015759801,0.00001846953,0.0000041866247],"category_scores_gemma":[0.00020486531,0.000035620196,0.0000183034,0.00020701758,0.000030135776,0.00009925473,0.00004634906,0.000047321882,0.000002364955],"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.0000031267896,0.000076799966,0.0011244852,0.000024621262,0.000033283657,0.0000020488378,0.0010184125,0.0010571461,0.01621348,0.33373407,0.00035704277,0.64635545],"study_design_scores_gemma":[0.0010799775,0.0001969007,0.45581958,0.000028297967,0.000021533973,0.00008572883,0.000103176324,0.15843037,0.15793861,0.20873266,0.017022114,0.00054104876],"about_ca_topic_score_codex":0.000016804772,"about_ca_topic_score_gemma":0.0000013763004,"teacher_disagreement_score":0.7272532,"about_ca_system_score_codex":0.0000053521844,"about_ca_system_score_gemma":0.000029147695,"threshold_uncertainty_score":0.14525495},"labels":[],"label_agreement":null},{"id":"W2041671400","doi":"10.1145/777792.777848","title":"The asteroid surveying problem and other puzzles","year":2003,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Asteroid; Shore; Plane (geometry); Set (abstract data type); Unit (ring theory); Computer science; Mathematics; Geodesy; Geology; Geometry; Physics; Astronomy","score_opus":0.02011364020360685,"score_gpt":0.23651136846794132,"score_spread":0.21639772826433448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041671400","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.01742867,0.0004175138,0.95084894,0.0007199379,0.00013724598,0.00008272438,1.8979068e-7,0.00004456784,0.03032024],"genre_scores_gemma":[0.89854264,0.000016172226,0.09511631,0.0007243146,0.000033541004,0.000009785651,3.8514668e-7,0.0000040944,0.0055527682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957407,0.00007521982,0.00007058671,0.00011241254,0.00008458301,0.000083140185],"domain_scores_gemma":[0.9996953,0.00012992705,0.000018568926,0.00010456845,0.000027804152,0.000023825924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045898304,0.000038405742,0.00002837245,0.000019619198,0.00018154988,0.00020632311,0.00010646776,0.00001064197,0.0000064916057],"category_scores_gemma":[0.000025140302,0.000023965897,0.000009042937,0.00013436722,0.000013614434,0.00013056201,0.00003108679,0.000024432882,0.000012050796],"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":[6.38759e-7,0.000008777995,0.0010774096,0.0000019897898,0.0000051347088,3.0324702e-7,0.00013834653,0.0003754067,0.0003833215,0.9156461,0.00072985166,0.08163276],"study_design_scores_gemma":[0.0005035167,0.00008379537,0.010194127,0.000010417683,0.000003277568,0.000074300115,0.00009435181,0.059725855,0.007781676,0.15018159,0.7710229,0.00032414004],"about_ca_topic_score_codex":0.0000031789332,"about_ca_topic_score_gemma":0.000031153504,"teacher_disagreement_score":0.88111395,"about_ca_system_score_codex":0.0000039051024,"about_ca_system_score_gemma":0.000018649042,"threshold_uncertainty_score":0.19895785},"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":"W2044795021","doi":"10.1142/s0218195912500112","title":"PROXIMITY GRAPHS: E, δ, Δ, χ AND ω","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"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":"Mathematics; Combinatorics; Chordal graph; Planar graph; Discrete mathematics; Clique number; 1-planar graph; Pathwidth; Graph; Line graph","score_opus":0.013881614469072502,"score_gpt":0.28432210158644977,"score_spread":0.2704404871173773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044795021","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.025273595,0.001619929,0.9699707,0.0014015157,0.00069475075,0.00023693217,0.000012705026,0.00005291401,0.0007369829],"genre_scores_gemma":[0.818655,0.00008933014,0.17986153,0.00058900594,0.00065204274,0.000044362543,0.000027430111,0.000009171851,0.00007213562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792784,0.00006762162,0.0006324255,0.00020513113,0.00094519614,0.00022179067],"domain_scores_gemma":[0.9973218,0.0003918537,0.0005091537,0.00016682548,0.0013617773,0.00024862157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073399156,0.00016014211,0.0001922858,0.0008382829,0.00014819101,0.00020885581,0.0008430621,0.000063465515,0.000030362211],"category_scores_gemma":[0.000070435744,0.00015602818,0.00012803891,0.0008461785,0.00007512284,0.0019362584,0.00019959327,0.0002076999,0.000034067067],"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.000023019511,0.0005221952,0.006039227,0.000016072549,0.00024456804,0.000004868545,0.0002515596,0.014284126,0.0002470956,0.7556719,0.0010654104,0.22162992],"study_design_scores_gemma":[0.0018757266,0.00019333886,0.10061647,0.00005117162,0.000073453615,0.0023286426,0.00010822501,0.017356077,0.0009990697,0.621815,0.25391266,0.0006701464],"about_ca_topic_score_codex":0.0000019083416,"about_ca_topic_score_gemma":3.1214051e-7,"teacher_disagreement_score":0.7933814,"about_ca_system_score_codex":0.00008186111,"about_ca_system_score_gemma":0.00014957032,"threshold_uncertainty_score":0.6362645},"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":"W2044955573","doi":"10.5555/545381.545444","title":"Closest-point problems simplified on the RAM","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":50,"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":"Computer science; Point (geometry); Mathematics; Geometry","score_opus":0.04622170058312015,"score_gpt":0.22755917887831703,"score_spread":0.1813374782951969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044955573","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.016269041,0.000062415915,0.85239536,0.03035801,0.0003967921,0.0003061382,5.876916e-7,0.00022422978,0.099987455],"genre_scores_gemma":[0.98416096,0.000007742301,0.005927305,0.0044391016,0.00009847636,0.00001970129,0.0000013074845,0.0000030814938,0.0053423354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933946,0.00004111648,0.00011229341,0.00018869911,0.00019657573,0.00012183477],"domain_scores_gemma":[0.9994142,0.0001761306,0.00002999471,0.00029658352,0.000046362537,0.00003673534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001792144,0.00006745013,0.000048277216,0.00004597695,0.00014001454,0.00013381326,0.00033900462,0.000020652655,0.00030821696],"category_scores_gemma":[0.000040044622,0.00004086269,0.000034180757,0.0003180407,0.000012783842,0.00015631045,0.00006642493,0.00006843399,0.00066085823],"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":[8.442488e-7,0.00008541407,0.000009072111,0.0000022262498,0.0000064435367,0.0000014839368,0.000277667,0.017193079,0.00038354794,0.87350786,0.049552813,0.058979545],"study_design_scores_gemma":[0.00019920057,0.00015084886,0.0005460708,0.000006795758,0.0000018921709,0.000012570698,0.000012081543,0.8845694,0.003402083,0.039392635,0.0715524,0.00015399233],"about_ca_topic_score_codex":0.0000033274182,"about_ca_topic_score_gemma":0.0000025651802,"teacher_disagreement_score":0.96789193,"about_ca_system_score_codex":0.000013121954,"about_ca_system_score_gemma":0.00000826245,"threshold_uncertainty_score":0.8494216},"labels":[],"label_agreement":null},{"id":"W2045363075","doi":"10.1007/s10998-008-8217-7","title":"Convex subdivisions with low stabbing numbers","year":2008,"lang":"en","type":"article","venue":"Periodica Mathematica Hungarica","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":"Mathematics; Combinatorics; Regular polygon; Subdivision; Geometry","score_opus":0.014221701164906474,"score_gpt":0.22009069934167405,"score_spread":0.20586899817676757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045363075","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.12691031,0.000071154514,0.8596439,0.0012727509,0.00011398313,0.00024354905,0.0000028256254,0.00029917175,0.011442395],"genre_scores_gemma":[0.8327553,0.000016240321,0.16597378,0.00031202027,0.000054681354,0.000035488007,0.0000072359976,0.000013513657,0.0008317299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983181,0.00005885435,0.00030298208,0.000410737,0.00058481784,0.00032453428],"domain_scores_gemma":[0.9987728,0.00023516039,0.00012398748,0.00053981185,0.00014141212,0.00018682408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020737677,0.0001908642,0.00026059896,0.00014810203,0.0006712193,0.00017815702,0.00055278925,0.00005340257,0.00019462346],"category_scores_gemma":[0.00010144185,0.00015473619,0.00007321008,0.00069412665,0.00015658629,0.00043208065,0.00015538506,0.00016234376,0.00030728884],"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.000120768884,0.0033361993,0.0045650005,0.0006683498,0.0005527994,0.0009463038,0.073722534,0.0059276535,0.009033717,0.8152834,0.04736558,0.03847766],"study_design_scores_gemma":[0.0042711264,0.001355013,0.02601362,0.0005342501,0.0001327631,0.003982555,0.00082859065,0.8383899,0.012397557,0.033510316,0.07525174,0.0033325662],"about_ca_topic_score_codex":0.0000067925666,"about_ca_topic_score_gemma":0.0000026722216,"teacher_disagreement_score":0.83246225,"about_ca_system_score_codex":0.000041144936,"about_ca_system_score_gemma":0.0002265014,"threshold_uncertainty_score":0.63099587},"labels":[],"label_agreement":null},{"id":"W2046209393","doi":"10.1007/s00454-008-9063-0","title":"On the Number of Facets of Three-Dimensional Dirichlet Stereohedra III: Full Cubic Groups","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Quarter (Canadian coin); Dirichlet distribution; Mathematics; Group (periodic table); Combinatorics; Pure mathematics; Mathematical analysis; Physics; History; Quantum mechanics","score_opus":0.023027953355241645,"score_gpt":0.25769156508404156,"score_spread":0.2346636117287999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046209393","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.6170448,0.000089798436,0.3811921,0.00048581723,0.00024708046,0.00018160521,0.000031786094,0.000037553848,0.0006894645],"genre_scores_gemma":[0.9766043,0.0000041408957,0.022547606,0.00047175479,0.00008822758,0.000016989781,0.00011423099,0.000014867495,0.0001379289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970787,0.00014094633,0.00068625365,0.00048816012,0.0013183439,0.00028756468],"domain_scores_gemma":[0.99706227,0.001427707,0.0004245996,0.00047104826,0.0005080724,0.00010631529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004455678,0.00026569446,0.00036352567,0.00034084494,0.00029474683,0.000038052676,0.0007745153,0.00008661388,0.0002488118],"category_scores_gemma":[0.00012629702,0.00020534804,0.00022891408,0.0016292209,0.00023272642,0.00035929427,0.0002989436,0.00022062768,0.000094948926],"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.00012965382,0.00038904077,0.0046453276,0.000041015504,0.00017977317,0.00001538016,0.00048646887,0.5135221,0.0009136174,0.47395453,0.0028075788,0.0029155198],"study_design_scores_gemma":[0.0018110627,0.00044749616,0.19224761,0.00011814119,0.0000344366,0.0002971122,0.0000449173,0.65509456,0.0027015966,0.14618112,0.00036122106,0.00066074886],"about_ca_topic_score_codex":0.000026095257,"about_ca_topic_score_gemma":0.0000033191222,"teacher_disagreement_score":0.35955945,"about_ca_system_score_codex":0.000041705884,"about_ca_system_score_gemma":0.00020615272,"threshold_uncertainty_score":0.83738506},"labels":[],"label_agreement":null},{"id":"W2047577363","doi":"10.1145/1250790.1250848","title":"Computing crossing number in linear time","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Crossing number (knot theory); Computer science; Time complexity; Algorithm; Parallel computing; Engineering; Intersection (aeronautics)","score_opus":0.013758730658606418,"score_gpt":0.2962379455782537,"score_spread":0.2824792149196473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047577363","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.2542887,0.0000075018565,0.73439014,0.00010097858,0.00016785823,0.000030952444,5.355291e-8,0.00006795206,0.010945839],"genre_scores_gemma":[0.7512025,1.01799564e-7,0.24716388,0.00046795057,0.000105202496,1.5840213e-7,0.0000014991332,0.0000022116722,0.0010564656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993271,0.000016197797,0.00017744384,0.00017045745,0.00013780197,0.0001709748],"domain_scores_gemma":[0.99965954,0.0001171331,0.000029447652,0.00010887707,0.0000449191,0.00004010481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062576815,0.0000536521,0.000060402916,0.00008432459,0.00010432917,0.00013295356,0.0001658851,0.000027860147,0.000049588234],"category_scores_gemma":[0.000024420531,0.000052651645,0.00002028847,0.00054459745,0.000014845572,0.000245314,0.00008701037,0.000062530424,0.00036232432],"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.000018258808,0.0002928683,0.029147442,0.000018169052,0.000014304023,0.00011893373,0.0030656403,0.09153207,0.012155921,0.14041807,0.0027997321,0.7204186],"study_design_scores_gemma":[0.0002298212,0.000010273003,0.028549725,0.00000919551,4.3912988e-7,0.000024915902,0.0000074177087,0.9602753,0.004159799,0.0016299867,0.004985076,0.00011807656],"about_ca_topic_score_codex":0.000016911563,"about_ca_topic_score_gemma":0.000011445105,"teacher_disagreement_score":0.8687432,"about_ca_system_score_codex":0.000027193782,"about_ca_system_score_gemma":0.00004305003,"threshold_uncertainty_score":0.4657067},"labels":[],"label_agreement":null},{"id":"W2047812461","doi":"","title":"Efficient Broadcast on Random Geometric Graphs","year":2010,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Random geometric graph; Connected component; Mathematics; Node (physics); Path (computing); Random graph; Component (thermodynamics); Binary logarithm; Shortest path problem; Discrete mathematics; Graph; Giant component; Euclidean geometry; Topology (electrical circuits); Computer science; Line graph; Physics; Computer network","score_opus":0.009335524000898158,"score_gpt":0.23199473718632596,"score_spread":0.2226592131854278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047812461","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.3339691,0.00002058623,0.6520883,0.00040632515,0.0011524507,0.00010401842,5.973386e-7,0.00012324142,0.012135431],"genre_scores_gemma":[0.9715271,0.0000016635516,0.027047576,0.00049382175,0.000088869354,0.00000785976,0.0000029068487,0.0000032996095,0.00082688045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990996,0.000023179184,0.00013674561,0.00027078,0.00031051424,0.00015919509],"domain_scores_gemma":[0.999293,0.00019165326,0.000036717778,0.00030545893,0.00008608703,0.00008707097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030600475,0.000087368186,0.000082539926,0.0005143791,0.00012604393,0.00012214846,0.00034278078,0.000038998463,0.000112860136],"category_scores_gemma":[0.000091499845,0.00007058772,0.00006247914,0.0015608293,0.000016984948,0.000064835986,0.00006974997,0.00013970266,0.00030374908],"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.000020553276,0.00025548472,0.00011405713,0.0000036501128,0.000011431047,0.000006318826,0.00008918056,0.0653281,0.0073031173,0.5881767,0.0032543088,0.3354371],"study_design_scores_gemma":[0.0022628962,0.00021147348,0.011477993,0.0000047874637,0.0000052392115,0.000041321073,0.0000059283834,0.9282151,0.020367347,0.007363818,0.029681122,0.0003629895],"about_ca_topic_score_codex":0.0000062130403,"about_ca_topic_score_gemma":0.0000029394614,"teacher_disagreement_score":0.86288697,"about_ca_system_score_codex":0.0000075876487,"about_ca_system_score_gemma":0.000033290627,"threshold_uncertainty_score":0.3904181},"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":"W2048247034","doi":"10.3792/pjaa.89.111","title":"Affine translation surfaces in Euclidean 3-space","year":2013,"lang":"en","type":"article","venue":"Proceedings of the Japan Academy Series A Mathematical Sciences","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Centre de Recherches Mathématiques","keywords":"Translation (biology); Affine space; Affine transformation; Space (punctuation); Computer science; Euclidean space; Pure mathematics; Mathematics; Chemistry","score_opus":0.026590841417593845,"score_gpt":0.2542275829609259,"score_spread":0.22763674154333205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048247034","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.955013,0.00008862873,0.0023677454,0.033256672,0.000064205095,0.00041577342,5.136142e-7,0.0000573947,0.00873606],"genre_scores_gemma":[0.93479955,0.000012518317,0.06457206,0.0001370195,0.00002976493,0.000023972216,9.221725e-8,0.000003367667,0.0004216842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858814,0.000015078537,0.00035648842,0.00027401085,0.00052311167,0.00024316476],"domain_scores_gemma":[0.99947965,0.00016213351,0.0001709956,0.000057284833,0.00007469873,0.000055219243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008493727,0.00011654176,0.00017334422,0.00011938062,0.00016988227,0.00022783922,0.0010976751,0.00006277782,0.000055580298],"category_scores_gemma":[0.00021769627,0.000073905874,0.000054329623,0.0014948107,0.0002808604,0.002136818,0.0001932616,0.00013517875,0.00002147807],"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.00000361166,0.00006661713,0.0015355792,0.00009955722,0.0000051004054,2.3605553e-8,0.002172057,0.00067470357,0.03319372,0.953697,0.00044730044,0.008104715],"study_design_scores_gemma":[0.00020888934,0.0001163571,0.02248894,0.00014982754,0.000006548867,0.000020588952,0.0007238448,0.15714993,0.054096185,0.76416445,0.0006319441,0.00024246903],"about_ca_topic_score_codex":0.000011073672,"about_ca_topic_score_gemma":0.0000020697971,"teacher_disagreement_score":0.18953253,"about_ca_system_score_codex":0.000017815419,"about_ca_system_score_gemma":0.000027014914,"threshold_uncertainty_score":0.3013794},"labels":[],"label_agreement":null},{"id":"W2048831243","doi":"10.1016/j.dam.2012.03.009","title":"Minimizing the error of linear separators on linearly inseparable data","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":"Queen's University; Lakes Environmental (Canada)","funders":"","keywords":"Mathematics; Classifier (UML); Separable space; Separator (oil production); Algorithm; Mean squared prediction error; Mathematical optimization; Artificial intelligence; Computer science; Mathematical analysis","score_opus":0.07884777409949395,"score_gpt":0.3250418174041744,"score_spread":0.24619404330468048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048831243","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.08236689,0.00014341729,0.90569067,0.00031296024,0.0002763292,0.00036857385,0.000023620543,0.00007999737,0.010737551],"genre_scores_gemma":[0.7262156,0.000006113714,0.2732112,0.000207633,0.00017360634,0.000016843464,0.000042660595,0.000011276287,0.000115069655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886364,0.000021714644,0.00032064723,0.00020723174,0.00036126448,0.00022550224],"domain_scores_gemma":[0.9982885,0.00030983877,0.0001914053,0.0010969145,0.00004481469,0.00006850383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065864786,0.00013226333,0.00017282432,0.000066700835,0.00014663213,0.000052169704,0.001034222,0.000045819244,0.000009939656],"category_scores_gemma":[0.00006657561,0.0000903006,0.00003816955,0.00040576435,0.000040534625,0.00031052207,0.00037694786,0.000110503715,0.00008793276],"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.00001647641,0.00038782728,0.00004063318,0.00012779354,0.00007618066,6.832632e-7,0.0067639058,0.008277157,0.0049328296,0.96856534,0.0041057775,0.006705363],"study_design_scores_gemma":[0.000522843,0.00009834019,0.0003116765,0.000061297,0.0000609897,0.000012008889,0.0006205568,0.9316351,0.035188876,0.012137462,0.018914446,0.00043642445],"about_ca_topic_score_codex":0.000001963578,"about_ca_topic_score_gemma":7.028467e-7,"teacher_disagreement_score":0.95642793,"about_ca_system_score_codex":0.000011647114,"about_ca_system_score_gemma":0.000044553053,"threshold_uncertainty_score":0.36823517},"labels":[],"label_agreement":null},{"id":"W2048900321","doi":"10.1177/0731684404028699","title":"Re-Meshing Algorithms Applied to Mould Filling Simulations in Resin Transfer Moulding","year":2004,"lang":"en","type":"article","venue":"Journal of Reinforced Plastics and Composites","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isotropy; Materials science; Flow (mathematics); Finite element method; Perpendicular; Displacement (psychology); Position (finance); Mesh generation; Computer science; Boundary (topology); Mechanics; Algorithm; Mechanical engineering; Geometry; Mathematics; Structural engineering; Physics; Engineering","score_opus":0.015064586808011387,"score_gpt":0.244850750683688,"score_spread":0.2297861638756766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048900321","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.33531484,0.000053860374,0.66406155,0.00032410456,0.00010954602,0.00005782019,0.0000014728384,0.0000082430215,0.000068556474],"genre_scores_gemma":[0.86071014,0.000016526315,0.13897866,0.00018657507,0.000088210116,8.151006e-7,0.0000027274589,0.0000044831286,0.000011886206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990003,0.000013828685,0.0004365847,0.00012790317,0.00027052264,0.0001508265],"domain_scores_gemma":[0.999277,0.0003082722,0.00008549574,0.00008226196,0.00013123066,0.00011576736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022020584,0.00010524279,0.00017661181,0.00040836568,0.00012800813,0.00020290869,0.00020291859,0.000051015482,0.0000022445256],"category_scores_gemma":[0.000057381527,0.000098502984,0.000039364713,0.00046776986,0.000010681807,0.00033589875,0.000045455807,0.00019569354,0.0000013006454],"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.000023377204,0.0000097842485,0.000044239125,0.00000722898,0.000010020508,0.000009876575,0.0007296558,0.94813496,0.026725497,0.022347232,0.0000107036985,0.0019474291],"study_design_scores_gemma":[0.0012318694,0.00025199345,0.0009344453,0.00016519496,0.0000143423595,0.000031116284,0.00010468238,0.9407399,0.052957714,0.0031144666,0.00024365827,0.00021061339],"about_ca_topic_score_codex":0.000005496696,"about_ca_topic_score_gemma":0.0000118728585,"teacher_disagreement_score":0.5253953,"about_ca_system_score_codex":0.000051926607,"about_ca_system_score_gemma":0.00007081704,"threshold_uncertainty_score":0.4016835},"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":"W2049175577","doi":"10.1080/00207160701623046","title":"A note on the lower bound of edge guards of polyhedral terrains","year":2008,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"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; Upper and lower bounds; Constructive proof; Mathematics; Vertex (graph theory); Enhanced Data Rates for GSM Evolution; Terrain; Guard (computer science); Discrete mathematics; Graph; Computer science; Mathematical analysis","score_opus":0.029676967989346232,"score_gpt":0.28633524922315107,"score_spread":0.25665828123380485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049175577","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.30479512,0.000029860481,0.6920475,0.0013595754,0.0012745576,0.000054316093,0.0000039033657,0.000006575083,0.00042862503],"genre_scores_gemma":[0.85726297,0.000016304059,0.14188865,0.00032183496,0.00043995815,7.7919196e-7,0.0000010369118,0.000005900932,0.00006257141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980085,0.000054913562,0.0007538976,0.00010087305,0.0009801217,0.000101702906],"domain_scores_gemma":[0.9974733,0.000501436,0.00081923965,0.0002405691,0.0009197767,0.000045685112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046065025,0.00011648787,0.00024012626,0.00028525566,0.000050857794,0.000046627905,0.0012506077,0.000038989856,0.0000224991],"category_scores_gemma":[0.00009598132,0.0000801232,0.00021326012,0.00021509662,0.00009858347,0.00026873106,0.00016815343,0.00014732202,0.0000067849646],"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.0002457942,0.0054990146,0.00039243815,0.00011933398,0.0011627682,0.00037629984,0.023752542,0.048867524,0.014432752,0.804193,0.020745095,0.08021341],"study_design_scores_gemma":[0.0030669323,0.0030949824,0.014199559,0.0010517337,0.00006619673,0.0053594913,0.000109499095,0.79297566,0.049239766,0.12268768,0.007533592,0.00061489554],"about_ca_topic_score_codex":0.000001977246,"about_ca_topic_score_gemma":5.7908983e-7,"teacher_disagreement_score":0.74410814,"about_ca_system_score_codex":0.000043563647,"about_ca_system_score_gemma":0.00020532728,"threshold_uncertainty_score":0.32673293},"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":"W2049481412","doi":"10.1007/s00170-005-0027-8","title":"Triangular mesh generation employing a boundary expansion technique","year":2005,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","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":"University of Victoria","funders":"","keywords":"Triangulation; Point cloud; Triangle mesh; Boundary (topology); Reduction (mathematics); Surface (topology); Computer science; Algorithm; Process (computing); Cloud computing; Coordinate system; Data set; Data reduction; Set (abstract data type); Computer vision; Geometry; Computer graphics (images); Polygon mesh; Artificial intelligence; Mathematics; Data mining","score_opus":0.013712072326758565,"score_gpt":0.2702200049857776,"score_spread":0.256507932659019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049481412","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.351903,0.00037798012,0.63283306,0.013763043,0.0008429952,0.0001244482,7.555915e-7,0.00009298137,0.00006171457],"genre_scores_gemma":[0.79216826,0.00013923587,0.20649537,0.00046376904,0.0006262736,0.000015530857,0.000002775224,0.000008630717,0.00008017835],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985822,0.000046293208,0.0004921737,0.00019508104,0.0005183893,0.00016590471],"domain_scores_gemma":[0.9987832,0.00007991386,0.0004445989,0.00029708794,0.00035656866,0.000038644135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005787654,0.00013414629,0.00016004461,0.0006562908,0.00016492487,0.00013557523,0.0016118874,0.00009066237,0.000016291086],"category_scores_gemma":[0.00013018108,0.00010200836,0.00009872452,0.00021969358,0.000055431425,0.00086177886,0.0002835028,0.0003345836,0.000010467669],"study_design_candidate":"bench_or_experimental","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.00004392847,0.000065339125,0.000008561057,0.0000023231942,0.00007367076,0.00004099114,0.00016376843,0.045579087,0.3286235,0.015536641,0.00067699054,0.6091852],"study_design_scores_gemma":[0.00054442073,0.00011127098,0.00009806756,0.000032017113,0.000007841488,0.00089096645,0.000029690524,0.0057377275,0.9250073,0.025341433,0.04207913,0.000120128876],"about_ca_topic_score_codex":0.00000141547,"about_ca_topic_score_gemma":0.000005545932,"teacher_disagreement_score":0.60906506,"about_ca_system_score_codex":0.00019528829,"about_ca_system_score_gemma":0.00012315485,"threshold_uncertainty_score":0.415978},"labels":[],"label_agreement":null},{"id":"W2049589900","doi":"10.1016/j.ipl.2008.09.006","title":"The relative neighbourhood graph is a part of every 30°-triangulation","year":2008,"lang":"en","type":"article","venue":"Information Processing Letters","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 Saskatchewan","funders":"","keywords":"Neighbourhood (mathematics); Combinatorics; Pitteway triangulation; Mathematics; Delaunay triangulation; Triangulation; Euclidean geometry; Graph; Surface triangulation; Discrete mathematics; Constrained Delaunay triangulation; Geometry; Mathematical analysis","score_opus":0.014155256485922044,"score_gpt":0.21788020283242357,"score_spread":0.2037249463465015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049589900","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.04827308,0.00010198866,0.94516325,0.00487519,0.0002476014,0.00012679037,0.0000020528264,0.00006693307,0.001143089],"genre_scores_gemma":[0.984215,0.000019185114,0.012174373,0.0034323744,0.000066670575,0.000014522038,0.0000166886,0.0000030130725,0.000058173217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989324,0.000036634738,0.00040537887,0.00009558341,0.00039839325,0.00013160409],"domain_scores_gemma":[0.9990826,0.000102686696,0.00037603502,0.00016898157,0.0002380347,0.000031649015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027354434,0.00008563678,0.00007899203,0.00015719478,0.000520568,0.00013660328,0.0002544543,0.000035040077,0.000009182334],"category_scores_gemma":[0.00006858979,0.000067467656,0.00005348128,0.0006624445,0.00006633115,0.003953458,0.000041207248,0.00008391772,0.000033816494],"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.000050778333,0.000060593782,0.0010422481,0.00011152175,0.00008237889,0.000002404183,0.04619311,0.029393485,0.0012791076,0.042186722,0.030281119,0.84931654],"study_design_scores_gemma":[0.0027083245,0.00020087024,0.06336969,0.0002510588,0.00004274919,0.00013710848,0.0004486407,0.7736277,0.02194727,0.027506055,0.1087364,0.001024124],"about_ca_topic_score_codex":0.0000039189213,"about_ca_topic_score_gemma":1.6723018e-7,"teacher_disagreement_score":0.93594193,"about_ca_system_score_codex":0.000029781373,"about_ca_system_score_gemma":0.00010989955,"threshold_uncertainty_score":0.40038407},"labels":[],"label_agreement":null},{"id":"W2049648031","doi":"10.1111/j.1538-4632.2005.00637.x","title":"Variable Resolution Spatial Interpolation Using the Simple Recursive Point Voronoi Diagram","year":2005,"lang":"en","type":"article","venue":"Geographical Analysis","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Voronoi diagram; Generator (circuit theory); Interpolation (computer graphics); Simple (philosophy); Set (abstract data type); Algorithm; Point (geometry); Computer science; Centroidal Voronoi tessellation; Variable (mathematics); Diagram; Mathematics; Geometry; Artificial intelligence; Mathematical analysis; Power (physics); Image (mathematics)","score_opus":0.011078335244444482,"score_gpt":0.24884529075090617,"score_spread":0.23776695550646168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049648031","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.026504135,0.00013372644,0.97052085,0.002314991,0.0001090643,0.00011345178,0.0000065224535,0.00006715492,0.0002300955],"genre_scores_gemma":[0.8926848,0.000015251718,0.10646686,0.00042637927,0.00028187552,0.000010322901,0.000082032515,0.0000037694422,0.000028689674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847525,0.00019644183,0.0003208161,0.00039377596,0.0003644851,0.00024920105],"domain_scores_gemma":[0.99900454,0.00014540873,0.00014243962,0.00042012316,0.00020219803,0.00008527906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060419936,0.00012732417,0.00017249172,0.00050727173,0.00039877338,0.00020931805,0.00038981595,0.00007530617,0.00011411631],"category_scores_gemma":[0.00008660853,0.00009752589,0.0002664433,0.0040996014,0.000055563094,0.00045295327,0.00015842197,0.00015622756,0.000012224427],"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.000022923134,0.00015316099,0.0052250167,0.0000043094847,0.0005614926,0.0000016623258,0.0003446427,0.7704891,0.00055309845,0.13917498,0.00031701193,0.0831526],"study_design_scores_gemma":[0.00012118129,0.000032803833,0.0133361025,0.0000026417288,0.0002765061,0.0000038907115,0.000011947391,0.96861225,0.00009502661,0.014225038,0.0031557344,0.00012684517],"about_ca_topic_score_codex":0.0006984938,"about_ca_topic_score_gemma":0.0005388728,"teacher_disagreement_score":0.86618066,"about_ca_system_score_codex":0.00004807911,"about_ca_system_score_gemma":0.000038734095,"threshold_uncertainty_score":0.39769903},"labels":[],"label_agreement":null},{"id":"W2049678150","doi":"10.1007/s10878-008-9149-x","title":"A quadratic lower bound for colourful simplicial depth","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","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 New Brunswick; Simon Fraser University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Convex hull; Mathematics; Theory of computation; Regular polygon; Quadratic equation; Point (geometry); Set (abstract data type); Graph; Computer science; Geometry; Algorithm","score_opus":0.018591734842085907,"score_gpt":0.26025837418015757,"score_spread":0.24166663933807167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049678150","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.027943656,0.00006559028,0.9644783,0.00049215264,0.0065855,0.000201857,9.39795e-7,0.000022475295,0.00020953944],"genre_scores_gemma":[0.746017,0.000027388374,0.25250128,0.00017533849,0.0011915577,0.000006353187,0.0000065700574,0.000010025392,0.00006452875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987454,0.00006963381,0.00050236983,0.00013430609,0.000398492,0.00014983889],"domain_scores_gemma":[0.99816096,0.00021279287,0.00046824187,0.00012936763,0.0009340295,0.0000946205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003993564,0.000107726926,0.0002147991,0.00020110152,0.00024844415,0.000114651484,0.0003275133,0.00007643115,0.000009272611],"category_scores_gemma":[0.00030070718,0.00010254493,0.00013097626,0.00044829742,0.00002499673,0.0008187303,0.000035019748,0.00009859021,0.0000026611224],"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.00019565901,0.00030947648,0.00007421105,0.000010014287,0.000040879193,0.000017329387,0.00037860157,0.9217218,0.00028562313,0.070492126,0.0049418686,0.001532384],"study_design_scores_gemma":[0.0043391646,0.0019497273,0.00049573934,0.000026170355,0.000039677336,0.00030498957,0.000012130355,0.94360167,0.0016785865,0.038803104,0.008464387,0.00028464993],"about_ca_topic_score_codex":0.0000014658536,"about_ca_topic_score_gemma":4.2309176e-7,"teacher_disagreement_score":0.7180733,"about_ca_system_score_codex":0.00010443679,"about_ca_system_score_gemma":0.00041773953,"threshold_uncertainty_score":0.4181661},"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":"W2050275819","doi":"10.1145/1187436.1210589","title":"Heuristics for estimating contact area of supports in layered manufacturing","year":2007,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Suite; Computer science; Representation (politics); Heuristic; Regular polygon; Range (aeronautics); Mathematical optimization; Key (lock); Convex hull; Algorithm; Mathematics; Artificial intelligence; Engineering; Geometry","score_opus":0.0256782719106334,"score_gpt":0.30864878649994687,"score_spread":0.2829705145893135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050275819","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.31663403,0.00021245124,0.6824175,0.000047566977,0.00056782016,0.00007676713,0.0000019744568,0.0000046680498,0.000037231428],"genre_scores_gemma":[0.5364741,0.0000024108579,0.46338612,0.000029594305,0.00009679605,7.4764796e-7,0.0000023459895,0.0000034921254,0.0000043673663],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988172,0.00001658654,0.0006209272,0.0001161243,0.00025705414,0.00017212321],"domain_scores_gemma":[0.9989228,0.00030936772,0.00040850323,0.00015167479,0.00013457125,0.00007303482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066852977,0.000097310854,0.0002007629,0.00022019372,0.00004423528,0.000032245793,0.00040703858,0.00003933438,0.0000042825413],"category_scores_gemma":[0.00013498236,0.00009438291,0.00008334723,0.00012999687,0.000013579099,0.0003271112,0.00008430778,0.000098291246,3.118522e-7],"study_design_candidate":"bench_or_experimental","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.0006722677,0.002404531,0.004272759,0.00015391171,0.000276908,0.0008242432,0.011041326,0.08614432,0.43372455,0.012498513,0.0014736252,0.44651303],"study_design_scores_gemma":[0.001215715,0.0005405558,0.002771098,0.000067020206,0.0000057735315,0.00026812876,0.00034579655,0.1847608,0.80722564,0.0025269713,0.00012858829,0.00014388363],"about_ca_topic_score_codex":0.0000063613447,"about_ca_topic_score_gemma":0.0000016422072,"teacher_disagreement_score":0.44636914,"about_ca_system_score_codex":0.00008837229,"about_ca_system_score_gemma":0.000069153066,"threshold_uncertainty_score":0.38488233},"labels":[],"label_agreement":null},{"id":"W2050666081","doi":"10.1145/369836.571192","title":"Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf","year":2000,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":71,"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":"Computer science; Intuition; Algorithm; Presentation (obstetrics); Context (archaeology); Computational geometry; Artificial intelligence; Cognitive science","score_opus":0.009808366371430902,"score_gpt":0.25924742868575046,"score_spread":0.24943906231431956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050666081","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.03587414,0.095125034,0.85701066,0.0069073928,0.00016282189,0.0015963075,0.00021546149,0.00018519688,0.0029229785],"genre_scores_gemma":[0.10464491,0.13102342,0.741229,0.0175783,0.00070282596,0.00038110669,0.0010904669,0.00008031897,0.003269634],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838805,0.00012503054,0.0004310691,0.00047384299,0.0003318622,0.0002501615],"domain_scores_gemma":[0.9985727,0.00047896805,0.00016114594,0.00047508735,0.00012517963,0.00018690022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046373054,0.00019798796,0.00028775365,0.00013516942,0.00017709285,0.00010407019,0.0004809977,0.00007451091,0.00028842],"category_scores_gemma":[0.00011463365,0.0002043865,0.000058629732,0.00071814866,0.00008017516,0.0004999367,0.0002100549,0.00013566118,0.000019909397],"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.0000127718595,0.000117399184,0.000745006,0.0005482108,0.000052244926,0.0000024815665,0.00007017872,0.00056080736,0.0003710411,0.00343665,0.07386138,0.9202218],"study_design_scores_gemma":[0.0013416306,0.00020641224,0.01581488,0.00082910206,0.000086711756,0.0002032442,0.000019322526,0.028221987,0.0006671468,0.041144475,0.91068274,0.0007823217],"about_ca_topic_score_codex":0.000055995326,"about_ca_topic_score_gemma":0.0000031725285,"teacher_disagreement_score":0.9194395,"about_ca_system_score_codex":0.000039669954,"about_ca_system_score_gemma":0.00013583506,"threshold_uncertainty_score":0.8334639},"labels":[],"label_agreement":null},{"id":"W2050847338","doi":"10.1145/1810959.1811026","title":"I/O-efficient computation of water flow across a terrain","year":2010,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Terrain; sort; Sorting; Vertex (graph theory); Computation; Computer science; Flow (mathematics); Sorting algorithm; Geology; Algorithm; Graph; Mathematics; Theoretical computer science; Geography; Geometry; Cartography","score_opus":0.010600857173719504,"score_gpt":0.2683145120005902,"score_spread":0.2577136548268707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050847338","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.44684273,0.00000234509,0.5519186,0.0003044421,0.00035800022,0.00004954794,9.025951e-7,0.000039126186,0.00048427252],"genre_scores_gemma":[0.8617908,1.00669496e-7,0.13787495,0.00011528146,0.00005239286,0.0000036572494,0.000008423512,0.0000024756011,0.0001519309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992399,0.000021135342,0.00018492623,0.00018918666,0.00020901018,0.00015584486],"domain_scores_gemma":[0.9995797,0.000030708572,0.000035316654,0.0001714242,0.00013773053,0.000045117544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033124682,0.00006701158,0.000078340476,0.00006443945,0.00008311405,0.000060148726,0.00022354537,0.000037154066,0.00003528454],"category_scores_gemma":[0.000016767555,0.00004807833,0.000042026,0.00019553109,0.000028806884,0.00009193408,0.00012104908,0.00007556253,0.000051809366],"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.0000063923158,0.00018777624,0.000111058995,0.000016130201,0.000012058913,0.0000024565759,0.00477784,0.52802277,0.25914437,0.026038276,0.00038524088,0.18129562],"study_design_scores_gemma":[0.00018016904,0.000029474599,0.0016468602,0.0000020636537,8.8860924e-7,0.000009565966,0.000016740012,0.93487686,0.061052825,0.0015912428,0.0005212667,0.00007204175],"about_ca_topic_score_codex":0.000014441619,"about_ca_topic_score_gemma":0.000022939792,"teacher_disagreement_score":0.41494805,"about_ca_system_score_codex":0.0000059987165,"about_ca_system_score_gemma":0.000022537326,"threshold_uncertainty_score":0.19605774},"labels":[],"label_agreement":null},{"id":"W2051155452","doi":"10.1016/j.cam.2006.11.018","title":"The family of biarcs that matches planar, two-point <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si99.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi>G</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math> Hermite data","year":2007,"lang":"lv","type":"article","venue":"Journal of Computational and Applied Mathematics","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":"University of Manitoba","funders":"","keywords":"Mathematics; Planar; Hermite polynomials; Point (geometry); Combinatorics; Algorithm; Geometry; Mathematical analysis; Computer graphics (images); Computer science","score_opus":0.03006313492031257,"score_gpt":0.2566309851773821,"score_spread":0.22656785025706952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051155452","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.7215522,0.0016643798,0.1132501,0.0012776772,0.0020020064,0.00006526724,0.00024809418,0.00008594899,0.15985435],"genre_scores_gemma":[0.94598776,0.00062371814,0.0502459,0.00094339496,0.0013908098,0.000070812675,0.00043485095,0.00016802434,0.00013470587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937903,0.0001523471,0.0018155067,0.00078847085,0.0024742018,0.0009791189],"domain_scores_gemma":[0.99278384,0.0028731166,0.0024642332,0.0010757003,0.00026401665,0.0005391185],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027730744,0.0004919881,0.00030690708,0.00037702778,0.0010602049,0.0011615512,0.0016757465,0.00063494843,0.011857638],"category_scores_gemma":[0.00048826382,0.00071051664,0.0006612647,0.0007922316,0.0007489215,0.0011004792,0.0012527421,0.00089793216,0.00027053864],"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.00054993184,0.00032374696,0.0000035413684,0.0007556243,0.0008682429,0.00036792757,0.0022055176,0.029667633,0.0010262341,0.8822853,0.075664915,0.006281362],"study_design_scores_gemma":[0.0017480754,0.0008153991,0.00022344477,0.0007903249,0.0006465478,0.0026405472,0.0022275764,0.6753159,0.3086857,0.003552493,0.0025595743,0.0007944238],"about_ca_topic_score_codex":0.00009000406,"about_ca_topic_score_gemma":0.000098812554,"teacher_disagreement_score":0.8787328,"about_ca_system_score_codex":0.00001278732,"about_ca_system_score_gemma":0.0011988395,"threshold_uncertainty_score":0.99987537},"labels":[],"label_agreement":null},{"id":"W2051202422","doi":"10.1016/j.disc.2007.12.061","title":"Volume requirements of 3D upward drawings","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","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":"University of Lethbridge","funders":"","keywords":"Directed acyclic graph; Mathematics; Combinatorics; Directed graph; Volume (thermodynamics); Upper and lower bounds; Discrete mathematics; Grid; Line (geometry); Geometry; Mathematical analysis","score_opus":0.03419053521280606,"score_gpt":0.26760955334706366,"score_spread":0.23341901813425758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051202422","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.14582753,0.00003901422,0.84965265,0.00014733468,0.00013603912,0.00009381855,0.000002340272,0.00005353977,0.0040477505],"genre_scores_gemma":[0.69121504,0.000008981882,0.30754834,0.00006187941,0.000036241574,0.00000503066,0.0000066417197,0.000005798484,0.0011120426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990503,0.000017972921,0.00029165202,0.0001563192,0.00035256887,0.00013116376],"domain_scores_gemma":[0.9993492,0.000042760254,0.0001426652,0.00031273635,0.000106763335,0.00004590366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017380885,0.00008861421,0.00014663087,0.0000842568,0.00009725144,0.000025654397,0.0003521312,0.000029757906,0.000028091],"category_scores_gemma":[0.00006368506,0.00008132303,0.000053521242,0.00030593446,0.00004324419,0.00028966827,0.00012622123,0.000043250926,0.00006252021],"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.000019731602,0.0011019271,0.0042788954,0.00085756177,0.0002702977,0.000086882785,0.041505557,0.013141718,0.022157652,0.8610397,0.01925867,0.036281418],"study_design_scores_gemma":[0.0007720699,0.00024002545,0.004152565,0.00012330292,0.000028324546,0.0001255832,0.00011760109,0.90140325,0.01926118,0.067905195,0.0053449706,0.0005259224],"about_ca_topic_score_codex":0.0000023186333,"about_ca_topic_score_gemma":2.9006358e-7,"teacher_disagreement_score":0.88826156,"about_ca_system_score_codex":0.000016098129,"about_ca_system_score_gemma":0.00004780692,"threshold_uncertainty_score":0.33162567},"labels":[],"label_agreement":null},{"id":"W2051340507","doi":"10.1145/1247069.1247129","title":"On approximate range counting and depth","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"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":"Las vegas; Range (aeronautics); Monte Carlo method; Tree (set theory); Value (mathematics); Expected value; Mathematics; Linear programming; Computer science; Algorithm; Combinatorics; Discrete mathematics; Statistics","score_opus":0.0162481277507072,"score_gpt":0.25313915749185567,"score_spread":0.23689102974114848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051340507","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.09628546,0.000030376112,0.8790748,0.00020866896,0.00010316595,0.00004101062,7.979814e-8,0.00006159125,0.024194807],"genre_scores_gemma":[0.93416804,0.0000019807578,0.064429775,0.00095375767,0.00004605599,9.013104e-7,9.50853e-7,0.0000016353182,0.00039691362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995748,0.0000067428577,0.00007216831,0.00013251526,0.000118166005,0.000095609816],"domain_scores_gemma":[0.9997413,0.00009916823,0.000018767743,0.00007917136,0.000028364178,0.00003322593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003675835,0.000040223367,0.000035579713,0.00006437536,0.00006838766,0.000067577785,0.00007917826,0.000015081249,0.0000061961887],"category_scores_gemma":[0.000018992405,0.000034403736,0.000009129051,0.00016318791,0.0000069449366,0.00015170277,0.00003714437,0.000029522533,0.000015576325],"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.000005970809,0.00002675953,0.0007580522,0.0000064262804,0.0000036226304,0.0000056344516,0.00016204493,0.0004992986,0.00061756006,0.79088074,0.0009245022,0.20610942],"study_design_scores_gemma":[0.0011413625,0.0002114981,0.0834528,0.00002168303,0.0000049040777,0.000066499306,0.000045695815,0.82519,0.01622261,0.06088166,0.012317701,0.00044360096],"about_ca_topic_score_codex":0.0000034330037,"about_ca_topic_score_gemma":0.000011443615,"teacher_disagreement_score":0.8378826,"about_ca_system_score_codex":0.0000073559504,"about_ca_system_score_gemma":0.0000074729205,"threshold_uncertainty_score":0.14029436},"labels":[],"label_agreement":null},{"id":"W2051690202","doi":"10.5555/982792.982853","title":"An optimal randomized algorithm for maximum Tukey depth","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":117,"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":"Mathematics; Randomized algorithm; Dimension (graph theory); Algorithm; Point (geometry); Linear programming; Set (abstract data type); Combinatorics; Computer science; Geometry","score_opus":0.011770735213949658,"score_gpt":0.27371233373679094,"score_spread":0.26194159852284127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051690202","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.0010882498,0.00013159547,0.99266446,0.002429705,0.0011536937,0.0010648124,0.00003810847,0.0003008523,0.0011285328],"genre_scores_gemma":[0.07526518,0.000047481164,0.922106,0.0008488852,0.00077193195,0.00038432088,0.00022510585,0.000038441212,0.00031260602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975237,0.00018267162,0.00046434876,0.0008142947,0.000521707,0.00049324636],"domain_scores_gemma":[0.9984729,0.00026325454,0.00016138556,0.0006256927,0.00021171708,0.0002650411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001016713,0.00032890553,0.00046279788,0.00025696013,0.00032242507,0.00037842034,0.00073395815,0.000120394274,0.000011234356],"category_scores_gemma":[0.000047148886,0.0002864459,0.00030583362,0.00045537733,0.00009251535,0.0008593638,0.00009456021,0.00015095586,0.00005675669],"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.002537957,0.00055350247,0.0000016494516,0.00002593074,0.00018745185,0.00003609341,0.0011699528,0.33874014,0.0026523282,0.11334435,0.00037077395,0.5403799],"study_design_scores_gemma":[0.04569648,0.0006866664,0.000023673396,0.000023767712,0.000034620978,0.000033308912,0.000024447923,0.90600157,0.0151834395,0.030377967,0.0014397361,0.000474337],"about_ca_topic_score_codex":0.000026169384,"about_ca_topic_score_gemma":0.0000033758754,"teacher_disagreement_score":0.5672614,"about_ca_system_score_codex":0.000110698296,"about_ca_system_score_gemma":0.00018681322,"threshold_uncertainty_score":0.99995875},"labels":[],"label_agreement":null},{"id":"W2051728965","doi":"10.1007/s00454-013-9521-1","title":"Computing Cartograms with Optimal Complexity","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":56,"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; Technische Universität Berlin; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Mathematics; Hamiltonian path; Planar graph; Planar; Combinatorics; Polygon (computer graphics); Time complexity; Polygonal chain; Discrete mathematics; Graph; Regular polygon; Geometry; Computer science","score_opus":0.017222318304278988,"score_gpt":0.24917491993821247,"score_spread":0.2319526016339335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051728965","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.263259,0.00008815843,0.7333792,0.00094650406,0.00021793736,0.0003370144,0.0000082198285,0.00028533567,0.0014786832],"genre_scores_gemma":[0.67909056,0.0000011534901,0.31982094,0.0005841574,0.0001448938,0.000022611535,0.00019051386,0.000016241958,0.00012895408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971964,0.00011550939,0.00047588252,0.0007425467,0.0009315667,0.0005381411],"domain_scores_gemma":[0.9981358,0.00033484653,0.00021625488,0.00041810266,0.00061699125,0.0002780021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002824545,0.000338673,0.00031630817,0.00043536344,0.00047881113,0.0006761295,0.00078318396,0.00008055003,0.00019318673],"category_scores_gemma":[0.00003949202,0.00029961922,0.00012841607,0.0018679954,0.00018008659,0.0011790383,0.00033602843,0.00026464582,0.00041024564],"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.000014112449,0.00014754588,0.0031696253,0.000029323144,0.000105060935,0.000016076718,0.00042480233,0.80591416,0.00010109997,0.144055,0.0017736757,0.04424954],"study_design_scores_gemma":[0.000719701,0.00022027892,0.101594664,0.000030022635,0.000011727408,0.00011463339,0.00009218723,0.87887484,0.0001259858,0.01650029,0.0012103992,0.00050526316],"about_ca_topic_score_codex":0.00011342666,"about_ca_topic_score_gemma":0.000005474636,"teacher_disagreement_score":0.41583157,"about_ca_system_score_codex":0.00007806247,"about_ca_system_score_gemma":0.00016983337,"threshold_uncertainty_score":0.9999456},"labels":[],"label_agreement":null},{"id":"W2051773453","doi":"10.1007/s00366-006-0044-8","title":"Structured mesh generation by kriging with local refinement with a new elliptic scheme","year":2006,"lang":"en","type":"article","venue":"Engineering With Computers","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quadrilateral; Scheme (mathematics); Mesh generation; Octree; Interpolation (computer graphics); Computer science; Finite element method; Algorithm; Mathematics; Applied mathematics; Mathematical analysis; Structural engineering; Artificial intelligence; Engineering","score_opus":0.003847016067766652,"score_gpt":0.16520900925788587,"score_spread":0.1613619931901192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051773453","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.074857935,0.00011940185,0.92399484,0.0003279031,0.00021825852,0.00017837512,0.0000011081038,0.00025934653,0.000042847903],"genre_scores_gemma":[0.54669994,0.0000010518002,0.45277134,0.000090848815,0.00022125109,0.000009933854,0.00005014963,0.000017152639,0.00013833425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859756,0.000012603786,0.00019271793,0.00045229995,0.00044511887,0.00029968252],"domain_scores_gemma":[0.9993729,0.000036766443,0.000099358265,0.0002897282,0.00008301471,0.00011823524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076674085,0.00025929208,0.00017285929,0.00016070716,0.000104802515,0.00023515076,0.00026661748,0.000038416998,0.000005228507],"category_scores_gemma":[0.0000023834284,0.00019878501,0.000022722848,0.0006327777,0.00002150104,0.0003623284,0.00004309793,0.00013220045,0.000003915149],"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.000014983618,0.000021913705,0.00012739653,0.000013670526,0.000040425042,0.000013981506,0.00007158655,0.9778418,0.003486893,0.008200235,0.0038806624,0.0062864455],"study_design_scores_gemma":[0.0009847338,0.000322501,0.0007881681,0.00006817408,0.000012336193,0.00008628267,0.0000042484285,0.9845825,0.007489312,0.000023687388,0.005274731,0.0003633182],"about_ca_topic_score_codex":0.000067497065,"about_ca_topic_score_gemma":0.000033178127,"teacher_disagreement_score":0.471842,"about_ca_system_score_codex":0.00008705179,"about_ca_system_score_gemma":0.00012344836,"threshold_uncertainty_score":0.81062174},"labels":[],"label_agreement":null},{"id":"W2052373622","doi":"10.1145/1328911.1328921","title":"Approximate distance oracles for geometric spanners","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":41,"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":"Mathematics; Combinatorics; Shortest path problem; Constant (computer programming); Data structure; Euclidean space; Binary logarithm; Distance; Oracle; Path (computing); Discrete mathematics; Dilation (metric space); Computational geometry; Graph; Algorithm; Computer science","score_opus":0.039160389139892775,"score_gpt":0.2687088556867836,"score_spread":0.22954846654689082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052373622","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.0020447436,0.00012852054,0.9953543,0.0011993365,0.0006345415,0.00027476653,0.000030963467,0.0002107956,0.000122055775],"genre_scores_gemma":[0.41817847,0.00009640836,0.58005345,0.0002693835,0.000096176,0.00013054903,0.00001581537,0.000013376406,0.0011463801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882674,0.000025767198,0.00021006423,0.00039968485,0.00028633463,0.00025141143],"domain_scores_gemma":[0.9989339,0.00026119943,0.00006143514,0.0005088433,0.0001382076,0.000096405034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001538712,0.00014520099,0.00013966733,0.00038874085,0.00051049795,0.00006453748,0.00051540474,0.000055441335,0.000016432885],"category_scores_gemma":[0.000048658923,0.00014375347,0.000116856594,0.0014162218,0.000043798653,0.00044230602,0.000009065736,0.00010950461,0.000040292598],"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.000029157787,0.0003553371,0.00001335398,0.000022633276,0.00005126468,0.000010902245,0.00031663704,0.06628166,0.00019063472,0.0070347115,0.00075984246,0.92493385],"study_design_scores_gemma":[0.0022090096,0.0006643855,0.0026916503,0.000029113124,0.000036142053,0.00019709459,0.00006931475,0.9015295,0.024798602,0.023794366,0.04308888,0.00089193764],"about_ca_topic_score_codex":0.000008691519,"about_ca_topic_score_gemma":0.000004076101,"teacher_disagreement_score":0.9240419,"about_ca_system_score_codex":0.00005590355,"about_ca_system_score_gemma":0.00006938434,"threshold_uncertainty_score":0.58620965},"labels":[],"label_agreement":null},{"id":"W2052512910","doi":"10.1115/1.4026183","title":"Computation of the Shortest Path in a Bounded Domain With Free Form Boundary by Domain Partitioning","year":2013,"lang":"en","type":"article","venue":"Journal of Computing and Information Science in Engineering","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 Alberta","funders":"","keywords":"Shortest path problem; Euclidean shortest path; Polygon (computer graphics); Boundary (topology); Domain (mathematical analysis); Bounded function; Mathematics; Yen's algorithm; Computation; Algorithm; K shortest path routing; Topology (electrical circuits); Computer science; Discrete mathematics; Mathematical analysis; Dijkstra's algorithm; Combinatorics; Graph","score_opus":0.0036505557593384708,"score_gpt":0.20157215809775517,"score_spread":0.19792160233841669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052512910","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.5393286,0.000022600329,0.46018928,0.00022307764,0.000110131536,0.000064216234,2.1171155e-7,0.0000052123014,0.000056721787],"genre_scores_gemma":[0.9440884,0.000004297826,0.05582,0.0000665814,0.000016492157,0.0000014882249,6.2539726e-7,0.0000016622109,4.824179e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866503,0.00002199596,0.00058159686,0.00007617427,0.00049114483,0.00016404617],"domain_scores_gemma":[0.9991383,0.000092111266,0.00035205198,0.00010477013,0.00026163974,0.00005112429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001331496,0.0000782563,0.00012973713,0.00046591306,0.00012375005,0.00032695243,0.00038942954,0.000023389961,5.8581804e-7],"category_scores_gemma":[0.00011886496,0.00005732941,0.000022039614,0.0014127132,0.000076873155,0.0053273574,0.00010628268,0.00016127757,3.5817658e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005478234,0.00003434694,0.007567433,0.000039155373,0.0000043659206,0.0000010092834,0.007066881,0.9579927,0.0024802615,0.009565572,0.00008929286,0.015153559],"study_design_scores_gemma":[0.0005631385,0.00008594604,0.101400375,0.00025921318,9.949961e-7,0.00007824519,0.00032930067,0.89318395,0.0005439704,0.003331733,0.00013408877,0.00008907525],"about_ca_topic_score_codex":0.000015576987,"about_ca_topic_score_gemma":0.000002978884,"teacher_disagreement_score":0.40475982,"about_ca_system_score_codex":0.000088453955,"about_ca_system_score_gemma":0.00018053754,"threshold_uncertainty_score":0.38622054},"labels":[],"label_agreement":null},{"id":"W2053245348","doi":"10.1007/s00138-006-0036-0","title":"Three-dimensional view-invariant face recognition using a hierarchical pose-normalization strategy","year":2006,"lang":"en","type":"article","venue":"Machine Vision and Applications","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":"McGill University","funders":"National Research Council Canada","keywords":"Artificial intelligence; Iterative closest point; Computer science; Normalization (sociology); Pattern recognition (psychology); Pose; Support vector machine; Facial recognition system; Invariant (physics); Computer vision; Point cloud; Mathematics","score_opus":0.02112778672951137,"score_gpt":0.27885009450118126,"score_spread":0.2577223077716699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053245348","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.026888087,0.00032354114,0.97102064,0.00080599106,0.000057295434,0.00034498394,0.000023109802,0.00011303897,0.00042330974],"genre_scores_gemma":[0.89260054,0.000017430957,0.10605486,0.0003590335,0.00028916798,0.00006760381,0.00052752043,0.000012126505,0.00007175186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988947,0.00005004718,0.00028390455,0.00038024446,0.00023976211,0.00015137464],"domain_scores_gemma":[0.99942946,0.0000716074,0.000095652525,0.00020935627,0.0001135697,0.000080324025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021293192,0.0001359049,0.00011298102,0.00016469737,0.00041270352,0.00019981728,0.00015446369,0.00006059134,0.000032799875],"category_scores_gemma":[0.000007739423,0.00012295948,0.000038925496,0.0006035859,0.000035493355,0.00036714738,0.00010570757,0.00011754262,0.000031318315],"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.000017454273,0.00046509507,0.0003176481,0.000030055997,0.000014908602,0.000003655848,0.00003702413,0.07717364,0.016846955,0.28197262,0.0011857613,0.6219352],"study_design_scores_gemma":[0.0002920738,0.000049022998,0.0058693457,0.000012288005,0.000009006351,0.000048835896,0.0000017438915,0.9316246,0.0004472957,0.05644461,0.005038564,0.00016260697],"about_ca_topic_score_codex":0.00017084293,"about_ca_topic_score_gemma":0.000076869015,"teacher_disagreement_score":0.8657124,"about_ca_system_score_codex":0.000023622191,"about_ca_system_score_gemma":0.000060486283,"threshold_uncertainty_score":0.5014142},"labels":[],"label_agreement":null},{"id":"W2053535344","doi":"10.1016/j.dam.2007.05.009","title":"Approximating the fixed linear crossing number","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":"ASTER","funders":"","keywords":"Mathematics; Combinatorics; Randomized algorithm; Approximation algorithm; Time complexity; Crossing number (knot theory); Discrete mathematics; Conjecture; Random graph; Graph","score_opus":0.019367477242300483,"score_gpt":0.28515869318712406,"score_spread":0.2657912159448236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053535344","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.030542107,0.000014040227,0.94238466,0.00016816625,0.000120948294,0.00021462045,8.587682e-7,0.0001341977,0.026420387],"genre_scores_gemma":[0.4075953,4.7287455e-7,0.5917949,0.0003044355,0.00014269869,0.000011673693,0.0000051350194,0.0000097008315,0.00013564703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987631,0.000010082505,0.0003853376,0.00021879701,0.00035467447,0.00026804573],"domain_scores_gemma":[0.99893224,0.0003532722,0.0001757869,0.0004202022,0.000059848782,0.000058666337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010714646,0.0001344156,0.00013420991,0.00004021009,0.0005078102,0.000344554,0.00049265806,0.00004882044,0.000016717564],"category_scores_gemma":[0.00006388787,0.000094255825,0.00005600128,0.00046137103,0.00006827365,0.00015761636,0.00018564014,0.00013744221,0.0001330246],"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.0000033549127,0.00005366156,0.00001884453,0.000055386765,0.000018659188,0.0000028398792,0.0051209885,0.0018363086,0.0052461014,0.96052575,0.0002553695,0.026862744],"study_design_scores_gemma":[0.00050876505,0.000018804585,0.00036262345,0.000045261975,0.00002417976,0.000064676555,0.0009896732,0.78857225,0.033294372,0.16800715,0.007621425,0.0004908158],"about_ca_topic_score_codex":0.0000014763955,"about_ca_topic_score_gemma":0.0000017061133,"teacher_disagreement_score":0.7925186,"about_ca_system_score_codex":0.000023463266,"about_ca_system_score_gemma":0.000041885534,"threshold_uncertainty_score":0.39057168},"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":"W2054150222","doi":"10.1007/s00453-003-1062-1","title":"Small Strictly Convex Quadrilateral Meshes of Point Sets","year":2003,"lang":"en","type":"article","venue":"Algorithmica","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":"University of New Brunswick","funders":"","keywords":"Quadrilateral; Combinatorics; Mathematics; Regular polygon; Polygon mesh; Convex set; Point (geometry); Theory of computation; Convex optimization; Geometry; Algorithm; Finite element method; Physics","score_opus":0.022503004539002266,"score_gpt":0.2326208544231259,"score_spread":0.21011784988412363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054150222","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.09117449,0.00017505982,0.9038474,0.00040076533,0.00056399615,0.00013085417,0.0000050817684,0.000071524075,0.003630815],"genre_scores_gemma":[0.8060963,0.0000066581465,0.19333772,0.0002672094,0.0000391343,0.000005407394,0.0000079267365,0.0000050771832,0.00023456532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908876,0.0000792474,0.00023646174,0.00023853898,0.00018826518,0.00016873087],"domain_scores_gemma":[0.9993694,0.0000959583,0.000087299624,0.00025062214,0.00012820667,0.00006854919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022418707,0.00009947445,0.00014115256,0.00011282577,0.00005780158,0.00004615011,0.0002735682,0.0000440717,0.00003903743],"category_scores_gemma":[0.00004843922,0.000095199364,0.000060015704,0.00039770117,0.000024155688,0.00019748905,0.000053919073,0.00006684143,0.000031827345],"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.000014989289,0.0004291857,0.0007657524,0.000056466502,0.0001460023,0.000045623492,0.0017581396,0.0051543377,0.01128228,0.7057048,0.004192429,0.27044997],"study_design_scores_gemma":[0.0023944352,0.00073988346,0.014253757,0.00005450829,0.00004308412,0.00024695788,0.000111361325,0.45314533,0.35678077,0.12698957,0.04414775,0.0010926021],"about_ca_topic_score_codex":0.000014833189,"about_ca_topic_score_gemma":0.0000020748714,"teacher_disagreement_score":0.71492183,"about_ca_system_score_codex":0.000018949684,"about_ca_system_score_gemma":0.00009211955,"threshold_uncertainty_score":0.38821176},"labels":[],"label_agreement":null},{"id":"W2054663930","doi":"10.1007/s00605-004-0296-6","title":"Finding the Best Face on a Voronoi Polyhedron – The Strong Dodecahedral Conjecture Revisited","year":2005,"lang":"en","type":"article","venue":"Monatshefte für Mathematik","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 Calgary","funders":"","keywords":"Dodecahedron; Unit sphere; Voronoi diagram; Combinatorics; Mathematics; Conjecture; Unit (ring theory); Surface (topology); Euclidean space; Euclidean geometry; Ball (mathematics); Polyhedron; Geometry","score_opus":0.024976173864611588,"score_gpt":0.29324760651116627,"score_spread":0.2682714326465547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054663930","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.09368161,0.00090220437,0.8686425,0.027884798,0.00036430603,0.00075707154,0.000012161197,0.00020976554,0.0075455923],"genre_scores_gemma":[0.98370564,0.000015480215,0.011405324,0.0013921063,0.0003343519,0.00004363243,0.000011577195,0.00001623879,0.003075658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998261,0.0001418538,0.00032828844,0.00039734613,0.0005419729,0.00032955516],"domain_scores_gemma":[0.9984918,0.0004573711,0.00018854305,0.0007337487,0.00006269482,0.00006582984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062335574,0.00023659924,0.00018638007,0.00010372927,0.0005697324,0.0003674073,0.0010798606,0.000073839175,0.00006722667],"category_scores_gemma":[0.000089093184,0.00013434926,0.00012409284,0.00050426566,0.00005511377,0.00037202836,0.00021488087,0.00030544293,0.00034567618],"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.00001290151,0.00014352152,0.00002386717,0.00002532912,0.000051296083,0.000005688279,0.0037100501,0.057888072,0.0006338617,0.82763094,0.0061134263,0.10376108],"study_design_scores_gemma":[0.00093060895,0.00030846032,0.0018262763,0.00018834791,0.00005483604,0.00016143311,0.00064329855,0.8742879,0.0069848318,0.03693065,0.07693979,0.00074353436],"about_ca_topic_score_codex":0.0000074466866,"about_ca_topic_score_gemma":0.000010405967,"teacher_disagreement_score":0.890024,"about_ca_system_score_codex":0.00008991401,"about_ca_system_score_gemma":0.000053943862,"threshold_uncertainty_score":0.5478604},"labels":[],"label_agreement":null},{"id":"W2055042442","doi":"10.1137/s0097539705447116","title":"Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polyhedron; Combinatorics; Tangent; Polytope; Regular polygon; Convex polytope; Mathematics; Line (geometry); Convex set; Connected component; Tangent space; Line segment; Convex hull; Integer points in convex polyhedra; Geometry; Algorithm; Linear programming; Convex optimization","score_opus":0.020322799490895906,"score_gpt":0.27727585342248656,"score_spread":0.2569530539315907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055042442","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.406796,0.00033653,0.5893268,0.0020739075,0.0010791244,0.00009359287,0.0000012487504,0.000048343278,0.00024445803],"genre_scores_gemma":[0.8043618,0.0000050221684,0.18994926,0.0041160337,0.0014630614,4.9795364e-7,0.0000031911625,0.000011443087,0.00008965184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982019,0.000050691404,0.00046355085,0.00033559828,0.00058775727,0.00036046997],"domain_scores_gemma":[0.9987259,0.00030531792,0.00018265542,0.00022882674,0.00020289292,0.00035439845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011691712,0.00018185584,0.00019011526,0.00034935924,0.00042657834,0.00023767397,0.0004465527,0.00005619168,0.000015744603],"category_scores_gemma":[0.000108773966,0.00016353218,0.00006795661,0.00047725078,0.00002238099,0.00024140115,0.00036476806,0.0003309054,0.000027708447],"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.00020592251,0.0005048725,0.004271883,0.00003736706,0.00017220252,0.00071819586,0.00094608666,0.13337637,0.011779661,0.028703367,0.0076481015,0.811636],"study_design_scores_gemma":[0.0028493637,0.0017135716,0.07951065,0.0004763155,0.000025387777,0.0024571456,0.000041817486,0.8696003,0.016120518,0.017277027,0.008962304,0.0009655943],"about_ca_topic_score_codex":0.000004293262,"about_ca_topic_score_gemma":0.000008578267,"teacher_disagreement_score":0.8106704,"about_ca_system_score_codex":0.000062008876,"about_ca_system_score_gemma":0.00008993496,"threshold_uncertainty_score":0.6668649},"labels":[],"label_agreement":null},{"id":"W205522897","doi":"","title":"On Properties of Higher-Order Delaunay Graphs with Applications ∗","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"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":"Delaunay triangulation; Combinatorics; Mathematics; Pitteway triangulation; Constrained Delaunay triangulation; Regular polygon; Bowyer–Watson algorithm; Graph; Discrete mathematics; Geometry","score_opus":0.01387605079641639,"score_gpt":0.2242497141313431,"score_spread":0.2103736633349267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205522897","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.029007746,0.00011083486,0.96094984,0.0014660837,0.000028691156,0.00016154961,4.0743984e-7,0.00007372127,0.008201141],"genre_scores_gemma":[0.8862819,0.0000025881902,0.111241624,0.0004421327,0.00002807142,0.000041045147,0.0000016768871,0.00000241505,0.0019585576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995053,0.00001165997,0.00010072973,0.0001474823,0.00016378328,0.00007106601],"domain_scores_gemma":[0.99959046,0.000020658339,0.00003526988,0.00019297408,0.00013270167,0.000027965494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004902233,0.000054976106,0.000053685944,0.0000855186,0.000055295783,0.000024470111,0.00017952206,0.000015930504,0.00002679424],"category_scores_gemma":[0.0000025338918,0.000037039743,0.00001573371,0.00047272976,0.000023350105,0.00018030313,0.000024558827,0.000030694184,0.000034954686],"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.0000061861665,0.00010145459,0.000027723006,0.0000051495717,0.000009046371,9.7844826e-8,0.000065565066,0.025423817,0.0023416884,0.93252593,0.0005455495,0.038947787],"study_design_scores_gemma":[0.0020847763,0.0011669633,0.006985288,0.00009123951,0.00003210289,0.000029860013,0.000042168096,0.25315458,0.45838356,0.065255605,0.21177979,0.0009940593],"about_ca_topic_score_codex":0.0000045766924,"about_ca_topic_score_gemma":0.000009316662,"teacher_disagreement_score":0.86727035,"about_ca_system_score_codex":0.000008545339,"about_ca_system_score_gemma":0.00003775849,"threshold_uncertainty_score":0.15104368},"labels":[],"label_agreement":null},{"id":"W2055608379","doi":"10.1142/s0218195911003810","title":"CONSTRUCTING CONSTRAINED DELAUNAY TETRAHEDRALIZATIONS OF VOLUMES BOUNDED BY PIECEWISE SMOOTH SURFACES","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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 British Columbia","funders":"","keywords":"Delaunay triangulation; Chew's second algorithm; Bowyer–Watson algorithm; Ruppert's algorithm; Mathematics; Constrained Delaunay triangulation; Boundary (topology); Surface triangulation; Polygon mesh; Bounded function; Pitteway triangulation; Algorithm; Vertex (graph theory); Piecewise; Discretization; Triangulation; Topology (electrical circuits); Geometry; Combinatorics; Mathematical analysis","score_opus":0.016794818185421435,"score_gpt":0.26329315313191276,"score_spread":0.24649833494649132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055608379","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.026767595,0.0007305584,0.96841735,0.0005409459,0.00058174896,0.0003147139,0.00015292838,0.00006120511,0.0024329382],"genre_scores_gemma":[0.74479353,0.00004654991,0.25453433,0.00016250293,0.00017729677,0.000028728648,0.00013949377,0.0000138742025,0.000103665356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967025,0.00010412742,0.0013914679,0.00035046032,0.001210202,0.00024124824],"domain_scores_gemma":[0.99416536,0.00059517147,0.0014263429,0.00025888736,0.0033606377,0.00019362911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060165767,0.00024544157,0.00037046697,0.0009921985,0.00018222151,0.00017849437,0.0015501236,0.00010355134,0.00020860939],"category_scores_gemma":[0.0001510917,0.00025702003,0.00023949385,0.0014192967,0.00028567482,0.0010598592,0.00016788366,0.00024050756,0.00001714549],"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.00008083185,0.0012408817,0.008268029,0.000042059477,0.00088958995,0.000018118451,0.00087570376,0.04337311,0.0019737093,0.7574952,0.0028757541,0.18286698],"study_design_scores_gemma":[0.0067400304,0.00093328964,0.017497642,0.00030174566,0.00033326255,0.0020722165,0.0017244512,0.18592297,0.02484106,0.66289204,0.09477649,0.0019647966],"about_ca_topic_score_codex":0.000022852066,"about_ca_topic_score_gemma":0.000004924613,"teacher_disagreement_score":0.718026,"about_ca_system_score_codex":0.00015044711,"about_ca_system_score_gemma":0.0005661301,"threshold_uncertainty_score":0.9999882},"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":"W2056220869","doi":"10.1006/jvci.2001.0488","title":"Nice Perspective Projections","year":2001,"lang":"en","type":"article","venue":"Journal of Visual Communication and Image Representation","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":"McGill University","funders":"","keywords":"Perspective (graphical); Ambiguity; Parallel projection; Computer graphics; Computer science; Projection (relational algebra); Artificial intelligence; Computer vision; Mathematics; Object (grammar); Graph; Computer graphics (images); Orthographic projection; Theoretical computer science; Algorithm","score_opus":0.032678964945319584,"score_gpt":0.3897377839897251,"score_spread":0.3570588190444055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056220869","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.090676546,0.00086966885,0.8962935,0.0059876605,0.00015974064,0.00013154281,3.6956948e-7,0.000032197437,0.005848736],"genre_scores_gemma":[0.93398786,0.0015015979,0.0639993,0.00014812342,0.00010129178,0.000003852699,0.0000038744433,0.0000041496633,0.00024996974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990426,0.00023309252,0.00030785825,0.000110867644,0.00023226955,0.00007333227],"domain_scores_gemma":[0.998331,0.00018659761,0.00031639353,0.00021728534,0.0008909632,0.000057774014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004688167,0.00006461133,0.0001029353,0.00024604143,0.00019888156,0.00020419704,0.00026495953,0.000027136808,0.0000124609],"category_scores_gemma":[0.00025672905,0.000060440998,0.000053005577,0.00056375616,0.000045445555,0.0016321522,0.00010011369,0.00014854522,0.0000055995556],"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.00035563088,0.002588486,0.009811837,0.00004698371,0.00040935833,0.000042760217,0.025407873,0.00341338,0.11340255,0.39835274,0.013478266,0.43269014],"study_design_scores_gemma":[0.006600875,0.0026636398,0.2166012,0.00024340871,0.00018950744,0.005987516,0.020082677,0.5554254,0.02852555,0.11900237,0.043544095,0.0011337777],"about_ca_topic_score_codex":0.00003215786,"about_ca_topic_score_gemma":0.000005752779,"teacher_disagreement_score":0.8433113,"about_ca_system_score_codex":0.00005582597,"about_ca_system_score_gemma":0.0000721997,"threshold_uncertainty_score":0.24647123},"labels":[],"label_agreement":null},{"id":"W2056775628","doi":"10.1016/j.jctb.2012.11.001","title":"Zarankiewiczʼs Conjecture is finite for each fixed m","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","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 Waterloo","funders":"","keywords":"Conjecture; Counterexample; Combinatorics; Bipartite graph; Mathematics; Integer (computer science); Graph; Discrete mathematics","score_opus":0.014450968568792546,"score_gpt":0.2576611888266693,"score_spread":0.24321022025787672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056775628","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.032248948,0.0015445183,0.94049495,0.0017080144,0.022834832,0.00022516359,0.000008720655,0.000037214526,0.00089762546],"genre_scores_gemma":[0.9786126,0.0000271028,0.017469268,0.0005158259,0.0027290473,0.0000056265376,0.000003684406,0.000010294806,0.0006265287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880034,0.00016304699,0.0003859032,0.00010387389,0.00031314138,0.00023371892],"domain_scores_gemma":[0.998307,0.00062171207,0.00036138663,0.0001875823,0.00038798232,0.00013437336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015106774,0.00013032829,0.00024069814,0.00013936387,0.00016129363,0.00011541208,0.0004523832,0.00008423744,0.000050574374],"category_scores_gemma":[0.00034809342,0.00010849233,0.00017737974,0.00028442818,0.000037037833,0.0013781267,0.000065276436,0.00016101477,0.000008555848],"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.00028566679,0.00010802448,0.000079939855,0.000015360063,0.00006479948,0.0000018606564,0.0013232213,0.00025969886,0.00048067994,0.9863729,0.005592673,0.0054151686],"study_design_scores_gemma":[0.001589165,0.0006704787,0.00024194762,0.000021076126,0.000031486572,0.000113301794,0.000052446572,0.00048217035,0.013400325,0.7032043,0.28001782,0.00017552655],"about_ca_topic_score_codex":2.1975907e-7,"about_ca_topic_score_gemma":5.3497796e-8,"teacher_disagreement_score":0.9463637,"about_ca_system_score_codex":0.000037428355,"about_ca_system_score_gemma":0.00013533141,"threshold_uncertainty_score":0.44241887},"labels":[],"label_agreement":null},{"id":"W2057096900","doi":"10.1287/ijoc.12.4.317.11880","title":"Approximation of Point Sets by 1-Corner Polygonal Chains","year":2000,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Monotone polygon; Polygonal chain; Point (geometry); Plane (geometry); Set (abstract data type); Computational geometry; Mathematics; Facility location problem; Combinatorics; Geometry; Mathematical optimization; Field (mathematics); Computer science; Regular polygon; Pure mathematics","score_opus":0.011064204731102003,"score_gpt":0.24432164614904872,"score_spread":0.23325744141794671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057096900","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.41183043,0.000052336698,0.5836529,0.0004454466,0.00039734197,0.00007274021,0.000002234574,0.000043553307,0.0035030216],"genre_scores_gemma":[0.97099894,0.00001256232,0.027579606,0.00085702474,0.00019193148,7.066817e-7,0.000011769933,0.0000061184032,0.00034132382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852455,0.000037427486,0.00055321207,0.00015438255,0.0004991893,0.00023127148],"domain_scores_gemma":[0.99916774,0.00010334309,0.00030058654,0.00016285102,0.00015208601,0.00011338586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006372082,0.00013131766,0.00016020211,0.00020233143,0.00023445225,0.00018661939,0.00040342018,0.00005110373,0.000089038556],"category_scores_gemma":[0.00003530289,0.000108126595,0.00009765036,0.00042277976,0.00002179306,0.0007472432,0.00005287847,0.00024766897,0.00005165115],"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.000024078226,0.0000960109,0.00008917716,0.000010403615,0.000025149206,0.000005504486,0.00083587307,0.112747826,0.0005887126,0.013947827,0.0027511315,0.8688783],"study_design_scores_gemma":[0.00073706935,0.0003118131,0.0017124141,0.000085427055,0.0000040873574,0.00037945766,0.000029020171,0.9822832,0.004430651,0.0035566362,0.006243644,0.00022658419],"about_ca_topic_score_codex":0.0000023467112,"about_ca_topic_score_gemma":2.0256506e-7,"teacher_disagreement_score":0.8695354,"about_ca_system_score_codex":0.0000580283,"about_ca_system_score_gemma":0.00008910423,"threshold_uncertainty_score":0.44092745},"labels":[],"label_agreement":null},{"id":"W2057259762","doi":"10.1007/s00454-001-0042-y","title":"Every Set of Disjoint Line Segments Admits a Binary Tree","year":2001,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":28,"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; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; K-ary tree; Disjoint sets; Tree (set theory); Interval tree; Binary tree; Vertex (graph theory); Segment tree; Line segment; Range tree; Line (geometry); Plane (geometry); Discrete mathematics; Tree structure; Graph; Geometry","score_opus":0.02535542343954046,"score_gpt":0.2833968965844862,"score_spread":0.25804147314494574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057259762","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.3400151,0.00034206882,0.65681636,0.000901814,0.00042371886,0.00020223281,0.000044011245,0.00011394609,0.0011406954],"genre_scores_gemma":[0.94395244,0.000031758136,0.05417444,0.00043085072,0.00024557335,0.000019812749,0.00046984773,0.000017617145,0.0006576272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997271,0.00012164921,0.0006712968,0.0006028103,0.0009693928,0.00036383484],"domain_scores_gemma":[0.99833196,0.0003543244,0.00030345438,0.0004117756,0.0003979751,0.00020050592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041249447,0.0002802059,0.0003391327,0.0007331921,0.0001846225,0.00010936552,0.0006856067,0.000093267685,0.00011278909],"category_scores_gemma":[0.000112820635,0.0002781015,0.00020274988,0.0023698693,0.00008196704,0.0007796745,0.0003757518,0.00017643468,0.00009806072],"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.00013255788,0.00042277557,0.0077546504,0.00008718013,0.00021353668,0.00009086523,0.0005614457,0.84460104,0.0016654447,0.039984677,0.0026652652,0.10182056],"study_design_scores_gemma":[0.0014626135,0.0005350253,0.15548047,0.000093225,0.00003246415,0.00014128274,0.00007122123,0.81023645,0.0010853687,0.026148733,0.0041067842,0.0006063641],"about_ca_topic_score_codex":0.000016473305,"about_ca_topic_score_gemma":0.00000412731,"teacher_disagreement_score":0.6039373,"about_ca_system_score_codex":0.00007618452,"about_ca_system_score_gemma":0.00021703485,"threshold_uncertainty_score":0.9999671},"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":"W2058272928","doi":"10.1007/s00022-006-0040-6","title":"Caps with free pairs of points","year":2006,"lang":"en","type":"article","venue":"Journal of 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":"Mathematics; Combinatorics; Upper and lower bounds; Plane (geometry); Geometry; Mathematical analysis","score_opus":0.005835075372395182,"score_gpt":0.2004139938960415,"score_spread":0.1945789185236463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058272928","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.51350987,0.0003327481,0.48435882,0.00060172094,0.00023830232,0.000028403052,0.0000016585211,0.000008432504,0.0009200482],"genre_scores_gemma":[0.890728,0.0000062974345,0.10879978,0.000078343466,0.00021355094,2.93277e-7,9.72518e-7,0.0000037732648,0.00016900005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988954,0.000035833094,0.0003692018,0.00009347991,0.0004936927,0.00011241464],"domain_scores_gemma":[0.99883616,0.000099866855,0.00041366898,0.00021268115,0.00038525125,0.000052388506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004550547,0.000074242445,0.0001684499,0.0004573893,0.000038333816,0.000037936057,0.0004764666,0.000031983636,0.000021219292],"category_scores_gemma":[0.0000668811,0.00005587692,0.000074804004,0.00090253836,0.000026380556,0.00041315457,0.00006338191,0.00010957166,0.0000037362133],"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.0005671831,0.003144339,0.12203352,0.00036896873,0.0007356822,0.00082425715,0.001182382,0.19477805,0.040647913,0.28785783,0.15729944,0.19056043],"study_design_scores_gemma":[0.0074023083,0.00394701,0.6947778,0.00037721483,0.00012344748,0.0028676398,0.00018459494,0.019157244,0.12244136,0.12431657,0.023497313,0.00090750516],"about_ca_topic_score_codex":0.000013846387,"about_ca_topic_score_gemma":0.000005889234,"teacher_disagreement_score":0.57274425,"about_ca_system_score_codex":0.000026402764,"about_ca_system_score_gemma":0.000116098614,"threshold_uncertainty_score":0.22785947},"labels":[],"label_agreement":null},{"id":"W2058678665","doi":"10.1007/s00454-009-9149-3","title":"Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"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":"Combinatorics; Planar graph; Mathematics; Book embedding; Embedding; Planar; Planar straight-line graph; Enhanced Data Rates for GSM Evolution; 1-planar graph; Point (geometry); Outerplanar graph; Plane (geometry); Graph; Discrete mathematics; Pathwidth; Chordal graph; Geometry; Computer science; Line graph; Computer graphics (images)","score_opus":0.013979366589323364,"score_gpt":0.25362074825531133,"score_spread":0.23964138166598797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058678665","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.32098374,0.00008784315,0.6775479,0.0006528552,0.00007984243,0.0002121162,0.000051645522,0.000037838287,0.00034624216],"genre_scores_gemma":[0.7841117,0.0000031131128,0.21548834,0.00018725033,0.00002336915,0.0000035833878,0.00015256197,0.000006281685,0.000023807119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983564,0.000044161916,0.00039803662,0.00036898977,0.00061209546,0.00022033793],"domain_scores_gemma":[0.99852705,0.0003854979,0.0003078745,0.00021477617,0.00047070353,0.00009408026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002519842,0.0001710628,0.00028487074,0.0005630005,0.00011373385,0.000049262493,0.00045135088,0.00005747078,0.000011107244],"category_scores_gemma":[0.000047598514,0.00016389515,0.000119794175,0.0012271528,0.000078900615,0.0005778644,0.00004145953,0.000078148674,0.0000026296823],"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.00029236244,0.000326016,0.0015128363,0.00011507072,0.0001873222,0.0000050736517,0.0007900565,0.1418076,0.0012849224,0.8343402,0.00035155652,0.018986987],"study_design_scores_gemma":[0.0039065112,0.0027707547,0.21366191,0.0002343953,0.000115186565,0.000034447377,0.00021035192,0.33887514,0.008953794,0.4299712,0.0005220644,0.00074426155],"about_ca_topic_score_codex":0.000012183667,"about_ca_topic_score_gemma":0.0000024766268,"teacher_disagreement_score":0.46312794,"about_ca_system_score_codex":0.000027544613,"about_ca_system_score_gemma":0.00016514554,"threshold_uncertainty_score":0.66834503},"labels":[],"label_agreement":null},{"id":"W2058787718","doi":"10.1137/130950422","title":"Empty Pentagons in Point Sets with Collinearities","year":2015,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Deutsche Forschungsgemeinschaft; Fonds De La Recherche Scientifique - FNRS; Australian Government; Hungarian Scientific Research Fund; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Pentagon; Regular polygon; Plane (geometry); General position; Convex polytope; Point (geometry); Finite set; Convex set; Constant (computer programming)","score_opus":0.035811816901916524,"score_gpt":0.28386318805756705,"score_spread":0.2480513711556505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058787718","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.21320868,0.000108843655,0.7762238,0.0028650893,0.0003573731,0.00020214531,0.0000046297055,0.00005301952,0.006976469],"genre_scores_gemma":[0.79271024,0.000013855622,0.20653933,0.0002606041,0.00009772755,0.0000063609705,0.0000043209584,0.000011424511,0.00035611904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876493,0.00006367753,0.00031499812,0.00014233855,0.0005224045,0.00019167503],"domain_scores_gemma":[0.9992175,0.0001032602,0.00015535299,0.0002038137,0.00014802565,0.0001720375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064424565,0.00012680615,0.00017198712,0.00019993326,0.0000907117,0.0002937094,0.000329453,0.00003275965,0.000015921654],"category_scores_gemma":[0.000089810645,0.000091532995,0.00004300668,0.0003685321,0.000026952705,0.00042408114,0.000065809014,0.00021994516,0.00003741203],"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.00021336919,0.0015547795,0.0015917481,0.00019127724,0.00016789511,0.0009786561,0.031037545,0.22491677,0.0002805522,0.7114198,0.012482059,0.0151655255],"study_design_scores_gemma":[0.003900116,0.001666298,0.0024136214,0.000620725,0.000028237355,0.002776856,0.0034336327,0.69923526,0.0019669363,0.27963474,0.0035000455,0.0008235176],"about_ca_topic_score_codex":0.0000024244418,"about_ca_topic_score_gemma":0.000013367147,"teacher_disagreement_score":0.57950157,"about_ca_system_score_codex":0.00009452562,"about_ca_system_score_gemma":0.0002018869,"threshold_uncertainty_score":0.37326074},"labels":[],"label_agreement":null},{"id":"W2059425416","doi":"10.1080/13658811003601430","title":"Toward 3D spatial dynamic field simulation within GIS using kinetic Voronoi diagram and Delaunay tetrahedralization","year":2010,"lang":"en","type":"article","venue":"International Journal of Geographical Information Systems","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voronoi diagram; Delaunay triangulation; Computer science; Spatial analysis; Field (mathematics); Data mining; Geographic information system; Representation (politics); Discretization; Geography; Remote sensing; Algorithm; Mathematics","score_opus":0.012087517800533175,"score_gpt":0.27466356641790024,"score_spread":0.26257604861736705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059425416","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.21602127,0.00005261774,0.77950895,0.00039636483,0.0037899103,0.00012988294,0.0000050507,0.000028204386,0.00006774445],"genre_scores_gemma":[0.98506457,0.000021810742,0.014323857,0.0002352,0.00031348947,0.000003433811,0.000027453822,0.0000050389563,0.000005148388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776673,0.00007615175,0.0010294988,0.00013017871,0.00086156605,0.00013586033],"domain_scores_gemma":[0.997296,0.00023110321,0.00084059336,0.00013865698,0.0013639665,0.00012970637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069098093,0.00014582115,0.00018710995,0.0008270884,0.00009882235,0.0006978904,0.0004643352,0.000147632,0.000012611435],"category_scores_gemma":[0.000368263,0.0001314394,0.00009454991,0.00039966297,0.000043348402,0.0028474897,0.0000911322,0.0003126169,0.000005067812],"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.00007084311,0.00007316123,0.00427076,0.000038555176,0.00013351571,0.000009065842,0.0012208981,0.8716108,0.0016011293,0.02556541,0.00004007686,0.09536578],"study_design_scores_gemma":[0.0005390557,0.00012494529,0.005989233,0.000048490165,0.000015272522,0.0003119399,0.00003927547,0.98987603,0.00019143293,0.00069606525,0.0020239742,0.000144291],"about_ca_topic_score_codex":0.00014494927,"about_ca_topic_score_gemma":0.000024356033,"teacher_disagreement_score":0.76904327,"about_ca_system_score_codex":0.000043828106,"about_ca_system_score_gemma":0.000095856696,"threshold_uncertainty_score":0.6729773},"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":"W2060313721","doi":"10.1016/j.ipl.2007.08.008","title":"Flying over a polyhedral terrain","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","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 Waterloo","funders":"","keywords":"Terrain; Approximation algorithm; Shortest path problem; Combinatorics; Metric (unit); Mathematics; Obstacle; Euclidean shortest path; Euclidean space; Computational geometry; Euclidean geometry; Path (computing); Space (punctuation); Euclidean distance; Metric space; Algorithm; Computer science; Discrete mathematics; K shortest path routing; Graph; Geometry; Geography","score_opus":0.007763657452015505,"score_gpt":0.24528319179360558,"score_spread":0.23751953434159007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060313721","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.119898014,0.00001793611,0.8764008,0.0019913758,0.00025623012,0.000064701446,4.302548e-7,0.00016386005,0.0012066028],"genre_scores_gemma":[0.92982364,3.4376495e-7,0.056909658,0.0131100565,0.0001071185,0.0000039011197,0.000016921242,0.0000028156721,0.000025525642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990669,0.000010782259,0.00030047636,0.00010221736,0.0003095008,0.00021012066],"domain_scores_gemma":[0.9995748,0.000031762433,0.00014317529,0.00012108809,0.00007179862,0.000057376536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048344192,0.00008688417,0.00006098131,0.00029883976,0.00030313854,0.00042120446,0.00024745625,0.000032703825,0.000008081775],"category_scores_gemma":[0.000035377318,0.000086193824,0.00003053675,0.0005269408,0.00001799247,0.0047330796,0.000054477812,0.000085598505,0.000055465764],"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.000008728203,0.000012614658,0.00030612282,0.000038562932,0.0000055176897,0.0000032484836,0.0069842436,0.0028936956,0.007720265,0.005813982,0.00228771,0.9739253],"study_design_scores_gemma":[0.0014553812,0.00006308016,0.057157658,0.00011651234,0.000009567408,0.00013696137,0.0003382414,0.8369568,0.013457312,0.0020039128,0.087456904,0.00084768963],"about_ca_topic_score_codex":0.000007440494,"about_ca_topic_score_gemma":0.0000013585708,"teacher_disagreement_score":0.9730776,"about_ca_system_score_codex":0.000055920635,"about_ca_system_score_gemma":0.00005087287,"threshold_uncertainty_score":0.40616843},"labels":[],"label_agreement":null},{"id":"W2061274508","doi":"10.1007/s4540010065","title":"Generalizing Ham Sandwich Cuts to Equitable Subdivisions","year":2000,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":85,"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":"Mathematics; Combinatorics; Subdivision; Disjoint sets; Plane (geometry); Generalization; Regular polygon; General position; Cutting-plane method; Discrete mathematics; Geometry; Algorithm; Mathematical analysis; Integer programming","score_opus":0.015435263351056735,"score_gpt":0.2780546105862947,"score_spread":0.262619347235238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061274508","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.18704653,0.0003005449,0.8018219,0.0019505816,0.00044481384,0.00028567872,0.000033382657,0.0002750593,0.007841528],"genre_scores_gemma":[0.8244002,0.000013865804,0.16827238,0.0027375673,0.0003253194,0.000040745264,0.00024025424,0.000023782783,0.003945918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996807,0.00011391197,0.0005319182,0.00083243375,0.0009601374,0.00075461896],"domain_scores_gemma":[0.99845064,0.00028698027,0.00009096247,0.00048745796,0.00028787352,0.00039608777],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005717736,0.0003081118,0.00029066333,0.00064349966,0.00070184976,0.00050593814,0.0009080007,0.00009029847,0.00095499156],"category_scores_gemma":[0.000079207086,0.00031751517,0.00016204534,0.0028230275,0.00003837011,0.00090542994,0.00038214572,0.0001926563,0.0013273371],"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.000017784994,0.00009594368,0.00043074627,0.000011235398,0.000043640062,0.00001469516,0.00032583272,0.8327644,0.00037784787,0.056873087,0.010919452,0.09812533],"study_design_scores_gemma":[0.0011314496,0.00031182947,0.04924025,0.00007276644,0.000027482041,0.000108068365,0.000046075613,0.80843604,0.0007778331,0.043942455,0.09476218,0.0011435957],"about_ca_topic_score_codex":0.000040712177,"about_ca_topic_score_gemma":0.0000059566846,"teacher_disagreement_score":0.63735366,"about_ca_system_score_codex":0.000099522105,"about_ca_system_score_gemma":0.00018721425,"threshold_uncertainty_score":0.9999583},"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":"W2061769667","doi":"10.1007/s00454-007-1329-4","title":"Dimensionality Reductions in ℓ2 that Preserve Volumes and Distance to Affine Spaces","year":2007,"lang":"en","type":"article","venue":"Discrete & 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 Toronto","funders":"","keywords":"Mathematics; Affine space; Combinatorics; Euclidean space; Affine transformation; Dimension (graph theory); Embedding; Curse of dimensionality; Space (punctuation); Affine hull; Discrete mathematics; Geometry","score_opus":0.017670676533831628,"score_gpt":0.2824645015259168,"score_spread":0.26479382499208515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061769667","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.44096297,0.00035589674,0.55527246,0.0023552952,0.0003018118,0.00020840438,0.000017265775,0.000069523274,0.00045640225],"genre_scores_gemma":[0.915013,0.000007745765,0.083723925,0.0004388103,0.00014212079,0.000016903758,0.00009547238,0.000010813328,0.0005511891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99774206,0.00008128108,0.00041395167,0.0006835742,0.0006898204,0.00038933303],"domain_scores_gemma":[0.99861115,0.00052490603,0.00011910595,0.0002903976,0.00021245219,0.00024200656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000928362,0.00022080516,0.00023270227,0.00069884723,0.00024151981,0.00023487413,0.0003806197,0.00007108398,0.000032573418],"category_scores_gemma":[0.0001753354,0.00022728379,0.00006598316,0.0020448584,0.00007899831,0.0007530706,0.00035444752,0.0001794834,0.000026310636],"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.00015408163,0.0003954359,0.0718216,0.00007782115,0.00008722465,0.00006163366,0.0018460981,0.511542,0.0006483193,0.3321829,0.0034477678,0.07773512],"study_design_scores_gemma":[0.00057565846,0.00010686197,0.82365626,0.000054827928,0.000007848594,0.00004636207,0.00016928535,0.13441171,0.00039204943,0.033634514,0.0064994483,0.0004451894],"about_ca_topic_score_codex":0.00007505805,"about_ca_topic_score_gemma":0.00013373839,"teacher_disagreement_score":0.75183463,"about_ca_system_score_codex":0.00010169522,"about_ca_system_score_gemma":0.00009159709,"threshold_uncertainty_score":0.9268364},"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":"W2064317094","doi":"10.1007/s00493-003-0028-x","title":"Sharp Concentration of the Number of Submaps in Random Planar Triangulations","year":2003,"lang":"en","type":"article","venue":"COMBINATORICA","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; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Planar; Vertex (graph theory); Degree (music); Convex polygon; Polygon (computer graphics); Regular polygon; Limiting; Triangulation; Planar graph; Point set triangulation; Geometry; Graph; Delaunay triangulation; Physics","score_opus":0.012195773987423764,"score_gpt":0.24536825558037026,"score_spread":0.23317248159294648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064317094","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.7383404,0.00034997793,0.24265993,0.0006630874,0.0014271659,0.00052257965,0.000005149203,0.000029549976,0.016002178],"genre_scores_gemma":[0.99811816,0.000004941902,0.0017370285,0.000025554227,0.000006612023,0.000006383561,0.000002751679,0.0000018900417,0.0000966783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924886,0.00013794923,0.0002458405,0.00010830947,0.00018089563,0.00007813549],"domain_scores_gemma":[0.999407,0.00015766024,0.00012206547,0.00020055285,0.00009311623,0.000019630814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002511191,0.00004920297,0.00010993035,0.000037946487,0.000043847274,0.000011657474,0.0002124217,0.000029234092,0.000016693883],"category_scores_gemma":[0.00015608316,0.0000402002,0.000045447978,0.0008076588,0.00002050057,0.00013480966,0.000018749768,0.000048880043,0.0000029351143],"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.000007019436,0.0001034773,0.013677971,0.000007744358,0.0000053143913,3.672445e-7,0.0003027577,0.0012931987,0.0010168577,0.98258364,0.00024488222,0.0007567724],"study_design_scores_gemma":[0.013385096,0.000114493996,0.29132673,0.00011075534,0.000030611413,0.000027537542,0.00008286911,0.056338347,0.12100015,0.5060217,0.011105246,0.00045647024],"about_ca_topic_score_codex":0.000009581353,"about_ca_topic_score_gemma":0.0000018940368,"teacher_disagreement_score":0.47656196,"about_ca_system_score_codex":0.00002832886,"about_ca_system_score_gemma":0.00011691107,"threshold_uncertainty_score":0.16393167},"labels":[],"label_agreement":null},{"id":"W2064723783","doi":"10.1016/j.jcta.2009.04.007","title":"Coloring axis-parallel rectangles","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","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":"Simon Fraser University","funders":"","keywords":"Chromatic scale; Combinatorics; Point (geometry); Construct (python library); Mathematics; Plane (geometry); Computer science; Geometry","score_opus":0.00995740381703517,"score_gpt":0.23863102350545598,"score_spread":0.22867361968842081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064723783","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.23204045,0.0016018493,0.7296373,0.004889002,0.020109052,0.00022284678,0.0000011642917,0.00013078538,0.011367548],"genre_scores_gemma":[0.9725551,0.000060364444,0.025770772,0.00022888173,0.0010601785,9.3051034e-7,5.825279e-7,0.0000042740253,0.00031890892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886674,0.0001594265,0.00037274364,0.00011097326,0.0003400376,0.00015011146],"domain_scores_gemma":[0.9989658,0.00016913339,0.000301765,0.00015990413,0.0003122647,0.00009115142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009851762,0.00010363118,0.00020307081,0.00015311847,0.00013207024,0.00015438543,0.00051094865,0.000050185317,0.000016672224],"category_scores_gemma":[0.00021535116,0.00009029229,0.000108571985,0.0003732984,0.000025063739,0.0011119908,0.000046751287,0.00016111681,0.000004992989],"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.0002474339,0.00007535583,0.000007661634,0.0000020706127,0.00001900717,0.000027585465,0.0002934763,0.00097190525,0.0014947967,0.978479,0.0007019654,0.017679717],"study_design_scores_gemma":[0.0007466851,0.0012019707,0.00049147406,0.000022617893,0.000008626427,0.00021214127,0.00004457011,0.00025855628,0.0041927877,0.96696097,0.025740517,0.00011910019],"about_ca_topic_score_codex":2.601573e-7,"about_ca_topic_score_gemma":1.1908909e-7,"teacher_disagreement_score":0.74051464,"about_ca_system_score_codex":0.000049912367,"about_ca_system_score_gemma":0.0001279556,"threshold_uncertainty_score":0.36820126},"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":"W2065769146","doi":"10.1007/s00453-001-0015-9","title":"Structural Lines, TINs, and DEMs","year":2001,"lang":"en","type":"article","venue":"Algorithmica","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":"University of British Columbia","funders":"","keywords":"Triangulated irregular network; Triangulation; Digital elevation model; Initialization; Terrain; Curvature; Surface (topology); Elevation (ballistics); Geometry; Computer science; Algorithm; Mathematics; Geodesy; Geology; Remote sensing; Geography","score_opus":0.013262080314140383,"score_gpt":0.2392971103008179,"score_spread":0.22603502998667752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065769146","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.32733753,0.0005225231,0.6688105,0.0018078937,0.00048320205,0.00008015313,0.0000015397666,0.000119776276,0.00083690626],"genre_scores_gemma":[0.8884363,0.000037345333,0.110028304,0.00046324573,0.00035781876,0.0000037484779,0.000011411608,0.000004022044,0.000657815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994693,0.000017143751,0.00009464724,0.00018783502,0.0001160771,0.000115003444],"domain_scores_gemma":[0.99970275,0.000039377494,0.000025998585,0.00012823976,0.00004614549,0.000057500507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006890105,0.000063712396,0.000059278933,0.00005459064,0.00009750829,0.000083831976,0.00016053868,0.000026547978,0.000012006807],"category_scores_gemma":[0.000015398959,0.00005799692,0.00001606269,0.00023861183,0.00001571054,0.00023900598,0.00008229188,0.00004926712,0.00002138792],"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.000002569804,0.000010706491,0.0006878598,0.0000028737845,0.000009852115,0.000017176286,0.0001296576,0.00043656197,0.0006799839,0.026967209,0.0011078165,0.96994776],"study_design_scores_gemma":[0.00034975674,0.000063216736,0.024357831,0.0000049837454,0.00000438348,0.00029422253,0.000007188145,0.9061903,0.0013112547,0.016398728,0.050814245,0.00020389378],"about_ca_topic_score_codex":0.000011738196,"about_ca_topic_score_gemma":0.000002928427,"teacher_disagreement_score":0.96974385,"about_ca_system_score_codex":0.000008536256,"about_ca_system_score_gemma":0.000021787953,"threshold_uncertainty_score":0.23650458},"labels":[],"label_agreement":null},{"id":"W2065795466","doi":"10.1007/s002360000044","title":"Analysis of range search for random k-d trees","year":2001,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":34,"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":"Hypercube; Combinatorics; Mathematics; Range (aeronautics); Binary search tree; Nearest neighbor search; Range tree; Conjecture; Theory of computation; Search tree; Regular polygon; Tree (set theory); Probabilistic logic; k-nearest neighbors algorithm; Discrete mathematics; Search algorithm; Algorithm; Computer science; Interval tree; Binary tree; Statistics; Data mining; Artificial intelligence","score_opus":0.02391396967433926,"score_gpt":0.27985544992381073,"score_spread":0.25594148024947144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065795466","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.12647341,0.000016454262,0.8692681,0.0005028269,0.000055502773,0.00016762003,0.0000056266886,0.000027285314,0.0034831672],"genre_scores_gemma":[0.9779598,0.00001573398,0.021601165,0.00018980066,0.00002678431,0.000017047732,0.000032692133,0.0000015435523,0.00015542496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992957,0.000017633867,0.00027543947,0.00007444091,0.00021249996,0.00012428242],"domain_scores_gemma":[0.9992024,0.00031712404,0.00007191489,0.00021878835,0.00014792738,0.00004189156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037433565,0.000056228557,0.000168353,0.00039232092,0.00006374319,0.00005697194,0.00030017857,0.000024949864,0.00003607429],"category_scores_gemma":[0.000056098026,0.000047925572,0.00012351802,0.0012548491,0.000015514499,0.0005981223,0.000052090483,0.000028774246,0.000008541562],"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.0005125296,0.00039636224,0.009913599,0.0002141176,0.0027496186,0.000002543338,0.017431708,0.18267335,0.0018276488,0.15105844,0.008654566,0.62456554],"study_design_scores_gemma":[0.0008577061,0.00006281076,0.008137691,0.0000040804493,0.00008682165,0.000001470657,0.00004028732,0.980004,0.0009935846,0.00028199516,0.009453805,0.00007575035],"about_ca_topic_score_codex":0.0000063986395,"about_ca_topic_score_gemma":0.0000076194874,"teacher_disagreement_score":0.8514864,"about_ca_system_score_codex":0.000010448227,"about_ca_system_score_gemma":0.000038699873,"threshold_uncertainty_score":0.19543481},"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":"W2066043589","doi":"10.1007/s11590-007-0068-z","title":"A simpler and tighter redundant Klee–Minty construction","year":2007,"lang":"en","type":"article","venue":"Optimization Letters","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Hyperplane; Mathematics; Dimension (graph theory); Combinatorics; Bent molecular geometry; Computational intelligence; Path (computing); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0056916164472046015,"score_gpt":0.21211858192349364,"score_spread":0.20642696547628905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066043589","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.028082075,0.00002113501,0.96714133,0.0037153114,0.00037263014,0.00009202369,8.1807343e-7,0.00007934862,0.0004953282],"genre_scores_gemma":[0.28526804,0.000011836771,0.71125424,0.0032117066,0.00014794497,0.0000035451276,0.000023966437,0.000006306757,0.00007243989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992454,0.000026316275,0.00017950892,0.00024004072,0.00016312035,0.00014559376],"domain_scores_gemma":[0.99960035,0.000055955465,0.00007122597,0.00013966803,0.000067317254,0.00006545301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002486603,0.000083551364,0.00006839843,0.00016227504,0.00013833077,0.00013468601,0.00010171041,0.000034631947,0.000033379856],"category_scores_gemma":[0.000020175548,0.00008343908,0.000021307955,0.0003332428,0.000044409015,0.00047383117,0.000048683964,0.000054592503,0.000008367421],"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.00002592619,0.00003548408,0.0007651667,0.000012217519,0.0000253736,0.000014697845,0.0005971046,0.8615282,0.007271673,0.040900715,0.003895094,0.084928334],"study_design_scores_gemma":[0.000569113,0.000053124255,0.0040183174,0.000011227727,0.000009352347,0.00013660407,0.000025619018,0.9801278,0.0036033904,0.000574223,0.010587921,0.00028327754],"about_ca_topic_score_codex":0.000003332308,"about_ca_topic_score_gemma":0.0000014323815,"teacher_disagreement_score":0.25718597,"about_ca_system_score_codex":0.00002949493,"about_ca_system_score_gemma":0.000016998889,"threshold_uncertainty_score":0.3402547},"labels":[],"label_agreement":null},{"id":"W2066612780","doi":"10.1145/1236246.1236306","title":"Voronoi-Delaunay duality and Delaunay meshes","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Voronoi diagram; Delaunay triangulation; Polygon mesh; Bowyer–Watson algorithm; Constrained Delaunay triangulation; Computer science; Centroidal Voronoi tessellation; Mathematics; Geometry; Algorithm; Computer graphics (images)","score_opus":0.008946470869681715,"score_gpt":0.2480538874043004,"score_spread":0.23910741653461867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066612780","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.1246663,0.00016411806,0.8642846,0.0005808948,0.00022193647,0.00006192336,4.1232164e-7,0.000108064116,0.009911753],"genre_scores_gemma":[0.9053288,0.000008513089,0.092593074,0.000659181,0.00008606292,0.000001684855,0.0000031146615,0.0000027372898,0.0013167978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99916536,0.000028883278,0.00018069758,0.00026077506,0.00018963461,0.0001746372],"domain_scores_gemma":[0.9994318,0.000159406,0.00003649503,0.0001947254,0.00007409398,0.000103489256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007879655,0.00008189043,0.00007897799,0.00008446471,0.00011586589,0.0001018193,0.00018005595,0.000039330484,0.000033348544],"category_scores_gemma":[0.000038238344,0.0000717707,0.000026232476,0.00027532686,0.000025331341,0.0003968299,0.00012480722,0.00005481178,0.00003304784],"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.0000068300105,0.000054704084,0.002130503,0.0000081542385,0.0000151518325,0.000009123498,0.0004082855,0.00045156712,0.0018615127,0.72976893,0.0019522425,0.26333302],"study_design_scores_gemma":[0.0015675842,0.00035483547,0.4286006,0.00002072532,0.000024709467,0.00022662696,0.00019385487,0.23360871,0.09234045,0.11541108,0.12643473,0.001216095],"about_ca_topic_score_codex":0.00002823849,"about_ca_topic_score_gemma":0.000054506858,"teacher_disagreement_score":0.78066254,"about_ca_system_score_codex":0.000018005416,"about_ca_system_score_gemma":0.000029566849,"threshold_uncertainty_score":0.29267243},"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":"W2067110987","doi":"10.1145/1498698.1564499","title":"Experimental study of geometric <i>t</i> -spanners","year":2009,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"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":"Spanner; Euclidean geometry; Set (abstract data type); Perspective (graphical); Point (geometry); Quality (philosophy); Combinatorics; Degree (music); Computer science; Plane (geometry); Euclidean distance; Mathematics; Algorithm; Discrete mathematics; Artificial intelligence; Geometry; Physics; Database","score_opus":0.022805471178469764,"score_gpt":0.2986947756010033,"score_spread":0.27588930442253357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067110987","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.9278464,0.0029400613,0.06788984,0.0001531439,0.00079346396,0.00016363851,0.0000010601236,0.000018727977,0.00019370693],"genre_scores_gemma":[0.93438864,0.000015569101,0.065176755,0.00017993244,0.00020743227,0.000001872568,0.000001357244,0.000006123753,0.000022297634],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981413,0.00007558784,0.00066547346,0.00020965397,0.00071476237,0.0001932591],"domain_scores_gemma":[0.99869525,0.00008328528,0.00048304023,0.00037140728,0.00023190441,0.00013511613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003350952,0.00016783093,0.00030107322,0.00055082876,0.000092910035,0.000073562514,0.001117138,0.000044042263,0.000012997757],"category_scores_gemma":[0.000058205213,0.00015410724,0.00013148403,0.0010540856,0.000025786345,0.0007575914,0.00019613298,0.00015016005,0.0000034581383],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029562475,0.028469775,0.00064865366,0.000007481514,0.00033628588,0.00034467274,0.015217799,0.013032432,0.8089104,0.0052983076,0.004203746,0.12323481],"study_design_scores_gemma":[0.0032802795,0.013221717,0.0025309732,0.000021196322,0.000019696212,0.00041155575,0.0044992454,0.006366242,0.9682449,0.0006878942,0.00039885571,0.00031745445],"about_ca_topic_score_codex":0.000006704953,"about_ca_topic_score_gemma":1.2728033e-7,"teacher_disagreement_score":0.15933448,"about_ca_system_score_codex":0.00010460414,"about_ca_system_score_gemma":0.00007711714,"threshold_uncertainty_score":0.6284311},"labels":[],"label_agreement":null},{"id":"W2067172197","doi":"10.5555/1070432.1070561","title":"Finding the shortest bottleneck edge in a parametric minimum spanning tree","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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":"Spanning tree; Minimum spanning tree; Combinatorics; Mathematics; Parametric statistics; Enhanced Data Rates for GSM Evolution; Time complexity; Connected dominating set; Shortest-path tree; Ranging; Bottleneck; Minimum degree spanning tree; Discrete mathematics; Computer science","score_opus":0.030453504939915606,"score_gpt":0.2718885037294417,"score_spread":0.24143499878952607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067172197","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.37870198,0.00026856954,0.60237014,0.0045648264,0.0002681804,0.00015469993,3.2577736e-7,0.00008673178,0.013584516],"genre_scores_gemma":[0.9584459,0.000007076676,0.03961765,0.00062947685,0.00017621192,0.000011696173,0.0000020145603,0.0000033416534,0.001106629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991131,0.00004427809,0.00019834429,0.00023827517,0.00020562079,0.00020040465],"domain_scores_gemma":[0.9993346,0.00031963285,0.000040633222,0.00023155498,0.00003238445,0.000041228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040202052,0.000084591884,0.000082358696,0.00029430693,0.000107652166,0.00015123785,0.00043038736,0.00003207343,0.000026035765],"category_scores_gemma":[0.000096183154,0.00006186063,0.00003829937,0.0016175692,0.000014054446,0.00037840768,0.00011360818,0.00010197431,0.00008380975],"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.0000046924406,0.0001578444,0.0076997518,0.000004099539,0.0000117347545,0.000010408857,0.0010660334,0.13561308,0.00090003555,0.085794486,0.0056808786,0.76305693],"study_design_scores_gemma":[0.0002489273,0.0000381972,0.053217016,0.000009359254,0.0000024659373,0.000016486456,0.000033297052,0.9316168,0.0018760869,0.0014178086,0.011376058,0.00014752428],"about_ca_topic_score_codex":0.000011091225,"about_ca_topic_score_gemma":0.00009406054,"teacher_disagreement_score":0.7960037,"about_ca_system_score_codex":0.000048027956,"about_ca_system_score_gemma":0.00005251268,"threshold_uncertainty_score":0.25226033},"labels":[],"label_agreement":null},{"id":"W2067403289","doi":"10.1145/1064092.1064121","title":"Multi-pass geometric algorithms","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Geometric programming; Convex hull; Algorithm; Computer science; Computational geometry; Regular polygon; Linear programming; Hull; Mathematical optimization; Mathematics; Geometry; Engineering","score_opus":0.026431810816621593,"score_gpt":0.2716727608701127,"score_spread":0.2452409500534911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067403289","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.0023725433,0.00015865022,0.99211514,0.0020951342,0.00024361441,0.0000605242,4.923363e-7,0.00016971398,0.0027841877],"genre_scores_gemma":[0.32115,0.000006726429,0.67320645,0.00067770935,0.00017268484,0.000004946485,0.0000030314163,0.0000024100334,0.0047760657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928665,0.000017961413,0.00012915189,0.00022101752,0.00019805544,0.00014718244],"domain_scores_gemma":[0.9995771,0.000050470506,0.000028112763,0.00019902806,0.000076076285,0.00006919685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016501252,0.0000681627,0.00006113025,0.00027523647,0.00007997744,0.000102115526,0.00028233798,0.00002788403,0.00008866652],"category_scores_gemma":[0.000028513014,0.000061030794,0.000036100155,0.0011242272,0.0000074599875,0.000483761,0.0000974096,0.00004934051,0.00052851933],"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":[6.326413e-7,0.00012560656,0.00009237532,0.0000018468561,0.000008542575,0.000002380521,0.00007339315,0.016075935,0.00085990026,0.027200809,0.005033418,0.95052516],"study_design_scores_gemma":[0.00028706968,0.000024539037,0.008105924,0.000001008276,0.0000013188442,0.0000130641,0.0000029502828,0.9305216,0.0041953633,0.0003981455,0.056329977,0.00011903316],"about_ca_topic_score_codex":0.0000067919023,"about_ca_topic_score_gemma":0.000006576884,"teacher_disagreement_score":0.95040613,"about_ca_system_score_codex":0.000030044464,"about_ca_system_score_gemma":0.000032672153,"threshold_uncertainty_score":0.6793223},"labels":[],"label_agreement":null},{"id":"W2068790848","doi":"10.1007/s00454-007-9019-9","title":"Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":40,"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; Mitacs; Army Research Office; Tel Aviv University; Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Spanning tree; Combinatorics; Minimum spanning tree; Euclidean geometry; Mathematics; Euclidean minimum spanning tree; Planar graph; Graph; Euclidean space; k-minimum spanning tree; Planar; Path (computing); Steiner tree problem; Discrete mathematics; Minimum degree spanning tree; Computer science; Tree structure; Binary tree; Geometry","score_opus":0.01198783087499152,"score_gpt":0.2639476584860729,"score_spread":0.2519598276110814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068790848","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.53524166,0.0009974395,0.46319976,0.00028371968,0.000060393824,0.00010207297,0.0000033069152,0.000017709224,0.00009392543],"genre_scores_gemma":[0.943967,0.000029170578,0.05568005,0.00020312073,0.000073051895,0.0000019429256,0.000021174517,0.000007233175,0.000017266202],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985252,0.000082291495,0.00043319963,0.00037939838,0.00034921875,0.00023070017],"domain_scores_gemma":[0.99851626,0.0009820642,0.00017437224,0.00013418988,0.000105147185,0.00008797925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010484578,0.00016181207,0.00020538144,0.00040974465,0.00022527014,0.00014382285,0.00018652588,0.000056201567,0.00000246009],"category_scores_gemma":[0.00009806485,0.00013721694,0.00002875738,0.0007533108,0.00014303585,0.00035008934,0.00027278042,0.00015716984,8.192479e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051789804,0.000100087076,0.14806476,0.00010343995,0.00008267302,0.000030815867,0.0049546207,0.2808716,0.0011933424,0.15481386,0.00007927535,0.40965375],"study_design_scores_gemma":[0.00034448315,0.000043904398,0.56817514,0.000032629403,0.0000062183035,0.000043614724,0.00019011063,0.42544606,0.00009878838,0.005428741,0.00007216898,0.00011812761],"about_ca_topic_score_codex":0.000045765813,"about_ca_topic_score_gemma":0.00003571593,"teacher_disagreement_score":0.4201104,"about_ca_system_score_codex":0.000019865467,"about_ca_system_score_gemma":0.00005314024,"threshold_uncertainty_score":0.5595544},"labels":[],"label_agreement":null},{"id":"W2068821766","doi":"10.1007/s00454-009-9190-2","title":"The Odd-Distance Plane Graph","year":2009,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; United States-Israel Binational Science Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Geometric graph theory; Distance-regular graph; Butterfly graph; Petersen graph; Wheel graph; Windmill graph; Graph power; Graph; Friendship graph; Discrete mathematics; Planar graph; Voltage graph; Line graph","score_opus":0.008770172417843971,"score_gpt":0.24651940598952396,"score_spread":0.23774923357167999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068821766","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.01467057,0.0011675673,0.974384,0.005301312,0.00061703654,0.00019395733,0.00001530807,0.00021798255,0.003432281],"genre_scores_gemma":[0.96226496,0.00003821137,0.035040937,0.0016176344,0.00023736892,0.0000120865625,0.00014534417,0.000008430885,0.00063504104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977806,0.00009423598,0.0004142747,0.000498491,0.00081134547,0.0004010393],"domain_scores_gemma":[0.99845034,0.000553248,0.00016907806,0.00042599754,0.0002510689,0.0001502917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046885238,0.0002241462,0.00017269728,0.00026040417,0.000804659,0.00050478196,0.0009547102,0.000062244966,0.000018629762],"category_scores_gemma":[0.00009684506,0.000176448,0.00013731135,0.0017029869,0.000079890815,0.0005523153,0.00010383738,0.00020593267,0.00011335006],"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.000024456334,0.00006295851,0.00021363997,0.0000047833705,0.000032712072,0.000013290642,0.00012437861,0.1403896,0.0000665748,0.76097023,0.0056265965,0.09247076],"study_design_scores_gemma":[0.00075924536,0.00027385287,0.11149573,0.000026111999,0.000013093286,0.00008852029,0.000045717563,0.31864512,0.00024168655,0.51567286,0.052147385,0.0005906645],"about_ca_topic_score_codex":0.00000468392,"about_ca_topic_score_gemma":0.0000038694398,"teacher_disagreement_score":0.9475944,"about_ca_system_score_codex":0.000052510877,"about_ca_system_score_gemma":0.00012221432,"threshold_uncertainty_score":0.71953404},"labels":[],"label_agreement":null},{"id":"W2069314331","doi":"10.1137/s1052623400374148","title":"The Analytic Center Cutting Plane Method with Semidefinite Cuts","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cutting-plane method; Mathematics; Semidefinite embedding; Semidefinite programming; Center (category theory); Plane (geometry); Mathematical analysis; Combinatorics; Quadratically constrained quadratic program; Geometry; Applied mathematics; Mathematical optimization; Quadratic equation; Integer programming","score_opus":0.010602547457741501,"score_gpt":0.2515268811390499,"score_spread":0.24092433368130842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069314331","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.0005932708,0.00010063696,0.9930543,0.0008733779,0.000368785,0.00007863,6.468129e-7,0.00003162365,0.0048987633],"genre_scores_gemma":[0.103352785,0.00021319641,0.8942329,0.000979771,0.00020217856,0.000005512084,0.000013380177,0.000016787884,0.0009834641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869496,0.00028090156,0.0002535418,0.00018728506,0.0003819719,0.00020135238],"domain_scores_gemma":[0.99899244,0.00029424787,0.00022458997,0.00018672565,0.00021367376,0.000088343775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093398057,0.00011446899,0.00009581023,0.00014844158,0.0005981113,0.00048919354,0.00023813584,0.000033221902,0.000019097044],"category_scores_gemma":[0.00013246444,0.0000728079,0.000043960536,0.0005784424,0.000013515256,0.00040239329,0.00001894685,0.00020539902,0.000013097016],"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.00001686287,0.000027303196,0.000105008905,0.000001558177,0.000021861575,0.000010437925,0.00008719731,0.9709951,0.000012703259,0.021307489,0.0005225397,0.006891897],"study_design_scores_gemma":[0.00060681335,0.00025314547,0.00011406543,0.000040564162,0.000011550054,0.00077044725,0.000035009285,0.9829317,0.00047027823,0.0015312529,0.0130857,0.0001494923],"about_ca_topic_score_codex":3.6007205e-7,"about_ca_topic_score_gemma":0.0000010193686,"teacher_disagreement_score":0.10275952,"about_ca_system_score_codex":0.000058063815,"about_ca_system_score_gemma":0.000106073894,"threshold_uncertainty_score":0.47173044},"labels":[],"label_agreement":null},{"id":"W2069358561","doi":"10.1007/s00454-004-1152-0","title":"Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries","year":2005,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":168,"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; Carleton University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Combinatorics; Boundary (topology); Algorithm; Nearest neighbour; Set (abstract data type); Point (geometry); Decision boundary; Decision rule; Line segment; k-nearest neighbors algorithm; Computer science; Artificial intelligence; Geometry; Statistics; Mathematical analysis","score_opus":0.021132077019035658,"score_gpt":0.29788084914743057,"score_spread":0.27674877212839494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069358561","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.050606173,0.0003053048,0.9446812,0.001994276,0.0010567056,0.00048832985,0.000079478436,0.00028947584,0.0004990509],"genre_scores_gemma":[0.5559466,0.0000030796737,0.44202346,0.00089313736,0.0006455305,0.000015578036,0.00024588022,0.00001969942,0.00020708315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674064,0.000095678915,0.0007077952,0.0009085795,0.00095941225,0.0005879146],"domain_scores_gemma":[0.99666256,0.0015621776,0.0002854456,0.00037514372,0.00087238074,0.00024227142],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073497783,0.00037562178,0.000383797,0.0006476085,0.0012024274,0.0011856937,0.00068909954,0.0001351043,0.000025238858],"category_scores_gemma":[0.00036469096,0.00038544938,0.00026998436,0.0013267668,0.00016307054,0.0011118165,0.00036368895,0.00023264866,0.00014904857],"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.000045154095,0.00009357716,0.0001442458,0.000017800288,0.00006751285,0.000006709519,0.00057657575,0.54455614,0.00003713194,0.09562431,0.0030247695,0.35580608],"study_design_scores_gemma":[0.0010781208,0.00016061119,0.014920837,0.000041978987,0.000018028928,0.000062015475,0.000063474596,0.9188315,0.00035160038,0.028691465,0.03529747,0.0004828926],"about_ca_topic_score_codex":0.000014763491,"about_ca_topic_score_gemma":0.00000884742,"teacher_disagreement_score":0.5053404,"about_ca_system_score_codex":0.00017755726,"about_ca_system_score_gemma":0.00041082953,"threshold_uncertainty_score":0.99985975},"labels":[],"label_agreement":null},{"id":"W2069852972","doi":"10.1007/s003730200028","title":"The Crossing Number of P(N, 3)","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Crossing number (knot theory); Combinatorics; Mathematics; Graph","score_opus":0.01433431762498918,"score_gpt":0.23276634486681638,"score_spread":0.2184320272418272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069852972","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.89837724,0.0035215467,0.08670584,0.0009422281,0.0011859536,0.00010282044,9.280164e-7,0.00007773464,0.009085733],"genre_scores_gemma":[0.9985204,0.00011633769,0.00096682506,0.000056701112,0.000006362828,0.0000019265553,1.947347e-7,0.0000015204288,0.00032974864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958915,0.000017162025,0.000098478835,0.0000900352,0.00012485898,0.00008033189],"domain_scores_gemma":[0.9996462,0.00008307958,0.000042940137,0.00013207077,0.0000684346,0.000027304539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011510477,0.00004131773,0.000046454305,0.000022914597,0.0003429088,0.00016415268,0.00015531531,0.000017723247,0.0000034358627],"category_scores_gemma":[0.000014136671,0.000030127594,0.00002366221,0.00039019156,0.000053956206,0.00011404267,0.000054244305,0.00003872077,0.000003762175],"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":[3.6101062e-7,0.000019925039,0.0017124414,0.0000025799502,0.0000034507966,4.9270113e-7,0.0001472817,0.000010548695,0.000021775379,0.9621425,0.00066492334,0.035273664],"study_design_scores_gemma":[0.00028913683,0.000042938816,0.008264244,0.0000062249896,0.0000037114753,0.00002337322,0.000018377514,0.063273974,0.00055232894,0.89733905,0.030080564,0.00010609119],"about_ca_topic_score_codex":0.000002772232,"about_ca_topic_score_gemma":3.8788033e-7,"teacher_disagreement_score":0.10014317,"about_ca_system_score_codex":0.0000034732589,"about_ca_system_score_gemma":0.0000070324154,"threshold_uncertainty_score":0.2637412},"labels":[],"label_agreement":null},{"id":"W2070761038","doi":"10.1016/j.dam.2003.05.005","title":"Hard cases of the multifacility location problem","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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":"Mathematics; Combinatorics; Mathematical optimization","score_opus":0.024164265586103864,"score_gpt":0.24281019983535757,"score_spread":0.21864593424925372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070761038","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.04909145,0.000028869856,0.9436342,0.00009471276,0.00008155344,0.0003456895,0.0000031890193,0.000038398808,0.0066819396],"genre_scores_gemma":[0.73568046,0.0000013035725,0.26409286,0.000037073878,0.000007503068,0.00002389165,0.0000026355349,0.0000032693704,0.00015101064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991987,0.00002490204,0.00025389306,0.00016460309,0.00025254386,0.0001053804],"domain_scores_gemma":[0.99915797,0.00012439766,0.00014679001,0.00043939188,0.000102838894,0.000028590885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029425428,0.00008729384,0.000109309236,0.000031695403,0.00009740044,0.000037207537,0.00030160855,0.000030716994,0.000008320402],"category_scores_gemma":[0.00010879875,0.00006120146,0.000043441873,0.00043784015,0.000039271672,0.000094087925,0.00006819534,0.00005434771,0.000015782209],"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.0000011238544,0.0000765531,0.000031004503,0.00011650076,0.000009608674,2.0552011e-7,0.00086446805,0.005355832,0.0075578783,0.9827689,0.000117285934,0.0031006597],"study_design_scores_gemma":[0.0009432753,0.0000740266,0.0038789597,0.00010817557,0.000056071298,0.00006216837,0.000588881,0.15985903,0.34188122,0.4872706,0.004679289,0.00059829396],"about_ca_topic_score_codex":0.0000023265807,"about_ca_topic_score_gemma":0.0000020850034,"teacher_disagreement_score":0.686589,"about_ca_system_score_codex":0.000018470097,"about_ca_system_score_gemma":0.0000712697,"threshold_uncertainty_score":0.24957232},"labels":[],"label_agreement":null},{"id":"W2071579776","doi":"10.1017/s0963548306007875","title":"Reconstructing Odd Necklaces","year":2007,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Computer science","score_opus":0.020988891127924663,"score_gpt":0.2596845590390479,"score_spread":0.23869566791112326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071579776","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.39773956,0.00011233086,0.59644395,0.00019259208,0.0014535681,0.00016757776,2.0683476e-7,0.0002989666,0.0035912725],"genre_scores_gemma":[0.87550855,0.0000015794711,0.124167606,0.00011300274,0.00014747791,0.0000014322334,0.0000032245337,0.000008007224,0.00004913644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782443,0.00010462367,0.0005723419,0.00060859736,0.0004079292,0.00048205047],"domain_scores_gemma":[0.99800545,0.0006970205,0.00022597471,0.0005310346,0.00037892215,0.00016161635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031164014,0.0001896526,0.00021213702,0.0001969289,0.0004738639,0.00021885763,0.0007461499,0.000092519374,0.0000054647658],"category_scores_gemma":[0.00050338206,0.00020582847,0.00009268991,0.0014020699,0.000058111287,0.00048737618,0.00047873362,0.00027241994,0.000024910973],"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.0000048025145,0.00014564146,0.017193457,0.000047725116,0.000014019148,0.000009324609,0.0005800524,0.0025326489,0.00036983698,0.78810954,0.0001032704,0.19088967],"study_design_scores_gemma":[0.00061919127,0.00012715906,0.012173485,0.000041887397,0.000006880512,0.00009410696,0.000068399306,0.3205384,0.0071192025,0.6563015,0.0023913865,0.0005184309],"about_ca_topic_score_codex":0.000008771384,"about_ca_topic_score_gemma":0.0000027517162,"teacher_disagreement_score":0.47776896,"about_ca_system_score_codex":0.00019858885,"about_ca_system_score_gemma":0.00012659689,"threshold_uncertainty_score":0.8393442},"labels":[],"label_agreement":null},{"id":"W2073199795","doi":"10.1142/s0218195914600048","title":"A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS","year":2014,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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 Regina; University of British Columbia","funders":"","keywords":"Resilience (materials science); Path (computing); Time complexity; Plane (geometry); Polynomial; Algorithm; Line (geometry); Mathematics; Wireless sensor network; Domain (mathematical analysis); Computer science; Geometry; Computer network; Mathematical analysis; Physics","score_opus":0.008442197794523045,"score_gpt":0.27682705252921863,"score_spread":0.2683848547346956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073199795","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.0120252995,0.00015938317,0.98556846,0.0011153284,0.00040541837,0.0004306698,0.00005150619,0.000017318096,0.00022663393],"genre_scores_gemma":[0.611649,0.000010297808,0.38744193,0.00018457587,0.0005654074,0.000024204239,0.000036552647,0.000009568287,0.000078488854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721324,0.00012509554,0.0011379671,0.00025210052,0.0010999608,0.00017163026],"domain_scores_gemma":[0.9933666,0.0018657045,0.001476004,0.0002540308,0.002954123,0.00008355315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013546048,0.00016053401,0.00031565866,0.0006513144,0.00015375404,0.00008503598,0.00159941,0.00005509193,0.00001645542],"category_scores_gemma":[0.00018401511,0.00013705876,0.00026293268,0.00089581555,0.00014122292,0.00035758407,0.0001670492,0.0001421393,0.000009539729],"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.000032809334,0.0002619178,0.00012563453,0.000021199612,0.00023672501,5.927103e-7,0.0001807097,0.60927993,0.0017465716,0.011649806,0.0014932831,0.37497082],"study_design_scores_gemma":[0.0014695273,0.00026470443,0.0048635225,0.00007187033,0.00005283319,0.00009053783,0.00005423696,0.9404444,0.0039441297,0.017370235,0.03115556,0.00021845072],"about_ca_topic_score_codex":0.0000046381133,"about_ca_topic_score_gemma":2.9700968e-7,"teacher_disagreement_score":0.5996237,"about_ca_system_score_codex":0.00006517913,"about_ca_system_score_gemma":0.00022840202,"threshold_uncertainty_score":0.5589094},"labels":[],"label_agreement":null},{"id":"W2074067065","doi":"10.1023/b:joco.0000038910.06360.0a","title":"Minimal Tetrahedralizations of a Class of Polyhedra","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","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 Regina","funders":"","keywords":"Polyhedron; Tetrahedron; Combinatorics; Class (philosophy); Mathematics; Dual polyhedron; Theory of computation; Euclidean space; Simple (philosophy); Graph; Discrete mathematics; Computer science; Algorithm; Geometry; Artificial intelligence","score_opus":0.009299103776380803,"score_gpt":0.2412016995222419,"score_spread":0.2319025957458611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074067065","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.024220023,0.00012142591,0.97267926,0.0004469382,0.0021117965,0.00008182998,0.0000020515229,0.000010180159,0.0003265119],"genre_scores_gemma":[0.7462502,0.00002874707,0.2535318,0.00002012514,0.00015165552,6.123881e-7,0.0000037767488,0.000004729193,0.000008337853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998528,0.00006180231,0.000737329,0.00009535939,0.0004838216,0.000093690185],"domain_scores_gemma":[0.9977073,0.00008451062,0.0008899259,0.00014763622,0.0011070285,0.00006360237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034220636,0.00008642882,0.00023976996,0.00037419322,0.000047811514,0.000033103614,0.0003495323,0.0000683043,0.000010610943],"category_scores_gemma":[0.0002216805,0.00008306023,0.000115296825,0.0009243045,0.00003782241,0.0007110875,0.000044632765,0.000082823004,6.0487827e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029808578,0.00021042633,0.00006909253,0.000012109841,0.00002256322,0.0000016690434,0.00024642862,0.76786375,0.0016614979,0.2293648,0.00005029678,0.00046754847],"study_design_scores_gemma":[0.016031452,0.005020522,0.003391161,0.00046740653,0.00020566783,0.0002669784,0.00016655542,0.58287627,0.1920783,0.19688123,0.0019065791,0.00070785143],"about_ca_topic_score_codex":0.00000481475,"about_ca_topic_score_gemma":1.7672792e-7,"teacher_disagreement_score":0.72203016,"about_ca_system_score_codex":0.000057358702,"about_ca_system_score_gemma":0.00041675204,"threshold_uncertainty_score":0.33870977},"labels":[],"label_agreement":null},{"id":"W2074320635","doi":"10.1145/1064092.1064153","title":"Animation of curve constrained drawings of planar graphs","year":2005,"lang":"en","type":"article","venue":"","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 Lethbridge","funders":"","keywords":"Animation; Computer science; Planar graph; Planar; Computer graphics (images); Enhanced Data Rates for GSM Evolution; Graph; Graph drawing; Computer animation; Combinatorics; Outerplanar graph; Line (geometry); Geometry; Mathematics; Artificial intelligence; Theoretical computer science; Line graph; Pathwidth","score_opus":0.012600476477466158,"score_gpt":0.24108019031934108,"score_spread":0.22847971384187493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074320635","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.13012841,0.000033671062,0.8621664,0.0005267956,0.000052902844,0.000059181042,0.0000022110848,0.000029531442,0.00700089],"genre_scores_gemma":[0.8415517,0.0000023595405,0.15822119,0.00007622008,0.000015365247,9.3008816e-7,0.0000054836282,0.000001017372,0.00012573731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994733,0.000018321454,0.00019963764,0.000097444936,0.00015397447,0.000057364072],"domain_scores_gemma":[0.9996097,0.000058139107,0.000093279625,0.000104838386,0.000112287016,0.00002173987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015806264,0.000041904575,0.0000775622,0.00012244411,0.000020999165,0.000010925293,0.00014431433,0.000020045863,0.0000300359],"category_scores_gemma":[0.000020181038,0.000038964467,0.00003348452,0.00031610893,0.000026238336,0.000279117,0.000017539083,0.00002062369,0.0000053934323],"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.0000030981196,0.000049506274,0.000296621,0.000011328306,0.000009027685,1.9650246e-7,0.0003276872,0.0024947813,0.0214217,0.940746,0.00058537966,0.03405466],"study_design_scores_gemma":[0.0010670571,0.00032658613,0.021499462,0.000035288107,0.000012208312,0.000022494294,0.00006616131,0.5442515,0.36993223,0.058093973,0.0044186357,0.00027437278],"about_ca_topic_score_codex":0.000009976858,"about_ca_topic_score_gemma":0.0000067770857,"teacher_disagreement_score":0.88265204,"about_ca_system_score_codex":0.000005745187,"about_ca_system_score_gemma":0.00003925164,"threshold_uncertainty_score":0.15889248},"labels":[],"label_agreement":null},{"id":"W2074574297","doi":"10.1142/s0218195905001762","title":"SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Natural Sciences and Engineering Research Council of Canada; Queen's University","funders":"","keywords":"Mathematics; Geodesic; Polygon (computer graphics); Combinatorics; Chord (peer-to-peer); Point (geometry); Path (computing); Set (abstract data type); Pairwise comparison; Algorithm; Geometry; Computer science","score_opus":0.010807649532028845,"score_gpt":0.2926302831839573,"score_spread":0.28182263365192844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074574297","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.023710165,0.0005423052,0.9697262,0.0043706526,0.00036408994,0.0002685539,0.000017882234,0.000029937924,0.0009702125],"genre_scores_gemma":[0.7763145,0.000041861353,0.22169392,0.0009355647,0.00075744465,0.00005187541,0.00005863131,0.000011935988,0.0001342741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689656,0.00008933119,0.0011077143,0.00034230287,0.0013173105,0.000246762],"domain_scores_gemma":[0.99802375,0.00041627372,0.0006655183,0.00020894867,0.0005236841,0.00016181845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072524475,0.00020491032,0.00024655153,0.0012402275,0.00011358456,0.00021616353,0.0013426497,0.000078881756,0.00009630375],"category_scores_gemma":[0.000059219692,0.00021788555,0.0001750126,0.0009512628,0.000054470656,0.0013903194,0.0002105044,0.00031842568,0.00014704296],"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.000028307248,0.00053154386,0.0010030842,0.0000049146533,0.00011252902,0.000018834717,0.00020610276,0.7062456,0.000584099,0.054105174,0.0006213049,0.23653853],"study_design_scores_gemma":[0.004417719,0.00026420248,0.053145118,0.000114107905,0.00003930346,0.0016903902,0.00013026196,0.40756214,0.0026445466,0.159029,0.37000015,0.0009630382],"about_ca_topic_score_codex":0.000003688272,"about_ca_topic_score_gemma":0.0000041727785,"teacher_disagreement_score":0.7526043,"about_ca_system_score_codex":0.00036097897,"about_ca_system_score_gemma":0.00027884459,"threshold_uncertainty_score":0.88851154},"labels":[],"label_agreement":null},{"id":"W2074682596","doi":"10.1007/s00454-009-9204-0","title":"Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"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; U.S. Department of Energy","keywords":"Mathematics; Shortest path problem; Combinatorics; Logarithm; Euclidean geometry; Data structure; Graph; Range (aeronautics); Discrete mathematics; Algorithm; Computer science","score_opus":0.019290037217268973,"score_gpt":0.28079750833709416,"score_spread":0.2615074711198252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074682596","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.08329514,0.00028309325,0.91181815,0.0024525153,0.00057832914,0.00047671798,0.00010044375,0.00030941173,0.00068623305],"genre_scores_gemma":[0.777102,0.000009116568,0.2204607,0.0012663605,0.00027099584,0.000035285277,0.0006195717,0.000015448171,0.00022054577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973982,0.000076105156,0.0005037196,0.0007699732,0.0007670038,0.0004850022],"domain_scores_gemma":[0.9984001,0.000499017,0.00019944612,0.00034814872,0.00036342873,0.00018984351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040198484,0.00034939562,0.00032657254,0.0004939637,0.0004525904,0.00039984728,0.0006284631,0.00010707005,0.000025272539],"category_scores_gemma":[0.00008369046,0.00033055764,0.00019845826,0.0012693678,0.0000623309,0.0007433921,0.00008655916,0.00017097346,0.000040195104],"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.00010595433,0.0003598758,0.0002662042,0.000022830309,0.00008021801,0.00001808674,0.00032563243,0.38876978,0.00034585572,0.4957277,0.0021745916,0.11180331],"study_design_scores_gemma":[0.0007156544,0.0006349743,0.024502374,0.0000302404,0.000012917341,0.000025777634,0.000029642446,0.86759126,0.0006169261,0.10350938,0.0018726097,0.00045824336],"about_ca_topic_score_codex":0.0000059131735,"about_ca_topic_score_gemma":9.544748e-7,"teacher_disagreement_score":0.6938068,"about_ca_system_score_codex":0.00007741091,"about_ca_system_score_gemma":0.00016109487,"threshold_uncertainty_score":0.99991465},"labels":[],"label_agreement":null},{"id":"W2075904003","doi":"10.1080/03081080701616672","title":"Critical sets of inertias for matrix patterns","year":2008,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"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 Victoria","funders":"","keywords":"Zero (linguistics); Mathematics; Sign (mathematics); Order (exchange); Combinatorics; Set (abstract data type); Matrix (chemical analysis); Pure mathematics; Mathematical analysis; Computer science","score_opus":0.029590431395079088,"score_gpt":0.3222916501112252,"score_spread":0.29270121871614607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075904003","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.40802658,0.00017280775,0.59111035,0.00031719144,0.00016701223,0.000116363764,0.000020555339,0.000038845545,0.00003029154],"genre_scores_gemma":[0.8517871,0.00003362791,0.14770523,0.00014766087,0.00013182896,0.000009363681,0.000020363803,0.000006093303,0.00015873816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992438,0.000023046228,0.0002205945,0.00022787573,0.00014120285,0.00014350316],"domain_scores_gemma":[0.99928826,0.00024362042,0.00003789498,0.00016613009,0.00018472965,0.00007938928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117478434,0.000090685986,0.00014020863,0.00007978391,0.000103141036,0.000017254419,0.00014747996,0.00005096174,0.00000906104],"category_scores_gemma":[0.00018329473,0.00008304245,0.000060240178,0.00013110743,0.00004797249,0.00019791214,0.000075866665,0.000055735025,0.000006416047],"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.00060499343,0.0028475157,0.038365524,0.0019966543,0.00036110988,0.00015769014,0.013137977,0.015078119,0.05622527,0.43224192,0.008414081,0.43056914],"study_design_scores_gemma":[0.000808109,0.00018885278,0.010248225,0.000016457792,0.000010201163,0.000061700935,0.000014855082,0.96030337,0.023569738,0.0012282014,0.0033798688,0.00017041096],"about_ca_topic_score_codex":0.000011722261,"about_ca_topic_score_gemma":0.0000022124934,"teacher_disagreement_score":0.94522524,"about_ca_system_score_codex":0.000004351935,"about_ca_system_score_gemma":0.000041781368,"threshold_uncertainty_score":0.33863726},"labels":[],"label_agreement":null},{"id":"W2075918368","doi":"10.14288/1.0073373","title":"Anisotropic mesh adaptation : recovering quasi-structured meshes","year":2012,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polygon mesh; Adaptation (eye); Computer science; Geology; Computer graphics (images); Physics; Optics","score_opus":0.012906928425280986,"score_gpt":0.18158000371001304,"score_spread":0.16867307528473205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075918368","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.62599754,0.0001510138,0.37293854,0.000059657206,0.0003380264,0.000079839614,0.000010387713,0.000065876455,0.00035908623],"genre_scores_gemma":[0.9641915,0.000042176853,0.03533298,0.00003652715,0.000069929934,3.1441553e-7,0.000016648793,0.0000046179834,0.00030533536],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99916524,0.000057955935,0.00010166711,0.00023328846,0.00023705931,0.00020482052],"domain_scores_gemma":[0.999417,0.000040318835,0.000106618805,0.00020224873,0.00012989235,0.00010388587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015611197,0.000036398465,0.00013430825,0.00005409507,0.00021225207,0.0001161447,0.00033157572,0.000060303053,0.000046304758],"category_scores_gemma":[0.000023512812,0.0001276852,0.00007152263,0.00038694998,0.00004241244,0.001290544,0.00012451278,0.00006797595,0.000018424684],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030118724,0.00007913641,0.0040438445,0.000024371351,0.000024210329,0.000009124736,0.0007828275,0.00051010214,0.0006012262,0.00030298985,0.0010922351,0.99252695],"study_design_scores_gemma":[0.00037694644,0.000059474514,0.97781205,0.000025447927,0.0000121447065,0.00004645985,0.00033826695,0.018779425,0.000012482381,0.0012062283,0.00117665,0.00015439324],"about_ca_topic_score_codex":0.0072618034,"about_ca_topic_score_gemma":0.02129936,"teacher_disagreement_score":0.9923725,"about_ca_system_score_codex":0.000058121397,"about_ca_system_score_gemma":0.000060991028,"threshold_uncertainty_score":0.99934894},"labels":[],"label_agreement":null},{"id":"W2076089605","doi":"10.1145/1542362.1542376","title":"Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection","year":2009,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Convex hull; Regular polygon; Hull; Algorithm; Convex combination; Orthogonal convex hull; Computer science; Combinatorics; Mathematics; Convex optimization; Convex body; Geometry; Materials science; Engineering; Transport engineering","score_opus":0.01669784383273594,"score_gpt":0.27187989581793687,"score_spread":0.25518205198520094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076089605","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.08706013,0.000032257,0.9107461,0.0013388557,0.00018937455,0.0001607343,4.970771e-7,0.00003627065,0.00043576912],"genre_scores_gemma":[0.7378827,0.000006039788,0.26082653,0.0006102422,0.000057989597,0.000010140598,0.0000047397275,0.000001409033,0.00060024945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951077,0.000013198096,0.00011016919,0.00019012822,0.00007742712,0.00009831544],"domain_scores_gemma":[0.9997875,0.00004483006,0.000022611504,0.00007127323,0.000039648028,0.00003413607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016970327,0.00005569484,0.0000631584,0.00009723487,0.000042689568,0.00007277361,0.000080742175,0.000023620865,0.000006027275],"category_scores_gemma":[0.000010009175,0.00005293244,0.000017117893,0.00015318963,0.000006060953,0.00025691692,0.000023781991,0.000031593823,0.0000033526583],"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.000048730042,0.00021726721,0.00009665201,0.000015358766,0.000014753947,0.000005229696,0.0019002432,0.060357507,0.007428747,0.14459924,0.0039328476,0.78138345],"study_design_scores_gemma":[0.0005989609,0.00032982536,0.0031065438,0.0000063722596,0.0000016019134,0.000016214684,0.000055139986,0.9834031,0.007805978,0.0026547245,0.0019183084,0.000103253784],"about_ca_topic_score_codex":0.0000043434457,"about_ca_topic_score_gemma":0.0000044671165,"teacher_disagreement_score":0.9230456,"about_ca_system_score_codex":0.000029123434,"about_ca_system_score_gemma":0.0000207768,"threshold_uncertainty_score":0.21585222},"labels":[],"label_agreement":null},{"id":"W2076184010","doi":"10.1115/detc2002/mech-34270","title":"A Numerically Robust Algorithm to Solve the Five-Pose Burmester Problem","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Robustness (evolution); Gravitational singularity; Algorithm; Computer science; Planar; Mathematics; Mathematical optimization","score_opus":0.02076092075006824,"score_gpt":0.21781677270768332,"score_spread":0.19705585195761507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076184010","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.00052303803,0.000048861635,0.9772669,0.012416782,0.00023783582,0.00023229001,8.747069e-7,0.000107596774,0.009165807],"genre_scores_gemma":[0.017613709,0.000006262053,0.96215767,0.0065475353,0.0002569575,0.000046022542,0.0000023529058,0.0000064335604,0.013363034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990489,0.000029427565,0.00016293088,0.00028772178,0.00026749648,0.00020353515],"domain_scores_gemma":[0.9993668,0.00008300499,0.00003316171,0.00030527922,0.00011456721,0.00009719315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016123604,0.00009915061,0.00007982825,0.000068211666,0.00016518995,0.00023862705,0.0005237812,0.000026620064,0.00021000313],"category_scores_gemma":[0.000017022172,0.00006512989,0.000047653397,0.0006524684,0.000014900725,0.00029094805,0.00018982725,0.000075985496,0.0006217024],"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.0000015702853,0.00012895286,0.000010434421,0.0000032762396,0.000017378268,0.000008822222,0.0016300873,0.04828906,0.00021620726,0.031588007,0.09490606,0.82320017],"study_design_scores_gemma":[0.00015206981,0.00012422001,0.0003939215,0.000004901631,0.0000032130506,0.00003251814,0.000021343858,0.9389041,0.00031998876,0.0022179582,0.05766915,0.00015660978],"about_ca_topic_score_codex":0.000014375706,"about_ca_topic_score_gemma":0.0000048691413,"teacher_disagreement_score":0.89061505,"about_ca_system_score_codex":0.000021524169,"about_ca_system_score_gemma":0.00001950724,"threshold_uncertainty_score":0.7990934},"labels":[],"label_agreement":null},{"id":"W2076832715","doi":"10.1145/1998196.1998254","title":"Kinetic mesh refinement in 2D","year":2011,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Autodesk (Canada)","funders":"","keywords":"Delaunay triangulation; Polygon mesh; Degree (music); Mathematics; Algebraic number; Triangulation; Planar; Point (geometry); Combinatorics; Computation; Binary logarithm; Algorithm; Computer science; Geometry; Mathematical analysis; Physics; Computer graphics (images)","score_opus":0.039342518133745674,"score_gpt":0.23793783686171602,"score_spread":0.19859531872797034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076832715","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.04860416,0.00003824227,0.8574993,0.00034516896,0.00023377084,0.00007339754,1.1005213e-7,0.000062616324,0.09314324],"genre_scores_gemma":[0.8831972,0.000003391922,0.11525224,0.00036609723,0.000018360473,0.0000067609963,0.0000010423385,0.0000011935108,0.0011537025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995638,0.000016079863,0.00010396865,0.00013490628,0.00009663437,0.00008460825],"domain_scores_gemma":[0.9997854,0.000011785136,0.000015316979,0.0001377147,0.000023788873,0.000025982865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010967434,0.000039091476,0.00003915415,0.00009456515,0.000016343978,0.000017007987,0.00018179808,0.000013012963,0.0002024698],"category_scores_gemma":[0.000007674126,0.00003451183,0.000012797823,0.0002895874,0.000004568732,0.00012379185,0.00006370298,0.00002637584,0.000085386746],"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.0000029828036,0.00011494723,0.0009190226,0.000003486124,0.0000032454438,0.0000094331335,0.00078180624,0.00042808978,0.00065781357,0.8982389,0.0018823153,0.09695794],"study_design_scores_gemma":[0.001557331,0.00046118096,0.41052473,0.000027488037,0.000005716174,0.000031301704,0.00006998131,0.38923737,0.041556805,0.109224334,0.046651855,0.0006519083],"about_ca_topic_score_codex":0.00005214722,"about_ca_topic_score_gemma":0.00004399552,"teacher_disagreement_score":0.83459306,"about_ca_system_score_codex":0.0000120107625,"about_ca_system_score_gemma":0.000018713112,"threshold_uncertainty_score":0.22169024},"labels":[],"label_agreement":null},{"id":"W2077000739","doi":"10.1016/j.jcss.2010.06.002","title":"Errors in graph embedding algorithms","year":2010,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Victoria","funders":"","keywords":"Planarity testing; Embedding; Algorithm; Computer science; Graph; Graph embedding; Torus; Genus; Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.01633444415429612,"score_gpt":0.2792815978192382,"score_spread":0.2629471536649421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077000739","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.3423549,0.00019535165,0.6550471,0.00023399333,0.001900771,0.000032917982,1.3896877e-7,0.000010170958,0.00022467235],"genre_scores_gemma":[0.76170594,0.000007826035,0.23798195,0.00004501932,0.00025259214,4.3807884e-7,5.6540365e-8,0.0000011129935,0.0000050856856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988836,0.00006397641,0.0003756347,0.00016318509,0.00037573001,0.0001378524],"domain_scores_gemma":[0.9993951,0.00011518417,0.00020510724,0.00008299864,0.000118448705,0.000083185965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016539149,0.00007485924,0.00016432056,0.00047781478,0.00013945147,0.00028164932,0.00049555156,0.000032378044,0.000001252681],"category_scores_gemma":[0.000008111519,0.000055237706,0.000048565867,0.0006705624,0.00006338134,0.0007840469,0.000079653735,0.00015481269,0.0000013487983],"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.0000143626485,0.00017722431,0.01245898,0.0001031392,0.000036000507,0.00023211633,0.0047049113,0.09704285,0.006137248,0.34840202,0.0015965072,0.52909464],"study_design_scores_gemma":[0.0004108324,0.00025057612,0.016209885,0.000098474935,0.000002402453,0.0014631156,0.0001478112,0.97699344,0.00036281304,0.0028501984,0.00106562,0.0001448148],"about_ca_topic_score_codex":0.000004126459,"about_ca_topic_score_gemma":0.000003903838,"teacher_disagreement_score":0.8799506,"about_ca_system_score_codex":0.00001042753,"about_ca_system_score_gemma":0.00007978114,"threshold_uncertainty_score":0.2715951},"labels":[],"label_agreement":null},{"id":"W2077647361","doi":"10.1007/s00010-014-0271-9","title":"Spindle starshaped sets","year":2014,"lang":"la","type":"article","venue":"Aequationes Mathematicae","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 Calgary","funders":"","keywords":"Normalization (sociology); Subfamily; Mathematics; Focus (optics); Chemistry","score_opus":0.02708654873179604,"score_gpt":0.26766858649611946,"score_spread":0.24058203776432344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077647361","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.038598962,0.00019579462,0.9488842,0.0026325977,0.00090529706,0.00041084504,0.0000069817047,0.0001721816,0.008193133],"genre_scores_gemma":[0.88659483,0.000017795264,0.109869055,0.00072097004,0.00037843946,0.000040311726,0.00005861304,0.00002676666,0.0022932193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971817,0.00028154074,0.0007231835,0.0005921505,0.0008079761,0.0004134359],"domain_scores_gemma":[0.9975133,0.0008060592,0.0003688919,0.00077325717,0.00034880833,0.00018966518],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012808668,0.00031196862,0.00036840548,0.00024316582,0.00036649944,0.00047355174,0.00065733626,0.00013282262,0.0005655038],"category_scores_gemma":[0.0007090849,0.00031117507,0.00014322656,0.0008304112,0.00006912907,0.000722209,0.00021813033,0.0001640037,0.004164796],"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.000009103598,0.00033536565,0.00003088853,0.0002253199,0.00005743378,0.000002632407,0.001997109,0.0037083286,0.0006908657,0.9001915,0.0021013962,0.09065007],"study_design_scores_gemma":[0.0004659895,0.00015614649,0.0015932618,0.000115047005,0.000043362536,0.000021252245,0.0000416521,0.8062567,0.0007521599,0.18295832,0.007218758,0.00037735884],"about_ca_topic_score_codex":0.000009920293,"about_ca_topic_score_gemma":0.000008517256,"teacher_disagreement_score":0.8479959,"about_ca_system_score_codex":0.00006161818,"about_ca_system_score_gemma":0.00014901921,"threshold_uncertainty_score":0.999934},"labels":[],"label_agreement":null},{"id":"W2077734616","doi":"10.1007/s10107-010-0378-2","title":"Separation, dimension, and facet algorithms for node flow polyhedra","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","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 British Columbia","funders":"","keywords":"Polyhedron; Cutting-plane method; Ball (mathematics); Flow network; Mathematics; Mathematical optimization; Algorithm; Computer science; Integer programming; Combinatorics; Geometry","score_opus":0.02201792622503246,"score_gpt":0.3070329254117051,"score_spread":0.28501499918667267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077734616","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.015225799,0.00003217227,0.98253226,0.001276831,0.00022216912,0.00039615677,0.0000015972383,0.00013391637,0.00017910714],"genre_scores_gemma":[0.15709856,7.3040746e-7,0.8423441,0.0001401125,0.00011611819,0.000080036174,0.000010843668,0.000006095451,0.00020342247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908406,0.00001576338,0.00022735202,0.0002775284,0.00018663463,0.00020868368],"domain_scores_gemma":[0.9992781,0.00022967653,0.00005209135,0.00021320954,0.00011865423,0.00010822159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039532216,0.00010937279,0.00013066319,0.00006319125,0.00020984423,0.0002829877,0.00017034213,0.00006225108,0.000012189444],"category_scores_gemma":[0.00027147777,0.0000942894,0.000042451884,0.00018712517,0.00004009744,0.00028319773,0.000089847716,0.00009903289,0.00002239868],"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.0000034381683,0.00014736886,0.000027834794,0.000098006945,0.00001688394,0.0000018877494,0.0007072516,0.00029351056,0.0055600684,0.504317,0.00053545466,0.4882913],"study_design_scores_gemma":[0.00031589688,0.000067592446,0.00010539158,0.000013582233,0.000009378342,0.0000418517,0.000016474854,0.9084463,0.0025534567,0.07588103,0.012377805,0.00017121986],"about_ca_topic_score_codex":8.19387e-7,"about_ca_topic_score_gemma":0.0000027312467,"teacher_disagreement_score":0.9081528,"about_ca_system_score_codex":0.0000066761086,"about_ca_system_score_gemma":0.00003402743,"threshold_uncertainty_score":0.38450098},"labels":[],"label_agreement":null},{"id":"W2077735330","doi":"10.1007/s00454-012-9417-5","title":"Approximation Algorithms for Maximum Independent Set of Pseudo-Disks","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":131,"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; Rounding; Approximation algorithm; Set (abstract data type); Independent set; Combinatorics; Algorithm; Plane (geometry); Relaxation (psychology); Linear programming relaxation; Set packing; Discrete mathematics; Linear programming; Computer science; Geometry; Graph","score_opus":0.03693149263006409,"score_gpt":0.3046274523030603,"score_spread":0.26769595967299625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077735330","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.057258062,0.00029114884,0.9401873,0.00037751344,0.0007908574,0.00047069555,0.00009903681,0.00009737421,0.00042801813],"genre_scores_gemma":[0.71333545,0.0000034992643,0.2854778,0.00013834477,0.00034736923,0.00006132437,0.00053637155,0.000014003606,0.00008585753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976764,0.00010269696,0.00058743573,0.00041077094,0.00079442473,0.00042828688],"domain_scores_gemma":[0.9981891,0.0005259772,0.00033822315,0.0003035757,0.00045599465,0.00018714409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010389249,0.0002331537,0.00028064178,0.0005396499,0.00019753608,0.0001034493,0.000517706,0.00011124388,0.000037926267],"category_scores_gemma":[0.00014539271,0.00023557997,0.00019187115,0.0011008914,0.00005392835,0.0011208394,0.00019510994,0.00012957712,0.000034718443],"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.00007590061,0.00044615322,0.004295509,0.00026272843,0.00023534145,0.0000017712946,0.0019196062,0.34869173,0.0013061905,0.45431253,0.0021805384,0.18627201],"study_design_scores_gemma":[0.001134962,0.00017153686,0.03629968,0.000029297156,0.00003353482,0.000042029456,0.00012146624,0.8761309,0.0029537163,0.080277115,0.0023388292,0.0004669389],"about_ca_topic_score_codex":0.00000891499,"about_ca_topic_score_gemma":6.1697176e-7,"teacher_disagreement_score":0.6560774,"about_ca_system_score_codex":0.00007647603,"about_ca_system_score_gemma":0.00012610329,"threshold_uncertainty_score":0.9606672},"labels":[],"label_agreement":null},{"id":"W2078355120","doi":"10.1007/s00454-011-9388-y","title":"Matroid Enumeration for Incidence Geometry","year":2011,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":45,"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":"Matroid; Combinatorics; Mathematics; Oriented matroid; Hyperplane; Graphic matroid; Enumeration; Rank (graph theory); Discrete mathematics; Discrete geometry; Antipodal point; Incidence (geometry); Geometry","score_opus":0.028588883420126835,"score_gpt":0.26595618511322267,"score_spread":0.23736730169309583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078355120","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.058838524,0.0002803628,0.93751186,0.00035413358,0.0007971075,0.00048158795,0.00004243202,0.00026030463,0.0014336902],"genre_scores_gemma":[0.67295647,0.000006353452,0.3255861,0.0006066659,0.00021596524,0.000089731555,0.0002480853,0.000018943963,0.00027167055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973693,0.00008711159,0.0006032343,0.0007709532,0.0007071599,0.00046228015],"domain_scores_gemma":[0.99805874,0.00043841437,0.00027283025,0.00043327885,0.0005927487,0.00020396327],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006368966,0.0003070738,0.00028378176,0.00077856105,0.00043189467,0.0002451678,0.00085537357,0.00012309942,0.00013505825],"category_scores_gemma":[0.00022085501,0.00032159218,0.00021587957,0.0017316609,0.000071253926,0.0013767048,0.00023819879,0.00017361932,0.00016797769],"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.00010976992,0.0003108701,0.0030814144,0.000100589124,0.0001545002,0.000016493186,0.0013090136,0.09065184,0.0008958572,0.8452475,0.0035923251,0.054529853],"study_design_scores_gemma":[0.0014180307,0.0005182626,0.07986579,0.000045973422,0.00004350818,0.00010589046,0.000091180504,0.65404886,0.0037264004,0.25398302,0.0051627373,0.0009903385],"about_ca_topic_score_codex":0.000023132536,"about_ca_topic_score_gemma":0.0000040327745,"teacher_disagreement_score":0.6141179,"about_ca_system_score_codex":0.00009409517,"about_ca_system_score_gemma":0.00021535116,"threshold_uncertainty_score":0.9999236},"labels":[],"label_agreement":null},{"id":"W2078615143","doi":"10.5555/1109557.1109689","title":"A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":31,"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":"Combinatorics; Convex hull; Amortized analysis; Regular polygon; Set (abstract data type); Mathematics; Computational geometry; Euclidean geometry; Point (geometry); Data structure; k-nearest neighbors algorithm; Computer science; Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.011868978540492582,"score_gpt":0.2646139178492995,"score_spread":0.2527449393088069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078615143","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.020233653,0.00045968455,0.9701172,0.006273831,0.00089856755,0.000627517,0.00063777633,0.0001711802,0.0005805661],"genre_scores_gemma":[0.81321245,0.0000456563,0.18268225,0.00059771683,0.00043428873,0.000041421932,0.0017319907,0.000028911003,0.0012253219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985582,0.000040125495,0.00023138677,0.0006566965,0.00025365653,0.00025993236],"domain_scores_gemma":[0.9989111,0.00014916493,0.000094089344,0.00068254705,0.00008677769,0.00007631455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014759427,0.00019458911,0.00018066716,0.000106185944,0.00024070227,0.00035853448,0.0005726254,0.000075412674,0.000009709413],"category_scores_gemma":[0.000021816517,0.00017263158,0.000037405604,0.0002469816,0.00007002068,0.00063681067,0.00028382064,0.00009120651,0.0000073515253],"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.00023702932,0.00033035467,0.0006549897,0.00032721355,0.00023930556,0.00005542524,0.0010059478,0.041715957,0.06912417,0.68695855,0.01860535,0.18074569],"study_design_scores_gemma":[0.00071788975,0.0002437488,0.003482986,0.000019880621,0.000018037344,0.000026242515,0.000016926686,0.9579796,0.0020708852,0.018882912,0.016214203,0.0003266611],"about_ca_topic_score_codex":0.00004948521,"about_ca_topic_score_gemma":0.00006130925,"teacher_disagreement_score":0.9162637,"about_ca_system_score_codex":0.000027450245,"about_ca_system_score_gemma":0.00007565704,"threshold_uncertainty_score":0.7039712},"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":"W2079484424","doi":"10.1002/nme.682","title":"Coarsening unstructured meshes by edge contraction","year":2003,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":35,"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 British Columbia","funders":"","keywords":"Polygon mesh; Vertex (graph theory); Edge contraction; Volume mesh; Isotropy; Anisotropy; Geometry; Contraction (grammar); Topology (electrical circuits); Mathematics; Computer science; Algorithm; Mesh generation; Combinatorics; Finite element method; Physics; Optics","score_opus":0.019249156678351045,"score_gpt":0.3630718741867319,"score_spread":0.3438227175083809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079484424","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.0011645856,0.00028984778,0.9916017,0.00042099803,0.006267301,0.00008383027,0.00000245387,0.00004537783,0.00012392372],"genre_scores_gemma":[0.12457297,0.000020496078,0.87497145,0.0001254727,0.0002130838,0.000014032724,0.000004495345,0.000010420693,0.00006756268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885625,0.000117460455,0.00036043173,0.00019790315,0.0002693021,0.0001986704],"domain_scores_gemma":[0.9989074,0.0006166247,0.000116787225,0.00008073115,0.00018886314,0.000089612826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091014773,0.00012115336,0.00015082328,0.0002472223,0.000066385684,0.0002071081,0.00037608933,0.000058350477,0.0000145953845],"category_scores_gemma":[0.0011779701,0.00012110143,0.00009318211,0.00027441906,0.0000075326307,0.00049891905,0.000028648494,0.00025202654,0.0000015015763],"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.00003270119,0.00008874932,0.00017931414,0.000011222462,0.00012760768,0.000023572084,0.00023853163,0.46518782,0.08305493,0.10731873,0.0014016167,0.3423352],"study_design_scores_gemma":[0.00084586383,0.000055187393,0.00023164199,0.00003084135,0.000005904508,0.00047807107,0.000017479739,0.80291253,0.041913565,0.013933208,0.13933603,0.00023965427],"about_ca_topic_score_codex":0.0000020294588,"about_ca_topic_score_gemma":1.512903e-7,"teacher_disagreement_score":0.34209555,"about_ca_system_score_codex":0.0001603087,"about_ca_system_score_gemma":0.0000457082,"threshold_uncertainty_score":0.4938373},"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":"W2081749768","doi":"10.1016/j.jctb.2014.07.005","title":"Graph layouts via layered separators","year":2014,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Queue; Book embedding; Discrete mathematics; Graph; Outerplanar graph; Partition (number theory); Line graph; Computer science; Voltage graph; Pathwidth","score_opus":0.00949178050449383,"score_gpt":0.24723880492290773,"score_spread":0.2377470244184139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081749768","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.0549991,0.0007525885,0.8944333,0.00061085925,0.047299266,0.00021647294,0.0000058724027,0.0000875282,0.0015950244],"genre_scores_gemma":[0.9865125,0.00007199481,0.010047121,0.0001980027,0.0028682998,0.0000063075086,0.000009917333,0.000022375127,0.00026352718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969323,0.0007329142,0.0009360702,0.00033826253,0.0007949748,0.0002654744],"domain_scores_gemma":[0.99654263,0.000349525,0.0013609835,0.00060152885,0.00093233056,0.00021301808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024052034,0.00034466115,0.00067078636,0.00046327547,0.00016952498,0.00039414005,0.0016128336,0.0003157386,0.000035031284],"category_scores_gemma":[0.00026332145,0.0003124347,0.0004281839,0.00041071678,0.00008535433,0.0007132642,0.00072539557,0.0008304388,0.000015679418],"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.0003374002,0.00015383928,0.000028789507,0.00006275427,0.00024202932,0.00004416795,0.00057147694,0.023489831,0.00041216714,0.9650147,0.003336574,0.006306295],"study_design_scores_gemma":[0.0007610583,0.00048135943,0.000110841116,0.000087377455,0.000042758275,0.00014438172,0.000015428686,0.0014327733,0.0033695726,0.97357726,0.019646073,0.00033109295],"about_ca_topic_score_codex":0.0000018776046,"about_ca_topic_score_gemma":4.6534385e-7,"teacher_disagreement_score":0.93151337,"about_ca_system_score_codex":0.000092933384,"about_ca_system_score_gemma":0.00047717837,"threshold_uncertainty_score":0.99993277},"labels":[],"label_agreement":null},{"id":"W2081999587","doi":"10.1080/16864360.2004.10738261","title":"A New Paradigm for Woodworking with NC Machines","year":2004,"lang":"en","type":"article","venue":"Computer-Aided Design and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Woodworking; Computer science; Manufacturing engineering; Engineering; Mechanical engineering","score_opus":0.024291510475545345,"score_gpt":0.2526088694134431,"score_spread":0.22831735893789779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081999587","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.00028826875,0.0002663546,0.9960111,0.0022675039,0.00006958985,0.0008616771,0.0000015484403,0.0001775604,0.000056424284],"genre_scores_gemma":[0.049793083,0.0000146650345,0.9486992,0.00065129116,0.00044892402,0.00028234185,0.00001575366,0.0000100239395,0.00008473881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909025,0.000021364967,0.0001734452,0.00041076692,0.00012306435,0.00018110104],"domain_scores_gemma":[0.99917674,0.00025679928,0.00007651891,0.00029007092,0.000059224494,0.00014063396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013379734,0.00014211005,0.00013212477,0.0001101374,0.00030584948,0.00023305506,0.00031376915,0.000038635964,0.0000013850135],"category_scores_gemma":[0.000004089217,0.00012542092,0.00003584732,0.00048035858,0.00002298612,0.00024880355,0.00006482028,0.00006009624,0.00000902803],"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.000010391933,0.000058218146,0.000012904175,0.000011040707,0.000018882934,9.2541546e-7,0.0001163166,0.088093884,0.00020619553,0.53412265,0.0009681074,0.3763805],"study_design_scores_gemma":[0.0021063066,0.0004324502,0.0009852597,0.000054923403,0.000028846505,0.00010209448,0.000003344442,0.49969667,0.0014060079,0.43824598,0.056470163,0.00046793462],"about_ca_topic_score_codex":0.000008781371,"about_ca_topic_score_gemma":0.0000028270433,"teacher_disagreement_score":0.4116028,"about_ca_system_score_codex":0.000024334242,"about_ca_system_score_gemma":0.0001616924,"threshold_uncertainty_score":0.51145166},"labels":[],"label_agreement":null},{"id":"W2082176820","doi":"10.1145/2261250.2261269","title":"How to walk your dog in the mountains with no magic leash","year":2012,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"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 Alberta","funders":"","keywords":"Euclidean geometry; MAGIC (telescope); Boundary (topology); Euclidean distance; Mathematics; Plane (geometry); Computational geometry; Combinatorics; Computer science; Approximation algorithm; Geometry; Computer graphics (images); Mathematical analysis; Physics","score_opus":0.0233052703335793,"score_gpt":0.2557827519500462,"score_spread":0.2324774816164669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082176820","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.15459229,0.000041212126,0.8194549,0.011596452,0.00021797098,0.00018818464,4.6499787e-7,0.000040714887,0.013867827],"genre_scores_gemma":[0.95607764,9.674492e-7,0.03621438,0.0027244189,0.00020084255,0.0000110633155,0.0000021414003,0.0000024086596,0.0047661564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934435,0.000041728847,0.000061648796,0.00013289199,0.00023269485,0.00018666993],"domain_scores_gemma":[0.9996161,0.000043646865,0.000017169468,0.00020882724,0.00005751751,0.000056756024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002822725,0.00006562593,0.00005011575,0.00008179936,0.000051403582,0.00019907932,0.0003411262,0.000015638901,0.0000150683945],"category_scores_gemma":[0.00001943885,0.00003800272,0.00001446805,0.0005322247,0.0000072041976,0.0005385577,0.00006200178,0.000055936038,0.00018308585],"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.00002333392,0.0004731053,0.022612609,0.000018112221,0.000020887894,0.000016041131,0.008970975,0.010464304,0.0019477711,0.8603452,0.026590008,0.06851767],"study_design_scores_gemma":[0.0013967048,0.00072802947,0.41342872,0.000030225277,0.0000137346515,0.0002072873,0.0013144036,0.1075137,0.0037178674,0.0050665555,0.46563244,0.0009503231],"about_ca_topic_score_codex":0.000021985736,"about_ca_topic_score_gemma":0.000038491107,"teacher_disagreement_score":0.8552786,"about_ca_system_score_codex":0.000022710925,"about_ca_system_score_gemma":0.000026357924,"threshold_uncertainty_score":0.23532593},"labels":[],"label_agreement":null},{"id":"W2082384308","doi":"10.1016/j.ejc.2008.12.006","title":"Symmetric matroid polytopes and their generation","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","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":"University of New Brunswick","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Polytope; Oriented matroid; Graphic matroid","score_opus":0.015182541598251557,"score_gpt":0.21102666050188307,"score_spread":0.19584411890363151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082384308","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.2325685,0.0021874483,0.76005304,0.001463888,0.00080397655,0.000039025526,3.425404e-7,0.000023954874,0.002859853],"genre_scores_gemma":[0.992404,0.00014720914,0.0067016655,0.00035698875,0.00028814192,6.314646e-8,9.0242185e-7,0.000004640036,0.000096429736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907166,0.00021298528,0.00030285126,0.000109025976,0.000200958,0.000102541286],"domain_scores_gemma":[0.99926376,0.000048174283,0.00022833022,0.00012774351,0.00023574136,0.00009622295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082571735,0.00009158736,0.000121032004,0.00029802773,0.00010203679,0.00018928871,0.0003191034,0.00001225267,0.0000016132977],"category_scores_gemma":[0.00007353831,0.00007290232,0.00004926196,0.00059695414,0.000009708753,0.00046675786,0.000044992907,0.0001232696,0.0000063972466],"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.000009296413,0.0001792154,0.00015194861,0.000005310891,0.000024295128,0.00009024989,0.00055072276,0.0012147742,0.010733459,0.53021127,0.004469768,0.4523597],"study_design_scores_gemma":[0.008551789,0.012120686,0.24497545,0.00017597029,0.00008985826,0.0053481734,0.00018137015,0.2311988,0.057208035,0.27074173,0.16740909,0.001999038],"about_ca_topic_score_codex":9.819903e-8,"about_ca_topic_score_gemma":3.3424957e-8,"teacher_disagreement_score":0.7598355,"about_ca_system_score_codex":0.00002367282,"about_ca_system_score_gemma":0.00003727218,"threshold_uncertainty_score":0.29728705},"labels":[],"label_agreement":null},{"id":"W2082803170","doi":"10.1007/s00453-008-9234-7","title":"Dynamic Connectivity for Axis-Parallel Rectangles","year":2008,"lang":"en","type":"article","venue":"Algorithmica","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 Waterloo","funders":"","keywords":"Combinatorics; Intersection (aeronautics); Theory of computation; Amortized analysis; Matrix multiplication; Mathematics; Graph; Multiplication (music); Data structure; Range (aeronautics); Computer science; Discrete mathematics; Algorithm; Physics","score_opus":0.02008169411881673,"score_gpt":0.2563268051233751,"score_spread":0.23624511100455836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082803170","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.045927383,0.00012170502,0.9518527,0.00092373125,0.00041369977,0.00019999767,0.0000069410316,0.00013679966,0.00041704922],"genre_scores_gemma":[0.5636835,0.000014911688,0.43533245,0.00021386973,0.00008718611,0.00004436411,0.00001932175,0.0000058845976,0.00059854065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920964,0.000031407068,0.00013228318,0.00029759348,0.00014871066,0.00018034888],"domain_scores_gemma":[0.9993538,0.00021636942,0.000049841823,0.0002212626,0.00010121228,0.000057464462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013727442,0.00009331671,0.000112109214,0.000084087136,0.00024319482,0.000033517153,0.00028495624,0.000042948068,0.0000062159434],"category_scores_gemma":[0.000064175125,0.00009388308,0.00006975027,0.00027547503,0.000029503937,0.00027626762,0.000061837534,0.000054747183,0.000032049044],"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.00005227604,0.00041590212,0.00015170185,0.000032391912,0.00010547735,0.00004738918,0.0013275134,0.010646863,0.005064998,0.14332497,0.013220144,0.82561034],"study_design_scores_gemma":[0.000570543,0.00020252175,0.003177007,0.0000046907326,0.0000045017473,0.00012838775,0.000006912997,0.9570821,0.0022559084,0.023337482,0.01300385,0.00022609989],"about_ca_topic_score_codex":0.0000070073665,"about_ca_topic_score_gemma":0.0000062748877,"teacher_disagreement_score":0.9464352,"about_ca_system_score_codex":0.000039005838,"about_ca_system_score_gemma":0.000082254315,"threshold_uncertainty_score":0.3828441},"labels":[],"label_agreement":null},{"id":"W2083035285","doi":"10.1007/11618058_8","title":"Drawing K n in Three Dimensions with One Bend Per Edge","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Lethbridge","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Geometry; Mathematics; Computer science; Artificial intelligence","score_opus":0.01796937553261109,"score_gpt":0.230563612036428,"score_spread":0.21259423650381692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083035285","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.0019558673,0.00045477576,0.9923913,0.00072102936,0.00075772527,0.00036178355,0.0000030744795,0.00009571287,0.0032587338],"genre_scores_gemma":[0.49183822,0.000011217306,0.50645095,0.0007853961,0.00048189805,0.000011772325,0.000016984135,0.000028643113,0.0003749154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656004,0.000027347343,0.00046293862,0.0013663141,0.0010251951,0.000558175],"domain_scores_gemma":[0.9982392,0.0003704391,0.00018892233,0.0008472696,0.00023265419,0.000121483434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005860646,0.00043131833,0.00042847544,0.001236767,0.0002737553,0.0004342644,0.0014636297,0.00021267364,0.000017352537],"category_scores_gemma":[0.000029040919,0.0003893276,0.00007574698,0.0010150332,0.00033619252,0.00067685416,0.000715235,0.00067168236,0.00003350709],"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.000008707954,0.00008627654,0.00033941332,0.000025991576,0.000010817331,0.00010413616,0.00040508615,0.700726,0.0003567393,0.04754366,0.000028134482,0.25036505],"study_design_scores_gemma":[0.00058447383,0.0002660876,0.004613131,0.0005679515,0.000011384153,0.000089989,1.2906305e-7,0.7768767,0.0009329481,0.21395703,0.0011554427,0.0009447328],"about_ca_topic_score_codex":0.00006499873,"about_ca_topic_score_gemma":0.001084256,"teacher_disagreement_score":0.48988235,"about_ca_system_score_codex":0.00027953062,"about_ca_system_score_gemma":0.0006182344,"threshold_uncertainty_score":0.9998559},"labels":[],"label_agreement":null},{"id":"W2083046806","doi":"10.1007/s00454-005-1183-1","title":"Transversals to Line Segments in Three-Dimensional Space","year":2005,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Mathematics; Combinatorics; Line segment; Line (geometry); Hyperboloid; Space (punctuation); Upper and lower bounds; Geometry; Mathematical analysis; Computer science","score_opus":0.015291887743706436,"score_gpt":0.27093243330678074,"score_spread":0.2556405455630743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083046806","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.2733955,0.0001612249,0.71849084,0.006825,0.00027784554,0.00028354515,0.000026942136,0.000106444495,0.0004326506],"genre_scores_gemma":[0.7798781,0.0000015968318,0.21764775,0.0018451511,0.00021980886,0.000025372312,0.0001144361,0.000013951526,0.00025383593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973672,0.000074890886,0.0005222181,0.00068703486,0.00091705093,0.0004315902],"domain_scores_gemma":[0.9988459,0.00028955308,0.00010065577,0.0002962731,0.00021314915,0.00025448407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004785049,0.00026536355,0.00026603718,0.0009309471,0.00015465057,0.00015559424,0.0005869691,0.00008523859,0.0001234184],"category_scores_gemma":[0.00007000923,0.00027927136,0.00011615783,0.0023106432,0.00003448353,0.0007516746,0.00021419874,0.00020417022,0.00044520915],"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.000026077156,0.00013372462,0.0009248845,0.000007633086,0.000021812468,0.000010951533,0.00018875043,0.9454609,0.00031247566,0.025501056,0.00069485774,0.026716856],"study_design_scores_gemma":[0.0011261757,0.00016372793,0.061286643,0.00004584041,0.0000071460136,0.000027570586,0.00001139591,0.9179916,0.0008006652,0.013453452,0.00462335,0.00046245783],"about_ca_topic_score_codex":0.000033284672,"about_ca_topic_score_gemma":0.000091239046,"teacher_disagreement_score":0.5064826,"about_ca_system_score_codex":0.00016011974,"about_ca_system_score_gemma":0.00017361407,"threshold_uncertainty_score":0.99996597},"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":"W2083241532","doi":"10.1016/j.advengsoft.2010.02.004","title":"A mesh-geometry based method for coupling 1D and 3D elements","year":2010,"lang":"en","type":"article","venue":"Advances in Engineering Software","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite element method; Degrees of freedom (physics and chemistry); Representation (politics); Coupling (piping); Boundary (topology); Constraint (computer-aided design); Geometry; Series (stratigraphy); Complex geometry; Computer science; Boundary value problem; Mathematics; Topology (electrical circuits); Applied mathematics; Mathematical optimization; Mathematical analysis; Structural engineering; Mechanical engineering; Engineering; Physics","score_opus":0.005813855617587656,"score_gpt":0.27111267568411274,"score_spread":0.26529882006652505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083241532","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.011083656,0.00061281904,0.98729265,0.00004726112,0.00066529267,0.00015474488,0.0000049216956,0.00013310865,0.0000055273454],"genre_scores_gemma":[0.12108354,0.000018173703,0.87867594,0.00006854339,0.00006782956,0.00005515087,0.000010216804,0.000008430075,0.000012203341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992493,0.000004646983,0.00017124419,0.00026574414,0.00012532312,0.00018374136],"domain_scores_gemma":[0.9992088,0.00048590833,0.00004109334,0.00015980088,0.000055222325,0.000049186623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034774884,0.00010530205,0.00011180114,0.00021076258,0.000053123742,0.000050085622,0.00019394685,0.00004282814,0.0000032466196],"category_scores_gemma":[0.00036349535,0.000113273876,0.00002402603,0.00039218392,0.0000071504564,0.0004659712,0.000049876653,0.00012455825,7.9032293e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037153814,0.000019642366,0.0015075221,0.00010108607,0.000004669705,0.0000016945766,0.000039256287,0.8148458,0.0018548428,0.0065594153,0.000009239686,0.17505315],"study_design_scores_gemma":[0.00035172806,0.000030529452,0.0008373398,0.000023166947,0.000002470539,0.0000032914693,0.0000018396746,0.9831109,0.002013299,0.00085999427,0.012626704,0.00013873843],"about_ca_topic_score_codex":0.0000011286785,"about_ca_topic_score_gemma":0.0000059479066,"teacher_disagreement_score":0.1749144,"about_ca_system_score_codex":0.000016186037,"about_ca_system_score_gemma":0.000026074302,"threshold_uncertainty_score":0.46191746},"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":"W2083860217","doi":"10.1007/s00022-011-0076-0","title":"A generalized Winternitz Theorem","year":2011,"lang":"en","type":"article","venue":"Journal of 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":"Mathematics; Polygon (computer graphics); Simple polygon; Combinatorics; Simple (philosophy); Point (geometry); Discrete mathematics; Regular polygon; Geometry","score_opus":0.030809820172241844,"score_gpt":0.24797638210264514,"score_spread":0.2171665619304033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083860217","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.36027792,0.00040763893,0.6353677,0.00018490753,0.0009769796,0.000031989697,5.644079e-7,0.00001962368,0.0027326937],"genre_scores_gemma":[0.8890602,0.000032171876,0.10975469,0.00039639205,0.00031959667,6.7868996e-7,5.5381213e-7,0.0000054713714,0.00043027013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890894,0.000075353455,0.00039212493,0.00012173162,0.00035124779,0.00015062816],"domain_scores_gemma":[0.9989926,0.00006370943,0.00032311078,0.00019958615,0.0003063759,0.00011458581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065919926,0.000094449715,0.00017226223,0.0005043498,0.000055937144,0.000068010835,0.0006519782,0.000043538617,0.0001899153],"category_scores_gemma":[0.00009800744,0.00007508223,0.00014793104,0.00066932186,0.000023128898,0.0005824224,0.00010106507,0.00015386619,0.000044746223],"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.0003166664,0.0010182649,0.0077169286,0.000047908634,0.0005178602,0.0005599408,0.005179731,0.0019855383,0.01565222,0.5799391,0.020202829,0.36686298],"study_design_scores_gemma":[0.00933481,0.004638813,0.17228687,0.00032459566,0.00021944854,0.008016128,0.0004901378,0.050814968,0.1840213,0.44677958,0.12104627,0.0020270857],"about_ca_topic_score_codex":0.0000037666402,"about_ca_topic_score_gemma":6.1627816e-7,"teacher_disagreement_score":0.52878225,"about_ca_system_score_codex":0.0000308384,"about_ca_system_score_gemma":0.00008633235,"threshold_uncertainty_score":0.30617645},"labels":[],"label_agreement":null},{"id":"W2084120415","doi":"10.1007/s10711-008-9234-4","title":"Minimum opaque manifolds","year":2008,"lang":"ceb","type":"article","venue":"Geometriae Dedicata","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 British Columbia","funders":"","keywords":"Differential geometry; Hyperbolic geometry; Algebraic geometry; Mathematics; Projective geometry; Opacity; Pure mathematics; Geometry; Topology (electrical circuits); Combinatorics; Physics","score_opus":0.04056243867691263,"score_gpt":0.2554664146443349,"score_spread":0.21490397596742228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084120415","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.1537827,0.010393306,0.8049165,0.0067108255,0.008846107,0.0009252523,0.00015828235,0.0004576403,0.013809373],"genre_scores_gemma":[0.96833104,0.001661447,0.015054597,0.0016081115,0.0024331252,0.000029658315,0.0002662396,0.000041700197,0.010574091],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99508923,0.00024203047,0.0009348092,0.0012810682,0.0015315367,0.0009213357],"domain_scores_gemma":[0.99652576,0.0005778137,0.00039692526,0.0014634837,0.00041443063,0.0006215578],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012321544,0.00048447956,0.00054997404,0.0017099112,0.0008308563,0.00027336957,0.0020992013,0.00033937808,0.00082888576],"category_scores_gemma":[0.00081949716,0.0005193663,0.00028794658,0.0065122494,0.00024536139,0.0009356043,0.0009222439,0.0004803813,0.003656466],"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.00020247168,0.0023703303,0.005588134,0.0003118421,0.00070685416,0.002128009,0.0035114684,0.0033965786,0.0035386113,0.047561415,0.65795404,0.27273023],"study_design_scores_gemma":[0.006190129,0.0014037691,0.091373645,0.00021862946,0.00021114736,0.00313514,0.00012322442,0.12031711,0.010972529,0.004000314,0.7592879,0.002766442],"about_ca_topic_score_codex":0.000091460766,"about_ca_topic_score_gemma":0.000009279407,"teacher_disagreement_score":0.8145483,"about_ca_system_score_codex":0.0001526844,"about_ca_system_score_gemma":0.0008633932,"threshold_uncertainty_score":0.9997258},"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":"W2084176317","doi":"10.1007/s00454-001-0013-3","title":"On the Number of Balanced Lines","year":2001,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; Hungarian Scientific Research Fund; City University of New York; National Science Foundation","keywords":"Mathematics; Combinatorics; General position; Conjecture; Bounded function; Plane (geometry); Line (geometry); Set (abstract data type); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.016084635105653722,"score_gpt":0.27943787908684875,"score_spread":0.26335324398119503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084176317","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.37383875,0.000051056,0.6184417,0.0022092473,0.0002934619,0.00012092712,0.000009182741,0.00006349668,0.004972174],"genre_scores_gemma":[0.97778636,0.00000971326,0.020324182,0.0012039029,0.0001387626,0.000015324718,0.000057358004,0.000008810317,0.00045556398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837047,0.0000919447,0.00034735497,0.0003295906,0.000653275,0.0002073446],"domain_scores_gemma":[0.9981363,0.0010053447,0.00017003856,0.0003316934,0.00028827877,0.000068334906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033880016,0.00016102537,0.00017118288,0.0001875207,0.00018481881,0.00009178037,0.00061506603,0.0000488277,0.00023740808],"category_scores_gemma":[0.0001776072,0.000118476695,0.00012044272,0.0015536202,0.00006763334,0.00026429954,0.00013482479,0.00013476211,0.00019344976],"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.000023661563,0.00009104499,0.0031521127,0.000008023521,0.00003963826,0.00000573712,0.00011097569,0.230556,0.00011236772,0.75492054,0.001929551,0.009050357],"study_design_scores_gemma":[0.00066123746,0.000116209354,0.09746294,0.00004910491,0.000011609158,0.00008680745,0.000042602085,0.5849122,0.0006414329,0.31142125,0.0042289826,0.0003656808],"about_ca_topic_score_codex":0.0000073383367,"about_ca_topic_score_gemma":7.133797e-7,"teacher_disagreement_score":0.60394764,"about_ca_system_score_codex":0.000025663343,"about_ca_system_score_gemma":0.00008136596,"threshold_uncertainty_score":0.48313394},"labels":[],"label_agreement":null},{"id":"W2085072732","doi":"10.1016/s0196-6774(03)00126-3","title":"Rectangular drawings of planar graphs","year":2003,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":42,"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 Alberta","funders":"","keywords":"Planar graph; Book embedding; Planar straight-line graph; Outerplanar graph; Combinatorics; Rectangle; Mathematics; Planar; Graph; Polyhedral graph; Embedding; Vertex (graph theory); Plane (geometry); 1-planar graph; Geometry; Line graph; Computer science; Pathwidth; Computer graphics (images); Artificial intelligence","score_opus":0.011175260138379248,"score_gpt":0.23730742971906998,"score_spread":0.22613216958069074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085072732","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.052300267,0.0008529876,0.9446744,0.00036592016,0.0008745302,0.00003829293,8.376618e-7,0.000009151326,0.00088364433],"genre_scores_gemma":[0.46541974,0.000057948135,0.5341148,0.00014045558,0.000118331714,4.6061814e-7,6.2501823e-7,0.0000048300335,0.00014281874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990708,0.000064925945,0.00033985515,0.00008324149,0.00034590147,0.000095270814],"domain_scores_gemma":[0.9991647,0.0000726246,0.00030267914,0.00011590115,0.00027867625,0.0000654102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005899918,0.00006227987,0.00014724745,0.00023692338,0.00004216753,0.000032146003,0.00023591644,0.000031662355,0.000011309207],"category_scores_gemma":[0.000095470015,0.00005317157,0.000103063205,0.00048118416,0.00001742173,0.00033303088,0.000011964098,0.000098385506,0.0000026473485],"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.00004452179,0.0005875708,0.0013280271,0.000058705897,0.00033353554,0.00028927563,0.0029587378,0.009406687,0.037681937,0.71289104,0.011473654,0.22294633],"study_design_scores_gemma":[0.0036454408,0.0024946756,0.010940219,0.00022240821,0.00009373955,0.0035649147,0.00026800952,0.038157165,0.22378369,0.63559306,0.08048157,0.000755132],"about_ca_topic_score_codex":0.0000018635654,"about_ca_topic_score_gemma":2.599975e-7,"teacher_disagreement_score":0.41311947,"about_ca_system_score_codex":0.000017092561,"about_ca_system_score_gemma":0.000111202644,"threshold_uncertainty_score":0.21682738},"labels":[],"label_agreement":null},{"id":"W2085524666","doi":"10.1006/jagm.2001.1189","title":"Fly Cheaply: On the Minimum Fuel Consumption Problem","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","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":"University of Waterloo","funders":"","keywords":"Subdivision; Function (biology); Fuel efficiency; Path (computing); Class (philosophy); Sequence (biology); Set (abstract data type); Mathematical optimization; Computer science; Combinatorics; Mathematics; Engineering; Artificial intelligence; Aerospace engineering","score_opus":0.03404273858224385,"score_gpt":0.2688807568102196,"score_spread":0.23483801822797576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085524666","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.10515446,0.00064372487,0.8680605,0.022016406,0.0014538451,0.00018529913,0.0000011372031,0.000035112425,0.002449513],"genre_scores_gemma":[0.88096035,0.0004060375,0.11377313,0.0021875575,0.0013706883,0.0000060099374,0.0000020546615,0.000010666907,0.0012834775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989484,0.00007774957,0.00030501574,0.000111586174,0.0004266742,0.00013059373],"domain_scores_gemma":[0.99909884,0.00018701512,0.00025353106,0.00015501108,0.0002363381,0.000069250076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069265894,0.0000833147,0.0001081722,0.00013723486,0.00010640527,0.00013101022,0.00036177674,0.000035164456,0.00003838702],"category_scores_gemma":[0.000045773904,0.000053340325,0.00008328323,0.00031031447,0.000023016613,0.00034914177,0.000039476174,0.00018339044,0.000062496074],"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.00015805243,0.0008563967,0.0009853833,0.000044557783,0.00022548005,0.00030605405,0.0027298508,0.022267675,0.005900167,0.15945573,0.040354785,0.7667159],"study_design_scores_gemma":[0.0038185506,0.0031201711,0.038313672,0.00032317796,0.00007544468,0.004726763,0.00019498981,0.5473677,0.00772629,0.19527113,0.1982184,0.00084372],"about_ca_topic_score_codex":0.0000011965035,"about_ca_topic_score_gemma":7.8357704e-7,"teacher_disagreement_score":0.7758059,"about_ca_system_score_codex":0.000041738916,"about_ca_system_score_gemma":0.00008285425,"threshold_uncertainty_score":0.21751553},"labels":[],"label_agreement":null},{"id":"W2085525401","doi":"10.1016/s0010-4485(00)00146-9","title":"Generation of a finite element MESH from stereolithography (STL) files","year":2002,"lang":"en","type":"article","venue":"Computer-Aided Design","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Polytechnique Montréal","funders":"","keywords":"Delaunay triangulation; Finite element method; Mesh generation; Polygon mesh; Volume mesh; Boundary (topology); Surface triangulation; Parametric surface; Triangulation; Algorithm; Representation (politics); Boundary representation; Computer science; Parametric statistics; Geometry; Smoothing; Mathematics; Constrained Delaunay triangulation; Mathematical analysis; Computer vision; Structural engineering","score_opus":0.10904740752373988,"score_gpt":0.2547190985165342,"score_spread":0.1456716909927943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085525401","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.014083921,0.0005350115,0.98379385,0.000251928,0.00072086806,0.00031287767,0.000016021473,0.0001370129,0.0001484916],"genre_scores_gemma":[0.47545516,0.00004442876,0.5235692,0.00036695835,0.00040683756,0.000024251232,0.00004774706,0.000009142355,0.00007625039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792033,0.0003005779,0.0005386899,0.0005402955,0.00044245808,0.00025765205],"domain_scores_gemma":[0.9983954,0.00045755992,0.00023980175,0.00057984056,0.00021417988,0.000113224676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032558048,0.00022025283,0.00026979728,0.0003437369,0.00015525751,0.00018409523,0.00061824656,0.00007611198,0.00014966159],"category_scores_gemma":[0.000028182327,0.00022216824,0.00013804097,0.00076217833,0.000039939572,0.00048691765,0.00017576896,0.000097651304,0.000064577216],"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.000021907597,0.00066360267,0.00033981982,0.00003466152,0.00022440095,0.000030940115,0.0023476176,0.24595368,0.012580569,0.0310496,0.053205747,0.65354747],"study_design_scores_gemma":[0.0005247649,0.0002825841,0.0013010822,0.000026440375,0.000014237551,0.000004712826,0.0000043444966,0.9786663,0.013224599,0.0036587885,0.0020548515,0.00023727835],"about_ca_topic_score_codex":0.000017123753,"about_ca_topic_score_gemma":0.0000026491816,"teacher_disagreement_score":0.7327126,"about_ca_system_score_codex":0.00002976625,"about_ca_system_score_gemma":0.000036188023,"threshold_uncertainty_score":0.9059758},"labels":[],"label_agreement":null},{"id":"W2085562535","doi":"10.1007/s10878-012-9475-x","title":"Coverage with k-transmitters in the presence of obstacles","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Transmitter; Cover (algebra); Combinatorics; Plane (geometry); Integer (computer science); Theory of computation; Line (geometry); Range (aeronautics); Upper and lower bounds; Mathematics; Computer science; Geometry; Telecommunications; Algorithm; Mathematical analysis","score_opus":0.008990101363827583,"score_gpt":0.2259723087213967,"score_spread":0.21698220735756912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085562535","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.075378254,0.00015206657,0.9225463,0.0004430884,0.0011899642,0.00009001583,3.1837547e-7,0.0000035984162,0.00019638009],"genre_scores_gemma":[0.95009,0.000033495682,0.049645565,0.00006085547,0.00016270978,0.0000012120497,0.0000010417821,0.0000025291884,0.0000026006312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900055,0.00014462332,0.00028958943,0.00005102562,0.0004171463,0.00009704495],"domain_scores_gemma":[0.99912316,0.00022285979,0.00029781167,0.00010589832,0.00021736344,0.00003289369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072180136,0.00005798683,0.00011105142,0.00013332315,0.000034022556,0.0000450386,0.0003228067,0.00002714468,0.0000046252367],"category_scores_gemma":[0.00007011924,0.000037549904,0.000034160832,0.0005294146,0.000018775705,0.0010535679,0.000014912187,0.00009404844,2.823018e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059498154,0.00022741494,0.0024459737,0.000009158093,0.000011429419,0.0000028205384,0.0018026738,0.91971123,0.00014395712,0.073733814,0.00013224527,0.0017197877],"study_design_scores_gemma":[0.015701454,0.0042056674,0.09890869,0.0005158072,0.0001565356,0.00051135605,0.00074122095,0.7988362,0.018742992,0.055864103,0.00483564,0.0009803713],"about_ca_topic_score_codex":0.0000028981897,"about_ca_topic_score_gemma":1.447348e-7,"teacher_disagreement_score":0.87471175,"about_ca_system_score_codex":0.00002577066,"about_ca_system_score_gemma":0.00008273178,"threshold_uncertainty_score":0.15312406},"labels":[],"label_agreement":null},{"id":"W2086252334","doi":"10.1007/s00453-003-1056-z","title":"Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree","year":2003,"lang":"en","type":"article","venue":"Algorithmica","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 Saskatchewan; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum spanning tree; Tree (set theory); Theory of computation; Path (computing); k-minimum spanning tree; Range tree; Grid; Euclidean minimum spanning tree; Running time; Upper and lower bounds; Plane (geometry); Binary logarithm; Connected dominating set; K-ary tree; Algorithm; Tree structure; Binary tree; Geometry; Computer science","score_opus":0.01759218772458964,"score_gpt":0.24545137364636013,"score_spread":0.22785918592177049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086252334","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.019684017,0.00028483925,0.973581,0.00020507112,0.0006724318,0.00014893556,0.000001360377,0.0001930399,0.005229261],"genre_scores_gemma":[0.5054232,0.0000037853554,0.4937205,0.00033769908,0.00013259822,0.0000067404303,0.000006938863,0.000011084666,0.00035747982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825805,0.00015909213,0.00031509603,0.00050734176,0.00035727883,0.0004031386],"domain_scores_gemma":[0.99889505,0.00033787917,0.00012049014,0.00038864062,0.00012800378,0.0001299187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065879396,0.0001839317,0.00019697657,0.00050442584,0.00027259288,0.00022468864,0.0004548552,0.00006624521,0.00002909068],"category_scores_gemma":[0.00023529412,0.00018507133,0.00009595506,0.002010659,0.000027992826,0.00038910282,0.00012758387,0.0001854945,0.000117764626],"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.0000035502517,0.0002217271,0.00047177027,0.000027576783,0.000075129894,0.000051371295,0.0007819888,0.005495035,0.0019694641,0.055165786,0.0032742315,0.9324624],"study_design_scores_gemma":[0.0010656638,0.00017461317,0.0030049018,0.00003033007,0.000020187734,0.00019530673,0.000060223065,0.93860227,0.024027793,0.009643205,0.022496883,0.0006786247],"about_ca_topic_score_codex":0.0000053517174,"about_ca_topic_score_gemma":5.875072e-7,"teacher_disagreement_score":0.93310726,"about_ca_system_score_codex":0.000049113045,"about_ca_system_score_gemma":0.00008625108,"threshold_uncertainty_score":0.754699},"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":"W2087236754","doi":"10.1016/j.jda.2014.11.006","title":"Computing upward topological book embeddings of upward planar digraphs","year":2014,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Planarity testing; Digraph; Planar; Planar graph; Point (geometry); Combinatorics; Mathematics; Planar straight-line graph; Book embedding; Set (abstract data type); Graph; Topology (electrical circuits); Computer science; Discrete mathematics; Geometry; 1-planar graph; Computer graphics (images)","score_opus":0.010233486860440585,"score_gpt":0.2610799165336955,"score_spread":0.25084642967325493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087236754","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.049005117,0.0005629567,0.9477185,0.0013298542,0.0006831663,0.00006035696,0.0000026369203,0.000025035482,0.0006123647],"genre_scores_gemma":[0.729897,0.00005190825,0.2690875,0.00035896225,0.0004937852,5.126125e-7,0.0000031164973,0.000006926566,0.000100301426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821013,0.00013714316,0.0006700352,0.00019806753,0.00056063733,0.0002239989],"domain_scores_gemma":[0.9984517,0.00027597693,0.00062289543,0.00019747834,0.00030326945,0.00014866893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090189034,0.00014549894,0.0003567009,0.00025765452,0.00010665184,0.00008719729,0.00058911165,0.000072691546,0.000017158749],"category_scores_gemma":[0.00014399098,0.00011357119,0.00022973208,0.00038519944,0.00007063583,0.0005277884,0.000106911815,0.00022687923,0.00000551666],"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.00021357212,0.0006420994,0.0041616657,0.00017773217,0.0006380939,0.00017144252,0.0043689883,0.06858187,0.011998421,0.24364842,0.025834868,0.63956285],"study_design_scores_gemma":[0.0026425861,0.0031117562,0.018480996,0.00028136498,0.000097311,0.0008953534,0.00022084422,0.85255384,0.014781472,0.06230526,0.043878634,0.00075059326],"about_ca_topic_score_codex":0.000005062351,"about_ca_topic_score_gemma":5.298821e-7,"teacher_disagreement_score":0.78397197,"about_ca_system_score_codex":0.000027042142,"about_ca_system_score_gemma":0.00007554218,"threshold_uncertainty_score":0.46312988},"labels":[],"label_agreement":null},{"id":"W2087662994","doi":"10.1006/jvci.2001.0503","title":"On Computing General Position Views of Data in Three Dimensions","year":2002,"lang":"en","type":"article","venue":"Journal of Visual Communication and Image Representation","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":"McGill University","funders":"","keywords":"Degenerate energy levels; Position (finance); Graphics; Algorithm; Transformation (genetics); Computer science; Computational complexity theory; Mathematics; Theoretical computer science; Physics; Computer graphics (images)","score_opus":0.11724995543605311,"score_gpt":0.40865313869727543,"score_spread":0.29140318326122233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087662994","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.5183909,0.0008872223,0.47889885,0.0012221329,0.00007798114,0.00010879343,0.0000017779253,0.000008148379,0.0004042217],"genre_scores_gemma":[0.89296174,0.0004623364,0.10638494,0.00011434555,0.000036621554,6.2703214e-7,0.000022903865,0.000003458259,0.0000130539065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986004,0.0003266055,0.0005654309,0.00014515842,0.00028748732,0.00007491424],"domain_scores_gemma":[0.99831593,0.00039704467,0.0005073572,0.0004886071,0.00024821775,0.000042832795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008328291,0.00007241256,0.00016279549,0.00029884803,0.00009243083,0.000078671874,0.0004959618,0.00003072593,0.000011351823],"category_scores_gemma":[0.00019114673,0.00006767368,0.00003515845,0.00043571347,0.000039735543,0.0013337263,0.00026405594,0.00015887296,0.0000029468606],"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.00017535538,0.002862964,0.005162314,0.00009051305,0.00012186391,0.000025865043,0.0052899527,0.018687297,0.13916542,0.10268135,0.0043661105,0.721371],"study_design_scores_gemma":[0.0007681121,0.00025123666,0.026274359,0.0000978619,0.000010819533,0.00006158065,0.00006192299,0.96370435,0.0024022353,0.006165828,0.00011491042,0.00008676388],"about_ca_topic_score_codex":0.000017348915,"about_ca_topic_score_gemma":0.000011441051,"teacher_disagreement_score":0.9450171,"about_ca_system_score_codex":0.000026140071,"about_ca_system_score_gemma":0.000018563056,"threshold_uncertainty_score":0.27596524},"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":"W2089842370","doi":"10.1002/rsa.10114","title":"Counting the onion","year":2004,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Convex hull; Regular polygon; Bounded function; Combinatorics; Mathematics; Upper and lower bounds; Ball (mathematics); Hull; Convex body; Set (abstract data type); Discrete mathematics; Geometry; Computer science; Mathematical analysis; Engineering","score_opus":0.008246097426498877,"score_gpt":0.23088304871805626,"score_spread":0.2226369512915574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089842370","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.05055908,0.0010775899,0.9440027,0.0034741974,0.0004738593,0.00012386894,0.000001130508,0.000050627255,0.000236984],"genre_scores_gemma":[0.96254975,0.00007239896,0.03637044,0.0006562839,0.00029362648,0.0000047621097,0.0000037909115,0.0000030554195,0.00004587408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945426,0.00002303441,0.000098226425,0.00015875002,0.00015854853,0.000107204854],"domain_scores_gemma":[0.99969476,0.000070014496,0.00003915788,0.00011912338,0.000036070123,0.00004089755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018257159,0.000070018636,0.00007453755,0.00003117707,0.00029091764,0.00019163784,0.00014963398,0.000023201486,0.000003912755],"category_scores_gemma":[0.0000330127,0.00004247936,0.000028857577,0.00015773156,0.000027839691,0.00015627556,0.00005978714,0.00006908415,0.0000020878301],"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.000022826662,0.000015154224,0.00004321671,0.000014708779,0.000031365747,0.000008390907,0.0012913898,0.040254284,0.0010439231,0.50117743,0.00037036836,0.45572695],"study_design_scores_gemma":[0.008753563,0.00011628652,0.013463448,0.00003086666,0.000020434576,0.00032046103,0.00010271455,0.189315,0.0059446776,0.75774217,0.023775797,0.00041460508],"about_ca_topic_score_codex":0.000021814423,"about_ca_topic_score_gemma":0.0000025736604,"teacher_disagreement_score":0.9119907,"about_ca_system_score_codex":0.000009689758,"about_ca_system_score_gemma":0.000036806596,"threshold_uncertainty_score":0.22375327},"labels":[],"label_agreement":null},{"id":"W2089916811","doi":"10.1115/pvp2003-1913","title":"Periodic Symmetry for Explicit Methods for Large Deformation Twisting and Stretching","year":2003,"lang":"en","type":"article","venue":"","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":"McMaster University","funders":"","keywords":"Symmetry (geometry); Finite element method; Kinematics; Deformation (meteorology); Work (physics); Homogeneous; Element (criminal law); Computer science; Classical mechanics; Mathematics; Geometry; Mathematical analysis; Physics; Structural engineering; Engineering; Statistical physics","score_opus":0.03070228496922074,"score_gpt":0.3441710904211566,"score_spread":0.3134688054519359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089916811","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.021894075,0.0001431797,0.97684425,0.00014072352,0.00021006919,0.00030614814,0.0000026454898,0.00006012795,0.0003988013],"genre_scores_gemma":[0.32929993,0.0000018469884,0.67030245,0.00021259325,0.00003225052,0.000047633286,0.000009335553,0.0000031612014,0.00009077053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934155,0.000056586283,0.0001718655,0.00019770963,0.00006552525,0.00016675674],"domain_scores_gemma":[0.99926794,0.00042341911,0.00005950855,0.00010444284,0.00009861504,0.00004610771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010959544,0.00007550981,0.000088242195,0.00009924926,0.00028734925,0.00017216292,0.00009411475,0.000032562766,0.0000029642279],"category_scores_gemma":[0.00033057705,0.0000696368,0.000039954448,0.00018313294,0.0000033010294,0.00047920772,0.000030851003,0.000031776184,9.0257674e-7],"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.0000017233974,0.000013432775,0.000055088578,0.000032266667,0.000005802023,3.4957125e-8,0.0005294166,0.00018730228,0.0010589554,0.88352627,0.000108672044,0.11448105],"study_design_scores_gemma":[0.0004957927,0.00007167997,0.0000937991,0.000006923752,0.0000062850013,0.00001052143,0.00021699033,0.91633755,0.012953498,0.05346594,0.016210599,0.00013040369],"about_ca_topic_score_codex":0.0000013449558,"about_ca_topic_score_gemma":0.0000018623798,"teacher_disagreement_score":0.9161503,"about_ca_system_score_codex":0.000018917783,"about_ca_system_score_gemma":0.000035754223,"threshold_uncertainty_score":0.28397065},"labels":[],"label_agreement":null},{"id":"W2089943985","doi":"10.1007/s00454-015-9677-y","title":"On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures","year":2015,"lang":"en","type":"article","venue":"Discrete & 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 Waterloo","funders":"","keywords":"Intersection (aeronautics); Mathematics; Constant (computer programming); Regular polygon; Convex hull; Algorithm; Computational geometry; Binary number; Point (geometry); Asymptotically optimal algorithm; Combinatorics; Mathematical optimization; Geometry; Computer science","score_opus":0.06708566401529192,"score_gpt":0.33068781697860244,"score_spread":0.2636021529633105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089943985","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.28787157,0.0005083783,0.7099874,0.0004062404,0.000441028,0.00021509978,0.00011641191,0.00009347421,0.00036040155],"genre_scores_gemma":[0.92898977,0.0000030105907,0.069396175,0.00044447483,0.000067873625,0.000006643716,0.0010599865,0.00001385958,0.000018231745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969812,0.0001582838,0.00054529204,0.00091622496,0.0010395974,0.00035940215],"domain_scores_gemma":[0.99743444,0.0012089245,0.00019993147,0.0006220374,0.00023143529,0.00030321974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072083087,0.0003018865,0.00036337567,0.00160485,0.00014662763,0.00033517316,0.0010198961,0.000099572215,0.000019414476],"category_scores_gemma":[0.00055615796,0.00027877578,0.000047044305,0.0029674752,0.00010852722,0.0006458511,0.000472998,0.00028236414,0.000019662044],"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.000038831193,0.00016802139,0.027867412,0.00001923173,0.000037651866,0.000020109617,0.0002343955,0.8757489,0.0000072800826,0.07677892,0.0019841935,0.017095083],"study_design_scores_gemma":[0.0012438658,0.00019418112,0.09962072,0.000020131334,0.000008502606,0.000009872627,0.00010344353,0.86253834,0.00008129151,0.035223607,0.0006082224,0.00034785102],"about_ca_topic_score_codex":0.00006228208,"about_ca_topic_score_gemma":0.000012577046,"teacher_disagreement_score":0.64111817,"about_ca_system_score_codex":0.00011710083,"about_ca_system_score_gemma":0.00043377734,"threshold_uncertainty_score":0.99996644},"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":"W2090891537","doi":"10.1016/j.jda.2014.12.005","title":"Universal point sets for planar three-trees","year":2015,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"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":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Combinatorics; Planar graph; Cardinality (data modeling); Planar; Mathematics; Plane (geometry); Embedding; Class (philosophy); Point (geometry); Upper and lower bounds; Set (abstract data type); Tree (set theory); Discrete mathematics; Computer science; Graph; Geometry; Artificial intelligence","score_opus":0.035795818754654034,"score_gpt":0.28785916265787115,"score_spread":0.2520633439032171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090891537","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.006637776,0.00035229317,0.98869467,0.0030088245,0.00090350886,0.00008676933,0.000009793687,0.000017014781,0.00028937758],"genre_scores_gemma":[0.321449,0.000018790435,0.67708963,0.00028670588,0.0008819538,0.0000025634963,0.00001398811,0.000011523724,0.00024585403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905044,0.0000329208,0.00027484747,0.0001246939,0.00037027252,0.0001467984],"domain_scores_gemma":[0.9989436,0.00009342667,0.00023825686,0.00013252551,0.00040877453,0.00018340349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005439188,0.00009058498,0.00015518216,0.00016442823,0.00006274851,0.00009835425,0.00038518483,0.000037402784,0.00000307923],"category_scores_gemma":[0.000073709794,0.00007323915,0.00011246872,0.00022223967,0.00001863921,0.0007784843,0.000047381436,0.00009280223,0.000005779681],"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.00054810493,0.00047348457,0.0011705272,0.000052738542,0.00066801964,0.00041623708,0.0048671137,0.09708811,0.0022877583,0.17894422,0.16683787,0.5466458],"study_design_scores_gemma":[0.003760137,0.0021521936,0.0032128638,0.00005990648,0.00005810522,0.00056470215,0.00036416168,0.7760848,0.0018993514,0.1785043,0.032944642,0.0003948714],"about_ca_topic_score_codex":0.000007240997,"about_ca_topic_score_gemma":0.000011509138,"teacher_disagreement_score":0.6789967,"about_ca_system_score_codex":0.00006254288,"about_ca_system_score_gemma":0.0002268065,"threshold_uncertainty_score":0.29866058},"labels":[],"label_agreement":null},{"id":"W2091389489","doi":"10.1016/s0167-8396(02)00133-4","title":"Experimental results on quadrangulations of sets of fixed points","year":2002,"lang":"en","type":"article","venue":"Computer Aided Geometric Design","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":"McGill University; Carleton University","funders":"","keywords":"Mathematics; Fixed point; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.06847259063844367,"score_gpt":0.2730529354289384,"score_spread":0.2045803447904947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091389489","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.025182884,0.00031996192,0.9726055,0.00020774297,0.0005302493,0.00028106157,0.000010958442,0.00007468377,0.0007869052],"genre_scores_gemma":[0.7520155,0.0000054668844,0.24766377,0.00010769485,0.000063882355,0.000007392393,0.0000103548755,0.0000070492697,0.000118941774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979355,0.00019826731,0.00064419373,0.00043253205,0.00056783925,0.00022168284],"domain_scores_gemma":[0.9978451,0.00094022806,0.00031425818,0.0005651189,0.00023719897,0.00009807249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000512617,0.00017831223,0.00029120513,0.001458815,0.00008800917,0.000048051705,0.00060881197,0.0000702031,0.000054675762],"category_scores_gemma":[0.00015907107,0.00017820613,0.00012298943,0.0035857682,0.000044813838,0.00031527178,0.00014619589,0.00009061502,0.00006693733],"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.00018004482,0.0027997096,0.000106121384,0.00006257795,0.00018482347,0.000029474399,0.0028920793,0.4931679,0.009815666,0.02384803,0.050634015,0.41627952],"study_design_scores_gemma":[0.0018629312,0.0013469389,0.0059937304,0.000048678947,0.000009714327,0.000016930608,0.000008451839,0.8503469,0.13845697,0.0011070713,0.0005264689,0.00027517087],"about_ca_topic_score_codex":0.000006183224,"about_ca_topic_score_gemma":1.0853201e-7,"teacher_disagreement_score":0.72683257,"about_ca_system_score_codex":0.000045912715,"about_ca_system_score_gemma":0.000032450258,"threshold_uncertainty_score":0.7267035},"labels":[],"label_agreement":null},{"id":"W2093765879","doi":"10.1016/s0166-218x(00)00237-7","title":"Minimum convex partition of a constrained point set","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":"Queen's University","funders":"","keywords":"Convex hull; Mathematics; Convex set; Combinatorics; Convex polytope; Subderivative; Convex analysis; Convex combination; Partition (number theory); Absolutely convex set; Orthogonal convex hull; Proper convex function; Convex body; Convex polygon; Regular polygon; Mixed volume; Convex optimization; Geometry","score_opus":0.02204595755920176,"score_gpt":0.25765646289923866,"score_spread":0.2356105053400369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093765879","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.07569881,0.000014139988,0.9100594,0.00038115185,0.00007128632,0.00021955092,0.0000072124185,0.00007313908,0.013475345],"genre_scores_gemma":[0.8419069,0.000007581617,0.15779635,0.00011739973,0.000034008805,0.000022802531,0.000029503915,0.000005718857,0.00007972569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907357,0.000011356751,0.0003352367,0.00018226916,0.00024729254,0.00015027572],"domain_scores_gemma":[0.9992885,0.00011848454,0.00016938303,0.00029126677,0.00007307809,0.00005926624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022665173,0.00010833356,0.00018457606,0.00008201986,0.000053432246,0.0000435941,0.00023604538,0.0000434749,0.000052911833],"category_scores_gemma":[0.000027480975,0.000100032594,0.00005248358,0.0003262297,0.00005387089,0.00013062716,0.000073806164,0.00005133054,0.000044275468],"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.0000078905505,0.000093315386,0.000008622187,0.00007480042,0.000024123738,0.0000040234477,0.0017106003,0.00080830645,0.028723812,0.96462226,0.0006783872,0.0032438687],"study_design_scores_gemma":[0.0013013013,0.00014492059,0.00017714022,0.0000691234,0.000040692266,0.000088781446,0.0008808795,0.54991126,0.056952722,0.38766226,0.0023041149,0.0004667828],"about_ca_topic_score_codex":0.0000010030471,"about_ca_topic_score_gemma":9.1488505e-7,"teacher_disagreement_score":0.7662081,"about_ca_system_score_codex":0.000012928096,"about_ca_system_score_gemma":0.000043661985,"threshold_uncertainty_score":0.40792108},"labels":[],"label_agreement":null},{"id":"W2094101429","doi":"10.1007/s13366-014-0206-6","title":"Finding equal-diameter triangulations in polygons","year":2014,"lang":"de","type":"article","venue":"Beiträge zur Algebra und Geometrie / Contributions to Algebra and 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 Calgary","funders":"","keywords":"Polygon (computer graphics); Combinatorics; Simple polygon; Perimeter; Simple (philosophy); Mathematics; Constructive; Rectilinear polygon; Star-shaped polygon; Polygon covering; Regular polygon; Geometry; Computer science","score_opus":0.014104540251117539,"score_gpt":0.29303641545888653,"score_spread":0.278931875207769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094101429","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.21968669,0.01592079,0.7497946,0.0081333425,0.0032027871,0.0016253752,0.0008913981,0.00027093024,0.00047406834],"genre_scores_gemma":[0.9840946,0.00046680574,0.008307245,0.002847399,0.0018064904,0.00019291922,0.000821774,0.00008367019,0.0013790486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.991038,0.00094392087,0.0021597072,0.0023060166,0.0013665383,0.002185816],"domain_scores_gemma":[0.99140674,0.0038600082,0.0006019278,0.0015687043,0.0010970784,0.0014655686],"candidate_categories":["metaresearch","metaepi_narrow","bibliometrics","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004284104,0.0011136318,0.001481723,0.00887474,0.0014953223,0.0016685541,0.0013184801,0.00080150244,0.00043322254],"category_scores_gemma":[0.0088460315,0.001251532,0.0004944051,0.021423848,0.00029555516,0.001543025,0.001144297,0.0011195616,0.0012413225],"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.00024113836,0.0014623444,0.015274961,0.00019276084,0.000956975,0.00006971723,0.0012711126,0.009741074,0.0009350864,0.720427,0.0064158193,0.24301203],"study_design_scores_gemma":[0.016902955,0.0030469196,0.29979494,0.0009334219,0.0015140465,0.00012604895,0.00029738236,0.13970892,0.0045437934,0.119297676,0.4074029,0.0064310045],"about_ca_topic_score_codex":0.00028801817,"about_ca_topic_score_gemma":0.00017720612,"teacher_disagreement_score":0.76440793,"about_ca_system_score_codex":0.00063996634,"about_ca_system_score_gemma":0.0007157316,"threshold_uncertainty_score":0.9998046},"labels":[],"label_agreement":null},{"id":"W2094741659","doi":"10.1145/1629255.1629293","title":"Gabriel meshes and Delaunay edge flips","year":2009,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Delaunay triangulation; Polygon mesh; Enhanced Data Rates for GSM Evolution; Constrained Delaunay triangulation; Computer science; Chew's second algorithm; Computer graphics (images); Artificial intelligence; Algorithm","score_opus":0.009825569919074437,"score_gpt":0.22668383151780144,"score_spread":0.216858261598727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094741659","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.033583913,0.0002250997,0.9470656,0.00317391,0.00013127943,0.00004798567,2.0060445e-7,0.00010205526,0.015669977],"genre_scores_gemma":[0.9245827,0.000014091887,0.07181089,0.0017210435,0.000071782444,0.0000011026791,0.0000018019886,0.0000010907107,0.001795487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999551,0.000014265367,0.00007987109,0.00016480219,0.00010040153,0.00008963366],"domain_scores_gemma":[0.9997378,0.000035112123,0.000015504298,0.000119941666,0.0000379505,0.000053708573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101705,0.000052143776,0.000049886043,0.00005337702,0.0000740737,0.000102251106,0.0001302647,0.000020360148,0.000015821002],"category_scores_gemma":[0.000015440364,0.000045012388,0.000015487221,0.00018818588,0.000008190372,0.00030099196,0.000036215148,0.000031064734,0.000024044888],"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.0000018163266,0.000030116455,0.00008501257,0.000001607567,0.0000035284147,0.000003291972,0.00018061222,0.0005201247,0.0016675949,0.5975905,0.0077688247,0.39214694],"study_design_scores_gemma":[0.0008375758,0.0004582886,0.09070558,0.000014236814,0.000009774842,0.0001531832,0.000032188178,0.5617684,0.028387625,0.21488546,0.10215302,0.0005946536],"about_ca_topic_score_codex":0.0000025886025,"about_ca_topic_score_gemma":0.000001992917,"teacher_disagreement_score":0.8909988,"about_ca_system_score_codex":0.000005656305,"about_ca_system_score_gemma":0.000021692225,"threshold_uncertainty_score":0.1835552},"labels":[],"label_agreement":null},{"id":"W2095921276","doi":"10.4230/lipics.socg.2020.33","title":"Finding Closed Quasigeodesics on Convex Polyhedra","year":2010,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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":"Geometry; Computer science; Computational geometry; Mathematics","score_opus":0.030150585440336095,"score_gpt":0.29114968372529654,"score_spread":0.26099909828496043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095921276","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.14017761,0.0000508867,0.84355223,0.0009553049,0.0077199508,0.0018653403,0.0006223935,0.00047192667,0.0045843646],"genre_scores_gemma":[0.86131597,0.00004975132,0.1303823,0.0032219507,0.0010636037,0.00030842295,0.0027789401,0.00008478654,0.00079428783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573696,0.00007549989,0.0015508024,0.0007055991,0.0010403794,0.0008907722],"domain_scores_gemma":[0.9959862,0.00042271998,0.0010646329,0.0016333194,0.0005576062,0.00033550488],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009930844,0.00078601437,0.0007707554,0.0007552475,0.0005672574,0.00138306,0.0024011151,0.00093580753,0.000039234805],"category_scores_gemma":[0.00022067863,0.0007767533,0.0005220329,0.00045110923,0.00010957698,0.001124133,0.0015275747,0.0020242508,0.00029284685],"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.00055303605,0.0023547066,0.0016503034,0.004448223,0.0012861511,0.000051060502,0.031423137,0.065192126,0.0011046319,0.6059468,0.034943424,0.2510464],"study_design_scores_gemma":[0.0034588524,0.0004613043,0.0011844126,0.0005366576,0.00008294873,0.00006482283,0.00021162674,0.8601594,0.0061593805,0.021857442,0.10387006,0.0019530786],"about_ca_topic_score_codex":0.000015872647,"about_ca_topic_score_gemma":0.000014502843,"teacher_disagreement_score":0.7949673,"about_ca_system_score_codex":0.00022600769,"about_ca_system_score_gemma":0.00048745036,"threshold_uncertainty_score":0.9996536},"labels":[],"label_agreement":null},{"id":"W2096202410","doi":"10.1007/978-3-540-87744-8_67","title":"On the Size of the 3D Visibility Skeleton: Experimental Results","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McGill University","funders":"","keywords":"Visibility; Skeleton (computer programming); Polytope; Combinatorics; Regular polygon; Set (abstract data type); Computer science; Mathematics; Geometry; Physics; Optics","score_opus":0.018876014687877463,"score_gpt":0.25185402980843297,"score_spread":0.2329780151205555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096202410","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.0040050023,0.00035231092,0.9858372,0.0023621619,0.002042084,0.0005381953,0.000010236284,0.000049823277,0.004802971],"genre_scores_gemma":[0.9407628,0.00001847293,0.05609761,0.00231542,0.0003229396,0.000007735319,0.0000022229383,0.000012842636,0.00045993368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683523,0.00009156138,0.0005208393,0.001004649,0.0012435614,0.00030415112],"domain_scores_gemma":[0.9956862,0.0020606865,0.00034673922,0.0016295416,0.00021271501,0.000064169304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009343507,0.00032273884,0.00028296438,0.00018030954,0.00042092375,0.00014894942,0.0029986647,0.0001498585,0.000018219711],"category_scores_gemma":[0.00042953002,0.00019201267,0.0001645192,0.00071644195,0.0007911577,0.00021912772,0.0010629093,0.0005319907,0.000014483947],"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.00008324148,0.00028110703,0.000022110873,0.000031232732,0.00003194243,0.000033984434,0.0049114996,0.40001544,0.00220169,0.10712267,0.0011632799,0.4841018],"study_design_scores_gemma":[0.0009859304,0.0008133692,0.0016981962,0.0005053274,0.000009649956,0.00013314853,7.098478e-7,0.752128,0.086583905,0.14958104,0.0065318705,0.0010288445],"about_ca_topic_score_codex":0.000011597991,"about_ca_topic_score_gemma":0.000010710292,"teacher_disagreement_score":0.9367578,"about_ca_system_score_codex":0.00019324812,"about_ca_system_score_gemma":0.00050304533,"threshold_uncertainty_score":0.78300494},"labels":[],"label_agreement":null},{"id":"W2096437618","doi":"10.1142/s0219265902000513","title":"STATION LAYOUTS IN THE PRESENCE OF LOCATION CONSTRAINTS","year":2002,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Mitacs","keywords":"Center (category theory); Base station; RADIUS; Point (geometry); Planar; Total station; Computer science; SIGNAL (programming language); Cover (algebra); Wireless; Telecommunications; Metro station; Electrical engineering; Computer network; Geodesy; Geometry; Geography; Mathematics; Engineering; Computer graphics (images); Transport engineering","score_opus":0.021801733310216134,"score_gpt":0.2467084641188144,"score_spread":0.22490673080859824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096437618","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.083821796,0.0002834566,0.9139427,0.0007959762,0.0007008183,0.00007024607,2.3264931e-7,0.0000052186606,0.00037954145],"genre_scores_gemma":[0.99673754,0.000063592546,0.0028229775,0.00017974034,0.0001646538,0.0000018291253,8.2208004e-7,0.0000018536715,0.000027001595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897957,0.00018382246,0.00044151567,0.00008082672,0.00023408032,0.000080203274],"domain_scores_gemma":[0.998769,0.00033853695,0.0003833838,0.00010985642,0.00037676198,0.000022457167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080804323,0.000055463588,0.000097595745,0.0001984731,0.00002923097,0.00005357733,0.00029574567,0.000038083555,0.00002606035],"category_scores_gemma":[0.00018511743,0.00004135038,0.000046078345,0.00064836285,0.000033456665,0.00058207,0.00001775233,0.0001695147,0.0000022768802],"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.000027799193,0.00017576842,0.0007451032,0.000011826563,0.000020645386,0.000008899603,0.0036225743,0.80030817,0.00034047186,0.015885103,0.004810101,0.17404354],"study_design_scores_gemma":[0.0003861336,0.00024662097,0.0072335773,0.00009860683,0.00000575249,0.0002312131,0.00034510752,0.98887604,0.00038739893,0.0017575637,0.0003702985,0.00006165716],"about_ca_topic_score_codex":0.0000044710855,"about_ca_topic_score_gemma":0.000014977253,"teacher_disagreement_score":0.91291577,"about_ca_system_score_codex":0.00003242125,"about_ca_system_score_gemma":0.000020571892,"threshold_uncertainty_score":0.16862196},"labels":[],"label_agreement":null},{"id":"W2096451963","doi":"10.1142/s0218195908002751","title":"MEDIAL AXIS APPROXIMATION AND UNSTABLE FLOW COMPLEX","year":2008,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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 Toronto","funders":"","keywords":"Medial axis; Mathematics; Boundary (topology); Topology (electrical circuits); Homotopy; Bounded function; Flow (mathematics); Simply connected space; Closeness; Geometry; Mathematical analysis; Combinatorics; Pure mathematics","score_opus":0.023305508746308278,"score_gpt":0.27423292670955524,"score_spread":0.25092741796324697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096451963","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.016921444,0.00045551223,0.978843,0.002150654,0.0005045324,0.000298349,0.000032074833,0.00006346563,0.00073097873],"genre_scores_gemma":[0.6232075,0.00015981359,0.37488636,0.0005348507,0.00089768943,0.000050112514,0.00014473111,0.000012716745,0.000106231295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714774,0.00008420957,0.000871645,0.000343207,0.0013430048,0.00021017577],"domain_scores_gemma":[0.9963537,0.0004971446,0.00062987074,0.00020727924,0.0021019944,0.00021005113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005077131,0.00020813337,0.00027982792,0.00096603605,0.00031891256,0.00019945568,0.0010130943,0.000082099774,0.00007825668],"category_scores_gemma":[0.000092558614,0.00021236343,0.0001457992,0.0009978994,0.00018844409,0.0011857963,0.00020951958,0.00023658341,0.000046265744],"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.00010667354,0.0008699395,0.0020680483,0.00004253809,0.0004909062,0.00007638176,0.00092017517,0.48563898,0.0015560662,0.22726654,0.007327492,0.27363628],"study_design_scores_gemma":[0.003545697,0.000326678,0.04132853,0.000053827574,0.000058666617,0.005419239,0.00008605259,0.5511096,0.0010326968,0.18368334,0.21255404,0.00080165174],"about_ca_topic_score_codex":0.0000038053734,"about_ca_topic_score_gemma":9.41142e-7,"teacher_disagreement_score":0.60628605,"about_ca_system_score_codex":0.00013275506,"about_ca_system_score_gemma":0.00036158174,"threshold_uncertainty_score":0.8659929},"labels":[],"label_agreement":null},{"id":"W2096602114","doi":"10.1007/s00371-011-0670-z","title":"Algorithms for computing diffuse reflection paths in polygons","year":2012,"lang":"en","type":"article","venue":"The Visual Computer","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":"Carleton University","funders":"University of Ottawa","keywords":"Path (computing); Polygon (computer graphics); Fast path; Longest path problem; Mathematics; Point (geometry); Reflection (computer programming); Path length; Widest path problem; Algorithm; Combinatorics; Computer science; Graph; Shortest path problem; Geometry","score_opus":0.049570679624260636,"score_gpt":0.351217092553216,"score_spread":0.30164641292895533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096602114","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.1737031,0.00011185652,0.8238688,0.000528918,0.0013719953,0.00025029364,0.0000012608203,0.00009625639,0.00006748075],"genre_scores_gemma":[0.9073156,0.0000029088542,0.09041673,0.0008190314,0.0013304676,0.000018033712,0.000012621829,0.000009715081,0.000074888114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988107,0.00012858224,0.0002493048,0.00023959203,0.00019423259,0.00037757846],"domain_scores_gemma":[0.99923575,0.0003239547,0.000081011254,0.00021790196,0.000067796296,0.000073578696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076351897,0.00013337668,0.00013123361,0.00016797794,0.0002448101,0.00013116495,0.00036807297,0.0000497483,0.000002810437],"category_scores_gemma":[0.00001923717,0.00010283679,0.000071023045,0.00058163365,0.000022166454,0.00042512373,0.00021698322,0.0001270269,0.000026008864],"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.00003762071,0.0009922894,0.0025407718,0.00003115849,0.00004389178,0.000002418859,0.0053126225,0.016528362,0.002100311,0.07673969,0.0030729007,0.892598],"study_design_scores_gemma":[0.00055842224,0.00014191009,0.017263085,0.0000126934965,0.000004573297,0.000022150414,0.000014783919,0.97431487,0.0009812043,0.0015609701,0.0049562124,0.00016915357],"about_ca_topic_score_codex":0.00001636967,"about_ca_topic_score_gemma":0.0000042486663,"teacher_disagreement_score":0.9577865,"about_ca_system_score_codex":0.00006437737,"about_ca_system_score_gemma":0.00003427852,"threshold_uncertainty_score":0.4193563},"labels":[],"label_agreement":null},{"id":"W2096691794","doi":"","title":"Streaming 1-Center with Outliers in High Dimensions","year":2009,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"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 Windsor; University of Waterloo","funders":"","keywords":"Outlier; Center (category theory); Computer science; Combinatorics; RADIUS; Ball (mathematics); Sequence (biology); Algorithm; Mathematics; Artificial intelligence; Geometry; Computer network; Crystallography","score_opus":0.007830340980827397,"score_gpt":0.22081061363345958,"score_spread":0.2129802726526322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096691794","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.4580502,0.000010989964,0.53733665,0.001554925,0.00007376594,0.00005827901,2.5588182e-7,0.00005812375,0.0028568278],"genre_scores_gemma":[0.9279659,0.0000014470864,0.0709459,0.00076154916,0.00001653345,0.0000012731332,0.0000037454688,0.0000011278764,0.00030252535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995277,0.00001395208,0.000079471916,0.00015744515,0.000116055955,0.00010535589],"domain_scores_gemma":[0.9997776,0.000020594445,0.00001626149,0.00012383271,0.00002628527,0.000035382516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005763586,0.00005061416,0.000050431445,0.00010616464,0.00003924071,0.000044290246,0.00011621983,0.000013852703,0.000008415943],"category_scores_gemma":[0.0000047744725,0.00003861372,0.000010049098,0.0003411613,0.000005200652,0.00024451595,0.000020555779,0.000040066563,0.000013795992],"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.000021258154,0.0005276688,0.009961039,0.0000030266967,0.000012601836,0.00006444529,0.00089797046,0.07008398,0.0018970006,0.6529665,0.0016559159,0.26190856],"study_design_scores_gemma":[0.0036842239,0.00095254654,0.5647166,0.000074644486,0.0000067034325,0.000077431985,0.00012900203,0.38997498,0.006113755,0.029134022,0.004412775,0.000723323],"about_ca_topic_score_codex":0.000011845489,"about_ca_topic_score_gemma":0.000027854365,"teacher_disagreement_score":0.6238325,"about_ca_system_score_codex":0.000018190814,"about_ca_system_score_gemma":0.000023751312,"threshold_uncertainty_score":0.1574622},"labels":[],"label_agreement":null},{"id":"W2096716375","doi":"","title":"On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces.","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Voronoi diagram; Point (geometry); SPHERES; Set (abstract data type); Mathematics; Computer science; Algorithm; Mathematical optimization; Geometry; Physics","score_opus":0.019854562947411242,"score_gpt":0.22959724654543012,"score_spread":0.20974268359801887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096716375","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.6874675,0.00019271356,0.2986423,0.00095561956,0.0005942264,0.0007552068,0.00006742719,0.00006817956,0.0112568075],"genre_scores_gemma":[0.97885615,0.0000018641624,0.020782314,0.00019262175,0.000016057365,0.000018362734,0.00006384108,0.000009638692,0.00005913299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978254,0.00020916693,0.00058841414,0.00045262472,0.0006098266,0.00031459975],"domain_scores_gemma":[0.9981088,0.0003914416,0.0002716974,0.0002777166,0.000725774,0.00022453899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006694176,0.00019960488,0.00030428026,0.0015702461,0.00009918612,0.00004581746,0.00033932447,0.00011179812,0.000048537164],"category_scores_gemma":[0.00019382723,0.00021757322,0.000066362314,0.0020842438,0.00006271767,0.00025770685,0.000024947887,0.0001707898,0.000039782437],"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.000010871815,0.000078341815,0.00027874016,0.00005115167,0.000011937737,0.000004372794,0.00009036495,0.44129178,0.00020376313,0.55572265,0.00013975831,0.0021162399],"study_design_scores_gemma":[0.0012346995,0.00044600866,0.031330135,0.0004984958,0.000009000098,0.00004305596,0.00008743052,0.9239099,0.0016609144,0.04019956,0.00016799121,0.00041282392],"about_ca_topic_score_codex":0.0026232332,"about_ca_topic_score_gemma":0.0016763249,"teacher_disagreement_score":0.51552314,"about_ca_system_score_codex":0.00037937178,"about_ca_system_score_gemma":0.0021492143,"threshold_uncertainty_score":0.88723785},"labels":[],"label_agreement":null},{"id":"W2096978969","doi":"10.1007/s00453-013-9790-3","title":"Monotone Drawings of Graphs with Fixed Embedding","year":2013,"lang":"en","type":"article","venue":"Algorithmica","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 Lethbridge","funders":"","keywords":"Book embedding; Planar graph; Combinatorics; Monotone polygon; Mathematics; Embedding; Outerplanar graph; Graph drawing; Discrete mathematics; Planar straight-line graph; Pathwidth; Graph embedding; Graph; Line graph; Computer science; Geometry","score_opus":0.00529886911728885,"score_gpt":0.21223427074331583,"score_spread":0.20693540162602697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096978969","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.23416236,0.000038264432,0.76459587,0.0003510491,0.00009662366,0.00013312175,7.3068594e-7,0.000057174275,0.00056483265],"genre_scores_gemma":[0.7852306,0.0000020955315,0.21441871,0.00011020089,0.000030669788,0.000018703655,0.00000387602,0.000004137228,0.00018102537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929404,0.000020114063,0.00014984782,0.00019724225,0.00020278853,0.00013596998],"domain_scores_gemma":[0.9994405,0.00006192307,0.00007492613,0.00021006612,0.00015826922,0.000054349835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006754625,0.00007943948,0.000104830535,0.00012328455,0.00006288503,0.000057413148,0.00026824567,0.000026608663,0.000030186993],"category_scores_gemma":[0.000011518467,0.000066444256,0.00003294772,0.0004892847,0.000029560542,0.00045806603,0.00006603972,0.00005361405,0.000037818765],"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.000019071838,0.0003694057,0.0019102668,0.00006495246,0.0001986255,0.000017559925,0.0023815695,0.017680926,0.072313614,0.16536562,0.0068355473,0.73284286],"study_design_scores_gemma":[0.00075535505,0.00033221714,0.016715722,0.000042732812,0.00001347356,0.00004385826,0.000059001344,0.839185,0.10805673,0.03279769,0.0016264735,0.0003717235],"about_ca_topic_score_codex":0.000052120355,"about_ca_topic_score_gemma":9.1432764e-7,"teacher_disagreement_score":0.8215041,"about_ca_system_score_codex":0.000009587711,"about_ca_system_score_gemma":0.000036421956,"threshold_uncertainty_score":0.2709518},"labels":[],"label_agreement":null},{"id":"W2097555437","doi":"10.1007/s10898-014-0239-2","title":"Locating a median line with partial coverage distance","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","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":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Line (geometry); Norm (philosophy); Dominating set; Enumeration; Finite set; Line segment; Point (geometry); Set (abstract data type); Mathematical analysis; Geometry; Graph","score_opus":0.005792925663033304,"score_gpt":0.2259134742240741,"score_spread":0.2201205485610408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097555437","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.00489603,0.00005552134,0.99286735,0.0012532491,0.00032598586,0.000043270426,0.000001089541,0.000016790438,0.0005407076],"genre_scores_gemma":[0.7010577,0.00000792767,0.29847103,0.0002020202,0.00024440148,5.718596e-7,0.0000032056562,0.0000022076615,0.000010948983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908596,0.000063385894,0.0002867534,0.00010954746,0.00034917632,0.0001051933],"domain_scores_gemma":[0.9990324,0.00004479268,0.00035579398,0.00010691603,0.0003730867,0.0000870468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032830547,0.00007542757,0.00011745755,0.000039448252,0.000074876225,0.00012226518,0.00021808737,0.000028558085,0.0000061032174],"category_scores_gemma":[0.0001277314,0.000059863753,0.00003310526,0.0005039372,0.000015529316,0.0006274794,0.000025737083,0.00006414847,0.0000022965135],"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.000026278607,0.000031562897,0.00057277764,0.000004102191,0.000007997129,0.0000042992046,0.000035093897,0.9654019,0.000012454255,0.01404015,0.00009718286,0.019766236],"study_design_scores_gemma":[0.00055495946,0.00030473692,0.00050618727,0.00002802477,0.000009505666,0.00009471383,0.0000038701596,0.9958455,0.00014873382,0.0011645214,0.0012614868,0.00007776432],"about_ca_topic_score_codex":0.0000019532097,"about_ca_topic_score_gemma":0.000005954138,"teacher_disagreement_score":0.6961616,"about_ca_system_score_codex":0.000078214594,"about_ca_system_score_gemma":0.00011832109,"threshold_uncertainty_score":0.24411729},"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":"W2098001620","doi":"","title":"Visibility Maintenance of a Moving Segment Observer inside Polygons with Holes","year":2010,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Visibility; Visibility graph; Polygon (computer graphics); Star-shaped polygon; Observer (physics); Point in polygon; Preprocessor; Line segment; Rectilinear polygon; Combinatorics; Computer science; Mathematics; Line (geometry); Computer vision; Artificial intelligence; Simple polygon; Regular polygon; Geometry; Optics; Physics","score_opus":0.011979340061908365,"score_gpt":0.2305946490096595,"score_spread":0.21861530894775114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098001620","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.5318334,0.00000606255,0.46667466,0.00029384712,0.00009092932,0.00005680752,5.9590127e-7,0.000031124455,0.0010125984],"genre_scores_gemma":[0.8164215,7.2616683e-7,0.18307318,0.00017755003,0.000022049246,0.000003762117,0.000001334578,0.0000020242321,0.00029784578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99930525,0.000019146559,0.00014616876,0.00022287383,0.00019133894,0.00011524168],"domain_scores_gemma":[0.9993547,0.00006158201,0.000060482827,0.00033174895,0.00014116085,0.000050279235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002154003,0.00006847581,0.00008323842,0.000053775846,0.000050552164,0.000039415296,0.00024420797,0.000023849423,0.000024540335],"category_scores_gemma":[0.000038526494,0.00004989962,0.000029136223,0.00029432884,0.000047106107,0.00030060738,0.00010503045,0.00008248225,0.0000082759425],"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.000037854683,0.0004174529,0.028419785,0.000043889446,0.000045850116,0.000011263313,0.0011426498,0.011873985,0.19425999,0.67456746,0.0007568472,0.08842296],"study_design_scores_gemma":[0.0010503329,0.00031590328,0.5473713,0.000046689263,0.000010785008,0.000053363252,0.000105098654,0.2274165,0.20556344,0.016092326,0.001538776,0.00043543006],"about_ca_topic_score_codex":0.000041592702,"about_ca_topic_score_gemma":0.00024282168,"teacher_disagreement_score":0.65847516,"about_ca_system_score_codex":0.000010686374,"about_ca_system_score_gemma":0.00009344911,"threshold_uncertainty_score":0.20348474},"labels":[],"label_agreement":null},{"id":"W2098355410","doi":"10.1142/s0218195902000748","title":"APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"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":"Annulus (botany); Mathematics; Combinatorics; Cylinder; Dimension (graph theory); Upper and lower bounds; Running time; Point (geometry); Simple (philosophy); RADIUS; Set (abstract data type); Approximation algorithm; Geometry; Mathematical analysis; Algorithm; Computer science","score_opus":0.020348855225838406,"score_gpt":0.2588979367072863,"score_spread":0.23854908148144788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098355410","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.010695472,0.0020664886,0.9804131,0.0047093085,0.00054529135,0.00035706008,0.000018064682,0.000047576614,0.0011476754],"genre_scores_gemma":[0.7307082,0.00016288586,0.26700476,0.0009861945,0.00088526757,0.000060896815,0.000025002084,0.000015272599,0.00015154926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697584,0.00012159632,0.0010415715,0.0003767475,0.0012325137,0.0002517255],"domain_scores_gemma":[0.9959829,0.0012188654,0.00090234005,0.00027895643,0.0014429818,0.00017395028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008095333,0.00023907605,0.0002654166,0.0006959634,0.00041281187,0.00060042395,0.0014409067,0.000080487596,0.000087525186],"category_scores_gemma":[0.00016880246,0.00020139581,0.00017873972,0.0010404533,0.00015114005,0.00076628936,0.00022899527,0.00035029667,0.000038095426],"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.000023223369,0.0005108888,0.0014137118,0.000027016353,0.00040804592,0.000026211772,0.00086928456,0.12932776,0.00054678734,0.099365115,0.001989493,0.76549244],"study_design_scores_gemma":[0.0023679968,0.00028477397,0.011826211,0.00012244165,0.000099566285,0.0026627218,0.00023391626,0.65606356,0.00069372245,0.25372276,0.07115419,0.0007681505],"about_ca_topic_score_codex":0.0000041201206,"about_ca_topic_score_gemma":0.0000013662742,"teacher_disagreement_score":0.7647243,"about_ca_system_score_codex":0.00011156436,"about_ca_system_score_gemma":0.000112498295,"threshold_uncertainty_score":0.82126826},"labels":[],"label_agreement":null},{"id":"W2098742646","doi":"10.1007/s00454-010-9288-6","title":"Lines Pinning Lines","year":2010,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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":"Banff International Research Station for Mathematical Innovation and Discovery; Korea Advanced Institute of Science and Technology; Research Institute for Mathematical Sciences; Division of Mathematical Sciences; Institut national de recherche en informatique et en automatique (INRIA); National Science Foundation","keywords":"Combinatorics; Polytope; Disjoint sets; Regular polygon; Line (geometry); Transversal (combinatorics); Mathematics; Face (sociological concept); Convex polytope; Pairwise comparison; Convex set; Geometry; Mathematical analysis; Sociology; Convex optimization; Statistics","score_opus":0.012523875588679477,"score_gpt":0.27200951409927454,"score_spread":0.2594856385105951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098742646","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.23040101,0.0001342891,0.76393247,0.00221766,0.0014975939,0.00013734186,0.000012137737,0.0002941508,0.0013733497],"genre_scores_gemma":[0.7777908,0.0000040778586,0.21962938,0.0010648587,0.00076272385,0.000018283237,0.00017840618,0.000016221187,0.00053525274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997834,0.0000530903,0.0004559605,0.0006071188,0.0006926743,0.00035714536],"domain_scores_gemma":[0.998335,0.00041846762,0.00017541488,0.00040235158,0.00047456234,0.00019421309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042889686,0.00025753432,0.00022485464,0.0005778394,0.00036679194,0.00038999825,0.00080126023,0.00011730473,0.00016914344],"category_scores_gemma":[0.0002491901,0.00025233382,0.00014732887,0.0016790704,0.000080007805,0.0008551704,0.0002940044,0.00038651464,0.00022609263],"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.000021826816,0.00020916256,0.003993916,0.000046154637,0.00009774153,0.000032300275,0.00042750043,0.3579524,0.00900138,0.4802225,0.0041744555,0.14382066],"study_design_scores_gemma":[0.0006650785,0.00009505472,0.061056685,0.000023000997,0.0000141870505,0.00012100679,0.000020863026,0.8458678,0.0017527874,0.05213491,0.037616894,0.00063170673],"about_ca_topic_score_codex":0.000016989932,"about_ca_topic_score_gemma":0.000008220081,"teacher_disagreement_score":0.5473898,"about_ca_system_score_codex":0.000021292797,"about_ca_system_score_gemma":0.00018128322,"threshold_uncertainty_score":0.9999929},"labels":[],"label_agreement":null},{"id":"W2098900782","doi":"10.1007/3-540-45253-2_21","title":"I/O-Efficient Well-Separated Pair Decomposition and Its Applications","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Computer science; Decomposition; Algorithm; Chemistry; Organic chemistry","score_opus":0.011352390769116972,"score_gpt":0.2565343242452294,"score_spread":0.2451819334761124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098900782","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.0007280965,0.0011947226,0.9924247,0.00065512623,0.00043027542,0.0006208409,0.0000067226433,0.00016514833,0.0037743475],"genre_scores_gemma":[0.73750407,0.0001918449,0.25866997,0.0018506122,0.0007584727,0.00008277146,0.00006866439,0.000042458363,0.0008311626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719304,0.000035275167,0.00043618458,0.0012815568,0.000659364,0.0003945922],"domain_scores_gemma":[0.99849886,0.00031146893,0.00017962515,0.00059091375,0.00024136668,0.00017777116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045445902,0.00037874177,0.00030764073,0.0008000282,0.00040168763,0.0004201924,0.0010784727,0.00021516038,0.000046100755],"category_scores_gemma":[0.000014635274,0.00038074114,0.000072136776,0.00083909696,0.0002001979,0.00024873804,0.00041855124,0.00039100306,0.00015383081],"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.000004329507,0.00003618785,0.0000027408184,0.000016526752,0.0000062766535,0.000011119356,0.00013736494,0.5660305,0.00023786914,0.03732121,0.00001816271,0.3961777],"study_design_scores_gemma":[0.00018328542,0.00008307872,0.00007730565,0.000086437314,0.00000714015,0.00008284442,3.885992e-8,0.92939425,0.001195038,0.062303517,0.0061753257,0.00041171812],"about_ca_topic_score_codex":0.0000037392863,"about_ca_topic_score_gemma":0.0000071785103,"teacher_disagreement_score":0.73677593,"about_ca_system_score_codex":0.00016862284,"about_ca_system_score_gemma":0.0003202823,"threshold_uncertainty_score":0.99986446},"labels":[],"label_agreement":null},{"id":"W2099188592","doi":"10.1007/978-3-540-30551-4_62","title":"Boundary-Optimal Triangulation Flooding","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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","funders":"","keywords":"Triangulation; Combinatorics; Boundary (topology); Planar; Mathematics; Flooding (psychology); Point set triangulation; Sequence (biology); Physics; Geometry; Discrete mathematics; Computer science; Mathematical analysis; Delaunay triangulation; Computer graphics (images)","score_opus":0.017610401689547018,"score_gpt":0.25038856005308996,"score_spread":0.23277815836354293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099188592","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.0004321416,0.00046048788,0.9932103,0.00068746874,0.0024516322,0.00033707728,0.000003353217,0.00017907695,0.0022384222],"genre_scores_gemma":[0.2875366,0.000025167288,0.70973223,0.00086956756,0.0011570649,0.000008349687,0.000028773538,0.000030244308,0.0006120053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965736,0.000027901691,0.0005269136,0.0012991214,0.0010745142,0.0004979264],"domain_scores_gemma":[0.99825895,0.00024877206,0.0002661946,0.0007944286,0.00027886432,0.0001527868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083384017,0.0004259976,0.0003808057,0.0011245427,0.00041496605,0.00088386197,0.001660382,0.0002691781,0.000050148334],"category_scores_gemma":[0.00008896274,0.0004321879,0.00014093303,0.0008702652,0.00030489574,0.0009799782,0.0006459587,0.0005442957,0.0000764425],"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.0000041439084,0.000015314785,0.0000044071485,0.000013515325,0.0000061770957,0.000028683584,0.00033315114,0.5344601,0.00017929882,0.06275261,0.000008494723,0.40219408],"study_design_scores_gemma":[0.00047260674,0.00014979701,0.00018194153,0.00020687946,0.0000069512926,0.000069802365,7.070303e-8,0.6626308,0.0018875985,0.33205712,0.0017573884,0.0005790309],"about_ca_topic_score_codex":0.000009877027,"about_ca_topic_score_gemma":0.000016996844,"teacher_disagreement_score":0.40161505,"about_ca_system_score_codex":0.00056686235,"about_ca_system_score_gemma":0.0012689752,"threshold_uncertainty_score":0.999813},"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":"W2099432728","doi":"10.1142/s0218195907002380","title":"ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX","year":2007,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Visibility; Disjoint sets; Mathematics; Bounded function; Unit (ring theory); Plane (geometry); Combinatorics; Geometry; Mathematical analysis; Optics; Physics","score_opus":0.019550224768341694,"score_gpt":0.3028139018826694,"score_spread":0.2832636771143277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099432728","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.08209621,0.00009310843,0.91024935,0.005265895,0.00061227364,0.00039674743,0.000024593826,0.000025310843,0.0012365244],"genre_scores_gemma":[0.96364707,0.0000061724295,0.03434849,0.0014037865,0.00046242806,0.000021460723,0.000012976345,0.000009100074,0.00008849592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965997,0.0001405924,0.0010542632,0.00026094163,0.0017553476,0.00018920722],"domain_scores_gemma":[0.9917196,0.004079169,0.0010636267,0.0004375209,0.0026017511,0.00009830684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015518868,0.00017319365,0.00021233235,0.00039657552,0.00025484696,0.00013023216,0.0024486873,0.000061851526,0.00012344104],"category_scores_gemma":[0.00052231184,0.00011497267,0.00030134956,0.0016468912,0.00017203408,0.0003071931,0.00025703764,0.00032010695,0.000022900822],"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.00010233904,0.00076958654,0.0011133354,0.000011444964,0.0003070355,0.0000052374803,0.00029657624,0.15412949,0.0023574869,0.7880882,0.0030384364,0.049780857],"study_design_scores_gemma":[0.0016230241,0.00026010378,0.33180404,0.00008426512,0.000052295796,0.00036036703,0.00019542192,0.023750423,0.0069607454,0.58929455,0.04519293,0.0004218371],"about_ca_topic_score_codex":0.000004783782,"about_ca_topic_score_gemma":0.000003192397,"teacher_disagreement_score":0.88155085,"about_ca_system_score_codex":0.00016243912,"about_ca_system_score_gemma":0.0002950034,"threshold_uncertainty_score":0.46884492},"labels":[],"label_agreement":null},{"id":"W2099582307","doi":"10.1142/s0218195906001975","title":"GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS","year":2006,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"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":"Mathematics; Logarithm; Sublinear function; Dimension (graph theory); Constant (computer programming); Point (geometry); Simple (philosophy); Set (abstract data type); Sliding window protocol; Optimization problem; Space (punctuation); Upper and lower bounds; Mathematical optimization; Window (computing); Applied mathematics; Combinatorics; Mathematical analysis; Geometry; Computer science","score_opus":0.01009771432731352,"score_gpt":0.2581873079074709,"score_spread":0.2480895935801574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099582307","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.0033548586,0.0008783124,0.9917087,0.0011298483,0.0008391133,0.0004412168,0.000025641173,0.00010002875,0.0015222951],"genre_scores_gemma":[0.68713963,0.00006212414,0.3100898,0.00037982044,0.0017522137,0.00008846606,0.00020613291,0.000024025368,0.00025781826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961161,0.00009080771,0.0012832651,0.00042633092,0.0017914916,0.0002919828],"domain_scores_gemma":[0.9951245,0.0005577285,0.0011405096,0.00027522785,0.002748886,0.00015314645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075433793,0.00026849823,0.00030945826,0.0024935827,0.00024574413,0.00055437523,0.0016199284,0.00011306847,0.00012602116],"category_scores_gemma":[0.00008338276,0.00027755118,0.00027317376,0.003084231,0.00005318325,0.0015765071,0.00021876008,0.0002924573,0.000055598735],"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.000011585912,0.00031189845,0.0006567896,0.000009696255,0.00010692892,0.000011566176,0.000026736794,0.8981535,0.00014687769,0.07489093,0.0013325014,0.024341032],"study_design_scores_gemma":[0.003211694,0.00024558947,0.020280726,0.00009484905,0.00008546909,0.0011860983,0.00003126311,0.6343027,0.0010490986,0.16394836,0.17465718,0.00090698054],"about_ca_topic_score_codex":0.000016161779,"about_ca_topic_score_gemma":0.0000019214447,"teacher_disagreement_score":0.6837848,"about_ca_system_score_codex":0.00029519675,"about_ca_system_score_gemma":0.00034678416,"threshold_uncertainty_score":0.9999677},"labels":[],"label_agreement":null},{"id":"W2100104291","doi":"","title":"Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis.","year":2008,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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":"Convex hull; Orthogonal convex hull; Convex combination; Convex polytope; Convex analysis; Convex set; Combinatorics; Mathematics; Subderivative; Regular polygon; Proper convex function; Plane (geometry); Hull; Geometry; Convex body; Convex optimization; Engineering","score_opus":0.027037493417761398,"score_gpt":0.23658781060333423,"score_spread":0.20955031718557282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100104291","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.7543182,0.00004737477,0.24178688,0.00034737054,0.000095457566,0.00015334076,0.0000030716712,0.000011910262,0.0032364454],"genre_scores_gemma":[0.9966352,0.0000054578427,0.0029431314,0.00026876442,0.000015735384,0.000002521813,0.0000066819853,0.0000011460753,0.0001213439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99903584,0.0002580084,0.00019890215,0.00014239267,0.00028817382,0.00007671211],"domain_scores_gemma":[0.9992794,0.000170328,0.00010868852,0.00032139977,0.00010262361,0.000017587156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040617984,0.000057543217,0.0001326259,0.00014222338,0.000057666064,0.000008881241,0.00050196843,0.000027502325,0.00001590131],"category_scores_gemma":[0.000020920794,0.000032683845,0.00006010493,0.0015545328,0.00006544982,0.00015835042,0.00005709955,0.00006045922,0.0000016562157],"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.00008097368,0.0009715689,0.05195741,0.000029221726,0.0003864105,0.000020052687,0.031842653,0.31434473,0.008436591,0.5811519,0.0016341786,0.009144281],"study_design_scores_gemma":[0.0004254486,0.00027998522,0.5209295,0.0000072978955,0.000037971375,0.000019403766,0.00056629465,0.45314628,0.021586807,0.002668654,0.00020990014,0.00012245929],"about_ca_topic_score_codex":0.00018461076,"about_ca_topic_score_gemma":0.00024992396,"teacher_disagreement_score":0.5784833,"about_ca_system_score_codex":0.000008417042,"about_ca_system_score_gemma":0.00008354243,"threshold_uncertainty_score":0.13328084},"labels":[],"label_agreement":null},{"id":"W2100302985","doi":"10.1142/s021819591360011x","title":"ROBUST NONPARAMETRIC SIMPLIFICATION OF POLYGONAL CHAINS","year":2013,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","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 Manitoba","funders":"","keywords":"Subsequence; Polygonal chain; Combinatorics; Cardinality (data modeling); Simple (philosophy); Nonparametric statistics; Sequence (biology); Mathematics; Monotonic function; Chain (unit); Piecewise; Piecewise linear function; Plane (geometry); Binary logarithm; Algorithm; Discrete mathematics; Computer science; Geometry; Bounded function; Regular polygon; Mathematical analysis; Statistics","score_opus":0.019437849981048746,"score_gpt":0.26814273900463526,"score_spread":0.2487048890235865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100302985","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.023457328,0.00044534288,0.97215384,0.0020735548,0.0005480313,0.0004854589,0.000029599349,0.00004609237,0.0007607501],"genre_scores_gemma":[0.7802986,0.00004799806,0.21833548,0.00036898258,0.00059307844,0.000100212645,0.00008780283,0.000014191101,0.00015364506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963672,0.00009093543,0.0013565788,0.00034996032,0.0016008224,0.00023446359],"domain_scores_gemma":[0.9925157,0.00078224245,0.001355683,0.0003260998,0.004816416,0.00020385296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005836263,0.0002240058,0.0003340843,0.0019830326,0.00012920433,0.00025245443,0.0018734747,0.00010258587,0.0001911558],"category_scores_gemma":[0.00015832124,0.00022450853,0.00027544255,0.0023674038,0.00010677566,0.0013267243,0.00019993694,0.00026551972,0.00013923642],"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.00002527641,0.0008071356,0.0011679778,0.000027538159,0.0003568546,0.0000045265156,0.00014570654,0.5283461,0.0019931444,0.2397479,0.0018466912,0.2255311],"study_design_scores_gemma":[0.0035572974,0.0006192655,0.11570772,0.0001292109,0.00011812764,0.0011271478,0.00025537962,0.4787254,0.0059225657,0.3443295,0.048350696,0.0011576788],"about_ca_topic_score_codex":0.000013815477,"about_ca_topic_score_gemma":6.6845047e-7,"teacher_disagreement_score":0.7568413,"about_ca_system_score_codex":0.00016532984,"about_ca_system_score_gemma":0.00042615653,"threshold_uncertainty_score":0.91551924},"labels":[],"label_agreement":null},{"id":"W2100967180","doi":"10.1016/j.jda.2003.12.004","title":"Optimizing a constrained convex polygonal annulus","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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":"Carleton University","funders":"","keywords":"Polygon (computer graphics); Star-shaped polygon; Polygon covering; Convex polygon; Rectilinear polygon; Regular polygon; Annulus (botany); Mathematics; Point in polygon; Combinatorics; Mathematical optimization; Algorithm; Computer science; Convex set; Geometry; Simple polygon; Convex optimization","score_opus":0.012492690460309706,"score_gpt":0.2567539926501066,"score_spread":0.24426130218979691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100967180","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.012726302,0.0006587427,0.9817258,0.003472076,0.0007678806,0.000057865927,0.0000045185684,0.000024707877,0.00056212017],"genre_scores_gemma":[0.5802977,0.000025669779,0.41895366,0.00027978665,0.00037805765,9.121708e-7,0.0000025189902,0.000005208641,0.000056467026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872494,0.00003898721,0.00043123143,0.00015031369,0.00045922145,0.00019529763],"domain_scores_gemma":[0.9990347,0.0000596305,0.00030899598,0.0001379805,0.00029418367,0.00016452877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039089072,0.00011738381,0.00020375488,0.00021175183,0.00010633161,0.00015679037,0.00039122842,0.000045883815,0.000018263072],"category_scores_gemma":[0.000055711203,0.00009911349,0.0001459981,0.00038776832,0.000051233583,0.0008128041,0.00007253561,0.00018867347,0.000011013146],"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.00012190349,0.0004846965,0.00010403014,0.000041427098,0.0004762466,0.0010672037,0.005196714,0.51161563,0.018259678,0.2195174,0.0015620278,0.24155301],"study_design_scores_gemma":[0.018459626,0.004487698,0.006420944,0.0005575613,0.00018178517,0.012012215,0.000984715,0.70004886,0.0523676,0.18556044,0.016963517,0.001955006],"about_ca_topic_score_codex":0.000005415369,"about_ca_topic_score_gemma":8.7796576e-7,"teacher_disagreement_score":0.5675714,"about_ca_system_score_codex":0.000066756795,"about_ca_system_score_gemma":0.00036478625,"threshold_uncertainty_score":0.40417305},"labels":[],"label_agreement":null},{"id":"W2101578223","doi":"10.1109/ipps.1997.580962","title":"A 2-D parallel convex hull algorithm with optimal communication phases","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Convex hull; Output-sensitive algorithm; Sorting; Combinatorics; Parallel algorithm; Computation; Regular polygon; Set (abstract data type); Constant (computer programming); Hull; Convex set; Algorithm; Convex combination; Computer science; Mathematics; Parallel computing; Convex optimization; Geometry; Engineering","score_opus":0.023476187831251723,"score_gpt":0.2362143654348949,"score_spread":0.2127381776036432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101578223","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.0027896254,0.00026654216,0.9871572,0.0015433513,0.000044049302,0.00010535467,9.819544e-7,0.00014635088,0.007946528],"genre_scores_gemma":[0.2504344,0.000045853656,0.7459465,0.00055140734,0.00003352413,0.000017394403,0.000012467061,0.0000035750352,0.0029548227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993131,0.000041129035,0.00012516568,0.00019453294,0.0001987593,0.00012727358],"domain_scores_gemma":[0.9993481,0.0000774675,0.0000481903,0.00036093942,0.00010670772,0.000058562004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094624746,0.000084695,0.00008234914,0.000072402974,0.00014461597,0.00013029012,0.00038126597,0.00002515397,0.00026236137],"category_scores_gemma":[0.000007328782,0.0000688363,0.000023596718,0.0003329662,0.000032795477,0.0004903747,0.000078417754,0.00006285037,0.00009923402],"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.000011818652,0.0006145064,0.000084266816,0.0000074366953,0.000065655964,0.000019013889,0.0017099546,0.053692035,0.00021694084,0.13924935,0.027388427,0.7769406],"study_design_scores_gemma":[0.0005281203,0.00013182982,0.00016323045,0.0000056601816,0.0000036428082,0.000044351316,0.00002504551,0.9851585,0.00062788883,0.00055294414,0.012627966,0.00013082406],"about_ca_topic_score_codex":0.0000126755485,"about_ca_topic_score_gemma":0.000004316755,"teacher_disagreement_score":0.93146646,"about_ca_system_score_codex":0.000014813924,"about_ca_system_score_gemma":0.000016290653,"threshold_uncertainty_score":0.2872673},"labels":[],"label_agreement":null},{"id":"W2101748273","doi":"10.1007/s00371-009-0363-z","title":"Approximate topological matching of quad meshes","year":2009,"lang":"en","type":"article","venue":"The Visual Computer","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":"McGill University","funders":"","keywords":"Polygon mesh; Quadrilateral; Computer science; Matching (statistics); Computer graphics; Greedy algorithm; Algorithm; Set (abstract data type); Representation (politics); Time complexity; Volume mesh; Mathematics; Theoretical computer science; Topology (electrical circuits); Mathematical optimization; Combinatorics; Mesh generation; Finite element method; Artificial intelligence; Computer graphics (images)","score_opus":0.019986501163395804,"score_gpt":0.29564546637105316,"score_spread":0.27565896520765737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101748273","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.2507844,0.0000448282,0.746847,0.001618201,0.000207162,0.00007419003,3.0973217e-7,0.000072425515,0.00035151636],"genre_scores_gemma":[0.9299975,0.000003603356,0.06848835,0.0012429334,0.00021115123,0.0000016443391,0.000002332102,0.0000021724936,0.00005031771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991085,0.000102443024,0.00021019723,0.0001968669,0.00022718882,0.0001547816],"domain_scores_gemma":[0.99946856,0.00013316439,0.00007949309,0.000222748,0.000059746395,0.00003628752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035127084,0.00009654969,0.00013328894,0.0000639169,0.00012002275,0.000082130166,0.0005334168,0.00003388931,0.000010301415],"category_scores_gemma":[0.000006899704,0.00006204848,0.00006543054,0.0003048005,0.00003445568,0.00019005447,0.00015134894,0.00009032797,0.00001861275],"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.000018011548,0.00022188932,0.000056936147,0.000009937179,0.000020045416,0.0000057011966,0.0013135616,0.018825997,0.0029548984,0.72932804,0.0010340976,0.24621089],"study_design_scores_gemma":[0.00032042316,0.00066561846,0.019552212,0.000020088912,0.000007590519,0.00004367932,0.000019775902,0.80392367,0.006122366,0.16806553,0.0010348771,0.00022416649],"about_ca_topic_score_codex":0.0000057577695,"about_ca_topic_score_gemma":4.8477455e-7,"teacher_disagreement_score":0.78509766,"about_ca_system_score_codex":0.000009833375,"about_ca_system_score_gemma":0.000020843454,"threshold_uncertainty_score":0.25302637},"labels":[],"label_agreement":null},{"id":"W2101955916","doi":"10.1142/s0218195909002861","title":"DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":35,"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":"Delaunay triangulation; Combinatorics; Spanner; Mathematics; Degree (music); Unit disk graph; Vertex (graph theory); Bounded function; Minimum-weight triangulation; Constant (computer programming); Upper and lower bounds; Point set triangulation; Graph; Pitteway triangulation; Discrete mathematics; Constrained Delaunay triangulation; Mathematical analysis; Computer science; Physics","score_opus":0.01813034938883125,"score_gpt":0.2913733717094611,"score_spread":0.27324302232062986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101955916","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.034595948,0.0008913924,0.9597767,0.0033366184,0.00029263916,0.0003046728,0.000030583946,0.000033540036,0.0007379208],"genre_scores_gemma":[0.8382055,0.000060432147,0.1607659,0.00044912187,0.00036098587,0.00001730489,0.00005639059,0.000007399359,0.00007693654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743444,0.00008129266,0.001014136,0.00028196798,0.0010119299,0.0001762606],"domain_scores_gemma":[0.99601644,0.0006113495,0.00088497327,0.00021039236,0.002102084,0.00017478262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060295535,0.00018611884,0.00030846245,0.0011189767,0.0001454897,0.00019439198,0.0009240497,0.00008133515,0.000026134963],"category_scores_gemma":[0.00013212468,0.00018873785,0.0001819539,0.0010432695,0.0001000984,0.00083633134,0.00009582229,0.00019848868,0.000008750578],"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.00008187216,0.0004935901,0.000778342,0.000012251631,0.00028014663,0.00001340325,0.00026175054,0.09756482,0.0013035677,0.5392832,0.00064344506,0.35928363],"study_design_scores_gemma":[0.0038839001,0.00065403915,0.11547659,0.00009256876,0.0001101985,0.00088187243,0.00014240462,0.06464372,0.002153905,0.76963264,0.041710783,0.0006173551],"about_ca_topic_score_codex":0.0000049415567,"about_ca_topic_score_gemma":0.0000020280734,"teacher_disagreement_score":0.80360955,"about_ca_system_score_codex":0.00010564631,"about_ca_system_score_gemma":0.00033377792,"threshold_uncertainty_score":0.7696506},"labels":[],"label_agreement":null},{"id":"W2102022978","doi":"10.1016/j.jsc.2003.08.007","title":"From the zonotope construction to the Minkowski addition of convex polytopes","year":2004,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":163,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Mathematics; Parallelizable manifold; Hyperplane; Minkowski addition; Bounded function; Combinatorics; Generalization; Time complexity; Polynomial; Regular polygon; Discrete mathematics; Algorithm; Mathematical optimization","score_opus":0.010522826828227867,"score_gpt":0.2417820425937021,"score_spread":0.23125921576547423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102022978","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.2571355,0.00014242128,0.7327576,0.008820618,0.000903911,0.00014452868,0.000009837122,0.000011033292,0.00007449502],"genre_scores_gemma":[0.9425408,0.000015484082,0.055964544,0.00067747635,0.0007744072,0.0000033564684,0.0000132926,0.000004458792,0.000006136213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986458,0.00011754654,0.00053113396,0.00013448366,0.0004652905,0.000105784464],"domain_scores_gemma":[0.99838567,0.00033570518,0.00052994065,0.00017144479,0.00051664846,0.000060598126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050124514,0.000098556164,0.00017448695,0.0001447237,0.00016121099,0.00011778801,0.00046368118,0.00003855961,0.000016484246],"category_scores_gemma":[0.000119659475,0.00006205236,0.00010163118,0.00062220776,0.000051036244,0.0004270564,0.00006783862,0.00014095688,0.000017230423],"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.00006981457,0.00014132315,0.00019753254,0.0000100152,0.0001269069,0.000006863781,0.008986178,0.6326296,0.0067218817,0.061860293,0.008738778,0.2805108],"study_design_scores_gemma":[0.0063828286,0.0021244597,0.20843601,0.0007587942,0.00027326902,0.0013966274,0.0044476073,0.14851044,0.056320336,0.53115404,0.039248243,0.0009473123],"about_ca_topic_score_codex":0.00008506827,"about_ca_topic_score_gemma":0.000017451592,"teacher_disagreement_score":0.6854053,"about_ca_system_score_codex":0.00006395901,"about_ca_system_score_gemma":0.00020550805,"threshold_uncertainty_score":0.25304216},"labels":[],"label_agreement":null},{"id":"W2102047759","doi":"10.1145/2421119.2421136","title":"Computational geometry column 54","year":2012,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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 Calgary","funders":"","keywords":"Column (typography); Spanning tree; Geometry; Plane (geometry); Combinatorics; Graph; Computer science; Line segment; Set (abstract data type); Mathematics; Connection (principal bundle)","score_opus":0.02655385791581369,"score_gpt":0.2750105416370427,"score_spread":0.248456683721229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102047759","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.23154551,0.00041954778,0.761752,0.0019722101,0.0012899647,0.00016406953,0.000004253444,0.00020052482,0.0026519261],"genre_scores_gemma":[0.8575789,0.000006684609,0.13958019,0.0017180934,0.0005023242,0.000012280201,0.000037810565,0.000008053207,0.0005556801],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987137,0.00006776692,0.0002325161,0.00024912268,0.00039646466,0.0003404806],"domain_scores_gemma":[0.9987461,0.0003907092,0.00009051285,0.0004741315,0.00010494026,0.00019359724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030691345,0.00013077848,0.00013078241,0.0001901315,0.00017554183,0.00014631292,0.000707855,0.000060155577,0.00012352757],"category_scores_gemma":[0.00023401072,0.00013407433,0.00007267266,0.0007815755,0.000023014803,0.0010671146,0.00031136489,0.00011501755,0.00058323226],"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.000022840872,0.00079467864,0.047304552,0.000038818966,0.00012681913,0.000013213906,0.0024322816,0.04495408,0.002534475,0.29435915,0.11559436,0.49182475],"study_design_scores_gemma":[0.0018360548,0.00029352462,0.3705725,0.00003109364,0.00003630585,0.00021739182,0.00009407303,0.16605644,0.005614698,0.07658845,0.3772944,0.0013650787],"about_ca_topic_score_codex":0.000026734679,"about_ca_topic_score_gemma":0.000004021654,"teacher_disagreement_score":0.62603337,"about_ca_system_score_codex":0.000052033654,"about_ca_system_score_gemma":0.00008833503,"threshold_uncertainty_score":0.7496465},"labels":[],"label_agreement":null},{"id":"W2102170762","doi":"10.20382/jocg.v2i1a3","title":"Delaunay triangulation of imprecise points, preprocess and actually get a fast query time","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Delaunay triangulation; Computer science; Constrained Delaunay triangulation; Triangulation; Bowyer–Watson algorithm; Pitteway triangulation; Point set triangulation; Artificial intelligence; Algorithm; Mathematics; Geometry","score_opus":0.0047364920417147,"score_gpt":0.1985808638164776,"score_spread":0.1938443717747629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102170762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.549913,0.000049511276,0.44899726,0.00028228565,0.000242104,0.00007865978,0.00000784029,0.000017096027,0.00041225355],"genre_scores_gemma":[0.9092461,0.000014121763,0.090085424,0.00007463054,0.00014698846,1.5773155e-7,0.000014366121,0.000007619843,0.00041061142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838006,0.0001048235,0.0004912725,0.00025374064,0.00061327225,0.00015685291],"domain_scores_gemma":[0.99719805,0.0005306594,0.00074131077,0.00017256617,0.0011809404,0.00017649481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065669947,0.00015638005,0.00030538265,0.0014512014,0.00012498247,0.00009236227,0.0005239725,0.00011193274,0.00005736032],"category_scores_gemma":[0.00020437657,0.00016322832,0.0001450483,0.0014042774,0.00008321708,0.0013261181,0.0001625082,0.00028737052,0.0000069494063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001051354,0.0011188993,0.0054323706,0.00021146156,0.0007428276,0.00023051348,0.0032658868,0.5083675,0.05961815,0.12370028,0.002086495,0.29417425],"study_design_scores_gemma":[0.0121325245,0.0021357122,0.17043138,0.00027823303,0.0003599136,0.0020806578,0.00052830385,0.69634897,0.016448017,0.07560373,0.022064386,0.0015881541],"about_ca_topic_score_codex":0.0000043384757,"about_ca_topic_score_gemma":0.0000026599346,"teacher_disagreement_score":0.35933307,"about_ca_system_score_codex":0.000050857652,"about_ca_system_score_gemma":0.00040820072,"threshold_uncertainty_score":0.6656258},"labels":[],"label_agreement":null},{"id":"W2102229938","doi":"10.1007/s00493-016-3441-7","title":"Point-Curve Incidences in the Complex Plane","year":2017,"lang":"en","type":"article","venue":"COMBINATORICA","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 British Columbia","funders":"","keywords":"Mathematics; Hypersurface; Lemma (botany); Algebraic curve; Combinatorics; Plane curve; Algebraic geometry; Algebraic number; Differential geometry; Plane (geometry); Incidence (geometry); Complex plane; Geometry; Discrete mathematics; Mathematical analysis","score_opus":0.047440835050536416,"score_gpt":0.2976345836036157,"score_spread":0.2501937485530793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102229938","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.6392432,0.00088924676,0.23338436,0.051364105,0.004769341,0.0009493043,0.0000065459117,0.0002726371,0.06912127],"genre_scores_gemma":[0.99777186,0.000010487734,0.0016082717,0.00042817363,0.00005363568,0.00001214654,0.000003640483,0.0000020330383,0.00010977359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991732,0.000088457644,0.00013419827,0.00019516333,0.0002648264,0.00014410513],"domain_scores_gemma":[0.99900633,0.00017987425,0.000102636855,0.00062812964,0.0000510499,0.000031950523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004981795,0.00007358844,0.000088526576,0.000065975626,0.00046469123,0.00042699592,0.0016931285,0.000026995916,0.000011465337],"category_scores_gemma":[0.00015530027,0.000054416843,0.000027613756,0.00018625356,0.000041991527,0.00047258372,0.0002116987,0.00010218984,0.000057229383],"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.0000033933534,0.00011813179,0.0059492863,0.000005601669,0.000004816933,0.000040222476,0.00070201507,0.0001016593,0.00012070059,0.9704937,0.009929848,0.012530662],"study_design_scores_gemma":[0.0006350322,0.0001455225,0.7065012,0.000015434369,0.0000030749638,0.000035910456,0.000049730024,0.027745768,0.0003153273,0.2268462,0.037481215,0.00022558469],"about_ca_topic_score_codex":0.00006313079,"about_ca_topic_score_gemma":0.00002023289,"teacher_disagreement_score":0.74364746,"about_ca_system_score_codex":0.000024847068,"about_ca_system_score_gemma":0.00004271896,"threshold_uncertainty_score":0.41175315},"labels":[],"label_agreement":null},{"id":"W2102465478","doi":"10.1007/978-3-642-23719-5_44","title":"Improved Algorithms for Partial Curve Matching","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Algorithm; Computer science; Matching (statistics); Simple (philosophy); Graph; Directed acyclic graph; Data structure; Jordan curve theorem; Mathematics; Combinatorics; Theoretical computer science; Statistics","score_opus":0.03105627783576869,"score_gpt":0.2677941876615241,"score_spread":0.23673790982575538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102465478","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.00003464587,0.00021575362,0.99449575,0.00033013753,0.0033435822,0.00058375765,0.000010711682,0.00014087577,0.0008448062],"genre_scores_gemma":[0.03888672,0.00002022233,0.957866,0.0010486138,0.00139714,0.000040490537,0.00002477636,0.000035035806,0.00068099145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699026,0.000024612471,0.00049919373,0.0013673631,0.0005504841,0.000568074],"domain_scores_gemma":[0.9980431,0.00038259217,0.0002847306,0.00078965677,0.00034108013,0.00015883935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095410703,0.00042591683,0.00039630392,0.0006227555,0.0003247219,0.00045984675,0.0019883486,0.00025132947,0.000018261308],"category_scores_gemma":[0.0000680984,0.00040851027,0.00016811186,0.00040932203,0.00022588237,0.00067315146,0.00072005857,0.00042185746,0.000020633033],"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.000009131659,0.000027378135,0.0000026862397,0.000028880197,0.000012792216,0.00001038804,0.00066839205,0.026792036,0.00031318268,0.06254546,0.000023595363,0.90956604],"study_design_scores_gemma":[0.00024047386,0.00017459874,0.000018586663,0.000071700175,0.0000064662386,0.000025582412,4.3858268e-8,0.64446723,0.0029449519,0.34925124,0.0023723624,0.00042676574],"about_ca_topic_score_codex":0.000023772303,"about_ca_topic_score_gemma":0.000026194915,"teacher_disagreement_score":0.90913934,"about_ca_system_score_codex":0.00016125194,"about_ca_system_score_gemma":0.0005536172,"threshold_uncertainty_score":0.9998367},"labels":[],"label_agreement":null},{"id":"W2102779916","doi":"10.1142/s0218195900000218","title":"A COST/BENEFIT ANALYSIS OF SIMPLICIAL MESH IMPROVEMENT TECHNIQUES AS MEASURED BY SOLUTION EFFICIENCY","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"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 British Columbia","funders":"","keywords":"Polygon mesh; Mathematical optimization; Laplacian smoothing; Finite element method; Simple (philosophy); Smoothing; Computer science; Eigenvalues and eigenvectors; Finite volume method; T-vertices; Mathematics; Quality (philosophy); Algorithm; Applied mathematics; Mesh generation; Geometry","score_opus":0.013400962522910589,"score_gpt":0.30061710136805564,"score_spread":0.2872161388451451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102779916","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.031098085,0.00033051657,0.96566606,0.0010982343,0.00019949346,0.0005192092,0.00012598255,0.000064066044,0.000898351],"genre_scores_gemma":[0.9417344,0.00012540538,0.056420974,0.0006177025,0.00036637377,0.00013772113,0.0003154156,0.000014844838,0.00026717453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960002,0.00006960037,0.0013572864,0.00041291615,0.0019106779,0.00024933362],"domain_scores_gemma":[0.9953895,0.00036964414,0.0009715501,0.00030365947,0.0027877197,0.00017791778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079750497,0.0002411013,0.00044269802,0.0018467259,0.000179392,0.00019152505,0.0015412436,0.000109135515,0.00033369605],"category_scores_gemma":[0.000058218255,0.00024962946,0.00043870354,0.0033881203,0.000094940144,0.00069647614,0.000119058255,0.00022222415,0.000033754328],"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.000087263295,0.0008865421,0.00018416022,0.000009598394,0.0012758613,0.0000039189435,0.00015640992,0.23544835,0.005541376,0.032580018,0.0010306278,0.72279584],"study_design_scores_gemma":[0.0038323293,0.0016727416,0.013035425,0.00013268662,0.0015893937,0.00040741052,0.00012379678,0.47481522,0.049644675,0.1691481,0.28390765,0.0016905674],"about_ca_topic_score_codex":0.000035412882,"about_ca_topic_score_gemma":0.0000043548775,"teacher_disagreement_score":0.9106363,"about_ca_system_score_codex":0.00026181465,"about_ca_system_score_gemma":0.00033554793,"threshold_uncertainty_score":0.9999956},"labels":[],"label_agreement":null},{"id":"W2102860190","doi":"","title":"Drawing Graphs on the Torus","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Torus; Combinatorics; Vertex (graph theory); Rotation system; Toroid; Planar graph; Embedding; Rotation (mathematics); Graph; Bipartite graph; Discrete mathematics; Geometry; Physics; Computer science","score_opus":0.017115935340757702,"score_gpt":0.23966051249161976,"score_spread":0.22254457715086207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102860190","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.96816427,0.00009274841,0.011146339,0.0046886695,0.0032029601,0.00014263373,3.1193676e-7,0.00014780025,0.012414278],"genre_scores_gemma":[0.9978946,0.000011341049,0.00058599986,0.0011015487,0.000015747124,0.000011341323,0.000001645171,0.000004145369,0.00037365567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992129,0.0000640141,0.00011179301,0.00019960325,0.00025487575,0.0001567655],"domain_scores_gemma":[0.9992917,0.0002184038,0.000039683262,0.00034352727,0.000060507013,0.000046162037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026366333,0.00008200689,0.00006347044,0.00007183195,0.00025985288,0.00013870202,0.00047148752,0.00002787682,0.000023156428],"category_scores_gemma":[0.000055590648,0.00006087645,0.00004760572,0.00061769615,0.000017590688,0.00020213518,0.00008188273,0.00009721308,0.00013088157],"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.000002230007,0.000037315778,0.00026154492,5.70788e-7,0.000005833242,0.000006635645,0.00011088308,0.0002888555,0.00016379436,0.9879656,0.0029723775,0.008184379],"study_design_scores_gemma":[0.00023658758,0.00008936441,0.00553952,0.000008367684,0.000002319366,0.000012808575,0.000011677307,0.012003569,0.0015328869,0.9599578,0.020484038,0.00012107188],"about_ca_topic_score_codex":0.000006791754,"about_ca_topic_score_gemma":0.0000011741053,"teacher_disagreement_score":0.029730318,"about_ca_system_score_codex":0.000023920042,"about_ca_system_score_gemma":0.000030644183,"threshold_uncertainty_score":0.24824695},"labels":[],"label_agreement":null},{"id":"W2102891664","doi":"","title":"Dynamic Ham-Sandwich Cuts in the Plane","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Combinatorics; Mathematics; Regular polygon; Cardinality (data modeling); Convex polygon; Point (geometry); Polygon (computer graphics); Plane (geometry); Time complexity; Partition (number theory); General position; Line (geometry); Convex set; Convex optimization; Computer science; Geometry","score_opus":0.008813267776402836,"score_gpt":0.24724498760321245,"score_spread":0.2384317198268096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102891664","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.1410001,0.00013741397,0.82460797,0.013705644,0.00017075843,0.000117510746,5.622355e-7,0.000065095584,0.020194948],"genre_scores_gemma":[0.96563274,0.0000055185824,0.031029329,0.0018011346,0.000045897043,0.0000053324384,0.0000055233304,0.000001160515,0.0014733457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999505,0.00003417242,0.00009226202,0.00012432634,0.00014973308,0.00009454812],"domain_scores_gemma":[0.9997231,0.00007289715,0.0000148838,0.00015785349,0.000015678712,0.000015637035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002154393,0.000043583907,0.00003766801,0.00006698746,0.000046274617,0.000073997195,0.0003347987,0.000016814376,0.000030307367],"category_scores_gemma":[0.000008901411,0.00002895265,0.000014428684,0.0003179077,0.000005966546,0.00021334687,0.0000358256,0.000052870106,0.000120392455],"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.000007742486,0.0002691363,0.00068862276,0.000006633689,0.000009803728,0.000019800897,0.003039773,0.080720276,0.0017349835,0.35736376,0.020510104,0.5356294],"study_design_scores_gemma":[0.00024449543,0.000030246907,0.020332385,0.0000028531335,9.693282e-7,0.000038731498,0.000024213232,0.9254012,0.00044872265,0.0039023843,0.049480308,0.00009345057],"about_ca_topic_score_codex":0.000008977107,"about_ca_topic_score_gemma":0.00018806882,"teacher_disagreement_score":0.84468096,"about_ca_system_score_codex":0.000015518597,"about_ca_system_score_gemma":0.00002415426,"threshold_uncertainty_score":0.15474416},"labels":[],"label_agreement":null},{"id":"W2102922436","doi":"10.1142/s0218195900000048","title":"POINT VISIBILITY GRAPHS AND ${\\mathcal O}$-CONVEX COVER","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Visibility graph; Polygon (computer graphics); Visibility polygon; Regular polygon; Visibility; Cardinality (data modeling); Uncountable set; Discrete mathematics; Polygon covering; Computer science; Geometry","score_opus":0.00838546564601397,"score_gpt":0.2720966079656274,"score_spread":0.26371114231961346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102922436","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.08604785,0.0006292768,0.90831274,0.0026994424,0.00035055977,0.00031384727,0.000031855532,0.0000689642,0.0015454567],"genre_scores_gemma":[0.89456373,0.00016940413,0.10309823,0.0012072901,0.00043123882,0.000046820944,0.000057392223,0.000013852333,0.0004120148],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997273,0.000091224414,0.00089339743,0.00039749563,0.0011390989,0.0002057787],"domain_scores_gemma":[0.9972006,0.0004991343,0.00041720274,0.00025379687,0.0014061134,0.00022314198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068778876,0.00020931831,0.00027453387,0.0007000679,0.00018213132,0.0003505765,0.0010566101,0.00008506874,0.00044842248],"category_scores_gemma":[0.000053308228,0.00020731201,0.00019277545,0.0009103042,0.00012255493,0.0011697664,0.00013643749,0.0002714638,0.00014751856],"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.00009422223,0.0005932936,0.0011034443,0.00002010977,0.00032145105,0.00002822487,0.00021659762,0.13421535,0.00022412841,0.28732488,0.001991626,0.57386667],"study_design_scores_gemma":[0.0020843837,0.00025353153,0.04023653,0.00004874824,0.00005076126,0.0016837801,0.00003773855,0.08869766,0.00040571933,0.6877526,0.17819434,0.0005541744],"about_ca_topic_score_codex":0.0000051561005,"about_ca_topic_score_gemma":6.5313276e-7,"teacher_disagreement_score":0.8085159,"about_ca_system_score_codex":0.00010868698,"about_ca_system_score_gemma":0.00023939899,"threshold_uncertainty_score":0.8453939},"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":"W2103189192","doi":"10.1142/s0218195912600096","title":"THREE PROBLEMS ABOUT DYNAMIC CONVEX HULLS","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"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":"Convex hull; Combinatorics; Mathematics; Amortized analysis; Binary logarithm; Line segment; Plane (geometry); Line (geometry); Data structure; Computational geometry; Regular polygon; Range (aeronautics); Competitive analysis; Set (abstract data type); Convex set; Upper and lower bounds; Algorithm; Convex optimization; Geometry; Computer science; Mathematical analysis","score_opus":0.013952405619557368,"score_gpt":0.28906387226589997,"score_spread":0.2751114666463426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103189192","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.006242949,0.0024207523,0.9865479,0.0018657733,0.0014071047,0.00041170922,0.000030008323,0.00007949714,0.0009943466],"genre_scores_gemma":[0.8147651,0.00007073403,0.182823,0.00068227,0.0013165333,0.00010078142,0.000103975224,0.000020433936,0.00011714983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99666154,0.00006494693,0.0010578689,0.00030240486,0.0015473671,0.00036585864],"domain_scores_gemma":[0.9956829,0.0005219359,0.0009115904,0.00029787436,0.0022758036,0.00030987972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091614196,0.00025103864,0.0003061958,0.0010785084,0.00020045962,0.00030413663,0.0017405482,0.000103567174,0.00011651906],"category_scores_gemma":[0.000075777025,0.00024989355,0.00026138985,0.0012293297,0.00009063441,0.0017260122,0.00019352736,0.0003350846,0.0002256027],"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.000040883577,0.0013183375,0.004747077,0.000043281245,0.000701959,0.000011907597,0.00048137485,0.2507559,0.0009333182,0.39794913,0.0027868382,0.34023002],"study_design_scores_gemma":[0.0027823846,0.00027821463,0.103411935,0.0001371328,0.00011572454,0.002125385,0.00009757497,0.13898121,0.00074147264,0.27715042,0.4730809,0.0010976461],"about_ca_topic_score_codex":0.000004067672,"about_ca_topic_score_gemma":0.00000242465,"teacher_disagreement_score":0.80852216,"about_ca_system_score_codex":0.00024140923,"about_ca_system_score_gemma":0.00031902263,"threshold_uncertainty_score":0.99999535},"labels":[],"label_agreement":null},{"id":"W2103293229","doi":"10.1016/s0010-4485(01)00119-1","title":"Separating an object from its cast","year":2002,"lang":"en","type":"article","venue":"Computer-Aided Design","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":"Carleton University","funders":"","keywords":"Object (grammar); Casting; Cast iron; Computer science; Engineering drawing; Materials science; Artificial intelligence; Metallurgy; Engineering","score_opus":0.09931367032658106,"score_gpt":0.26914684859530613,"score_spread":0.16983317826872507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103293229","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.02579563,0.0004297098,0.97139364,0.00020709245,0.0009769244,0.00023727586,0.000004022459,0.00037862314,0.0005770725],"genre_scores_gemma":[0.52688175,0.00000888133,0.47157207,0.0005794675,0.00068228605,0.000013422283,0.000016560258,0.000012330509,0.00023323452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979053,0.00034490202,0.00035597786,0.00068444223,0.00037450963,0.00033483523],"domain_scores_gemma":[0.9985274,0.00039937676,0.000131633,0.0005771396,0.00016649763,0.00019796628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003297748,0.00023260753,0.00022724384,0.0001801471,0.0002960527,0.00049878383,0.0008191474,0.00008411588,0.00011964965],"category_scores_gemma":[0.00003574723,0.00024198605,0.00007562547,0.0006328263,0.000018976833,0.0011711909,0.00019008637,0.00015384261,0.00055040343],"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.000013505912,0.0004187894,0.000061021994,0.0000132011355,0.000073342664,0.00016403322,0.0031938814,0.3448713,0.011676928,0.014021122,0.02035041,0.6051424],"study_design_scores_gemma":[0.00036710745,0.0002735279,0.0006470182,0.000017481274,0.0000064755027,0.00004227309,0.000005051418,0.9880657,0.0062078307,0.0023467313,0.0017241825,0.0002966288],"about_ca_topic_score_codex":0.000015347363,"about_ca_topic_score_gemma":0.0000033577628,"teacher_disagreement_score":0.6431944,"about_ca_system_score_codex":0.00005266594,"about_ca_system_score_gemma":0.000049258106,"threshold_uncertainty_score":0.9867905},"labels":[],"label_agreement":null},{"id":"W2103317190","doi":"10.1007/s00453-005-1197-3","title":"I/O-Efficient Well-Separated Pair Decomposition and Applications","year":2006,"lang":"en","type":"article","venue":"Algorithmica","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":"Dalhousie University; Carleton University","funders":"","keywords":"sort; Combinatorics; Theory of computation; Mathematics; Sorting; Sorting algorithm; Dimension (graph theory); Set (abstract data type); Decomposition; Point (geometry); Discrete mathematics; Algorithm; Computer science; Arithmetic; Chemistry","score_opus":0.004536547837923732,"score_gpt":0.2345241682267032,"score_spread":0.22998762038877946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103317190","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.02768549,0.00020125778,0.9689949,0.0006471555,0.000090840724,0.00019189571,0.0000029095004,0.00014366064,0.0020418894],"genre_scores_gemma":[0.9054084,0.0000026809757,0.093688995,0.00017445635,0.00024460992,0.00006428673,0.00005881857,0.00000516492,0.00035261447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928516,0.000029003522,0.00015012438,0.0002657328,0.00014033563,0.00012962426],"domain_scores_gemma":[0.999604,0.000053020445,0.000046501576,0.00017034984,0.00007937853,0.00004676195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010039739,0.00008082239,0.00006867346,0.00009672645,0.00018085795,0.000097754746,0.00014583857,0.00003426959,0.000008668184],"category_scores_gemma":[0.0000019979555,0.00008259247,0.000023980256,0.00041710827,0.000024053557,0.000080369435,0.00006095175,0.000047807134,0.00009011353],"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.0000073904803,0.00047777235,0.000211394,0.000018484023,0.000025531477,0.000009901992,0.00009389664,0.20714009,0.008635802,0.46787524,0.00884216,0.30666235],"study_design_scores_gemma":[0.00021307624,0.000029800774,0.004060902,0.0000032228238,0.0000051991055,0.000032176707,0.0000025588606,0.9512108,0.00454697,0.009775866,0.029983347,0.00013607707],"about_ca_topic_score_codex":0.00002106656,"about_ca_topic_score_gemma":0.0000016919353,"teacher_disagreement_score":0.87772286,"about_ca_system_score_codex":0.000023821443,"about_ca_system_score_gemma":0.000026560776,"threshold_uncertainty_score":0.33680233},"labels":[],"label_agreement":null},{"id":"W2104672836","doi":"","title":"Small Weak Epsilon-Nets in Three Dimensions","year":2006,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Constant (computer programming); Upper and lower bounds; Regular polygon; Mathematics; Combinatorics; Set (abstract data type); Range (aeronautics); Net (polyhedron); Discrete mathematics; Value (mathematics); Computer science; Mathematical analysis; Statistics; Geometry","score_opus":0.024629877784814767,"score_gpt":0.2273223534702929,"score_spread":0.20269247568547813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104672836","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.20756416,0.00007190359,0.7720159,0.0017086092,0.00021565649,0.000078555015,4.114665e-7,0.000081652215,0.018263135],"genre_scores_gemma":[0.84875506,0.0000015571399,0.14947493,0.00034043976,0.000033085205,0.0000066268253,0.0000072252415,0.0000025266775,0.0013785639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993791,0.000018120949,0.00014512158,0.00020215868,0.00011806586,0.00013744076],"domain_scores_gemma":[0.9996658,0.00006390744,0.000022824246,0.00017988532,0.000038062633,0.000029537234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012412021,0.00006319366,0.00006203924,0.00013223919,0.0000543087,0.00005576899,0.00020089507,0.000027603384,0.00002366597],"category_scores_gemma":[0.000009684388,0.00005742412,0.000024621702,0.00046004815,0.000008695959,0.00016455415,0.0000897464,0.000049671406,0.00008430001],"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.0000013392622,0.0001023396,0.0054563754,0.0000015738357,0.0000019922559,0.0000059221898,0.000024635028,0.05271877,0.0014106259,0.9281785,0.0034487438,0.008649216],"study_design_scores_gemma":[0.00038872048,0.00004601633,0.19843438,0.000008427222,0.00000142214,0.0000151076565,0.0000039716647,0.60977477,0.0026070941,0.17366606,0.014849627,0.00020438041],"about_ca_topic_score_codex":0.00029284536,"about_ca_topic_score_gemma":0.0022988874,"teacher_disagreement_score":0.7545124,"about_ca_system_score_codex":0.000019372066,"about_ca_system_score_gemma":0.000037930982,"threshold_uncertainty_score":0.23416877},"labels":[],"label_agreement":null},{"id":"W2104867783","doi":"10.1109/enc.2009.15","title":"Partial Delaunay Triangulations Based Data-Centric Storage and Routing with Guaranteed Delivery in Wireless Ad Hoc and Sensor Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Delaunay triangulation; Computer science; Unit disk graph; Wireless ad hoc network; Routing (electronic design automation); Destination-Sequenced Distance Vector routing; Computer network; Geographic routing; Distributed computing; Dynamic Source Routing; Wireless; Algorithm; Wireless network; Routing protocol","score_opus":0.01909143687378569,"score_gpt":0.23775392152228841,"score_spread":0.21866248464850271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104867783","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.4099459,0.00021557555,0.58932024,0.0003054862,0.00003496816,0.0001136503,0.0000021691503,0.00003504821,0.000026983213],"genre_scores_gemma":[0.9629182,0.000021402206,0.036494955,0.0004422856,0.00004999069,0.000002067266,0.000040752384,0.0000031854506,0.000027149847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902815,0.000081944294,0.00018980274,0.00037029196,0.0001509605,0.0001788413],"domain_scores_gemma":[0.99941504,0.00016394573,0.000059990056,0.0002487516,0.00004677401,0.00006552208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003134575,0.00010371888,0.0001248415,0.00014720499,0.00012975694,0.00016069571,0.00016112468,0.00004085689,0.000003920758],"category_scores_gemma":[0.00001998431,0.00008923452,0.000010135107,0.0005905149,0.000019373341,0.00045857197,0.00006541503,0.00008368365,7.093054e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021508415,0.00021159314,0.0062139737,0.000010412047,0.00002286406,0.00008149169,0.00045939864,0.5616989,0.0005264375,0.010085087,0.00020601971,0.4202687],"study_design_scores_gemma":[0.001129403,0.00008411709,0.029559892,0.000015294901,0.000007772064,0.000016339645,0.000018623863,0.96883106,0.00005335217,0.00004188748,0.00011929871,0.00012298327],"about_ca_topic_score_codex":0.000014057031,"about_ca_topic_score_gemma":0.00006519213,"teacher_disagreement_score":0.5529723,"about_ca_system_score_codex":0.000017384553,"about_ca_system_score_gemma":0.00006070048,"threshold_uncertainty_score":0.36388782},"labels":[],"label_agreement":null},{"id":"W2105118635","doi":"10.1109/isvd.2007.32","title":"On Sweep-plane Analysis of Laguerre Voronoi Diagram","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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","keywords":"Voronoi diagram; Laguerre polynomials; Centroidal Voronoi tessellation; Power diagram; Diagram; Weighted Voronoi diagram; Invariant (physics); Bowyer–Watson algorithm; Mathematics; Plane (geometry); Geometry; Algorithm; Mathematical analysis; Mathematical physics; Statistics","score_opus":0.010099531741614508,"score_gpt":0.2615583340489183,"score_spread":0.25145880230730383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105118635","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.1715346,0.000019392615,0.81968355,0.00009767516,0.00012530162,0.000035219833,0.0000012542283,0.00003906567,0.008463916],"genre_scores_gemma":[0.9860084,0.0000019596855,0.012968094,0.0002465692,0.000031010055,8.779551e-7,0.000023366252,0.0000014724586,0.0007182483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992894,0.00001705994,0.00017772331,0.00017603424,0.00022694697,0.000112834445],"domain_scores_gemma":[0.9993947,0.00020412005,0.000056183082,0.00022622294,0.000068365785,0.000050385883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034997074,0.00005868445,0.00011564056,0.00042792602,0.000035661433,0.000023450702,0.00021245875,0.000028679011,0.00008364845],"category_scores_gemma":[0.000029773657,0.000050411814,0.000074033036,0.0015039976,0.000010382886,0.00010413021,0.000036782185,0.00003706175,0.000028050648],"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.0000108119975,0.0001410299,0.001094653,0.000003673395,0.00020544666,0.000005619186,0.00018337899,0.050825465,0.00084559876,0.7022294,0.0009435438,0.24351138],"study_design_scores_gemma":[0.00030250387,0.00023903501,0.26863506,0.0000048961265,0.000119563265,0.0000025155794,0.000019734001,0.6997143,0.024132024,0.0042710667,0.0023285812,0.0002307137],"about_ca_topic_score_codex":0.00005651452,"about_ca_topic_score_gemma":0.00015910214,"teacher_disagreement_score":0.8144738,"about_ca_system_score_codex":0.0000143092075,"about_ca_system_score_gemma":0.00001644004,"threshold_uncertainty_score":0.20557342},"labels":[],"label_agreement":null},{"id":"W2105256528","doi":"10.20382/jocg.v6i1a8","title":"Quasi-parallel segments and characterization of unique bichromatic matchings","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matching (statistics); Combinatorics; Characterization (materials science); Plane (geometry); Point (geometry); Set (abstract data type); Property (philosophy); Mathematics; Line segment; Line (geometry); General position; Position (finance); Algorithm; Computer science; Geometry; Physics; Optics","score_opus":0.00647455589633572,"score_gpt":0.18985622678958583,"score_spread":0.1833816708932501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105256528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4934566,0.00002113019,0.50577635,0.00039451645,0.00011429605,0.00008152871,0.0000022904192,0.000010929567,0.0001423483],"genre_scores_gemma":[0.90950745,0.000039480725,0.08988791,0.00015244618,0.000055202927,3.1492542e-7,0.000016571055,0.0000061406404,0.00033446337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862385,0.00012273733,0.0004549728,0.00017007503,0.0004925216,0.00013585211],"domain_scores_gemma":[0.9980743,0.00020850121,0.0006928602,0.000114162875,0.00077449455,0.00013570828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027666753,0.0001334299,0.00026783717,0.0011814354,0.00010133078,0.00009215397,0.00040247804,0.00006454281,0.000044237295],"category_scores_gemma":[0.000035424902,0.00013697364,0.000092141905,0.0011956807,0.000052852018,0.0015809442,0.00013160524,0.00013653877,0.00000862691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026150307,0.002760369,0.015072271,0.0007165697,0.0012992078,0.00021241308,0.004632812,0.29890978,0.113074124,0.41104677,0.0019433195,0.15007088],"study_design_scores_gemma":[0.0054889075,0.0022005802,0.43663362,0.00043664358,0.00015383457,0.0007995158,0.0005075321,0.4700174,0.0042299884,0.07268892,0.005834665,0.001008373],"about_ca_topic_score_codex":0.000013724891,"about_ca_topic_score_gemma":4.0920315e-7,"teacher_disagreement_score":0.42156136,"about_ca_system_score_codex":0.00007434069,"about_ca_system_score_gemma":0.00018123281,"threshold_uncertainty_score":0.5585623},"labels":[],"label_agreement":null},{"id":"W2105401484","doi":"10.1007/11682462_12","title":"Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"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":"Voronoi diagram; Pointer (user interface); Data structure; Time complexity; Combinatorics; Point location; Computer science; Line segment; Computational geometry; Binary logarithm; Algorithm; Mathematics; Point (geometry); Discrete mathematics; Geometry","score_opus":0.029638551381710336,"score_gpt":0.2644702082896593,"score_spread":0.23483165690794894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105401484","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.00062303315,0.00072264543,0.9957883,0.0005610686,0.0010951235,0.00063929113,0.00012581762,0.000089495225,0.00035525783],"genre_scores_gemma":[0.18499476,0.00003573684,0.81222767,0.00077930494,0.0010394652,0.00001994532,0.0005853099,0.000027275795,0.00029051318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704087,0.000024834657,0.00040482808,0.0015004111,0.000620746,0.0004083172],"domain_scores_gemma":[0.99797314,0.00042360814,0.0002207659,0.0011087232,0.00016495535,0.00010881836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070767413,0.00039358292,0.0003583676,0.0004005211,0.00034824797,0.0006891056,0.002206464,0.0001919772,0.000005672216],"category_scores_gemma":[0.00009056872,0.00036068115,0.000047268346,0.00026490717,0.0004508392,0.0011008929,0.0017662505,0.00030413616,0.0000022806305],"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.000015209275,0.000031949447,0.00015630756,0.000099526325,0.000019002806,0.000016433543,0.00017954687,0.03470423,0.00019843206,0.07969175,0.0004803735,0.8844072],"study_design_scores_gemma":[0.00038961825,0.00019334248,0.0010094183,0.00008177397,0.000014032869,0.000074270756,1.3882183e-7,0.7193668,0.0010768886,0.26853666,0.008635345,0.0006217574],"about_ca_topic_score_codex":0.0000506647,"about_ca_topic_score_gemma":0.00045021795,"teacher_disagreement_score":0.8837855,"about_ca_system_score_codex":0.0001141971,"about_ca_system_score_gemma":0.000357238,"threshold_uncertainty_score":0.9998845},"labels":[],"label_agreement":null},{"id":"W2105506385","doi":"10.1007/s00493-014-3079-2","title":"Embedding a graph-like continuum in a surface","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","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 Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Voltage graph; Symmetric graph; Embedding; Discrete mathematics; Graph; Line graph; Computer science","score_opus":0.009086792051369086,"score_gpt":0.240379365254211,"score_spread":0.2312925732028419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105506385","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.31631082,0.00018536727,0.67769986,0.0006771221,0.0013062716,0.00011604416,2.5842832e-7,0.00014214899,0.0035620977],"genre_scores_gemma":[0.9890755,0.000005802446,0.0102474755,0.00023193342,0.00002801911,0.0000060978005,0.0000022194515,0.0000046922505,0.00039826878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908555,0.000092084774,0.00016951471,0.00026947312,0.00018858846,0.00019481122],"domain_scores_gemma":[0.9993954,0.00015289416,0.000053163243,0.00026530764,0.00006846832,0.000064803644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003632906,0.00009007574,0.00012718311,0.00013138355,0.000075782074,0.00009033578,0.00038136495,0.000039593768,0.000005323329],"category_scores_gemma":[0.00006427406,0.00009404696,0.00003935861,0.0008848699,0.000012621816,0.0002490414,0.00011906746,0.00009726368,0.000042668536],"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.000008947853,0.00033471236,0.0049985885,0.000025328636,0.00001404406,0.000016339745,0.0008943605,0.012703571,0.0024219106,0.9391324,0.01141811,0.02803171],"study_design_scores_gemma":[0.001481615,0.00019150863,0.015442912,0.00003517355,0.000004085387,0.000015040498,0.000015117695,0.6785626,0.002292514,0.2255314,0.0760014,0.0004266537],"about_ca_topic_score_codex":0.000010501345,"about_ca_topic_score_gemma":0.000005085338,"teacher_disagreement_score":0.713601,"about_ca_system_score_codex":0.000038744663,"about_ca_system_score_gemma":0.00003061818,"threshold_uncertainty_score":0.38351238},"labels":[],"label_agreement":null},{"id":"W2105525115","doi":"10.1142/s0218195903001207","title":"THE LARGEST EMPTY ANNULUS PROBLEM","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Annulus (botany); Minimax; Euclidean space; Plane (geometry); Constant (computer programming); Space (punctuation); Circumference; Upper and lower bounds; Concentric; 1-center problem; Binary logarithm; Facility location problem; Discrete mathematics; Geometry; Mathematical optimization; Mathematical analysis; Computer science","score_opus":0.00901005290849842,"score_gpt":0.2732297818459956,"score_spread":0.2642197289374972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105525115","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.0017269748,0.0012934722,0.9885366,0.0035923722,0.00092006277,0.00033551996,0.000013958736,0.000050040875,0.0035310173],"genre_scores_gemma":[0.74115235,0.00020954672,0.2558274,0.0008738811,0.00090317184,0.00014316528,0.000042278825,0.000021515307,0.0008266716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99696624,0.00016435415,0.0009224837,0.0002939008,0.0013897996,0.00026320526],"domain_scores_gemma":[0.99492264,0.00097632315,0.00075218844,0.0002962593,0.0028789644,0.00017360675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012846456,0.00019379606,0.0001942702,0.0005193073,0.00048673977,0.00057222263,0.001783804,0.00006873721,0.000033635915],"category_scores_gemma":[0.00018217918,0.00015637121,0.0002172646,0.0012285446,0.00009942655,0.0007933283,0.00013542485,0.0003038974,0.00009247479],"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.000017324004,0.00026472495,0.0005366312,0.000005654974,0.00021445402,0.000011231391,0.00007536578,0.110046804,0.00009356951,0.7838842,0.003529366,0.10132064],"study_design_scores_gemma":[0.0007074955,0.00008255751,0.0029347264,0.000015566635,0.000017818167,0.00064181275,0.000042209813,0.006473709,0.00042553304,0.29770666,0.6907341,0.00021781611],"about_ca_topic_score_codex":0.0000022617658,"about_ca_topic_score_gemma":0.0000018751847,"teacher_disagreement_score":0.7394254,"about_ca_system_score_codex":0.0001585003,"about_ca_system_score_gemma":0.0005532007,"threshold_uncertainty_score":0.6376633},"labels":[],"label_agreement":null},{"id":"W2105729287","doi":"10.1142/s0218195910003207","title":"DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Dilation (metric space); Mathematics; Combinatorics; Convex polygon; Regular polygon; Shortest path problem; Euclidean geometry; Time complexity; Polygon (computer graphics); Path (computing); Binary logarithm; Geometry; Graph; Computer science","score_opus":0.008597747177721698,"score_gpt":0.28283690844958936,"score_spread":0.27423916127186765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105729287","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.116827086,0.00017674691,0.8783894,0.0024650465,0.0011687018,0.0002749076,0.000022600647,0.000050580536,0.0006249142],"genre_scores_gemma":[0.79366344,0.000024542042,0.20452607,0.00037570827,0.0011688794,0.00006185992,0.00010078355,0.000013865548,0.000064874774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968903,0.00007521605,0.0011041252,0.00037732322,0.0012975448,0.00025548413],"domain_scores_gemma":[0.99639,0.000591423,0.0006986378,0.00025664558,0.0018793636,0.00018395101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008297534,0.00022413232,0.00026222342,0.0017266102,0.00014917014,0.00031736415,0.0015473514,0.00013182127,0.00011722425],"category_scores_gemma":[0.0001334383,0.00023676253,0.00020573742,0.0014324625,0.000093612514,0.0012975849,0.00018682578,0.0005927004,0.000082140126],"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.00006818935,0.00080579764,0.005389021,0.000012680944,0.00015359384,0.00003332468,0.00022708117,0.42259943,0.0039655375,0.31842223,0.0007282566,0.24759483],"study_design_scores_gemma":[0.0042526536,0.00027516083,0.24708647,0.000087538465,0.000052460153,0.0020553838,0.00011231029,0.26863444,0.0034126805,0.29410073,0.17878737,0.0011428344],"about_ca_topic_score_codex":0.000008743258,"about_ca_topic_score_gemma":0.000013479072,"teacher_disagreement_score":0.6768363,"about_ca_system_score_codex":0.0001377592,"about_ca_system_score_gemma":0.0004788647,"threshold_uncertainty_score":0.96548957},"labels":[],"label_agreement":null},{"id":"W2105749797","doi":"10.37236/831","title":"Distinct Distances in Graph Drawings","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada; Universitat Politècnica de Catalunya; Ministerio de Economía y Competitividad","keywords":"Combinatorics; Mathematics; Treewidth; 1-planar graph; Bounded function; Pathwidth; Discrete mathematics; Bipartite graph; Indifference graph; Partial k-tree; Chordal graph; Clique-sum; Degree (music); Tree-depth; Graph; Line graph","score_opus":0.008631698698195259,"score_gpt":0.2169544812141173,"score_spread":0.20832278251592207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105749797","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.51771504,0.0030669132,0.47717607,0.0011386484,0.000444724,0.000046414345,1.0621926e-7,0.000011073869,0.00040098836],"genre_scores_gemma":[0.9992006,0.0004160725,0.00011577056,0.000061633975,0.000068022135,0.0000011592975,3.2569534e-7,0.0000034944585,0.00013296417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888086,0.000092264956,0.00029978037,0.00008904526,0.00036926533,0.0002687522],"domain_scores_gemma":[0.99927884,0.0001680489,0.00021906642,0.00015121605,0.00014448309,0.000038360802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007500495,0.00007951408,0.0001358248,0.00014798988,0.00015422593,0.000035279958,0.0006925002,0.000022942839,0.0000018636941],"category_scores_gemma":[0.00006363196,0.000055145232,0.0000716399,0.0009705054,0.000041719184,0.00034876296,0.000045864508,0.0003411156,0.0000025510722],"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.000013305564,0.00009192715,0.0013533189,0.0000024540084,0.000014083415,0.000024024106,0.0005086887,0.0008024252,0.000071527094,0.9951892,0.00035936263,0.0015696787],"study_design_scores_gemma":[0.0005837782,0.0002936207,0.014844175,0.00001219182,0.000005536926,0.0004772936,0.000019330384,0.0024383524,0.0005345364,0.97563106,0.005056951,0.00010315633],"about_ca_topic_score_codex":0.000003836742,"about_ca_topic_score_gemma":0.000007521596,"teacher_disagreement_score":0.48148552,"about_ca_system_score_codex":0.0001414689,"about_ca_system_score_gemma":0.0003779353,"threshold_uncertainty_score":0.22487572},"labels":[],"label_agreement":null},{"id":"W2106160424","doi":"","title":"I/O efficient path traversal in well-shaped tetrahedral meshes.","year":2010,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Tree traversal; Tetrahedron; Intersection (aeronautics); Polygon mesh; Path (computing); Regular polygon; Plane (geometry); Sequence (biology); Combinatorics; Computer science; Space (punctuation); Mathematics; Topology (electrical circuits); Algorithm; Geometry; Engineering","score_opus":0.0070113044265866075,"score_gpt":0.22349407864824383,"score_spread":0.21648277422165724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106160424","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.59397703,0.0000067984374,0.39928666,0.00032386725,0.0006615712,0.00008765068,4.5001258e-7,0.000073718395,0.0055822525],"genre_scores_gemma":[0.9605036,6.6625967e-7,0.038720258,0.00027560705,0.00008477652,0.000005807167,0.000003903207,0.000003335082,0.00040206863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991446,0.000024796962,0.00016973217,0.00023221564,0.00023742505,0.00019123692],"domain_scores_gemma":[0.99957496,0.00006623049,0.00002828128,0.00021335747,0.000043139506,0.000074048716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002664281,0.00008877004,0.00008348879,0.00016777775,0.000054631495,0.00008539504,0.00033010912,0.00005217044,0.0002185548],"category_scores_gemma":[0.000016722275,0.000079310536,0.000039822084,0.0005046757,0.00001912437,0.000106810345,0.00007165591,0.00016402443,0.00015341812],"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.000025092091,0.00082973886,0.0078746835,0.000018526665,0.000018244347,0.000066041044,0.0029813896,0.11126763,0.080660515,0.6988055,0.0021306262,0.09532199],"study_design_scores_gemma":[0.00035701605,0.000031467713,0.029408623,0.0000022333313,0.0000010039417,0.000012550579,0.000021912178,0.96543616,0.0017935815,0.00086572196,0.001945928,0.00012378204],"about_ca_topic_score_codex":0.000050242405,"about_ca_topic_score_gemma":0.00017635102,"teacher_disagreement_score":0.85416853,"about_ca_system_score_codex":0.000016281747,"about_ca_system_score_gemma":0.000074618576,"threshold_uncertainty_score":0.32341897},"labels":[],"label_agreement":null},{"id":"W2106220493","doi":"10.1007/978-3-319-00200-2_6","title":"Monotone Paths in Planar Convex Subdivisions and Polytopes","year":2013,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","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 Calgary","funders":"","keywords":"Combinatorics; Mathematics; Monotone polygon; Vertex (graph theory); Subdivision; Polytope; Regular polygon; Bounded function; Path (computing); Convex hull; Convex polytope; Discrete mathematics; Convex set; Graph; Geometry; Convex optimization; Computer science; Mathematical analysis","score_opus":0.048042537474316735,"score_gpt":0.27056477122839984,"score_spread":0.2225222337540831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106220493","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.00033426218,0.0066833138,0.301404,0.0119203385,0.0007599678,0.0008749961,0.00005173461,0.00019887704,0.6777725],"genre_scores_gemma":[0.4512836,0.020060372,0.16097431,0.0037900733,0.00032637076,0.00031245442,0.0011645119,0.00006389736,0.3620244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892515,0.000036092908,0.00038215364,0.00033031648,0.00017266045,0.00015361514],"domain_scores_gemma":[0.99776304,0.0002255846,0.00014100634,0.001665448,0.00011080152,0.000094116825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014763956,0.0002102015,0.00025617066,0.00032952556,0.00027584942,0.00014055865,0.0013791496,0.0002793206,0.00007586589],"category_scores_gemma":[0.00004495353,0.00022377014,0.000057118876,0.00011709162,0.00016201574,0.0005237615,0.0007538777,0.0005455868,0.00017152488],"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":[8.177002e-7,0.000025242069,0.000016836932,0.000008817197,0.000016377897,0.0000037951183,0.00026139422,0.00009032039,0.000011465355,0.9697569,0.002597717,0.027210314],"study_design_scores_gemma":[0.00030694873,0.00005893117,0.0008670253,0.0001901782,0.000017570777,0.000023689934,0.000010118994,0.023258727,0.000021289266,0.17749107,0.797292,0.0004624527],"about_ca_topic_score_codex":0.00015948131,"about_ca_topic_score_gemma":0.00062414346,"teacher_disagreement_score":0.7946943,"about_ca_system_score_codex":0.000041700958,"about_ca_system_score_gemma":0.00015351792,"threshold_uncertainty_score":0.91250813},"labels":[],"label_agreement":null},{"id":"W2106248614","doi":"10.1007/s00454-013-9526-9","title":"Many Collinear $$k$$ k -Tuples with no $$k+1$$ k + 1 Collinear Points","year":2013,"lang":"en","type":"article","venue":"Discrete & 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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Tuple; Combinatorics; Mathematics; Upper and lower bounds; Plane (geometry); Planar; Point (geometry); Line (geometry); Set (abstract data type); Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.008008304695346212,"score_gpt":0.22375942436473428,"score_spread":0.21575111966938806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106248614","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.15033102,0.00013797106,0.843409,0.0019060235,0.00041167435,0.0006050387,0.00003288948,0.00029015297,0.00287623],"genre_scores_gemma":[0.67162174,0.000010510664,0.32452852,0.0014400111,0.0003493333,0.00010575779,0.0003238139,0.000032250173,0.0015880876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689794,0.00011811916,0.00055347173,0.00080236583,0.0011058192,0.00052226864],"domain_scores_gemma":[0.99737054,0.0004596942,0.00024228489,0.00047903546,0.0011443957,0.0003040381],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003317165,0.00037854016,0.000349549,0.00055005646,0.0004091028,0.00064629805,0.00082561834,0.000110192166,0.0005390699],"category_scores_gemma":[0.0001161764,0.00033082467,0.00013591666,0.0020944774,0.000120102224,0.0013131592,0.00026546727,0.00024984826,0.0025737458],"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.00010083744,0.00049570977,0.005366615,0.00011186221,0.00033719224,0.00006364785,0.00046202602,0.732261,0.00051087793,0.21353327,0.025318457,0.021438535],"study_design_scores_gemma":[0.001218636,0.00037921531,0.03961377,0.00004886418,0.000018804798,0.000087446904,0.000047241425,0.9306153,0.000321813,0.012444478,0.014538038,0.0006663759],"about_ca_topic_score_codex":0.000051719202,"about_ca_topic_score_gemma":0.0000036584984,"teacher_disagreement_score":0.5212907,"about_ca_system_score_codex":0.000093463226,"about_ca_system_score_gemma":0.0002794957,"threshold_uncertainty_score":0.9999144},"labels":[],"label_agreement":null},{"id":"W2106378227","doi":"10.1007/3-540-45071-8_45","title":"On Constrained Minimum Pseudotriangulations","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Memorial University of Newfoundland","funders":"","keywords":"Triangulation; Minimum-weight triangulation; Combinatorics; Computer science; Set (abstract data type); Line (geometry); Algorithm; Mathematics; Discrete mathematics; Delaunay triangulation; Constrained Delaunay triangulation; Geometry","score_opus":0.01779878287417115,"score_gpt":0.24986154309309805,"score_spread":0.2320627602189269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106378227","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.0001132945,0.00014778505,0.98419976,0.0016225484,0.0022361814,0.00034591844,0.000006936818,0.000118673976,0.011208885],"genre_scores_gemma":[0.22045718,0.000025994932,0.7670193,0.008784227,0.00078688754,0.000019539902,0.000036857877,0.00004892334,0.0028211204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968648,0.00004389528,0.00047416348,0.0012463534,0.0009181018,0.0004526949],"domain_scores_gemma":[0.9976498,0.0007529708,0.0002227727,0.00093781034,0.00026855036,0.00016811039],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000642165,0.00042060704,0.00036012888,0.0011334695,0.0003065229,0.00042540272,0.0014128437,0.00024748454,0.000067261535],"category_scores_gemma":[0.00015031784,0.0004111754,0.00013063865,0.0008565943,0.0003727649,0.00037879377,0.00028468508,0.0005008861,0.000099764075],"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.0000046257737,0.000040989642,0.0000034811144,0.000011062152,0.0000107600345,0.00004541904,0.00018938236,0.2389326,0.00013658957,0.44315234,0.00022356596,0.3172492],"study_design_scores_gemma":[0.00034063525,0.00018288403,0.00004013488,0.00011865458,0.0000056861536,0.000070899914,4.9097224e-8,0.45140293,0.00071294256,0.5441435,0.0024736405,0.000508035],"about_ca_topic_score_codex":0.0000019872002,"about_ca_topic_score_gemma":0.000010813342,"teacher_disagreement_score":0.31674117,"about_ca_system_score_codex":0.00022731218,"about_ca_system_score_gemma":0.00060203276,"threshold_uncertainty_score":0.999834},"labels":[],"label_agreement":null},{"id":"W2106734202","doi":"10.1142/s1793830910000486","title":"AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"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 Manitoba; University of New Brunswick; University of Waterloo","funders":"","keywords":"Cover (algebra); Separable space; Cardinality (data modeling); Unit disk; Combinatorics; Line (geometry); Plane (geometry); Unit (ring theory); Mathematics; Set (abstract data type); Set cover problem; Algorithm; Discrete mathematics; Computer science; Geometry; Mathematical analysis; Database","score_opus":0.015063564027802068,"score_gpt":0.29526947229923023,"score_spread":0.28020590827142816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106734202","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.0013591553,0.000053403575,0.9964186,0.00034074183,0.00013403421,0.0009410709,0.00016891459,0.00013590207,0.00044819314],"genre_scores_gemma":[0.02741173,0.000027396352,0.96996546,0.00012852196,0.00043056207,0.0009258134,0.00027796524,0.000026393587,0.00080613076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987057,0.000014301103,0.00034221084,0.00047922687,0.00019065646,0.00026793155],"domain_scores_gemma":[0.9985923,0.0001783689,0.00015714751,0.00065751007,0.00020916316,0.00020550835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033018983,0.00020620672,0.00020521498,0.00010208757,0.00046147313,0.0004225171,0.000507775,0.000094378505,0.000016147793],"category_scores_gemma":[0.00002243699,0.00018288418,0.00007703006,0.00037181276,0.00007193264,0.0004934029,0.00010869408,0.00016053749,0.000017711385],"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.0000025417905,0.00032229567,0.0000102458935,0.000070100155,0.000049351354,5.291732e-7,0.0005325963,0.00083300844,0.012296724,0.50677186,0.00017182497,0.47893894],"study_design_scores_gemma":[0.00032080399,0.00008004874,0.000053958345,0.0000054622237,0.00002341552,0.000011188785,0.000048717196,0.9049895,0.0020425094,0.07287791,0.019300286,0.0002462246],"about_ca_topic_score_codex":0.000009802113,"about_ca_topic_score_gemma":0.00000768193,"teacher_disagreement_score":0.90415645,"about_ca_system_score_codex":0.000008545833,"about_ca_system_score_gemma":0.000063407795,"threshold_uncertainty_score":0.74578005},"labels":[],"label_agreement":null},{"id":"W2107263471","doi":"10.1016/j.tcs.2006.02.024","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-Spine, 1-bend planarity","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"McGill University","funders":"","keywords":"Planarity testing; Planar graph; Planar; Combinatorics; Mathematics; Geometry; Vertex (graph theory); Hamiltonian path; Algorithm; Graph; Computer science; Computer graphics (images)","score_opus":0.012392663271763091,"score_gpt":0.23701306708695594,"score_spread":0.22462040381519285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107263471","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.5238524,0.00005860486,0.4709004,0.0005550637,0.0008632394,0.0000403396,0.0000070079977,0.00014951217,0.0035734754],"genre_scores_gemma":[0.93255544,0.0000105545605,0.06557793,0.0010834102,0.0006602526,0.000025379573,0.00002903248,0.00002190401,0.00003611501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964649,0.0001067785,0.0004977782,0.0009467111,0.0012427443,0.0007410876],"domain_scores_gemma":[0.99809355,0.00034967804,0.00021433516,0.00089071685,0.00015245819,0.00029925955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014088107,0.00027388666,0.0001812547,0.00019855663,0.0008757547,0.0009315429,0.0017434377,0.00018600257,0.000049643382],"category_scores_gemma":[0.00014398133,0.00030196438,0.00019537852,0.001104003,0.0012912864,0.0009358518,0.0011354482,0.00035161176,0.00052047713],"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.000023766977,0.00011314103,0.000006237266,0.000028206392,0.000013986381,0.00006574229,0.00019667203,0.008962771,0.00066020305,0.9836308,0.0006068693,0.005691599],"study_design_scores_gemma":[0.00029795594,0.0003107208,0.00052407244,0.000053459527,0.00001824147,0.000177957,0.000008148405,0.94059396,0.009278671,0.047420524,0.0010075457,0.00030874053],"about_ca_topic_score_codex":0.00006194823,"about_ca_topic_score_gemma":0.000015846912,"teacher_disagreement_score":0.9362103,"about_ca_system_score_codex":0.00002792787,"about_ca_system_score_gemma":0.00039763603,"threshold_uncertainty_score":0.99994326},"labels":[],"label_agreement":null},{"id":"W2107489311","doi":"10.1016/j.dam.2007.08.033","title":"On polyhedra induced by point sets in space","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":"McGill University","funders":"","keywords":"Polyhedron; Mathematics; Space (punctuation); Point (geometry); Combinatorics; Dual polyhedron; Geometry; Computer science","score_opus":0.013710954617112605,"score_gpt":0.26433591996709116,"score_spread":0.2506249653499786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107489311","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.18466309,0.000015615295,0.7905013,0.00043133524,0.00009446771,0.00023636952,0.000002232066,0.000079750615,0.023975825],"genre_scores_gemma":[0.894584,0.0000017313465,0.10489996,0.00037109107,0.000024967043,0.000012368883,0.000014434915,0.000010681908,0.00008075491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988146,0.000009465002,0.00029762308,0.0002737809,0.0003374949,0.00026702794],"domain_scores_gemma":[0.99920255,0.00024003765,0.00010383212,0.0003446621,0.000024021501,0.000084918785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053927186,0.00014772484,0.00015752454,0.00017647962,0.00006066622,0.000077509634,0.00032198807,0.00006909578,0.00001190156],"category_scores_gemma":[0.000038784387,0.00013715803,0.000034106208,0.000524286,0.000013691576,0.00012606027,0.000097523094,0.00014127455,0.00009223472],"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.000007509658,0.00012682522,0.0000024002115,0.000021276923,0.000005899918,0.0000043479586,0.0012224028,0.00035698627,0.027997695,0.96164554,0.00077183754,0.007837286],"study_design_scores_gemma":[0.0015956184,0.0002148958,0.00080357003,0.00009211193,0.000010767203,0.000017499868,0.0005679216,0.09219216,0.17362863,0.7289707,0.0010477147,0.00085841055],"about_ca_topic_score_codex":0.0000041242947,"about_ca_topic_score_gemma":0.0000057923444,"teacher_disagreement_score":0.70992094,"about_ca_system_score_codex":0.000056801575,"about_ca_system_score_gemma":0.000028528822,"threshold_uncertainty_score":0.5593142},"labels":[],"label_agreement":null},{"id":"W2107640410","doi":"10.1016/j.jda.2008.10.002","title":"Sigma-local graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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":"Carleton University","funders":"","keywords":"Planarity testing; Combinatorics; Vertex (graph theory); Locality; Mathematics; Polyhedron; Modular decomposition; Plane (geometry); Indifference graph; Planar graph; Pathwidth; Maximal independent set; Discrete mathematics; Chordal graph; Graph; 1-planar graph; Line graph; Geometry","score_opus":0.017124027973588217,"score_gpt":0.24782401956857114,"score_spread":0.23069999159498292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107640410","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.020692106,0.00063909346,0.976327,0.0009889228,0.0007373143,0.00003576835,0.000001320286,0.000019732168,0.0005587574],"genre_scores_gemma":[0.8529306,0.00014224395,0.1460924,0.00025296,0.0003255635,9.2836444e-7,0.0000017990444,0.0000055247224,0.0002479785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988155,0.000053738997,0.00036213495,0.00012738127,0.00048921304,0.00015203108],"domain_scores_gemma":[0.999162,0.00007058447,0.00022909502,0.00015614541,0.00024813047,0.00013405267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002849156,0.00009395366,0.0001620566,0.00021717811,0.00013916293,0.00004678504,0.0004058395,0.000038382568,0.000015671108],"category_scores_gemma":[0.00003244531,0.00007526592,0.00015540358,0.0004794789,0.000054604003,0.00070261775,0.00006520867,0.00016188284,0.000012216893],"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.00009168366,0.00052205735,0.0013446772,0.000030230269,0.00037389793,0.0018309116,0.0031750451,0.084533595,0.004025993,0.108851194,0.04244154,0.7527792],"study_design_scores_gemma":[0.0040752366,0.0024698414,0.040089108,0.000108414235,0.00006740119,0.012682176,0.00020109511,0.74483687,0.018508123,0.121083386,0.054823242,0.0010551278],"about_ca_topic_score_codex":0.0000037570342,"about_ca_topic_score_gemma":6.098533e-7,"teacher_disagreement_score":0.8322385,"about_ca_system_score_codex":0.00002847416,"about_ca_system_score_gemma":0.00014077646,"threshold_uncertainty_score":0.3069255},"labels":[],"label_agreement":null},{"id":"W2107945074","doi":"10.1016/j.ipl.2006.06.015","title":"On the All-Farthest-Segments problem for a planar set of points","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","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 Windsor","funders":"","keywords":"Set (abstract data type); Planar; Combinatorics; Computer science; Mathematics; Computational geometry; Algorithm; Computer graphics (images); Programming language","score_opus":0.015606133536053017,"score_gpt":0.23386586222278158,"score_spread":0.21825972868672855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107945074","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.055775363,0.0000071704235,0.9289739,0.014114764,0.000081241094,0.00029420422,0.000008423298,0.000049260547,0.0006956568],"genre_scores_gemma":[0.9088579,4.6106658e-7,0.07674341,0.014100562,0.00007077986,0.000063181295,0.0001205555,0.000004482361,0.00003868379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992375,0.000018608645,0.0002862646,0.000082856415,0.00025517377,0.00011959037],"domain_scores_gemma":[0.9994223,0.000105661005,0.00023349766,0.000116636256,0.000106376574,0.000015540321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030765374,0.000075509146,0.000063311214,0.00012241467,0.00012376378,0.00016889475,0.00025363482,0.000021957912,0.0000023062187],"category_scores_gemma":[0.000028715236,0.00005577386,0.00003217722,0.00022722787,0.000019237117,0.0011450374,0.000017419552,0.000043527038,0.000017960188],"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.00010831073,0.00012995854,0.00020563317,0.0005448811,0.000058789148,0.000001088743,0.007675482,0.14264514,0.009320333,0.48190966,0.12831452,0.22908619],"study_design_scores_gemma":[0.002425703,0.0003182938,0.0029976757,0.00030286156,0.000028109365,0.000028314116,0.00014378075,0.7398568,0.040380787,0.12178547,0.09106502,0.00066722225],"about_ca_topic_score_codex":0.0000050303306,"about_ca_topic_score_gemma":6.833417e-7,"teacher_disagreement_score":0.85308254,"about_ca_system_score_codex":0.000023607074,"about_ca_system_score_gemma":0.00004159663,"threshold_uncertainty_score":0.2274392},"labels":[],"label_agreement":null},{"id":"W2107966077","doi":"","title":"Efficient Snap Rounding with Integer Arithmetic.","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rounding; Combinatorics; Partition (number theory); Logarithm; Intersection (aeronautics); Integer (computer science); Mathematics; Time complexity; Line segment; Discrete mathematics; Computer science; Algorithm; Geometry","score_opus":0.022500775482839738,"score_gpt":0.2500785208696665,"score_spread":0.22757774538682674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107966077","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.084619865,0.000038920505,0.9003203,0.0017124618,0.0005224074,0.00020562559,0.000012436649,0.00010064496,0.012467362],"genre_scores_gemma":[0.9326467,8.7936286e-7,0.065099925,0.0016610333,0.00014715311,0.0000088370825,0.00006265989,0.000014041346,0.00035877558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976703,0.000048924216,0.00034194576,0.0006064794,0.00072147796,0.00061087403],"domain_scores_gemma":[0.9978908,0.00039429485,0.00011837619,0.00032134587,0.0006032183,0.00067201006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000730049,0.00025590803,0.00020202623,0.0015481401,0.0003873415,0.00037808152,0.0005918032,0.00009723725,0.00012567684],"category_scores_gemma":[0.00009200753,0.00024371524,0.0000606806,0.0019612168,0.000085125306,0.00017777366,0.000057186295,0.00028508814,0.00023661424],"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.000013816678,0.00004689575,0.0002741686,0.000006554197,0.000024996738,0.000074362964,0.00014010681,0.49518555,0.000027477525,0.4793583,0.00036521896,0.024482565],"study_design_scores_gemma":[0.0007289964,0.00032586494,0.022356523,0.00008595707,0.000010834229,0.00015500862,0.00012603494,0.95505947,0.00025692824,0.014786678,0.0054533696,0.00065435],"about_ca_topic_score_codex":0.0011428493,"about_ca_topic_score_gemma":0.0041562947,"teacher_disagreement_score":0.8480268,"about_ca_system_score_codex":0.00043065747,"about_ca_system_score_gemma":0.0013358251,"threshold_uncertainty_score":0.99384195},"labels":[],"label_agreement":null},{"id":"W2108310473","doi":"10.1023/a:1009859026994","title":"Graph Algorithms with Small Communication Costs","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Theory of computation; Focus (optics); Shortest path problem; Parallel algorithm; Theoretical computer science; Cost efficiency; Graph theory; Communication complexity; Mathematical optimization; Graph; Algorithm; Parallel computing; Mathematics","score_opus":0.009833638694845234,"score_gpt":0.22079303252200846,"score_spread":0.21095939382716322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108310473","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.00793347,0.00021827496,0.988638,0.0006550012,0.0008125282,0.000114460636,5.561743e-7,0.00003336139,0.0015943872],"genre_scores_gemma":[0.20375055,0.00033505517,0.7953225,0.00014821012,0.000290144,0.000003739255,0.000015627282,0.0000113148435,0.00012286265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988328,0.00015157726,0.00039386962,0.000120530174,0.00038470226,0.0001164722],"domain_scores_gemma":[0.9985485,0.000101880425,0.00033878375,0.00024802546,0.0006736211,0.000089206245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047332296,0.00010603012,0.00016501851,0.00020134545,0.00014889291,0.00018549553,0.0005000698,0.000059117803,0.000054724962],"category_scores_gemma":[0.00003377568,0.000090211426,0.000059795846,0.0007339766,0.00002715582,0.00089006434,0.000027540178,0.00015489799,0.0000055676956],"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.00008481308,0.00015945686,0.000037000016,0.0000030271747,0.000030802712,0.000006206974,0.00016671226,0.9070481,0.00002303528,0.027956689,0.00035598897,0.064128175],"study_design_scores_gemma":[0.006795771,0.0019189084,0.0009090464,0.00017712996,0.0000785107,0.00043988376,0.000037734433,0.94245356,0.0019022808,0.030684324,0.014059013,0.00054383365],"about_ca_topic_score_codex":0.0000058536907,"about_ca_topic_score_gemma":5.848806e-7,"teacher_disagreement_score":0.19581707,"about_ca_system_score_codex":0.00007802907,"about_ca_system_score_gemma":0.00014124696,"threshold_uncertainty_score":0.3678715},"labels":[],"label_agreement":null},{"id":"W2108375200","doi":"10.1142/s0218195905001841","title":"COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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 British Columbia","funders":"Defense Advanced Research Projects Agency","keywords":"Terrain; Horizon; Mathematics; Combinatorics; Set (abstract data type); Convex hull; Regular polygon; Algorithm; Geometry; Computer science","score_opus":0.01670172683024567,"score_gpt":0.3065674018432316,"score_spread":0.28986567501298593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108375200","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.023546454,0.00061969634,0.9626737,0.012043666,0.0003660379,0.00031962176,0.000047357975,0.000017842976,0.00036558716],"genre_scores_gemma":[0.92900306,0.00003660914,0.06941563,0.0005357073,0.00089769677,0.000019963098,0.00003984746,0.000009380378,0.000042113712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99688095,0.00014586901,0.0012215539,0.00021664024,0.0013619594,0.00017300333],"domain_scores_gemma":[0.99470294,0.0014440696,0.0014010632,0.00033352146,0.0020391261,0.00007925751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012508873,0.00016587021,0.00025574898,0.00048102325,0.00017194636,0.000117879354,0.002294588,0.0000506919,0.000029755001],"category_scores_gemma":[0.00011113954,0.0001127931,0.0002702882,0.0010700702,0.00020098987,0.00042086994,0.00027975993,0.00027269582,0.000011501898],"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.0000342455,0.00027654873,0.0002571337,0.000014713997,0.00041841378,0.0000022817944,0.0011290739,0.57910097,0.00095162325,0.23291372,0.0015497939,0.1833515],"study_design_scores_gemma":[0.0021486613,0.0004116932,0.018382354,0.00014258672,0.00016580499,0.00095289596,0.00067975407,0.39529926,0.0051526595,0.15946428,0.41666406,0.00053597434],"about_ca_topic_score_codex":0.000009696844,"about_ca_topic_score_gemma":0.00000487788,"teacher_disagreement_score":0.9054566,"about_ca_system_score_codex":0.00009713678,"about_ca_system_score_gemma":0.00032912672,"threshold_uncertainty_score":0.45995694},"labels":[],"label_agreement":null},{"id":"W2108558002","doi":"","title":"Memory Requirements for Local Geometric Routing and Traversal in Digraphs","year":2008,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Tree traversal; Graph traversal; Computer science; Strongly connected component; Routing (electronic design automation); Node (physics); Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Algorithm; Computer network","score_opus":0.036114744265710416,"score_gpt":0.2584583483242786,"score_spread":0.22234360405856818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108558002","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.17310606,0.00006826675,0.82572454,0.00010897683,0.00010732925,0.000115062605,4.2653582e-7,0.000028372477,0.0007409753],"genre_scores_gemma":[0.966452,0.00001178043,0.03300564,0.00018152979,0.00002990219,0.000009119467,0.0000033043725,0.0000022782706,0.00030443515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993427,0.000015580707,0.00014585332,0.00021164272,0.00014119745,0.00014304758],"domain_scores_gemma":[0.9996986,0.0001074,0.000027658665,0.000084938925,0.00003824933,0.000043179225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021665424,0.00005941967,0.00007390314,0.0003373009,0.00009864372,0.000028002334,0.00012113901,0.000025330231,0.000004192389],"category_scores_gemma":[0.00003742703,0.000057395748,0.000023660617,0.00080701604,0.000023084653,0.0003150595,0.0000512211,0.000033655495,0.000002610097],"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.00003695615,0.00025373936,0.011875561,0.000037136244,0.00003085187,0.000033340893,0.0019906955,0.024984617,0.00085236435,0.061950076,0.0019940145,0.8959606],"study_design_scores_gemma":[0.0017862082,0.00020523844,0.09501559,0.000010483383,0.0000035177077,0.00005448509,0.00009695127,0.8925706,0.0059055616,0.0033906782,0.00070412725,0.00025656132],"about_ca_topic_score_codex":0.000027131495,"about_ca_topic_score_gemma":0.000013907625,"teacher_disagreement_score":0.8957041,"about_ca_system_score_codex":0.000022282671,"about_ca_system_score_gemma":0.00003595446,"threshold_uncertainty_score":0.23405306},"labels":[],"label_agreement":null},{"id":"W2108742501","doi":"","title":"Minimum Enclosing Area Triangle with a Fixed Angle","year":2010,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Carleton University","funders":"","keywords":"Plane (geometry); Set (abstract data type); Mathematics; Fixed point; Combinatorics; Geometry; Computer science; Mathematical analysis","score_opus":0.04384352178120192,"score_gpt":0.16677883852722236,"score_spread":0.12293531674602044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108742501","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.53572696,0.0000051297498,0.4612429,0.00006698259,0.0001745218,0.000064322674,0.0000010588889,0.00007567916,0.002642439],"genre_scores_gemma":[0.9892808,0.0000020510022,0.008646451,0.00010396621,0.000078818855,3.672915e-7,0.0000054715133,0.000004780157,0.0018772855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992746,0.000033254342,0.00007830042,0.0003716172,0.00006838795,0.00017384016],"domain_scores_gemma":[0.99929786,0.000092021575,0.000065467175,0.0003359372,0.00010611215,0.00010258084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111876674,0.00010136297,0.000100398596,0.0001545802,0.00016632522,0.000077787896,0.0003987211,0.000051449573,0.00005315587],"category_scores_gemma":[0.00002641893,0.000099685705,0.00004888715,0.0008691073,0.00004292254,0.00054149714,0.000093139264,0.00012997894,0.000043860433],"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.00023380444,0.00060907484,0.013081071,0.000027828852,0.00012695014,0.0006992116,0.00085036625,0.13324565,0.04423063,0.7809071,0.0034429594,0.022545371],"study_design_scores_gemma":[0.002127465,0.00030588207,0.006708141,0.00002118901,0.000036314956,0.000061987754,0.00008715649,0.95808077,0.009203445,0.012770243,0.01007315,0.0005242382],"about_ca_topic_score_codex":0.000013682695,"about_ca_topic_score_gemma":0.00006115469,"teacher_disagreement_score":0.8248351,"about_ca_system_score_codex":0.000023399578,"about_ca_system_score_gemma":0.00009446725,"threshold_uncertainty_score":0.4065065},"labels":[],"label_agreement":null},{"id":"W2109075893","doi":"10.1007/s00454-010-9277-9","title":"Long Non-crossing Configurations in the Plane","year":2010,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Hamiltonian path; Hamiltonian (control theory); General position; Approximation algorithm; Spanning tree; Discrete mathematics; Mathematical optimization; Graph","score_opus":0.01084745765232033,"score_gpt":0.2704098126255391,"score_spread":0.2595623549732188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109075893","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.32288435,0.000040589955,0.67230684,0.0017848291,0.0005777218,0.00021174164,0.00001174228,0.000057474437,0.002124704],"genre_scores_gemma":[0.9655315,0.000001287774,0.03272269,0.0010781084,0.00026162085,0.000031456628,0.00026134268,0.00000901729,0.00010295487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99810624,0.00008932002,0.0004054597,0.00043242043,0.0006553256,0.00031123575],"domain_scores_gemma":[0.9985674,0.000662141,0.00013022438,0.0003796302,0.00017588666,0.000084737585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007124178,0.00018946463,0.0001619429,0.00045078798,0.0005466112,0.0009182719,0.00087017025,0.000086266235,0.00006959342],"category_scores_gemma":[0.0001222603,0.00015544317,0.00008664278,0.0017516761,0.0001261084,0.0007195203,0.00010944948,0.0004662515,0.00010758465],"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.000025811341,0.0003877429,0.012297002,0.000041507086,0.000057269463,0.00011846481,0.004436169,0.43943805,0.0047545033,0.47926006,0.0026464367,0.05653699],"study_design_scores_gemma":[0.00062618754,0.00005524836,0.53447646,0.00001701242,0.0000071339464,0.00016769077,0.00009821023,0.4381902,0.0003282026,0.022644535,0.0030586931,0.00033044297],"about_ca_topic_score_codex":0.00003360867,"about_ca_topic_score_gemma":0.000077056495,"teacher_disagreement_score":0.6426472,"about_ca_system_score_codex":0.00002498165,"about_ca_system_score_gemma":0.0002467167,"threshold_uncertainty_score":0.8854917},"labels":[],"label_agreement":null},{"id":"W2109083408","doi":"10.1142/s0218195902000803","title":"ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":69,"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 Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; Simple polygon; Simple (philosophy); Decomposition; Regular polygon; Convex polygon; Geometry","score_opus":0.01666600020750904,"score_gpt":0.2948917396336267,"score_spread":0.27822573942611767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109083408","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.015752535,0.0002626515,0.9758973,0.0063920417,0.000317101,0.0004934784,0.0000905209,0.000027507542,0.0007668269],"genre_scores_gemma":[0.9495421,0.00002506858,0.048129488,0.0012894687,0.0005682984,0.00011401012,0.00009678868,0.000014331495,0.00022045958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773186,0.00007857298,0.00081490766,0.0002369202,0.0009706588,0.00016704742],"domain_scores_gemma":[0.9944474,0.0023252557,0.00081209425,0.00024124575,0.0020777206,0.00009626452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005607545,0.00016291,0.00023375372,0.0006562556,0.00022494557,0.0001784421,0.0012940663,0.000060651586,0.00024632222],"category_scores_gemma":[0.00014810129,0.00013692114,0.00026452495,0.0007684001,0.00009379523,0.00042951148,0.00009248865,0.00016780122,0.00008544827],"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.00006337706,0.0007599218,0.000055925415,0.000015453605,0.00038377964,0.0000030557082,0.00016501472,0.21343239,0.0017315284,0.7081432,0.016332876,0.058913533],"study_design_scores_gemma":[0.001465059,0.00046383697,0.0014032762,0.000048859565,0.000053748907,0.00023204548,0.000030586474,0.3730728,0.003166693,0.5532678,0.06648555,0.0003097704],"about_ca_topic_score_codex":0.0000016018662,"about_ca_topic_score_gemma":3.4813544e-7,"teacher_disagreement_score":0.93378955,"about_ca_system_score_codex":0.00010554486,"about_ca_system_score_gemma":0.000116601484,"threshold_uncertainty_score":0.5583482},"labels":[],"label_agreement":null},{"id":"W2109478355","doi":"","title":"Relaxed gabriel graphs","year":2009,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Mathematics; Geometric graph theory; Dual graph; Line graph; Constrained Delaunay triangulation; Discrete mathematics; Planar graph; Sublinear function; 1-planar graph; Graph; Voltage graph","score_opus":0.009834189295401244,"score_gpt":0.23144829851430304,"score_spread":0.2216141092189018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109478355","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.012551859,0.000046658184,0.9481787,0.0031981117,0.00016980163,0.00003896421,9.0855e-8,0.00015993993,0.035655886],"genre_scores_gemma":[0.90392053,0.000004351731,0.091609746,0.0022171943,0.00003354904,9.671908e-7,0.0000019993795,8.3795095e-7,0.002210815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995668,0.000012620884,0.00007833441,0.00013845878,0.000118984135,0.000084795494],"domain_scores_gemma":[0.9997271,0.00002037658,0.00001616726,0.0001566521,0.000039653132,0.00004009656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008482957,0.00004163614,0.000038375423,0.0000701025,0.00005780593,0.00006329016,0.00019338573,0.000017574563,0.000025404244],"category_scores_gemma":[0.000012461634,0.000036826055,0.00002750435,0.000375598,0.0000042561232,0.00025961912,0.00001921783,0.00003166719,0.00007448635],"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":[7.555317e-7,0.000020878038,0.000019917155,2.7311305e-7,0.0000012671987,0.0000019270437,0.000039352428,0.00045936482,0.0011063861,0.8866883,0.0063260067,0.10533556],"study_design_scores_gemma":[0.00048650106,0.00027766105,0.052217886,0.0000053781228,0.0000031454963,0.00004316042,0.000007269951,0.18036415,0.014061752,0.7093499,0.04286891,0.00031432288],"about_ca_topic_score_codex":0.0000016741423,"about_ca_topic_score_gemma":7.2350167e-7,"teacher_disagreement_score":0.8913687,"about_ca_system_score_codex":0.000005627876,"about_ca_system_score_gemma":0.000019328474,"threshold_uncertainty_score":0.1501723},"labels":[],"label_agreement":null},{"id":"W2110131456","doi":"10.1007/s00454-015-9699-5","title":"The Packing Density of the $$n$$ n -Dimensional Cross-Polytope","year":2015,"lang":"en","type":"article","venue":"Discrete & 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 Calgary","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Dimension (graph theory); Sphere packing; Upper and lower bounds; Euclidean geometry; Euclidean space; Space (punctuation); Geometry; Mathematical analysis","score_opus":0.021622339269126056,"score_gpt":0.2817796608075106,"score_spread":0.26015732153838456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110131456","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.601428,0.0004505184,0.39335817,0.0020243032,0.0015470469,0.00022581492,0.000013398698,0.00006907671,0.00088365824],"genre_scores_gemma":[0.9850719,0.000002079308,0.013817486,0.00048436274,0.00016273274,0.000008037416,0.000027319995,0.00000946414,0.0004166136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747574,0.00018228922,0.00046438648,0.00036690643,0.0012269743,0.0002836883],"domain_scores_gemma":[0.9975133,0.0007040596,0.00028978937,0.0004992343,0.00085302436,0.00014058826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010058391,0.00017751739,0.00017121685,0.00013148539,0.00064344384,0.0002803255,0.0010611676,0.00006310397,0.000007713781],"category_scores_gemma":[0.00044100243,0.00011202975,0.00016764838,0.0014094154,0.00023713295,0.00043241621,0.00065800146,0.00020013037,0.00003661185],"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.00003554635,0.00006394079,0.019698663,0.00001118192,0.00006377476,0.000003666072,0.00034042678,0.7490875,0.00014501196,0.21902543,0.0021601354,0.009364686],"study_design_scores_gemma":[0.0008339724,0.00008974568,0.36748254,0.000037655413,0.0000150690075,0.00007676142,0.00006216831,0.5118754,0.0019099306,0.113398865,0.003898774,0.00031911134],"about_ca_topic_score_codex":0.000024050929,"about_ca_topic_score_gemma":0.00000830917,"teacher_disagreement_score":0.3836439,"about_ca_system_score_codex":0.000075021344,"about_ca_system_score_gemma":0.00044616594,"threshold_uncertainty_score":0.4948915},"labels":[],"label_agreement":null},{"id":"W2110313341","doi":"10.1007/s10543-010-0283-3","title":"Analysis of and workarounds for element reversal for a finite element-based algorithm for warping triangular and tetrahedral meshes","year":2010,"lang":"en","type":"article","venue":"BIT Numerical Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":53,"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 mesh; Finite element method; Algorithm; Tetrahedron; Volume mesh; Vertex (graph theory); Boundary (topology); Mathematics; Mesh generation; Image warping; Stiffness matrix; Triangle mesh; Dimension (graph theory); Geometry; Computer science; Mathematical analysis; Combinatorics; Graph","score_opus":0.021898097847507375,"score_gpt":0.28652208233149434,"score_spread":0.26462398448398694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110313341","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.0076034428,0.00006737611,0.9910734,0.00039336362,0.00008840115,0.00068291626,0.00006423969,0.000022578583,0.0000042525285],"genre_scores_gemma":[0.07749677,0.0000035916719,0.92205465,0.00011670327,0.000063069565,0.00016935676,0.000049993745,0.0000079243855,0.00003794109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901754,0.000013592516,0.00037089735,0.00025414905,0.00016385282,0.00017997735],"domain_scores_gemma":[0.99808675,0.0013248946,0.00018378034,0.00017561152,0.0001578001,0.000071182694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054513395,0.00011826844,0.0003167476,0.0002084012,0.00011369422,0.00008740404,0.00014781186,0.000050622704,0.0000036197698],"category_scores_gemma":[0.00026278401,0.000106249776,0.00014470192,0.0004787881,0.000029794712,0.00010734355,0.00004195721,0.000041352952,1.2847431e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006971189,0.00060745276,0.00024215903,0.0006708525,0.0009931714,6.834593e-7,0.0011681254,0.0055732606,0.0030065659,0.07424824,0.00044899154,0.9129708],"study_design_scores_gemma":[0.0009387301,0.0002529398,0.00007959567,0.000012531848,0.0002898373,7.3316716e-7,0.00003823026,0.9855731,0.0013948248,0.009123359,0.0021706852,0.00012539835],"about_ca_topic_score_codex":0.0000019046255,"about_ca_topic_score_gemma":0.0000033125473,"teacher_disagreement_score":0.9799999,"about_ca_system_score_codex":0.000012131645,"about_ca_system_score_gemma":0.000044694905,"threshold_uncertainty_score":0.433274},"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":"W2110892810","doi":"10.1080/17513470701413451","title":"Sand drawings and Gaussian graphs§","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematics and the Arts","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Interdisciplinary Research in Music Media and Technology; McGill University","funders":"","keywords":"Connection (principal bundle); Class (philosophy); Computer science; Graph; Gaussian; Mathematics; Theoretical computer science; Geometry; Artificial intelligence","score_opus":0.012058198451296392,"score_gpt":0.24489033075351962,"score_spread":0.23283213230222324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110892810","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.3824979,0.0005892723,0.6137422,0.0018632098,0.00012088784,0.000039892835,8.40686e-8,0.0000037673644,0.0011428137],"genre_scores_gemma":[0.9338651,0.0000763583,0.06578907,0.00016613449,0.00005917613,1.6169938e-7,4.2179355e-8,0.0000017319961,0.000042230527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995131,0.000010377124,0.00021446719,0.000044348828,0.00015232789,0.00006538472],"domain_scores_gemma":[0.9994085,0.00023967848,0.000170345,0.00007148985,0.000059297516,0.000050695784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013992364,0.000043921027,0.00009919559,0.00007838493,0.000096472875,0.00010882658,0.00010778366,0.000013717397,0.0000015568783],"category_scores_gemma":[0.000048993898,0.000024495102,0.000030947842,0.000098135686,0.000044542216,0.00016016293,0.000043953787,0.000058649894,6.261819e-7],"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.000010806594,0.000037862916,0.00006570814,0.000018211174,0.000024111025,0.000012541102,0.0030675349,0.00003219607,0.0004714594,0.9764882,0.00021656707,0.019554814],"study_design_scores_gemma":[0.0012053382,0.00009253904,0.0027623265,0.000057236186,0.000022520047,0.0010977597,0.0001826448,0.018812496,0.001534318,0.97208333,0.0020663976,0.00008309035],"about_ca_topic_score_codex":5.876885e-7,"about_ca_topic_score_gemma":7.648408e-7,"teacher_disagreement_score":0.55136716,"about_ca_system_score_codex":0.0000028044603,"about_ca_system_score_gemma":0.000011066372,"threshold_uncertainty_score":0.10494172},"labels":[],"label_agreement":null},{"id":"W2111009215","doi":"","title":"On a geometric approach to the segment sum problem and its generalization","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on 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 Windsor","funders":"","keywords":"Generalization; Combinatorics; Monotone polygon; Mathematics; Optimization problem; Sequence (biology); Subset sum problem; Discrete mathematics; Mathematical optimization; Computer science; Algorithm; Knapsack problem; Geometry","score_opus":0.030181404593928495,"score_gpt":0.24807000493480882,"score_spread":0.21788860034088034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111009215","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.032170955,0.00013105752,0.9467984,0.004585896,0.00038454967,0.0006719677,0.000031165906,0.00007103353,0.01515502],"genre_scores_gemma":[0.96532494,0.00000766533,0.027220543,0.006546549,0.00016943699,0.00003989527,0.00012347572,0.000014007831,0.0005534875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766195,0.000082525876,0.0003493651,0.00066620845,0.00072376395,0.0005161616],"domain_scores_gemma":[0.9981226,0.00036086846,0.00010302647,0.0002894714,0.00048147564,0.00064261287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009501706,0.00024948653,0.0001750707,0.0019908934,0.00051809143,0.00039544498,0.0006097404,0.00009499798,0.000032525895],"category_scores_gemma":[0.00015864904,0.00021502875,0.000048221216,0.003459328,0.000028432469,0.00023092664,0.00009440759,0.0002143015,0.00017316724],"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.00000826046,0.00005285813,0.000051315623,0.000009463863,0.000016495476,0.000004751047,0.00017527246,0.28282318,0.000016284861,0.6841391,0.002826386,0.029876662],"study_design_scores_gemma":[0.00074259675,0.00051508885,0.029611703,0.0000551041,0.000013605461,0.00007097418,0.000081019105,0.9237497,0.00030538288,0.027390087,0.016708208,0.0007565489],"about_ca_topic_score_codex":0.0005180898,"about_ca_topic_score_gemma":0.0011565639,"teacher_disagreement_score":0.933154,"about_ca_system_score_codex":0.00022519949,"about_ca_system_score_gemma":0.00059177674,"threshold_uncertainty_score":0.8768618},"labels":[],"label_agreement":null},{"id":"W2111465243","doi":"10.1142/s0218195905001877","title":"GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"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":"Polyhedron; Combinatorics; Mathematics; Vertex (graph theory); Regular polygon; Polygon (computer graphics); Simple polygon; Monotonic function; Convex set; Polygon covering; Convex polytope; Intersection (aeronautics); Star-shaped polygon; Rectilinear polygon; Simple (philosophy); Geometry; Computer science; Convex optimization; Mathematical analysis","score_opus":0.016600819376952018,"score_gpt":0.29098531703691255,"score_spread":0.27438449765996054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111465243","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.084734924,0.000672662,0.9078629,0.0043591843,0.00054555235,0.00024431135,0.000033117965,0.00003281955,0.0015144949],"genre_scores_gemma":[0.7910706,0.00013460293,0.20501135,0.0006434669,0.0029944417,0.000022048727,0.000029359851,0.000012628259,0.000081513],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99749625,0.00007171028,0.000919805,0.00030713066,0.0010233157,0.00018176659],"domain_scores_gemma":[0.9968823,0.00061351457,0.0008029174,0.0001862778,0.0013658572,0.0001491419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048369964,0.00018867684,0.00027677283,0.0011682756,0.0001481793,0.00018776862,0.0008661878,0.00007471052,0.00004906516],"category_scores_gemma":[0.00008760533,0.00019317213,0.00016490558,0.00077503506,0.00008387178,0.0007899545,0.0001702866,0.00024051694,0.000024167482],"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.00005940226,0.00041633917,0.00046537234,0.00001235611,0.00024036005,0.000006183649,0.00021064389,0.22845408,0.0013308866,0.22676961,0.000989425,0.5410453],"study_design_scores_gemma":[0.0052870465,0.00092384854,0.040025577,0.00031608992,0.0001662807,0.0017360356,0.00025580055,0.20847481,0.024478758,0.25526476,0.46167728,0.0013936966],"about_ca_topic_score_codex":0.000004570739,"about_ca_topic_score_gemma":0.000002631063,"teacher_disagreement_score":0.70633566,"about_ca_system_score_codex":0.00013975652,"about_ca_system_score_gemma":0.00027718634,"threshold_uncertainty_score":0.7877331},"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":"W2112643218","doi":"10.48550/arxiv.cs/0212050","title":"Open Problems from CCCG 2002","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Science Foundation","keywords":"Computer science","score_opus":0.11145220488087618,"score_gpt":0.28754904591280983,"score_spread":0.17609684103193365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112643218","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.40554932,0.0021272218,0.56373405,0.0037677765,0.0040862933,0.0012718573,0.0000658686,0.00037993555,0.019017661],"genre_scores_gemma":[0.9228917,0.00021092151,0.055402305,0.0013706131,0.0010504765,0.00019970539,0.00023523714,0.000033268898,0.018605774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978148,0.000114163195,0.00040516342,0.0010246317,0.00035837988,0.00028288554],"domain_scores_gemma":[0.9982089,0.000102745864,0.00025780083,0.0011239641,0.00017130024,0.00013529634],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028082592,0.0002859499,0.00031911916,0.0001399518,0.00016835648,0.0007039446,0.0031646965,0.00022109468,0.0006905214],"category_scores_gemma":[0.00005456206,0.0002909903,0.00011241658,0.0003575218,0.000027648157,0.0005482304,0.004858806,0.00046768945,0.0017943574],"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.000036525435,0.0020751115,0.11395776,0.00040559212,0.0009197888,0.000218639,0.006870678,0.30276474,0.0053383005,0.022680154,0.2868017,0.257931],"study_design_scores_gemma":[0.0016093027,0.0001771586,0.21241724,0.00047023574,0.00007007478,0.000019295896,0.000019553496,0.41382846,0.0044517675,0.052708607,0.31215218,0.0020761357],"about_ca_topic_score_codex":0.00036156684,"about_ca_topic_score_gemma":0.000043384785,"teacher_disagreement_score":0.5173424,"about_ca_system_score_codex":0.00007438889,"about_ca_system_score_gemma":0.00015734498,"threshold_uncertainty_score":0.9999542},"labels":[],"label_agreement":null},{"id":"W2113371112","doi":"10.1007/s00022-013-0167-1","title":"Isoperimetric triangular enclosures with a fixed angle","year":2013,"lang":"en","type":"article","venue":"Journal of 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":"Isoperimetric inequality; Mathematics; Combinatorics; Perimeter; Fixed point; Plane (geometry); Tree (set theory); Upper and lower bounds; Isoperimetric dimension; Position (finance); Circumference; Computation; Geometry; General position; Triangle inequality; Mathematical analysis; Algorithm","score_opus":0.007688430332942935,"score_gpt":0.2108605492883758,"score_spread":0.20317211895543286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113371112","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.5233404,0.0013379065,0.47365668,0.0006661545,0.00034540694,0.00009636403,4.7862045e-7,0.000019072973,0.00053752726],"genre_scores_gemma":[0.90887755,0.00002104941,0.090012,0.0002995045,0.00028660757,0.0000028449886,8.610533e-7,0.0000063508605,0.000493249],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99873126,0.00006533313,0.00035628155,0.00013968015,0.0005328419,0.00017459174],"domain_scores_gemma":[0.99864566,0.00015411305,0.00031461002,0.00020468037,0.0005422674,0.00013867894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038239654,0.00010746852,0.00020753409,0.0009833944,0.00007822306,0.00021767177,0.00050209096,0.00004562884,0.00014841661],"category_scores_gemma":[0.00018181372,0.00007526877,0.00009589432,0.0024165476,0.000021717155,0.0010187337,0.000063107706,0.00016033753,0.00006382577],"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.00021301329,0.0015714105,0.035775658,0.00011011578,0.00080122665,0.00041365554,0.0013216062,0.02475471,0.050683126,0.015830392,0.095773056,0.77275205],"study_design_scores_gemma":[0.012661494,0.011068417,0.6922696,0.00032065742,0.0002076572,0.0057524545,0.00062323024,0.04211119,0.110186815,0.019929003,0.10275176,0.0021176885],"about_ca_topic_score_codex":0.000010935408,"about_ca_topic_score_gemma":6.42475e-7,"teacher_disagreement_score":0.77063435,"about_ca_system_score_codex":0.000039185943,"about_ca_system_score_gemma":0.00014176137,"threshold_uncertainty_score":0.30693713},"labels":[],"label_agreement":null},{"id":"W2113436588","doi":"10.37236/3025","title":"Crossings in Grid Drawings","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Omega; Vertex (graph theory); Grid; Crossing number (knot theory); Matching (statistics); Integer (computer science); Graph; Discrete mathematics; Geometry; Mathematical analysis; Physics","score_opus":0.0031886454561910584,"score_gpt":0.20650493789445723,"score_spread":0.20331629243826618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113436588","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.26087195,0.0008513418,0.73371285,0.0026092082,0.0011968353,0.000042425425,4.259263e-8,0.00001244312,0.00070292735],"genre_scores_gemma":[0.9990677,0.000056436,0.00021915881,0.00024105482,0.0002451716,7.1138817e-7,2.1273188e-7,0.0000040687514,0.00016546017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888515,0.00012239108,0.00029445402,0.00008690187,0.00032614288,0.00028495654],"domain_scores_gemma":[0.9991937,0.00020058484,0.00022857598,0.00016832563,0.00016991094,0.00003890151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00185317,0.000074868454,0.0001305508,0.00014682172,0.00011357844,0.00012912467,0.0007276608,0.000029634386,0.0000017614674],"category_scores_gemma":[0.00012791397,0.000053524087,0.000059366543,0.0006853552,0.000025632824,0.0003618065,0.000060706723,0.00038489368,0.0000052459864],"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.0000069841303,0.00004791719,0.00015418055,0.0000022747588,0.0000071916293,0.0000017836919,0.0003259549,0.0019368611,0.0002613586,0.99127656,0.0006611372,0.0053177844],"study_design_scores_gemma":[0.0007193408,0.0003626138,0.0022593318,0.0000151301565,0.0000057268157,0.00015879126,0.000010313226,0.017916083,0.0015894437,0.935631,0.041236293,0.00009593577],"about_ca_topic_score_codex":0.0000037732448,"about_ca_topic_score_gemma":0.000002721884,"teacher_disagreement_score":0.7381958,"about_ca_system_score_codex":0.0001556366,"about_ca_system_score_gemma":0.00031406316,"threshold_uncertainty_score":0.2182649},"labels":[],"label_agreement":null},{"id":"W2113528966","doi":"10.1142/s0218195900000061","title":"ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","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 Windsor","funders":"","keywords":"Visibility graph; Mathematics; Bipartite graph; Combinatorics; Visibility; Polygon (computer graphics); Planar graph; Enhanced Data Rates for GSM Evolution; Graph; Visibility polygon; Polygon covering; Discrete mathematics; Geometry; Regular polygon; Computer science; Artificial intelligence; Optics; Telecommunications","score_opus":0.008723127740412584,"score_gpt":0.2677453525527823,"score_spread":0.25902222481236975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113528966","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.117609225,0.00040202434,0.87844867,0.00096664735,0.00018242636,0.00028618384,0.0000547667,0.00004336652,0.002006667],"genre_scores_gemma":[0.8624962,0.000059675876,0.13659967,0.00028551425,0.00028446366,0.000037063575,0.00007802456,0.000012878332,0.00014651025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967642,0.00009394529,0.0010428076,0.00036485423,0.0015239221,0.0002102606],"domain_scores_gemma":[0.99583685,0.0004965526,0.00072811823,0.0003165786,0.0024389843,0.00018288419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005708858,0.0002221862,0.0003253757,0.00094294,0.00014548053,0.00014747331,0.0014741606,0.00007552268,0.00024859328],"category_scores_gemma":[0.000033757115,0.00020025877,0.0002477019,0.001612331,0.0002198291,0.0008831858,0.000095667456,0.0002579951,0.000042241376],"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.00019323012,0.001002011,0.0030264494,0.000021585125,0.0004804121,0.00001885549,0.00017848291,0.34738338,0.0003837441,0.32005945,0.00039047527,0.32686192],"study_design_scores_gemma":[0.0066827056,0.0014193762,0.16896184,0.0002766438,0.00022292783,0.0030445284,0.00017496958,0.04261087,0.003873955,0.61269224,0.15855804,0.0014819162],"about_ca_topic_score_codex":0.0000046397613,"about_ca_topic_score_gemma":0.000002736914,"teacher_disagreement_score":0.744887,"about_ca_system_score_codex":0.000089771136,"about_ca_system_score_gemma":0.0005292182,"threshold_uncertainty_score":0.81663156},"labels":[],"label_agreement":null},{"id":"W2114125964","doi":"10.1016/j.ipl.2007.05.009","title":"On planar path transformation","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","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":"Queen's University","funders":"","keywords":"Planar; Mathematics; Path (computing); General position; Position (finance); Hamiltonian path; Regular polygon; Combinatorics; Hamiltonian (control theory); Plane (geometry); Geometry; Computer science; Mathematical optimization; Graph","score_opus":0.008217308766478882,"score_gpt":0.22678855360038522,"score_spread":0.21857124483390633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114125964","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.03777259,0.000008415013,0.9535303,0.0028538622,0.00024086963,0.0001018681,0.0000012417233,0.00018506436,0.0053057717],"genre_scores_gemma":[0.9622576,9.967173e-7,0.02441348,0.013196888,0.000055554523,0.0000053903946,0.000056066405,0.0000027508436,0.000011223768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902064,0.000011751592,0.0003259519,0.00009198576,0.0003714698,0.00017819287],"domain_scores_gemma":[0.99955785,0.000050993705,0.00013399708,0.00011615138,0.000086422,0.0000545992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004842276,0.000092481474,0.000061026873,0.00031891468,0.00020413745,0.0002818092,0.00021657282,0.000037056892,0.0000050224485],"category_scores_gemma":[0.000027130542,0.00008788893,0.000028794144,0.00046491445,0.000013289447,0.0041467706,0.00000896102,0.00009322003,0.00013570361],"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.000029258435,0.000027395006,0.00001890274,0.00006418915,0.000005757823,0.0000026319829,0.006039482,0.015354747,0.0018801593,0.1104319,0.0039396496,0.8622059],"study_design_scores_gemma":[0.00325255,0.00038211967,0.015919497,0.000297498,0.000018089046,0.00015495687,0.0004858846,0.74463135,0.039605092,0.017638465,0.17613705,0.0014774646],"about_ca_topic_score_codex":0.0000018334274,"about_ca_topic_score_gemma":5.211641e-7,"teacher_disagreement_score":0.92911685,"about_ca_system_score_codex":0.000057502046,"about_ca_system_score_gemma":0.000039269733,"threshold_uncertainty_score":0.35840067},"labels":[],"label_agreement":null},{"id":"W2114303587","doi":"","title":"A Simple Streaming Algorithm for Minimum Enclosing Balls","year":2006,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"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":"Simple (philosophy); Dimension (graph theory); Ball (mathematics); Approximation algorithm; Algorithm; SIMPLE algorithm; Computer science; Set (abstract data type); Combinatorics; Mathematics; Geometry; Physics","score_opus":0.011889523263211906,"score_gpt":0.25201876578450394,"score_spread":0.24012924252129203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114303587","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.0071367593,0.00004336252,0.98937345,0.00016127937,0.00017728627,0.00013507275,0.0000037201878,0.00009904841,0.0028700223],"genre_scores_gemma":[0.28011468,6.117973e-7,0.7177524,0.00020920769,0.0002881442,0.000016028924,0.00003605972,0.000004050756,0.0015788021],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934375,0.000012265745,0.0001433094,0.00021301438,0.00012929236,0.00015837434],"domain_scores_gemma":[0.99959296,0.00013226246,0.000036608064,0.00012539739,0.000082844825,0.000029930803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000124123,0.000068943635,0.00006655228,0.00007711924,0.00012815697,0.00013621572,0.00017579798,0.000025076119,0.000016273181],"category_scores_gemma":[0.000010526738,0.00006626192,0.00004510092,0.00022700756,0.0000069590906,0.00028286353,0.00005060458,0.000021990267,0.0000100120815],"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.0000010589536,0.00007320176,0.000059739075,0.000006052569,0.000006977985,0.0000021594192,0.000040818893,0.005272777,0.005315745,0.10862895,0.009370897,0.8712216],"study_design_scores_gemma":[0.00022155458,0.00003868734,0.00064359955,0.00000254822,0.0000024373926,0.0000047035337,0.000007236715,0.94530994,0.011589849,0.0266547,0.015420729,0.00010403586],"about_ca_topic_score_codex":0.000037692233,"about_ca_topic_score_gemma":0.000010863272,"teacher_disagreement_score":0.94003713,"about_ca_system_score_codex":0.00002162387,"about_ca_system_score_gemma":0.000040054823,"threshold_uncertainty_score":0.27020827},"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":"W2114804538","doi":"10.1145/2151171.2151173","title":"Succinct geometric indexes supporting point location queries","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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; Carleton University","funders":"","keywords":"Point location; Point (geometry); Mathematics; Combinatorics; Bounded function; Entropy (arrow of time); Planar; Space (punctuation); Line segment; Computational geometry; Computer science; Discrete mathematics; Algorithm; Geometry","score_opus":0.02228141457167807,"score_gpt":0.27819387146114904,"score_spread":0.25591245688947095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114804538","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.0107761305,0.0002239492,0.9856727,0.0015342144,0.0011522127,0.00016458155,0.0000048380593,0.00022543078,0.0002459488],"genre_scores_gemma":[0.8199401,0.000019652782,0.17920193,0.00029023408,0.00018090848,0.000037226062,0.000011553691,0.000010219608,0.00030821035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985264,0.000063521664,0.0003299707,0.00029434232,0.0004067734,0.00037900667],"domain_scores_gemma":[0.99878436,0.00023443151,0.00011253483,0.00053519907,0.00017610416,0.0001573524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054008525,0.0001639708,0.00013857338,0.00060850085,0.0003567507,0.00012835293,0.0004078307,0.00007693358,0.000103338854],"category_scores_gemma":[0.00012437573,0.00016278322,0.00008000536,0.0021402745,0.000026649694,0.0014316572,0.000019268491,0.00018730137,0.00017681319],"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.0000065916747,0.00030946065,0.00031404677,0.000016489012,0.000036325393,0.0000020931805,0.000684463,0.013637463,0.00023957246,0.0049863374,0.00020336642,0.9795638],"study_design_scores_gemma":[0.0043207426,0.0018461721,0.3097626,0.00018549916,0.00024073603,0.00085510465,0.0012660926,0.33853137,0.24681725,0.043403096,0.04878887,0.0039824364],"about_ca_topic_score_codex":0.00004406297,"about_ca_topic_score_gemma":0.000006519771,"teacher_disagreement_score":0.97558135,"about_ca_system_score_codex":0.00009385661,"about_ca_system_score_gemma":0.0000820666,"threshold_uncertainty_score":0.66381073},"labels":[],"label_agreement":null},{"id":"W2115103572","doi":"","title":"VC-Dimension of Visibility on Terrains","year":2008,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Terrain; Combinatorics; Monotone polygon; Mathematics; Guard (computer science); Dimension (graph theory); Line segment; Piecewise; Raised-relief map; Algorithm; Computer science; Geometry; Mathematical analysis; Geography; Cartography","score_opus":0.030802723715013122,"score_gpt":0.25743841042472176,"score_spread":0.22663568670970863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115103572","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.6101341,0.0000070607007,0.38160497,0.00029009255,0.0001301619,0.000049049107,3.6287378e-7,0.00004390022,0.0077402825],"genre_scores_gemma":[0.96808046,0.0000021512349,0.030982645,0.00031774302,0.00002287652,0.0000010568967,0.000001960802,0.0000011711509,0.0005899086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994457,0.000026263797,0.00012005053,0.00016234694,0.00018195779,0.000063689025],"domain_scores_gemma":[0.9995895,0.000054053548,0.000031960284,0.00022775297,0.000066739914,0.000030002997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011676223,0.000043685326,0.000060766735,0.00006702325,0.000059541264,0.000005759494,0.00014083687,0.000018444563,0.000027474096],"category_scores_gemma":[0.000026833412,0.000035880963,0.000031123578,0.00023060261,0.000019910141,0.00012885213,0.000050461185,0.000029646026,0.000033386917],"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.00006361136,0.0014595013,0.004525877,0.000034938184,0.00003821237,0.000031025404,0.004665547,0.04690972,0.07651219,0.6797427,0.021760104,0.16425659],"study_design_scores_gemma":[0.0009438281,0.00093766773,0.20269263,0.000020901838,0.0000035158018,0.000064549575,0.000023437138,0.46730417,0.3039365,0.018624095,0.005089833,0.00035885157],"about_ca_topic_score_codex":0.000007047188,"about_ca_topic_score_gemma":0.0000018315689,"teacher_disagreement_score":0.66111857,"about_ca_system_score_codex":0.000011344513,"about_ca_system_score_gemma":0.0000363476,"threshold_uncertainty_score":0.14631832},"labels":[],"label_agreement":null},{"id":"W2115185960","doi":"10.1007/978-3-319-19315-1_27","title":"Kinetic Reverse k-Nearest Neighbor Problem","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Victoria; University of Waterloo","funders":"","keywords":"k-nearest neighbors algorithm; Combinatorics; Integer (computer science); Dimension (graph theory); Kinetic energy; Set (abstract data type); Nearest-neighbor chain algorithm; Point (geometry); Computer science; Nearest neighbor search; Nearest neighbor graph; Algorithm; Mathematics; Discrete mathematics; Physics; Geometry; Artificial intelligence; Cluster analysis; Quantum mechanics","score_opus":0.02665015439700633,"score_gpt":0.254776265792872,"score_spread":0.22812611139586567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115185960","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.0000244187,0.00068293273,0.98397946,0.0011538543,0.0018088847,0.00042594227,0.0000054612547,0.00016318199,0.011755855],"genre_scores_gemma":[0.057511576,0.000044704466,0.93571955,0.0020628478,0.0013035733,0.000018416362,0.00003123056,0.000045945442,0.0032621413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961759,0.00004133131,0.00050958566,0.0014171426,0.0013083153,0.00054774625],"domain_scores_gemma":[0.9975404,0.0002608441,0.00026288713,0.0010804252,0.00058672857,0.00026868063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009719775,0.0004656278,0.000416328,0.00089409295,0.00020523774,0.00055546715,0.0023825287,0.0002620335,0.000036291305],"category_scores_gemma":[0.00010792483,0.0004402696,0.00010574859,0.00097156985,0.00034390212,0.0006890011,0.001092359,0.0006064624,0.00017940174],"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.000006604688,0.00003868827,0.00001460631,0.000040152652,0.000010287959,0.00010025535,0.00043037784,0.23809946,0.0001245709,0.087137185,0.00107724,0.6729206],"study_design_scores_gemma":[0.0003876178,0.0002666364,0.00008136051,0.00025726075,0.000009774037,0.00012505369,8.996514e-8,0.5648204,0.00041688795,0.3908714,0.0419901,0.00077338115],"about_ca_topic_score_codex":0.000022737453,"about_ca_topic_score_gemma":0.000051668867,"teacher_disagreement_score":0.6721472,"about_ca_system_score_codex":0.0003507056,"about_ca_system_score_gemma":0.0011082534,"threshold_uncertainty_score":0.9998049},"labels":[],"label_agreement":null},{"id":"W2115400757","doi":"10.1016/s0012-365x(02)00491-0","title":"Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","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":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Crossing number (knot theory); Point (geometry); Graph; Enhanced Data Rates for GSM Evolution; Complete graph; Line segment; Plane (geometry); Discrete mathematics; Geometry; Computer science","score_opus":0.023865429777955555,"score_gpt":0.2814076873342632,"score_spread":0.25754225755630766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115400757","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.09892558,0.00020626068,0.89555305,0.0006864352,0.00022092846,0.00012503625,0.0000016005292,0.000036497757,0.00424462],"genre_scores_gemma":[0.6424643,0.0000110527535,0.35658288,0.00016680518,0.000059505284,0.0000019653696,0.0000017456181,0.000009338228,0.0007024039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913037,0.00004289252,0.00026611963,0.00016783275,0.00024780183,0.00014500583],"domain_scores_gemma":[0.999263,0.00018427128,0.00012435668,0.00028871017,0.000079231846,0.000060428225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003545139,0.00010856358,0.00014288646,0.000033847024,0.00018935607,0.0003774338,0.0002249485,0.000041352363,0.000021860886],"category_scores_gemma":[0.00022384118,0.00007756042,0.000052201674,0.0002939272,0.00010805109,0.00021096303,0.00008255363,0.00008268572,0.0000136819035],"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.0000026055914,0.000059918813,0.0007338609,0.00011682538,0.000041507876,0.000002142401,0.017141478,0.00078522915,0.00045656395,0.97278595,0.0009911576,0.006882746],"study_design_scores_gemma":[0.0008540765,0.00009328706,0.0012286992,0.00018302894,0.00007145556,0.00036653722,0.0013357702,0.271697,0.019414155,0.67368543,0.030493822,0.00057672686],"about_ca_topic_score_codex":0.0000059775216,"about_ca_topic_score_gemma":0.0000010797123,"teacher_disagreement_score":0.54353875,"about_ca_system_score_codex":0.00001286476,"about_ca_system_score_gemma":0.00013689889,"threshold_uncertainty_score":0.3639603},"labels":[],"label_agreement":null},{"id":"W2115400861","doi":"10.1109/soac.1990.82194","title":"A faster algorithm for weighted distance tiles","year":2002,"lang":"en","type":"article","venue":"","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 Manitoba","funders":"","keywords":"Algorithm; Tile; Computer science; Graphics; Sequence (biology); Combinatorics; Ranking (information retrieval); Mathematics; Artificial intelligence; Computer graphics (images)","score_opus":0.02009628879015512,"score_gpt":0.23273258192082813,"score_spread":0.212636293130673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115400861","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.00029567027,0.00011506331,0.99430704,0.00097122614,0.00023443445,0.00011070415,0.0000034299153,0.00008628541,0.0038761331],"genre_scores_gemma":[0.07184742,0.0000073403457,0.91035455,0.00088883255,0.00016722578,0.00003582164,0.00000788315,0.000003980924,0.016686924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950194,0.000009373984,0.0000941176,0.00017858563,0.000106378204,0.00010958575],"domain_scores_gemma":[0.99968016,0.000058399255,0.000022649072,0.00013532299,0.00006719701,0.00003627833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005159842,0.00005531461,0.000052747633,0.00004628275,0.0000748435,0.000083487714,0.00018196786,0.000018490666,0.00009892791],"category_scores_gemma":[0.0000051568513,0.000047062087,0.000033688106,0.00020038745,0.000007876737,0.00025605134,0.00003114051,0.00002012825,0.000074047086],"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":[4.7091692e-7,0.00003742823,0.000005310136,0.0000025998916,0.0000049021182,7.8070246e-7,0.00010579368,0.000056926787,0.000077958946,0.080630034,0.015546957,0.90353084],"study_design_scores_gemma":[0.00016782437,0.000029229494,0.000052042513,0.0000019613337,0.0000010847565,0.0000022823808,0.000002641565,0.9146202,0.00116058,0.0058344696,0.07805775,0.00006993963],"about_ca_topic_score_codex":7.2423757e-7,"about_ca_topic_score_gemma":0.000001721055,"teacher_disagreement_score":0.91456324,"about_ca_system_score_codex":0.00001017671,"about_ca_system_score_gemma":0.0000054901707,"threshold_uncertainty_score":0.19191362},"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":"W2116409181","doi":"10.1142/s0218195900000309","title":"VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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; University of Saskatchewan","funders":"","keywords":"Traverse; Visibility; Visibility graph; Visibility polygon; Graph; Computer science; Line (geometry); Line segment; Algorithm; Set (abstract data type); Mathematics; Artificial intelligence; Optics; Theoretical computer science; Geometry; Regular polygon; Simple polygon; Geography; Geodesy; Physics","score_opus":0.016608263547273308,"score_gpt":0.28811897972057954,"score_spread":0.27151071617330624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116409181","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.23357111,0.00016009503,0.76208925,0.0025129498,0.00019009244,0.00036818933,0.000032550917,0.00003922009,0.0010365366],"genre_scores_gemma":[0.94304556,0.00008576826,0.05508455,0.00084400293,0.00048963795,0.000030884865,0.000071037364,0.000013023727,0.00033551062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973845,0.000093260605,0.0008651178,0.00041678594,0.001032931,0.00020743549],"domain_scores_gemma":[0.99766964,0.0006557192,0.0003811023,0.00019465107,0.0009406221,0.00015826689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007019893,0.00020909496,0.00027075133,0.0008850405,0.00014345732,0.00022992738,0.000679815,0.00007648178,0.00008677504],"category_scores_gemma":[0.000060948696,0.00021491839,0.000117254065,0.00087836734,0.000073092226,0.0006889072,0.00010309893,0.00029169492,0.00013619965],"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.00009395774,0.00047380736,0.0007363495,0.0000087787275,0.000100293524,0.00003217766,0.00016463279,0.67892265,0.00007175355,0.009174661,0.00012515085,0.3100958],"study_design_scores_gemma":[0.0051198066,0.0008858618,0.12936899,0.0002991698,0.000053561376,0.00093973166,0.00006325723,0.687635,0.0013827553,0.11416249,0.059102483,0.0009869001],"about_ca_topic_score_codex":0.0000083108725,"about_ca_topic_score_gemma":0.0000058884416,"teacher_disagreement_score":0.7094745,"about_ca_system_score_codex":0.00021731874,"about_ca_system_score_gemma":0.00017262348,"threshold_uncertainty_score":0.87641174},"labels":[],"label_agreement":null},{"id":"W2116779196","doi":"10.5555/1109557.1109582","title":"Simultaneous diagonal flips in plane triangulations","year":2006,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Diagonal; Triangulation; Combinatorics; Vertex (graph theory); Mathematics; Pitteway triangulation; Sequence (biology); Plane (geometry); Delaunay triangulation; Geometry; Graph","score_opus":0.009305936358018874,"score_gpt":0.2296637316293846,"score_spread":0.22035779527136573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116779196","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.10619461,0.000056436867,0.8831341,0.000838301,0.00019580885,0.000093085255,0.0000020045832,0.000092476555,0.009393125],"genre_scores_gemma":[0.9623159,8.053348e-7,0.035132837,0.00013806506,0.00012556322,0.000005370623,0.00003317447,0.0000019144582,0.0022463333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940705,0.00002497804,0.00015565057,0.0001597886,0.00014205313,0.00011048717],"domain_scores_gemma":[0.99954927,0.00025788828,0.00002302352,0.00011380652,0.00003240924,0.000023575205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101805446,0.000053546766,0.000057774683,0.00013960736,0.000048116886,0.00006011182,0.00014802914,0.0000258827,0.00005268672],"category_scores_gemma":[0.000033930264,0.00005111581,0.000020541305,0.00043958638,0.0000071541067,0.00017413306,0.00003182762,0.000041242696,0.00006602273],"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.0000049948353,0.00011781342,0.00096774154,0.000002069395,0.000002324109,0.000034397475,0.00006298464,0.5835449,0.0009467921,0.38223025,0.0018127685,0.03027297],"study_design_scores_gemma":[0.000502671,0.000028163055,0.025381424,0.0000029261582,0.0000011318093,0.000020586416,0.0000040595655,0.9347821,0.0012344527,0.026884727,0.011020653,0.00013713374],"about_ca_topic_score_codex":0.00008774986,"about_ca_topic_score_gemma":0.00025816643,"teacher_disagreement_score":0.8561213,"about_ca_system_score_codex":0.000022994256,"about_ca_system_score_gemma":0.000038287548,"threshold_uncertainty_score":0.20844422},"labels":[],"label_agreement":null},{"id":"W2116792850","doi":"10.1142/s0218195910003281","title":"GRID VERTEX-UNFOLDING ORTHOSTACKS","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Grid; Surface (topology); Plane (geometry); Geometry; Graph","score_opus":0.007965995282322239,"score_gpt":0.28004740388542537,"score_spread":0.27208140860310315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116792850","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.027971221,0.00020380286,0.9641427,0.002360614,0.0034418947,0.00026197877,0.000031766438,0.000081854785,0.0015041863],"genre_scores_gemma":[0.7734446,0.000030823485,0.22354883,0.0007371595,0.0019342485,0.000050994546,0.00009245752,0.00001727824,0.00014361386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969316,0.000054623746,0.0009572827,0.00035617762,0.0014545043,0.0002457846],"domain_scores_gemma":[0.99517894,0.0006429618,0.0007574915,0.0003213018,0.0028586963,0.0002406004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007415954,0.00022105925,0.0002544588,0.0011725407,0.00022285659,0.00043123704,0.0020445916,0.000111357,0.00015976882],"category_scores_gemma":[0.00016284749,0.00022399731,0.0002568666,0.0012316664,0.000084238665,0.001235515,0.00024881345,0.00056243635,0.00013067029],"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.00004219559,0.0005941321,0.0016774466,0.000015611007,0.0003627807,0.000045255925,0.00018063775,0.110001385,0.0052776476,0.5556466,0.004283908,0.32187244],"study_design_scores_gemma":[0.0020478235,0.00020387759,0.01590651,0.000048519978,0.000058523936,0.0021496709,0.000058993315,0.050421864,0.0036492066,0.26381102,0.66090256,0.000741437],"about_ca_topic_score_codex":0.000003925487,"about_ca_topic_score_gemma":0.0000033966407,"teacher_disagreement_score":0.7454734,"about_ca_system_score_codex":0.00009445862,"about_ca_system_score_gemma":0.00048098632,"threshold_uncertainty_score":0.9134345},"labels":[],"label_agreement":null},{"id":"W2117667062","doi":"10.5555/982792.982854","title":"Minimizing the stabbing number of matchings, trees, and triangulations","year":2004,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Rounding; Iterated function; Combinatorics; Line segment; Spanning tree; Linear programming relaxation; Mathematics; Relaxation (psychology); Minimum spanning tree; Discrete geometry; Set (abstract data type); Computational geometry; Computer science; Mathematical optimization; Algorithm; Linear programming; Geometry","score_opus":0.015011632453877271,"score_gpt":0.26075708692988137,"score_spread":0.2457454544760041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117667062","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.23868135,0.000053894488,0.7572468,0.0017823786,0.000068503934,0.000053665433,5.0093786e-7,0.000024437832,0.0020884539],"genre_scores_gemma":[0.8762074,0.0000041823378,0.12343286,0.00014072964,0.00002667938,0.0000020164964,0.0000013574164,0.0000014836552,0.00018327103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995934,0.000019364144,0.00011871399,0.00009816469,0.00010965622,0.000060718776],"domain_scores_gemma":[0.99969774,0.00008977596,0.000041360763,0.00011457448,0.000036382356,0.000020174699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017147536,0.00003966989,0.000049940238,0.000031946984,0.00010790452,0.000052889434,0.00011940215,0.000013188729,0.00001203604],"category_scores_gemma":[0.00002118209,0.000027521744,0.000019509816,0.00023341257,0.00001666895,0.00021452401,0.000056184832,0.000029797766,0.0000043575405],"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.0000020693699,0.000024965238,0.0004334582,0.0000037729474,0.000009373439,6.1433315e-7,0.001407538,0.017302733,0.0014069553,0.9515152,0.00010288385,0.027790422],"study_design_scores_gemma":[0.003888544,0.00012277314,0.12859102,0.00009020354,0.000041238407,0.00022685851,0.0009225096,0.24165264,0.029518418,0.5851009,0.00921902,0.000625897],"about_ca_topic_score_codex":0.000048933056,"about_ca_topic_score_gemma":0.000022185603,"teacher_disagreement_score":0.6375261,"about_ca_system_score_codex":0.0000086110385,"about_ca_system_score_gemma":0.000036568985,"threshold_uncertainty_score":0.11223042},"labels":[],"label_agreement":null},{"id":"W2117711754","doi":"","title":"Some properties of higher order delaunay and gabriel graphs","year":2010,"lang":"en","type":"article","venue":"RECERCAT (Consorci de Serveis Universitaris de Catalunya)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematics; Delaunay triangulation; 1-planar graph; Adjacency list; Discrete mathematics; Chordal graph; Graph","score_opus":0.012086581141640811,"score_gpt":0.20675415228644725,"score_spread":0.19466757114480643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117711754","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.9867894,0.0008322329,0.009473055,0.0015285303,0.00035832194,0.00015574283,0.000009368455,0.00009717626,0.00075617194],"genre_scores_gemma":[0.97708124,0.00014936697,0.020927098,0.00028593506,0.00006666631,0.000003356164,0.000015905192,0.000011215354,0.0014592307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889916,0.00007475752,0.00018650248,0.0003563084,0.00019758752,0.00028567802],"domain_scores_gemma":[0.99900323,0.00007092981,0.00010007141,0.00038867586,0.00026135246,0.00017573821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028984508,0.00016290061,0.00018506529,0.0003557683,0.00017959713,0.00007853387,0.0005082197,0.00015189667,0.00004125797],"category_scores_gemma":[0.00004976337,0.00016672467,0.00006810762,0.0007644498,0.00015136234,0.0008877487,0.00024245873,0.00025221292,0.000012125975],"study_design_candidate":"bench_or_experimental","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.00010268252,0.00027894537,0.014370023,0.00021178114,0.00023107154,0.000049503906,0.0034089193,0.0015976771,0.40724388,0.5512137,0.0033543408,0.017937487],"study_design_scores_gemma":[0.004581485,0.00063633587,0.16111648,0.000224803,0.00032084913,0.0005688378,0.00087863975,0.08841338,0.5940855,0.06409792,0.08265907,0.002416677],"about_ca_topic_score_codex":0.00030467333,"about_ca_topic_score_gemma":0.00008857304,"teacher_disagreement_score":0.48711577,"about_ca_system_score_codex":0.000062651015,"about_ca_system_score_gemma":0.00027649538,"threshold_uncertainty_score":0.6798835},"labels":[],"label_agreement":null},{"id":"W2117878581","doi":"10.1142/s0218195911003755","title":"SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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":"Mathematics; Shortest path problem; Path (computing); Terrain; Euclidean shortest path; Algorithm; Sequence (biology); Combinatorics; Time complexity; Approximation algorithm; Point (geometry); Yen's algorithm; K shortest path routing; Computer science; Dijkstra's algorithm; Geometry; Graph; Geography","score_opus":0.03376333864733476,"score_gpt":0.30093062877473153,"score_spread":0.26716729012739676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117878581","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.0053721797,0.0002930684,0.99078697,0.00035085002,0.0009484643,0.0002791975,0.00003873691,0.00010035556,0.0018301489],"genre_scores_gemma":[0.5214405,0.000041302792,0.4770291,0.00036822926,0.000910929,0.000048251844,0.00008929828,0.000016901504,0.000055521163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967146,0.000113938404,0.0010306636,0.00043279893,0.0014305754,0.0002774573],"domain_scores_gemma":[0.99577665,0.00022285151,0.00076262496,0.0003322806,0.00258941,0.00031618713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008186674,0.00025925454,0.00029588118,0.0012684676,0.00021444343,0.00032375404,0.0022522581,0.00010023517,0.00017258998],"category_scores_gemma":[0.00006136204,0.0002630469,0.00023455052,0.0012103315,0.000083969375,0.0020568408,0.00022809679,0.00031779305,0.00007293133],"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.000029281382,0.0009361305,0.0005928818,0.000006784271,0.0002738692,0.000058040096,0.00054333004,0.02695192,0.00022584634,0.09627012,0.00031561655,0.87379616],"study_design_scores_gemma":[0.0029354803,0.0011129522,0.07365651,0.00012482255,0.00015017159,0.0036813745,0.00041157845,0.3154905,0.004873507,0.5117546,0.08427734,0.0015311872],"about_ca_topic_score_codex":0.000015356862,"about_ca_topic_score_gemma":0.0000017536512,"teacher_disagreement_score":0.872265,"about_ca_system_score_codex":0.00020364049,"about_ca_system_score_gemma":0.00050565094,"threshold_uncertainty_score":0.9999822},"labels":[],"label_agreement":null},{"id":"W2117946485","doi":"10.1109/pacrim.1993.407230","title":"Disjunctive constraint satisfaction over reals","year":2002,"lang":"en","type":"article","venue":"","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":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Constraint (computer-aided design); Constraint satisfaction; Computer science; Theoretical computer science; Discrete mathematics; Combinatorics; Mathematics; Algorithm; Mathematical optimization; Artificial intelligence; Geometry","score_opus":0.022169955211932404,"score_gpt":0.2375867106721217,"score_spread":0.2154167554601893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117946485","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.033689212,0.000036845853,0.9301453,0.00076096895,0.0003354661,0.00007503993,0.0000010169948,0.00012129331,0.03483482],"genre_scores_gemma":[0.97642344,0.000010201189,0.021314517,0.00047375468,0.00006877346,0.0000052182845,0.0000017572879,0.0000018608823,0.0017005008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944144,0.000026125148,0.000101943006,0.00017908141,0.00015689635,0.00009451102],"domain_scores_gemma":[0.9996757,0.000058543275,0.00003133338,0.00014143453,0.000047744048,0.00004522744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007618386,0.000057109813,0.00005274621,0.000064666376,0.00007424958,0.000074854084,0.00008822637,0.000024016108,0.00070093526],"category_scores_gemma":[0.000020183246,0.00005032035,0.000028494096,0.00023562786,0.000016384629,0.00039150126,0.000035217592,0.000041501542,0.00019878981],"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.0000013057462,0.00003711633,0.0011767863,0.000002225591,0.0000135867485,0.0000036899828,0.00027262187,0.0014188917,0.0014158922,0.5183921,0.0141648045,0.463101],"study_design_scores_gemma":[0.0005733939,0.00012526431,0.18916799,0.000007678955,0.0000060451603,0.00005042741,0.000033229877,0.7654655,0.003419511,0.026709368,0.01412336,0.00031821118],"about_ca_topic_score_codex":0.000024156787,"about_ca_topic_score_gemma":0.000014008491,"teacher_disagreement_score":0.9427342,"about_ca_system_score_codex":0.000027847249,"about_ca_system_score_gemma":0.000009129408,"threshold_uncertainty_score":0.76747495},"labels":[],"label_agreement":null},{"id":"W2118695911","doi":"10.1142/s0218195910003256","title":"FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"","keywords":"Polygon (computer graphics); Boundary (topology); Simple polygon; Combinatorics; Point (geometry); Mathematics; Line (geometry); Line segment; Polygon covering; Computer science; Algorithm; Computer graphics (images); Geometry; Monotone polygon; Mathematical analysis; Computer network","score_opus":0.02494821649383296,"score_gpt":0.3166541974319437,"score_spread":0.29170598093811073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118695911","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.017502833,0.00021710308,0.9733778,0.0055201007,0.0014981753,0.00039316557,0.00004298424,0.000090251495,0.0013575413],"genre_scores_gemma":[0.75094485,0.000038229664,0.24620011,0.00091587467,0.0012355535,0.000101983205,0.00014134479,0.000020692456,0.00040133088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965104,0.00007928624,0.0008894038,0.00043275586,0.0017570587,0.00033110636],"domain_scores_gemma":[0.9952563,0.0007881506,0.00077832956,0.00039775894,0.0024805493,0.00029892684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009981269,0.00025353278,0.00027759033,0.0014804949,0.0002896524,0.0005824328,0.0022858097,0.00012988481,0.00018866925],"category_scores_gemma":[0.00013548414,0.0002601271,0.00026581308,0.0012254649,0.00009523835,0.0010896066,0.00031397567,0.0006694642,0.00016864714],"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.00004987245,0.00095786515,0.0021924956,0.000027676695,0.00062019704,0.000043171593,0.000385585,0.22287768,0.0045874263,0.4980982,0.0040646433,0.2660952],"study_design_scores_gemma":[0.0019570151,0.00017714576,0.019268705,0.000053334647,0.00007384573,0.0018700474,0.000107206855,0.09606741,0.0034820382,0.25087875,0.62532324,0.000741265],"about_ca_topic_score_codex":0.000010007009,"about_ca_topic_score_gemma":0.000013024644,"teacher_disagreement_score":0.733442,"about_ca_system_score_codex":0.00014813303,"about_ca_system_score_gemma":0.0006091708,"threshold_uncertainty_score":0.9999851},"labels":[],"label_agreement":null},{"id":"W2118893502","doi":"10.5555/1109557.1109583","title":"Morphing orthogonal planar graph drawings","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"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":"Planarity testing; Morphing; Planar graph; Vertex (graph theory); Computer science; Orthogonality; Combinatorics; Graph drawing; Planar; Graph; Book embedding; Mathematics; Pathwidth; Line graph; Computer graphics (images); Geometry","score_opus":0.007873912044065968,"score_gpt":0.22653860830052655,"score_spread":0.2186646962564606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118893502","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.033010878,0.00017692095,0.9472009,0.0052603437,0.0010795526,0.00022436686,0.000022065262,0.00035653348,0.012668434],"genre_scores_gemma":[0.9271852,0.00001966173,0.068678096,0.0010203967,0.0010117838,0.0000377575,0.00017575211,0.000026259078,0.0018451147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818087,0.0000620996,0.00029948895,0.000548703,0.0005581369,0.0003506806],"domain_scores_gemma":[0.9992398,0.000092713555,0.00010637019,0.00037645694,0.000082077015,0.00010258718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025758616,0.00021546423,0.00016498957,0.00026897664,0.00029715596,0.00028137834,0.0004664357,0.00007207669,0.000016100328],"category_scores_gemma":[0.0000086051305,0.0002009615,0.00012837141,0.0006386934,0.000041213185,0.0005463452,0.00008319847,0.00015925146,0.00010571344],"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.000032542,0.00024449496,0.00064422697,0.000026142445,0.000063504915,0.00013986744,0.00035200245,0.082168035,0.028593048,0.85703415,0.012039942,0.018662067],"study_design_scores_gemma":[0.0024572352,0.000877694,0.025834003,0.00012887195,0.00005050722,0.00024236829,0.000043035263,0.6394483,0.034435563,0.2542249,0.040237296,0.0020202145],"about_ca_topic_score_codex":0.00006555924,"about_ca_topic_score_gemma":0.000008189165,"teacher_disagreement_score":0.8941743,"about_ca_system_score_codex":0.00004391307,"about_ca_system_score_gemma":0.00006142048,"threshold_uncertainty_score":0.8194972},"labels":[],"label_agreement":null},{"id":"W2119288811","doi":"","title":"The Gaussian Centre of a Set of Mobile Points","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Facility location problem; Position (finance); Bounded function; Euclidean geometry; Set (abstract data type); Computer science; Motion (physics); Function (biology); Gaussian; Mathematical optimization; Mathematics; Mathematical analysis; Geometry; Physics; Artificial intelligence","score_opus":0.020640345941570753,"score_gpt":0.2478583186047206,"score_spread":0.22721797266314986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119288811","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.29895145,0.00089426,0.6392156,0.008360851,0.0022533874,0.0012872216,0.00034199844,0.00010382983,0.048591394],"genre_scores_gemma":[0.98952097,0.000010716667,0.009826106,0.000249532,0.000027139273,0.000009041025,0.00003482627,0.0000063642383,0.0003152904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984448,0.00014529379,0.00039383688,0.0002843043,0.0004461848,0.0002855779],"domain_scores_gemma":[0.99819064,0.00047643727,0.00020141847,0.00032305528,0.0005560413,0.00025240897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046051605,0.00014086008,0.00018318853,0.0004495346,0.00021578933,0.000081506696,0.000536982,0.00006154785,0.00012785246],"category_scores_gemma":[0.00020335834,0.00012159835,0.00007888855,0.0011153088,0.000106327265,0.00014462542,0.0000315239,0.00011999079,0.00004001723],"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.0000043933164,0.000026323667,0.00039322278,0.000012613158,0.000027777427,0.0000036917768,0.00022717405,0.03636972,0.00004134596,0.94116926,0.001096662,0.020627802],"study_design_scores_gemma":[0.0022451517,0.0009005574,0.03154525,0.00025045508,0.000035599944,0.00009280329,0.0012456101,0.430076,0.007912974,0.4187211,0.10576747,0.0012070093],"about_ca_topic_score_codex":0.00057656295,"about_ca_topic_score_gemma":0.00172359,"teacher_disagreement_score":0.6905695,"about_ca_system_score_codex":0.000081709986,"about_ca_system_score_gemma":0.0015737327,"threshold_uncertainty_score":0.49586368},"labels":[],"label_agreement":null},{"id":"W2120092636","doi":"10.1142/s0218195900000103","title":"An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Combinatorics; Simple polygon; Mathematics; Link (geometry); Polygon (computer graphics); Vertex (graph theory); Upper and lower bounds; Algorithm; Geometry; Graph; Regular polygon; Computer science; Mathematical analysis","score_opus":0.015412377064069742,"score_gpt":0.30347923727356124,"score_spread":0.2880668602094915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120092636","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.005697797,0.00031333865,0.99011564,0.001908957,0.00073526474,0.00063429325,0.00013916343,0.000084854575,0.00037071516],"genre_scores_gemma":[0.38168132,0.0000745657,0.61323327,0.0009641313,0.0030752458,0.00020341542,0.00045987673,0.000026706943,0.0002814774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662197,0.000085430576,0.0011065019,0.0004967264,0.001299436,0.0003899186],"domain_scores_gemma":[0.9966684,0.0005383056,0.00055851927,0.00030784094,0.0015858556,0.0003410863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066875725,0.00027823017,0.00032055963,0.0008510668,0.00031852745,0.00051525974,0.0018158483,0.00011346768,0.00019673033],"category_scores_gemma":[0.000032262196,0.000291539,0.00031131756,0.00092301675,0.00006656872,0.0013681084,0.00007947272,0.00027293531,0.000047750676],"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.000027484213,0.00036721866,0.0001470879,0.0000047631643,0.00015920405,0.0000082193865,0.00010968759,0.29575217,0.00012997794,0.015536645,0.0004283725,0.6873292],"study_design_scores_gemma":[0.0020665887,0.00049064145,0.007516161,0.00005166194,0.000065740656,0.00060766574,0.00006327273,0.72830546,0.0006213527,0.06931314,0.19034402,0.0005542826],"about_ca_topic_score_codex":0.0000062899067,"about_ca_topic_score_gemma":0.0000021590695,"teacher_disagreement_score":0.68677485,"about_ca_system_score_codex":0.0002932269,"about_ca_system_score_gemma":0.00047702208,"threshold_uncertainty_score":0.9999537},"labels":[],"label_agreement":null},{"id":"W2122213873","doi":"10.1109/sfcs.2000.892109","title":"On levels in arrangements of curves","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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":"Combinatorics; Pairwise comparison; Mathematics; Upper and lower bounds; Mathematical proof; Planar; Polynomial; Planar graph; Degree (music); Simple (philosophy); Parametric statistics; Discrete mathematics; Geometry; Computer science; Physics; Graph; Mathematical analysis; Computer graphics (images)","score_opus":0.057346798081464895,"score_gpt":0.25999557518700567,"score_spread":0.20264877710554077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122213873","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.14624904,0.0003693318,0.7970469,0.002130567,0.00024962265,0.00013958191,0.0000012725152,0.000039781266,0.053773906],"genre_scores_gemma":[0.99095184,0.000014710965,0.007229593,0.00066758046,0.000007471606,0.000002063252,4.999979e-7,7.36253e-7,0.0011255175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996463,0.000015347878,0.00008661408,0.000083887186,0.000120074656,0.00004778616],"domain_scores_gemma":[0.99981916,0.000038072925,0.000018959476,0.00009220976,0.000019759269,0.000011821409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077487784,0.000027111197,0.00004027447,0.0000791252,0.000008815151,0.0000065748977,0.0001231986,0.000007742624,0.00019443755],"category_scores_gemma":[0.000018062521,0.00002417053,0.000011567829,0.00026351213,0.000003830639,0.00011118911,0.000021061824,0.000018164392,0.000042528092],"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.0000031668949,0.0006731352,0.0014802393,0.00008134287,0.000014854477,0.0000069534326,0.00068976794,0.018439034,0.0033250074,0.6462364,0.04243695,0.28661314],"study_design_scores_gemma":[0.0013721032,0.00037071988,0.12624303,0.00025203472,0.0000027489602,0.0000041431335,0.000010493474,0.79247093,0.035281338,0.039416905,0.0042470386,0.00032853955],"about_ca_topic_score_codex":0.0000031285995,"about_ca_topic_score_gemma":0.0000032828611,"teacher_disagreement_score":0.8447028,"about_ca_system_score_codex":0.0000059280355,"about_ca_system_score_gemma":0.0000032391154,"threshold_uncertainty_score":0.21289548},"labels":[],"label_agreement":null},{"id":"W2123276592","doi":"10.1016/s0020-0190(00)00011-9","title":"Estimating the number of vertices of a polyhedron","year":2000,"lang":"en","type":"article","venue":"Information Processing Letters","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polyhedron; Combinatorics; Computer science; Mathematics","score_opus":0.0074845664320263615,"score_gpt":0.24575505388399693,"score_spread":0.23827048745197058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123276592","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.474016,0.000014793046,0.5230353,0.001457881,0.00006278142,0.000043844448,5.996724e-7,0.000024303585,0.0013445092],"genre_scores_gemma":[0.93118584,5.7579143e-7,0.06758845,0.0011794746,0.000022281676,0.0000037079533,0.000004039219,0.0000012070783,0.000014430867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933296,0.00001781832,0.0002969931,0.00004917562,0.00022962195,0.00007340858],"domain_scores_gemma":[0.9995599,0.000039528204,0.00019245717,0.00011334693,0.00008130215,0.000013487613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019363583,0.000048434566,0.00006094139,0.000049829818,0.00008835898,0.000080417674,0.00024941764,0.00001483114,0.000031393774],"category_scores_gemma":[0.000024606798,0.000036353773,0.000023651557,0.00036083287,0.00003520602,0.0019672054,0.000020153304,0.0000400157,0.00002213235],"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.0000072115126,0.00001345745,0.00034244504,0.000105313105,0.0000066947355,1.10883875e-7,0.0048775245,0.1535928,0.0012664825,0.0015154157,0.00031088776,0.8379617],"study_design_scores_gemma":[0.00019017227,0.00001128384,0.0037220682,0.000065174725,0.0000054057914,0.00001493424,0.000032954264,0.9876356,0.0062639005,0.0006307103,0.0013497939,0.00007800935],"about_ca_topic_score_codex":0.000010349453,"about_ca_topic_score_gemma":1.4224835e-7,"teacher_disagreement_score":0.83788365,"about_ca_system_score_codex":0.000008737405,"about_ca_system_score_gemma":0.00004212471,"threshold_uncertainty_score":0.14824638},"labels":[],"label_agreement":null},{"id":"W2123306533","doi":"10.1016/j.jda.2005.06.008","title":"Area-preserving approximations of polygonal paths","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"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; Path (computing); Integer (computer science); Monotone polygon; Measure (data warehouse); Approximation algorithm; Discrete mathematics; Geometry; Computer science","score_opus":0.017485411038258868,"score_gpt":0.2625111394373805,"score_spread":0.24502572839912165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123306533","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.025060834,0.000657947,0.9702742,0.0026423675,0.00029379097,0.000054001965,0.000006890961,0.0000125297665,0.0009974156],"genre_scores_gemma":[0.5978697,0.00003125035,0.40143454,0.000094958596,0.0004029104,0.0000012390681,0.0000034943303,0.0000043531722,0.00015755792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986985,0.000050114835,0.0005165281,0.00011106771,0.0004903998,0.00013340634],"domain_scores_gemma":[0.9988335,0.00010332052,0.00043030683,0.00018657467,0.00035177573,0.00009455056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000440003,0.00008791926,0.00017559186,0.00023665465,0.000072112045,0.00006575753,0.00049718306,0.00003591558,0.00004106899],"category_scores_gemma":[0.00008388569,0.00007326716,0.0001364875,0.00040422333,0.00002344919,0.0009967756,0.00011342547,0.00013334294,0.000004718062],"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.000049087994,0.0006072563,0.00063668884,0.000066834196,0.000295009,0.00003786093,0.003161539,0.19355506,0.019497337,0.07010032,0.010143337,0.7018497],"study_design_scores_gemma":[0.00077257026,0.0002716444,0.004768104,0.000076488555,0.000026798374,0.00024882102,0.00008932695,0.96227956,0.0113055715,0.013688792,0.0062792613,0.00019303735],"about_ca_topic_score_codex":0.0000034126588,"about_ca_topic_score_gemma":0.0000019489098,"teacher_disagreement_score":0.7687245,"about_ca_system_score_codex":0.000033171076,"about_ca_system_score_gemma":0.00013102335,"threshold_uncertainty_score":0.2987748},"labels":[],"label_agreement":null},{"id":"W2123411109","doi":"","title":"Flipping your lid","year":2001,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; Carleton University","funders":"","keywords":"Combinatorics; Convex polygon; Regular polygon; Polygon (computer graphics); Midpoint; Sequence (biology); Mathematics; Star-shaped polygon; Polygon covering; Computer science; Convex set; Geometry; Convex optimization; Chemistry; Telecommunications","score_opus":0.05257903836359342,"score_gpt":0.2725959820000142,"score_spread":0.2200169436364208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123411109","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.05987838,0.00012411195,0.88836455,0.00903123,0.0011048174,0.00024719565,0.000024794293,0.00021474827,0.041010167],"genre_scores_gemma":[0.97301656,0.00001579616,0.021117827,0.00401552,0.00026192816,0.000016758453,0.00010897043,0.0000129398595,0.0014337056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800986,0.000068582376,0.00031313358,0.000573574,0.0005302487,0.00050457654],"domain_scores_gemma":[0.9983116,0.00017337417,0.000095563104,0.0003499309,0.00045981436,0.0006097439],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027482572,0.0002283165,0.00018905236,0.0011836834,0.0004047387,0.00042072457,0.00074619986,0.00010230696,0.00043746352],"category_scores_gemma":[0.000112942966,0.0002559578,0.00008400615,0.0017488815,0.00004519584,0.00049465516,0.00007041647,0.00022960744,0.00083028484],"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.000007691465,0.000053467273,0.00079047476,0.000007410442,0.000033446395,0.00011783661,0.00019132569,0.17944227,0.000053872347,0.6909651,0.004236508,0.12410056],"study_design_scores_gemma":[0.0006414246,0.00018747909,0.03248713,0.000057135454,0.000007620786,0.00021736568,0.00006319782,0.8069023,0.00008170695,0.08310499,0.07553272,0.00071693433],"about_ca_topic_score_codex":0.0014337914,"about_ca_topic_score_gemma":0.0020360283,"teacher_disagreement_score":0.91313815,"about_ca_system_score_codex":0.00025001372,"about_ca_system_score_gemma":0.0013424894,"threshold_uncertainty_score":0.9999893},"labels":[],"label_agreement":null},{"id":"W2123672008","doi":"10.1142/s0218195909003143","title":"ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Delaunay triangulation; Line graph; Discrete mathematics; Complement graph; Graph; Voltage graph","score_opus":0.00971004641262518,"score_gpt":0.2639447868047667,"score_spread":0.2542347403921415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123672008","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.16540433,0.0011325302,0.8295215,0.0027263158,0.00042323643,0.0002676406,0.0000148190675,0.000034324137,0.00047535717],"genre_scores_gemma":[0.9520374,0.000052091487,0.046841577,0.00076517544,0.000205032,0.000014457104,0.000019058705,0.000007430125,0.00005777308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780196,0.00006827474,0.00071454316,0.00026078225,0.0010051803,0.00014924069],"domain_scores_gemma":[0.99685794,0.00027611887,0.00058745744,0.00017940842,0.0019835199,0.000115577604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031069055,0.00018207387,0.00023787458,0.001000865,0.00012392488,0.00014769183,0.0008372809,0.00006299474,0.000033003766],"category_scores_gemma":[0.000059848226,0.00015531623,0.00013495074,0.0010332107,0.00013462134,0.0005265574,0.000074429445,0.00019937949,0.0000068039717],"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.00006245219,0.00016476109,0.00013367308,0.000010602151,0.00012340624,0.000003960906,0.00010672079,0.09486916,0.001022067,0.84935486,0.00017778837,0.053970575],"study_design_scores_gemma":[0.0009140193,0.00034169215,0.017649695,0.000066279244,0.00002889804,0.00022206672,0.000018120254,0.012579195,0.0018617876,0.9640172,0.0020693876,0.00023164073],"about_ca_topic_score_codex":0.0000018135835,"about_ca_topic_score_gemma":2.7181207e-7,"teacher_disagreement_score":0.7866331,"about_ca_system_score_codex":0.000049411745,"about_ca_system_score_gemma":0.00015225647,"threshold_uncertainty_score":0.6333612},"labels":[],"label_agreement":null},{"id":"W2123788968","doi":"","title":"Computing the Straight Skeleton of a Monotone Polygon in O(nlogn) Time","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Monotone polygon; Simple polygon; Polygon (computer graphics); Combinatorics; Polygon covering; Skeleton (computer programming); Computational geometry; Simple (philosophy); Rectilinear polygon; Time complexity; Mathematics; Computer science; Algorithm; Geometry","score_opus":0.011715641864569531,"score_gpt":0.23644737920830203,"score_spread":0.2247317373437325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123788968","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.6586443,0.00004464078,0.32321915,0.0067014913,0.0013145291,0.00047783705,0.000051859497,0.000070286704,0.009475894],"genre_scores_gemma":[0.97517,0.0000011748544,0.023505077,0.00084550015,0.00017665901,0.000007701116,0.00006285392,0.00000975732,0.00022124857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981499,0.000099629935,0.00044226408,0.00044748982,0.00046604953,0.00039469486],"domain_scores_gemma":[0.99835855,0.00048759277,0.00016954257,0.0003790183,0.00034260334,0.00026268588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005895751,0.00020197274,0.0002332093,0.000989935,0.00020626963,0.00015912051,0.0009081899,0.00011944842,0.00026204603],"category_scores_gemma":[0.0001454658,0.00018204996,0.00007506486,0.0016078927,0.000117763884,0.00023852575,0.00008419851,0.0004671751,0.00012472148],"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.000010687481,0.00009936976,0.00071650854,0.000014616098,0.000026503814,0.00002185698,0.00042534227,0.25392455,0.0016043107,0.6727569,0.0011243974,0.06927494],"study_design_scores_gemma":[0.0003695483,0.00008873798,0.0476775,0.000030759402,0.0000034075388,0.000026318949,0.000019096045,0.9275584,0.00038247093,0.02215887,0.00144699,0.00023788546],"about_ca_topic_score_codex":0.0025212858,"about_ca_topic_score_gemma":0.0072327163,"teacher_disagreement_score":0.6736339,"about_ca_system_score_codex":0.00008836465,"about_ca_system_score_gemma":0.0013680403,"threshold_uncertainty_score":0.7423782},"labels":[],"label_agreement":null},{"id":"W2124026121","doi":"10.1109/ipps.1997.580919","title":"Coarse grained parallel next element search","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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":"Computer science; Element (criminal law); Parallel computing","score_opus":0.06382471902284206,"score_gpt":0.2642887798201955,"score_spread":0.20046406079735343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124026121","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.007124231,0.00009769053,0.97624314,0.0037532484,0.00015830444,0.000105580315,3.3538694e-7,0.00011142619,0.012406045],"genre_scores_gemma":[0.77374727,0.000029052404,0.21334337,0.0012720445,0.00009817267,0.00001142547,0.000005403154,0.000003213726,0.011490069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991951,0.000049489907,0.00012428148,0.00020364781,0.00026158788,0.00016589407],"domain_scores_gemma":[0.9995804,0.000053229494,0.00001660239,0.00021016152,0.00006749212,0.000072142204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020145622,0.00006324563,0.000056231842,0.00008267564,0.00012110615,0.00013975809,0.0002812751,0.000018666797,0.00064849836],"category_scores_gemma":[0.000012971174,0.000056079345,0.000032519525,0.0003460987,0.000010751064,0.0003333156,0.00009959846,0.000060362447,0.0005543643],"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.0000031910952,0.00021102949,0.000088454806,0.0000071237673,0.000019038127,0.000014526661,0.00086416985,0.028692849,0.0012487891,0.52839994,0.055613447,0.38483742],"study_design_scores_gemma":[0.00025411986,0.000058966332,0.0003003187,0.0000013737704,9.804253e-7,0.000006998485,0.000016905287,0.9690241,0.00063256855,0.0018482974,0.027766015,0.000089316454],"about_ca_topic_score_codex":0.000009128706,"about_ca_topic_score_gemma":0.0000048188517,"teacher_disagreement_score":0.9403313,"about_ca_system_score_codex":0.000018985238,"about_ca_system_score_gemma":0.000013834147,"threshold_uncertainty_score":0.7125416},"labels":[],"label_agreement":null},{"id":"W2124036531","doi":"10.5555/1281991.1282027","title":"Delaunay mesh construction","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Delaunay triangulation; Polygon mesh; Ruppert's algorithm; Chew's second algorithm; Constrained Delaunay triangulation; Mesh generation; Computer science; Bowyer–Watson algorithm; Enhanced Data Rates for GSM Evolution; Correctness; Algorithm; Decimation; T-vertices; Feature (linguistics); Topology (electrical circuits); Mathematics; Computer graphics (images); Artificial intelligence; Combinatorics; Finite element method; Computer vision","score_opus":0.009806913710809016,"score_gpt":0.24228229931077438,"score_spread":0.23247538559996536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124036531","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.021608338,0.000018550214,0.95059425,0.0002910922,0.00047918383,0.000034638026,9.11909e-8,0.00011812226,0.026855715],"genre_scores_gemma":[0.65811795,0.0000016096814,0.34079325,0.0003339146,0.000082715065,6.831676e-7,0.0000018346316,0.0000011666862,0.0006668756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995363,0.000008514987,0.000101835336,0.0001264343,0.00012801887,0.000098925724],"domain_scores_gemma":[0.9997077,0.000048197955,0.00002251384,0.00011306574,0.00006371653,0.000044801363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027081824,0.00003855137,0.00003363883,0.00008706163,0.00006451215,0.000045954974,0.0001283255,0.00002158961,0.000043141907],"category_scores_gemma":[0.000013999629,0.000035374167,0.000019759615,0.00032009828,0.000011918434,0.00026280506,0.000035356297,0.0000310422,0.00007751797],"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.0000012081756,0.000008507744,0.00018584024,6.866723e-7,0.00000253402,0.0000020527007,0.000036299913,0.0001776269,0.0013721068,0.76756,0.00075023336,0.22990288],"study_design_scores_gemma":[0.0012752906,0.00024854223,0.050703116,0.000012095224,0.000011234088,0.0006076164,0.00015820189,0.27389255,0.30303526,0.20037581,0.16885008,0.0008301906],"about_ca_topic_score_codex":0.000003761866,"about_ca_topic_score_gemma":0.0000069671296,"teacher_disagreement_score":0.6365096,"about_ca_system_score_codex":0.000014833333,"about_ca_system_score_gemma":0.00002289681,"threshold_uncertainty_score":0.14425166},"labels":[],"label_agreement":null},{"id":"W2124089227","doi":"","title":"An Algorithm for the MaxMin Area Triangulation of a Convex Polygon","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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 Saskatchewan","funders":"","keywords":"Minimum-weight triangulation; Polygon (computer graphics); Convex polygon; Triangulation; Point set triangulation; Mathematics; Pitteway triangulation; Star-shaped polygon; Polygon covering; Combinatorics; Regular polygon; Diagonal; Rectilinear polygon; Algorithm; Computer science; Delaunay triangulation; Simple polygon; Convex optimization; Convex set; Bowyer–Watson algorithm; Geometry","score_opus":0.0404761246826628,"score_gpt":0.27205617256618186,"score_spread":0.23158004788351907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124089227","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.006880086,0.00011736659,0.9898056,0.0010768074,0.00055263535,0.00046983815,0.000101803824,0.000034562752,0.00096130103],"genre_scores_gemma":[0.9013334,0.000003934347,0.09735283,0.00083442597,0.00007874179,0.000047760255,0.00015022737,0.0000101919395,0.00018849604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844176,0.00011575376,0.000348642,0.00040067453,0.00039126092,0.00030188533],"domain_scores_gemma":[0.99783605,0.0007032011,0.00016607555,0.00035953344,0.0006536739,0.00028146605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005936774,0.00017611762,0.00020194637,0.00061214814,0.00031937798,0.000179039,0.00053576037,0.00009006261,0.00012778767],"category_scores_gemma":[0.00017023271,0.00015695453,0.000091668015,0.0009803033,0.00006879411,0.0003114344,0.000013650359,0.000113708025,0.0000166037],"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.00000766123,0.000059214562,0.0000828111,0.0000075583716,0.000036805875,0.0000022777458,0.00016014739,0.10689141,0.00009384393,0.64739287,0.00068505516,0.24458036],"study_design_scores_gemma":[0.00059149927,0.00022672476,0.004506867,0.00001370184,0.00001156353,0.0000143297575,0.00007591993,0.9496232,0.0006027039,0.03983604,0.0042892573,0.00020817749],"about_ca_topic_score_codex":0.00070524466,"about_ca_topic_score_gemma":0.0008431614,"teacher_disagreement_score":0.8944533,"about_ca_system_score_codex":0.00011436918,"about_ca_system_score_gemma":0.0014576237,"threshold_uncertainty_score":0.640042},"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":"W2124205318","doi":"10.1142/s0218195902000979","title":"DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"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 British Columbia; McGill University; Carleton University","funders":"","keywords":"Minimum-weight triangulation; Mathematics; Combinatorics; Triangulation; Point set triangulation; Graph; Time complexity; Pitteway triangulation; Constant (computer programming); Point (geometry); Set (abstract data type); Discrete mathematics; Delaunay triangulation; Bowyer–Watson algorithm; Geometry; Computer science","score_opus":0.022254890056135224,"score_gpt":0.27384084145362225,"score_spread":0.251585951397487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124205318","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.010468474,0.0010515086,0.9783695,0.0067633837,0.0011904666,0.00036132435,0.00006230118,0.00007630142,0.0016567382],"genre_scores_gemma":[0.87096155,0.00013811942,0.12446858,0.0009959921,0.0022021797,0.0001026774,0.00007654758,0.000025178297,0.0010291758],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960637,0.000112758804,0.001218904,0.00046095936,0.001853028,0.00029065073],"domain_scores_gemma":[0.99458677,0.0007309276,0.00128105,0.00035555786,0.002774476,0.00027124136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005322635,0.0002882752,0.00036552656,0.0014975055,0.0002704974,0.0004380356,0.0018323589,0.0001252692,0.00035474848],"category_scores_gemma":[0.00014994833,0.00029428606,0.00033562566,0.0016816617,0.00009772001,0.001378666,0.00021754288,0.000341305,0.00034893342],"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.00010927337,0.002599548,0.001741511,0.000038048656,0.00086662924,0.0001247844,0.0006904147,0.28935605,0.000735695,0.19763432,0.01634227,0.48976144],"study_design_scores_gemma":[0.0046968297,0.0003852043,0.014229264,0.00012740628,0.00013136232,0.0014298721,0.00013782423,0.3313995,0.0013756043,0.094135664,0.5508798,0.0010716895],"about_ca_topic_score_codex":0.0000027187143,"about_ca_topic_score_gemma":0.0000014155753,"teacher_disagreement_score":0.86049306,"about_ca_system_score_codex":0.0002146029,"about_ca_system_score_gemma":0.00015747808,"threshold_uncertainty_score":0.99995095},"labels":[],"label_agreement":null},{"id":"W2124671353","doi":"10.1109/isvd.2010.25","title":"Smooth Morphing Delaunay Triangulation","year":2010,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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 Calgary","funders":"","keywords":"Delaunay triangulation; Morphing; Vertex (graph theory); Computer science; Merge (version control); Quadrilateral; Constrained Delaunay triangulation; Diagonal; Algorithm; Computer graphics; Computer graphics (images); Mathematics; Theoretical computer science; Geometry; Physics; Graph","score_opus":0.01164636638545062,"score_gpt":0.2424807821594851,"score_spread":0.2308344157740345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124671353","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.13764659,0.000007159543,0.85476696,0.0008069252,0.00066995394,0.0000517009,1.65371e-7,0.000121338926,0.0059291846],"genre_scores_gemma":[0.82416964,4.1521338e-7,0.17458495,0.00027307292,0.00015122545,0.0000031624327,0.000004433534,0.0000020269617,0.00081110286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949336,0.000014277808,0.00010451348,0.00015617261,0.00014407885,0.00008762619],"domain_scores_gemma":[0.99962324,0.000054059543,0.000030695348,0.00018701155,0.000060208713,0.000044763226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021353833,0.000048434744,0.000042610034,0.00008848872,0.00008879077,0.000116598974,0.00020122284,0.000032029213,0.00009570135],"category_scores_gemma":[0.000045613495,0.00004340499,0.000026688354,0.00028076378,0.000006986833,0.00044724697,0.00004667082,0.000079513666,0.0000800138],"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.0000017337428,0.0000255685,0.00022690014,0.0000014308812,0.0000031226741,0.0000018043826,0.00012622273,0.0028548306,0.061168987,0.66035074,0.0011748001,0.27406386],"study_design_scores_gemma":[0.00039070257,0.000031287014,0.021846414,0.0000018807375,0.0000027115036,0.000019379588,0.0000050332324,0.87312895,0.024781177,0.038830772,0.040772885,0.00018883539],"about_ca_topic_score_codex":0.000009711114,"about_ca_topic_score_gemma":0.000019999356,"teacher_disagreement_score":0.87027407,"about_ca_system_score_codex":0.0000058516252,"about_ca_system_score_gemma":0.00003323333,"threshold_uncertainty_score":0.17700042},"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":"W2125293312","doi":"10.1007/s00453-014-9893-5","title":"Space–Time Trade-offs for Stack-Based Algorithms","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"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; Simple polygon; Algorithm; Polygon covering; Binary logarithm; Polygon (computer graphics); Stack (abstract data type); Amortized analysis; Theory of computation; Computational geometry; Mathematics; Bounded function; Time complexity; Regular polygon; Workspace; Rectilinear polygon; Combinatorics; Computer science; Simple (philosophy); Data structure; Frame (networking); Geometry","score_opus":0.01165814548503848,"score_gpt":0.23956512267524782,"score_spread":0.22790697719020933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125293312","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.0007269135,0.00004441128,0.99251556,0.0050467723,0.00052130246,0.00029305808,0.000015431951,0.00022033876,0.0006162366],"genre_scores_gemma":[0.102448985,0.0000015701315,0.893834,0.0016412173,0.0008409346,0.00008312511,0.00010529761,0.000023486355,0.00102139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986207,0.000072291754,0.00022884975,0.00045867602,0.00030002827,0.0003194394],"domain_scores_gemma":[0.99889404,0.0003879297,0.00008725482,0.00040072124,0.0000958274,0.00013423247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000424101,0.00016931827,0.00018667616,0.00014949568,0.000200439,0.0001434147,0.00050216215,0.00007650051,0.000023794268],"category_scores_gemma":[0.00008349966,0.00016820391,0.000121532255,0.00040682935,0.000032078657,0.00027312877,0.000057196947,0.000085254585,0.00011421789],"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.000016811451,0.0001913336,0.00001060595,0.000027928523,0.000039500417,0.0000033149145,0.00014166183,0.010247126,0.0032899466,0.061450776,0.021055438,0.90352553],"study_design_scores_gemma":[0.00064139534,0.00020438404,0.00018303939,0.0000067911283,0.000008199713,0.0000052730775,0.000001662585,0.868778,0.012648791,0.0070990063,0.11021408,0.00020937271],"about_ca_topic_score_codex":0.000004022007,"about_ca_topic_score_gemma":7.8005945e-7,"teacher_disagreement_score":0.9033162,"about_ca_system_score_codex":0.000039512423,"about_ca_system_score_gemma":0.00010795483,"threshold_uncertainty_score":0.6859157},"labels":[],"label_agreement":null},{"id":"W2125573420","doi":"","title":"On computing shortest external watchman routes for convex polygons","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Regular polygon; Computer science; Mathematics; Geometry","score_opus":0.02155396410099874,"score_gpt":0.25277989988577937,"score_spread":0.23122593578478062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125573420","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.07275045,0.00006825514,0.91620153,0.003478936,0.00091548666,0.00045051056,0.00013306197,0.0001524002,0.0058493796],"genre_scores_gemma":[0.9530348,0.0000012064804,0.042538766,0.0028154212,0.00046946757,0.000029383187,0.00037916435,0.000022274788,0.00070949853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974416,0.000070588074,0.0004796998,0.00077685335,0.0005772406,0.0006540083],"domain_scores_gemma":[0.99755144,0.00093197584,0.00016783278,0.00034871374,0.00055917824,0.00044083747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035302868,0.00033595305,0.0002961833,0.001046043,0.0006199897,0.0005586678,0.0007577485,0.00012872726,0.0001029538],"category_scores_gemma":[0.00011554814,0.0003675369,0.00014696096,0.0009019921,0.000076759476,0.00030126615,0.000059991224,0.00024081627,0.00017077324],"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.000010156618,0.00006912819,0.00035557093,0.0000079659285,0.000015989795,0.00001446416,0.000038731847,0.2500888,0.00006484371,0.7285526,0.0049693813,0.015812399],"study_design_scores_gemma":[0.0007126758,0.0003077857,0.024940914,0.00007368933,0.00000903261,0.000030700652,0.000017578901,0.7858545,0.00026388175,0.18417922,0.003097672,0.0005123344],"about_ca_topic_score_codex":0.0030240198,"about_ca_topic_score_gemma":0.0030678741,"teacher_disagreement_score":0.88028437,"about_ca_system_score_codex":0.00030397132,"about_ca_system_score_gemma":0.0011245816,"threshold_uncertainty_score":0.99987763},"labels":[],"label_agreement":null},{"id":"W2126525546","doi":"10.1142/s0218195903001189","title":"COLLISION DETECTION OPTIMIZATION IN A MULTI-PARTICLE SYSTEM","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"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; Research Services, University of Calgary; University of Calgary","keywords":"Voronoi diagram; Collision detection; Collision; Particle system; Event (particle physics); Computer science; Discrete event simulation; Mathematical optimization; Particle (ecology); Algorithm; Mathematics; Simulation; Geometry; Physics; Computer graphics (images)","score_opus":0.015992117870421124,"score_gpt":0.28245956038806685,"score_spread":0.26646744251764576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126525546","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.012173834,0.00035716637,0.98567516,0.0002896909,0.000708731,0.00037943452,0.000007786021,0.000060625916,0.00034757712],"genre_scores_gemma":[0.7355604,0.000023324546,0.26402518,0.00010654126,0.00014460542,0.000070271446,0.0000172823,0.000010627558,0.000041744028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973079,0.00018561221,0.0010003371,0.00032267728,0.0009754759,0.00020801526],"domain_scores_gemma":[0.9969533,0.00033988841,0.0006352124,0.00020332963,0.0017285965,0.00013966252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009392909,0.00017794991,0.00023298642,0.0010352123,0.00014403005,0.00024886086,0.0007804553,0.00008935982,0.000023820206],"category_scores_gemma":[0.00014806031,0.00018781825,0.00014323369,0.0018805361,0.000038495065,0.0010223339,0.00007507049,0.00022387762,0.000037698686],"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.00002017604,0.00030884755,0.00041444047,0.000010552802,0.00004877853,0.000013265584,0.00007332927,0.91338843,0.00035513754,0.07065,0.000024673596,0.014692387],"study_design_scores_gemma":[0.0023300224,0.000115180104,0.0035058402,0.00006259397,0.000019622094,0.0006755287,0.00015815174,0.97103715,0.004674583,0.007024027,0.010094869,0.00030245192],"about_ca_topic_score_codex":0.0000067147394,"about_ca_topic_score_gemma":0.000004928685,"teacher_disagreement_score":0.7233866,"about_ca_system_score_codex":0.00043633181,"about_ca_system_score_gemma":0.00029743765,"threshold_uncertainty_score":0.7659006},"labels":[],"label_agreement":null},{"id":"W2126656617","doi":"10.5555/1281957.1281989","title":"Nonobtuse remeshing and mesh decimation","year":2006,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Decimation; Polygon mesh; Quadric; Computer science; Mathematical optimization; Set (abstract data type); Mesh generation; Algorithm; T-vertices; Mathematics; Finite element method; Computer graphics (images); Engineering; Combinatorics","score_opus":0.006864309174317014,"score_gpt":0.20673270561016885,"score_spread":0.19986839643585183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126656617","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.068945594,0.00006471632,0.9191686,0.0006908708,0.00009721109,0.000042974298,1.5183379e-7,0.000085932166,0.010903953],"genre_scores_gemma":[0.8230983,0.0000038886124,0.1758464,0.00019907918,0.00007216368,0.0000023933808,0.000004928547,0.0000015757728,0.0007712515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955845,0.000015042421,0.00010178548,0.00014251581,0.000110340385,0.00007189527],"domain_scores_gemma":[0.99976516,0.00004476846,0.00002589518,0.000099693316,0.000042976597,0.000021485197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001378385,0.00004292565,0.000040490475,0.00006887004,0.00008014701,0.00015440893,0.00009054152,0.000017262642,0.0000097447155],"category_scores_gemma":[0.0000130897915,0.000039689523,0.000011421612,0.00018653502,0.0000064965125,0.0005094457,0.00004998158,0.00002330682,0.00001751849],"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.0000012384414,0.00002364203,0.00066178426,0.000004124915,0.0000025266704,0.0000018739895,0.00007462829,0.0026291413,0.0033849382,0.926024,0.007525746,0.05966635],"study_design_scores_gemma":[0.00035281567,0.000034369004,0.043829396,0.0000070362285,0.0000032823177,0.00003178542,0.00000894328,0.8367351,0.010612964,0.09430691,0.013879468,0.00019792675],"about_ca_topic_score_codex":0.000028646647,"about_ca_topic_score_gemma":0.000021047219,"teacher_disagreement_score":0.83410597,"about_ca_system_score_codex":0.000010276499,"about_ca_system_score_gemma":0.000014693173,"threshold_uncertainty_score":0.16184919},"labels":[],"label_agreement":null},{"id":"W2126873594","doi":"10.1142/s0218195910003335","title":"A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Conjecture; Set (abstract data type); Cover (algebra); Pairwise comparison; Upper and lower bounds; Plane (geometry); Fraction (chemistry); Unit (ring theory); Discrete mathematics; Computer science; Geometry; Statistics","score_opus":0.015092753927062564,"score_gpt":0.2819490346999965,"score_spread":0.26685628077293394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126873594","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.12794916,0.00008929464,0.862992,0.0060570557,0.0012178967,0.00032265618,0.000031851905,0.000029032239,0.0013110454],"genre_scores_gemma":[0.95938754,0.000013148483,0.038942404,0.0007714452,0.0007022702,0.000057421617,0.000026254984,0.000011767071,0.00008776015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972377,0.00007309918,0.00083410065,0.0002680366,0.001411197,0.00017588436],"domain_scores_gemma":[0.99482214,0.0014590193,0.0009200592,0.00035012423,0.0023309481,0.000117683034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087098056,0.00018260111,0.00022980552,0.00072756654,0.00020198578,0.00025123745,0.0018201512,0.000079985664,0.00013426592],"category_scores_gemma":[0.00025817624,0.00014217518,0.0002586056,0.0010798987,0.00014051264,0.00046637713,0.00016807769,0.00048200574,0.000035933295],"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.00008831159,0.0008656054,0.0006985562,0.00001005504,0.0003719245,0.000014660685,0.00022642473,0.11579457,0.004971652,0.7951728,0.0021925655,0.07959283],"study_design_scores_gemma":[0.0023337193,0.00062994636,0.04263743,0.0001370938,0.00009323173,0.00090275117,0.000131223,0.09515892,0.0072530797,0.65699905,0.19298787,0.00073570677],"about_ca_topic_score_codex":0.0000031684567,"about_ca_topic_score_gemma":0.0000036021834,"teacher_disagreement_score":0.83143836,"about_ca_system_score_codex":0.00006648305,"about_ca_system_score_gemma":0.00037004577,"threshold_uncertainty_score":0.57977355},"labels":[],"label_agreement":null},{"id":"W2127083985","doi":"10.1142/s0218195907002343","title":"MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT","year":2007,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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; McGill University","funders":"","keywords":"Mathematics; Amortized analysis; Combinatorics; Visibility; Binary logarithm; Set (abstract data type); Point (geometry); Planar; Plane (geometry); Time complexity; Preprocessor; Data structure; Discrete mathematics; Algorithm; Computer science; Geometry; Artificial intelligence","score_opus":0.008923220077508166,"score_gpt":0.2787615474502688,"score_spread":0.26983832737276064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127083985","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.021393657,0.00016521505,0.97532624,0.001396384,0.00028006168,0.00035111065,0.000028984472,0.000042690706,0.001015646],"genre_scores_gemma":[0.688761,0.000017244227,0.3103425,0.0005264037,0.00024127342,0.000016396445,0.00007942839,0.000007707419,0.000008048957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964325,0.00006490127,0.0014423829,0.00024169103,0.0015818389,0.00023670425],"domain_scores_gemma":[0.99380946,0.00077286956,0.0014686394,0.00026039733,0.0035100428,0.00017861553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019812537,0.00020359705,0.0003011132,0.0014273493,0.00013438227,0.00017501035,0.0011175094,0.00007681733,0.000034106994],"category_scores_gemma":[0.000133803,0.00018726046,0.00017141351,0.0012999364,0.0000919328,0.0019764176,0.00013314269,0.00028324613,0.000021704309],"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.00028993873,0.0004917555,0.0020883316,0.00004812859,0.00043617215,0.000026822972,0.0007568149,0.30656654,0.00045840183,0.37772545,0.0003012247,0.31081042],"study_design_scores_gemma":[0.0077138874,0.0017763004,0.16851011,0.0005556212,0.00015514517,0.0042224377,0.001548482,0.12097452,0.008103108,0.58018714,0.10460231,0.0016509276],"about_ca_topic_score_codex":0.000009482679,"about_ca_topic_score_gemma":0.0000039946067,"teacher_disagreement_score":0.66736734,"about_ca_system_score_codex":0.00024043002,"about_ca_system_score_gemma":0.00044675116,"threshold_uncertainty_score":0.763626},"labels":[],"label_agreement":null},{"id":"W2127235804","doi":"","title":"A Space-Efficient Algorithm for Segment Intersection","year":2003,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"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":"Intersection (aeronautics); Line segment; Space (punctuation); Algorithm; Binary logarithm; Line (geometry); Combinatorics; Computer science; Mathematics; Geometry","score_opus":0.014619036063025071,"score_gpt":0.2487439899668432,"score_spread":0.23412495390381813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127235804","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.0020700002,0.000024257299,0.99303454,0.0002555484,0.0007914778,0.00019019663,6.745432e-7,0.00007266113,0.0035606213],"genre_scores_gemma":[0.21869446,0.0000010342152,0.7789941,0.00023721714,0.00005723067,0.00004133071,0.0000035573107,0.000002965701,0.00196812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947166,0.000022407154,0.00009317022,0.00018826482,0.00011401564,0.00011047214],"domain_scores_gemma":[0.99969965,0.000040897234,0.000025741214,0.00011481258,0.000079098085,0.000039810195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002055595,0.000055421562,0.000046821682,0.00008168607,0.000084404026,0.00006657476,0.00008958863,0.000018461003,0.000022282446],"category_scores_gemma":[0.00001963101,0.0000500766,0.00004116613,0.00022949805,0.0000051226307,0.00008640382,0.000020512376,0.000022358256,0.000022581673],"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.0000015604926,0.000121187804,0.0000044701837,0.00000420273,0.000011914941,6.965483e-7,0.00023956705,0.030130992,0.0011895417,0.62487805,0.003063484,0.34035435],"study_design_scores_gemma":[0.00025087246,0.00008289115,0.00003694388,0.0000021739836,0.0000018329343,0.000011163279,0.00003014271,0.9454387,0.024751022,0.0031029496,0.026213596,0.00007772802],"about_ca_topic_score_codex":0.0000023717353,"about_ca_topic_score_gemma":0.0000014295197,"teacher_disagreement_score":0.9153077,"about_ca_system_score_codex":0.000047626738,"about_ca_system_score_gemma":0.00003974087,"threshold_uncertainty_score":0.20420645},"labels":[],"label_agreement":null},{"id":"W2127481651","doi":"10.1007/978-88-7642-475-5_91","title":"A combinatorial approach to colourful simplicial depth","year":2013,"lang":"en","type":"book-chapter","venue":"Scuola Normale Superiore eBooks","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":"McMaster University","funders":"","keywords":"Art; Computer science; Mathematics","score_opus":0.018000544610441996,"score_gpt":0.21906356878807276,"score_spread":0.20106302417763078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127481651","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014921179,0.000092700386,0.07760137,0.00010596598,0.00265301,0.0012159676,0.000025840125,0.00028526672,0.91652775],"genre_scores_gemma":[0.17601693,0.0000111257705,0.057333045,0.0025253163,0.0051631583,0.0004078072,0.00031087262,0.00022015594,0.7580116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99702334,0.000051673,0.0005881138,0.0009773613,0.0008116271,0.0005478531],"domain_scores_gemma":[0.99808896,0.00007951776,0.0001624446,0.0008492496,0.00039676498,0.00042306146],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028714127,0.00058899936,0.00057854445,0.00044226355,0.0003542152,0.00051956065,0.0013085947,0.00047753274,0.00013281258],"category_scores_gemma":[0.000029075865,0.00060398737,0.000281583,0.00011044266,0.000089865265,0.0003145288,0.0007166934,0.00054077763,0.0011380487],"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.00002098679,0.000037601214,0.0000054813986,0.000038922964,0.00006195193,0.00001386247,0.0007728337,0.00025918038,0.00018879074,0.93949115,0.0049572643,0.054152],"study_design_scores_gemma":[0.001175431,0.0005984146,0.00022090324,0.00009689715,0.00006337649,0.00014647364,0.00002486252,0.0068353284,0.0006568159,0.072969794,0.91544425,0.0017674181],"about_ca_topic_score_codex":0.00003347701,"about_ca_topic_score_gemma":0.000020441805,"teacher_disagreement_score":0.910487,"about_ca_system_score_codex":0.00015499767,"about_ca_system_score_gemma":0.00049056817,"threshold_uncertainty_score":0.9996411},"labels":[],"label_agreement":null},{"id":"W2127508981","doi":"","title":"Hausdorff Core of a One Reflex Vertex Polygon","year":2010,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Polygon covering; Hausdorff distance; Rectilinear polygon; Polygon (computer graphics); Convex polygon; Regular polygon; Simple polygon; Vertex (graph theory); Geometry; Computer science; Mathematical analysis; Graph","score_opus":0.03168699849454913,"score_gpt":0.2771142197961057,"score_spread":0.24542722130155653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127508981","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.44555306,0.000023150164,0.53625095,0.00086906657,0.00071904075,0.0000841029,0.0000011108033,0.00008699633,0.016412491],"genre_scores_gemma":[0.90394384,0.0000015626329,0.0943714,0.00023207006,0.000053,0.000002134721,0.00000394754,0.0000020960024,0.0013899596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994396,0.000008747751,0.00013160793,0.00015144434,0.00018039664,0.000088192726],"domain_scores_gemma":[0.99949896,0.00005107552,0.000044463246,0.00025937968,0.00009936,0.000046757417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014088578,0.000049879323,0.000073964206,0.000083455096,0.000039276296,0.000026220434,0.00027682798,0.000036061698,0.00012348554],"category_scores_gemma":[0.000036598154,0.00004574926,0.00003021323,0.0003021977,0.000019761788,0.00018624913,0.00007994348,0.00007648154,0.00004601188],"study_design_candidate":"bench_or_experimental","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.000004989907,0.00008187951,0.00012558715,0.0000057064203,0.00000766511,9.3696434e-7,0.00010858545,0.00015008288,0.29057872,0.61612046,0.0014850688,0.0913303],"study_design_scores_gemma":[0.0009920466,0.00034006106,0.043122433,0.000018073293,0.000011618065,0.00003642775,0.000016436825,0.3864834,0.47380272,0.0749067,0.019881152,0.00038893442],"about_ca_topic_score_codex":0.000023595696,"about_ca_topic_score_gemma":0.000033873104,"teacher_disagreement_score":0.54121375,"about_ca_system_score_codex":0.000004407818,"about_ca_system_score_gemma":0.00005488536,"threshold_uncertainty_score":0.18656008},"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":"W2127945324","doi":"10.1016/j.jda.2009.05.001","title":"Approximation algorithms for shortest descending paths in terrains","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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":"Carleton University; University of Waterloo","funders":"","keywords":"Shortest path problem; K shortest path routing; Yen's algorithm; Terrain; Algorithm; Path (computing); Computer science; Constrained Shortest Path First; Shortest Path Faster Algorithm; Generalization; Euclidean shortest path; Approximation algorithm; Point (geometry); Mathematical optimization; Mathematics; Dijkstra's algorithm; Geometry; Theoretical computer science","score_opus":0.03003635432018853,"score_gpt":0.3028809910076843,"score_spread":0.27284463668749576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127945324","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.009773082,0.00027812598,0.9870496,0.0019474026,0.0005469098,0.00020722329,0.000005112663,0.000021713973,0.00017087885],"genre_scores_gemma":[0.5746015,0.0000306696,0.42463553,0.00020683401,0.00046048468,0.0000049632727,0.0000111213,0.0000060875846,0.000042853782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849296,0.000054641983,0.0006128204,0.00020601599,0.00038687035,0.0002466715],"domain_scores_gemma":[0.9990505,0.000112692374,0.00034694903,0.00015593869,0.00022619312,0.00010770904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086233276,0.0001394525,0.0002462534,0.0004276933,0.00009460871,0.00017101437,0.00040840486,0.00006294846,0.0000029808016],"category_scores_gemma":[0.00011714475,0.00012256345,0.00014558203,0.0005537171,0.000015235843,0.0011500359,0.000032306307,0.00017065449,0.000001688045],"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.00003387981,0.00025741084,0.00020099836,0.000015842017,0.00003157972,0.000046568763,0.0013385059,0.016834967,0.0045431857,0.013964322,0.00080694957,0.9619258],"study_design_scores_gemma":[0.0013122257,0.00082978903,0.0105521,0.00009486664,0.000015589774,0.0001873154,0.00010007921,0.94827896,0.0029766697,0.03430701,0.0010943467,0.0002510413],"about_ca_topic_score_codex":0.0000021216274,"about_ca_topic_score_gemma":0.0000021843402,"teacher_disagreement_score":0.96167475,"about_ca_system_score_codex":0.00010574735,"about_ca_system_score_gemma":0.00011429639,"threshold_uncertainty_score":0.4997992},"labels":[],"label_agreement":null},{"id":"W2129252388","doi":"10.1007/978-3-642-00219-9_5","title":"Crossing and Weighted Crossing Number of Near-Planar Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Crossing number (knot theory); Planar graph; Planar; Combinatorics; Book embedding; Graph; Computer science; Mathematics; Discrete mathematics; 1-planar graph; Line graph","score_opus":0.013661287680244159,"score_gpt":0.2622508273205566,"score_spread":0.24858953964031244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129252388","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.007929626,0.0005457341,0.9887831,0.00026600083,0.00068603514,0.00017729476,0.0000039753595,0.00007453922,0.0015337018],"genre_scores_gemma":[0.286534,0.000017656821,0.7122207,0.000826817,0.00018948456,0.0000014983501,0.0000074443146,0.000016341126,0.00018601716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724805,0.000030567902,0.00053403294,0.0010264721,0.00075708464,0.00040380054],"domain_scores_gemma":[0.99834734,0.0003008234,0.00032881435,0.0005968257,0.0002919644,0.00013425032],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006243209,0.00036604976,0.0004308327,0.00048155547,0.0007659027,0.0020366625,0.0010361623,0.00022861345,0.00001178122],"category_scores_gemma":[0.00004103551,0.00035062875,0.000095424046,0.0008038353,0.0013980311,0.00067636656,0.00032981674,0.00041813348,0.000008302642],"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.0000065949266,0.000022976457,0.0002111955,0.000034462937,0.000008773004,0.000033143475,0.0009295182,0.009887417,0.00061284436,0.03005323,0.000009603402,0.95819026],"study_design_scores_gemma":[0.0003266176,0.00010861949,0.0018754012,0.00037230522,0.000009263101,0.00021221738,1.0323297e-7,0.5207849,0.0023441054,0.47136888,0.0020523984,0.00054518034],"about_ca_topic_score_codex":0.000021892767,"about_ca_topic_score_gemma":0.000018237426,"teacher_disagreement_score":0.95764506,"about_ca_system_score_codex":0.00008573458,"about_ca_system_score_gemma":0.0007503911,"threshold_uncertainty_score":0.99989456},"labels":[],"label_agreement":null},{"id":"W2129446687","doi":"","title":"Optimal Polygon Placement","year":2006,"lang":"en","type":"article","venue":"","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 Manitoba; Carleton University","funders":"","keywords":"Simple polygon; Combinatorics; Polygon (computer graphics); Mathematics; Set (abstract data type); Algorithm; Polygon covering; Plane (geometry); Annulus (botany); Time complexity; Space (punctuation); Computer science; Monotone polygon; Geometry","score_opus":0.008290254393005757,"score_gpt":0.22369495071385823,"score_spread":0.21540469632085246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129446687","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.046157576,0.000035459103,0.92986834,0.00064580824,0.00015715827,0.000037141748,2.0039298e-7,0.00008798234,0.023010321],"genre_scores_gemma":[0.7853022,5.6885114e-7,0.20797756,0.00023263323,0.0001167184,0.0000036789056,0.0000062501967,0.0000013660025,0.006359005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995766,0.000009407899,0.000078373545,0.00012348664,0.00012704857,0.000085054526],"domain_scores_gemma":[0.99981844,0.00001618573,0.000015330404,0.00010426955,0.000026348816,0.00001944657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068776106,0.000039220165,0.00003031659,0.000049346807,0.000051110437,0.000067941975,0.00013522616,0.000011948221,0.00005531362],"category_scores_gemma":[0.0000020556513,0.00003512757,0.000017502733,0.00016982426,0.000004288565,0.00016633893,0.000050129984,0.000018608001,0.00009815461],"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.0000022890395,0.000064959335,0.000102692095,0.0000015097147,0.0000030436693,0.000002947643,0.000026916685,0.25440505,0.0031188063,0.7091125,0.020575874,0.0125834],"study_design_scores_gemma":[0.0004151541,0.00009396075,0.0071005365,0.0000024292372,0.000002135547,0.00001832172,0.000008435213,0.8801198,0.04482299,0.005956179,0.061254077,0.00020596909],"about_ca_topic_score_codex":0.000021295215,"about_ca_topic_score_gemma":0.0000039611486,"teacher_disagreement_score":0.7391446,"about_ca_system_score_codex":0.000013716392,"about_ca_system_score_gemma":0.000020879908,"threshold_uncertainty_score":0.14324607},"labels":[],"label_agreement":null},{"id":"W2129707404","doi":"10.1016/s0166-218x(00)00180-3","title":"Ray shooting from convex ranges","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":"Mathematics; Combinatorics; Homothetic transformation; Regular polygon; Comparability; Convex set; Plane (geometry); Graph; Discrete mathematics; Convex optimization; Geometry","score_opus":0.018066393488328152,"score_gpt":0.2419161445472571,"score_spread":0.22384975105892896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129707404","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.056245085,0.00007709563,0.9255312,0.00036854963,0.00014216352,0.000164054,0.000003390934,0.00017279634,0.01729568],"genre_scores_gemma":[0.619618,0.000017017865,0.37967208,0.00027493248,0.0001550907,0.000023705254,0.00003075782,0.000010566413,0.00019784698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989804,0.000011393662,0.00025436134,0.0002714952,0.0002878866,0.0001944765],"domain_scores_gemma":[0.9991834,0.00021899294,0.00011091849,0.00037078717,0.000042686177,0.000073172014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001911272,0.00013759568,0.0001808504,0.00006797305,0.00012246298,0.00015616906,0.00042039115,0.000050026018,0.00006913005],"category_scores_gemma":[0.000028924827,0.00012448976,0.00004910507,0.00031036139,0.000022526689,0.00016766241,0.00013814292,0.00008227312,0.00019077961],"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.000010218158,0.00014211684,0.000057132504,0.0000483164,0.00006916644,0.0000167569,0.0044259517,0.0049028466,0.03593591,0.88935584,0.0014610164,0.06357473],"study_design_scores_gemma":[0.0010709285,0.000038286264,0.0007199203,0.00005334557,0.00003985286,0.000018686507,0.00056479714,0.63230497,0.020972027,0.3298693,0.013679152,0.0006687535],"about_ca_topic_score_codex":0.000004217024,"about_ca_topic_score_gemma":0.000002239325,"teacher_disagreement_score":0.6274021,"about_ca_system_score_codex":0.00001823583,"about_ca_system_score_gemma":0.000025960642,"threshold_uncertainty_score":0.5076545},"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":"W2131997976","doi":"10.1002/nme.1437","title":"Measuring the conformity of non-simplicial elements to an anisotropic metric field","year":2005,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Measure (data warehouse); Mathematics; Hexahedron; Metric (unit); Quadrilateral; Conformity; Field (mathematics); Mathematical analysis; Dimension (graph theory); Geometry; Finite element method; Pure mathematics; Computer science; Data mining; Engineering; Structural engineering","score_opus":0.03861093739679666,"score_gpt":0.39437657849771635,"score_spread":0.3557656411009197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131997976","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.01758127,0.000032723183,0.9796081,0.001092488,0.0015032564,0.00012128424,0.0000014468544,0.000014204316,0.000045195433],"genre_scores_gemma":[0.37009418,0.0000038131222,0.62925637,0.0002510293,0.00037088842,0.000010494047,6.719079e-7,0.000004116957,0.0000084407575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889016,0.000051563504,0.0004244867,0.0001365644,0.0003355408,0.00016167712],"domain_scores_gemma":[0.9989674,0.0004971155,0.00010785451,0.00011413614,0.0002311179,0.000082387494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001047512,0.000086917775,0.00013045293,0.00037368562,0.000053968266,0.00009591246,0.0007998709,0.000031222397,0.00000819273],"category_scores_gemma":[0.00076820306,0.00007155103,0.00007719035,0.00045757345,0.0000039712654,0.000392101,0.00010896006,0.00016530279,0.0000014145262],"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.000017855995,0.000042951626,0.00021506271,0.0000034227319,0.000029764004,0.0000012024624,0.00019290588,0.41248962,0.0069269114,0.0048934873,0.000043529824,0.5751433],"study_design_scores_gemma":[0.00036777474,0.00017035355,0.004773069,0.000020451045,0.000004287519,0.000039771596,0.000012787578,0.9524257,0.030393537,0.0011513467,0.010529856,0.000111036316],"about_ca_topic_score_codex":0.000008118547,"about_ca_topic_score_gemma":0.0000019765207,"teacher_disagreement_score":0.57503223,"about_ca_system_score_codex":0.00011418039,"about_ca_system_score_gemma":0.000039025246,"threshold_uncertainty_score":0.29177666},"labels":[],"label_agreement":null},{"id":"W2132190651","doi":"10.1007/978-3-642-54423-1_14","title":"Drawing HV-Restricted Planar Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba","funders":"","keywords":"Planar graph; Book embedding; Combinatorics; Planar straight-line graph; Outerplanar graph; Embedding; Graph drawing; Vertex (graph theory); Pathwidth; Planar; Graph; 1-planar graph; Mathematics; Graph embedding; Computer science; Discrete mathematics; Line graph; Artificial intelligence; Computer graphics (images)","score_opus":0.014444525577706322,"score_gpt":0.23467275329984832,"score_spread":0.220228227722142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132190651","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.00016496965,0.00032095937,0.9926606,0.00074318703,0.002364864,0.00027521045,0.0000035094415,0.00022051812,0.003246197],"genre_scores_gemma":[0.30040547,0.0000581244,0.69349957,0.0034957114,0.0012707487,0.000014186721,0.000046729765,0.000052197105,0.0011572497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623543,0.00004878816,0.0005363439,0.0014573183,0.0011382508,0.0005838407],"domain_scores_gemma":[0.99757016,0.00058358203,0.00028580517,0.0010678489,0.00028873028,0.00020390475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006422015,0.00048620996,0.00045207227,0.001514197,0.00037660712,0.0006526958,0.0025815393,0.0002925733,0.00001819145],"category_scores_gemma":[0.00011511825,0.00047074404,0.00014748517,0.0012238354,0.00034723818,0.000468869,0.0005845112,0.0006514697,0.000080711216],"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.000004261085,0.000017872339,0.000031001724,0.000024872343,0.000012774054,0.000055779357,0.00025502735,0.10195756,0.00031496907,0.19075169,0.00013105934,0.70644313],"study_design_scores_gemma":[0.00028999068,0.00017131476,0.000377444,0.00019977486,0.000008598309,0.00008292346,4.6526985e-8,0.6203088,0.0008751455,0.36939064,0.00757212,0.00072317413],"about_ca_topic_score_codex":0.00001529522,"about_ca_topic_score_gemma":0.000031898027,"teacher_disagreement_score":0.70571995,"about_ca_system_score_codex":0.00018391642,"about_ca_system_score_gemma":0.00051937014,"threshold_uncertainty_score":0.9997744},"labels":[],"label_agreement":null},{"id":"W2132941873","doi":"10.1109/asap.1993.397147","title":"Time-optimal visibility-related algorithms on meshes with multiple broadcasting","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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 Ottawa","funders":"","keywords":"Visibility; Broadcasting (networking); Algorithm; Computer science; Disjoint sets; Plane (geometry); Polygon mesh; Line (geometry); Mathematics; Combinatorics; Computer network; Computer graphics (images); Geometry","score_opus":0.016592152356915857,"score_gpt":0.21690653239718502,"score_spread":0.20031438004026916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132941873","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.22120063,0.0000619109,0.76345885,0.00081744796,0.0001655482,0.00021552989,0.000001490598,0.00039848368,0.013680089],"genre_scores_gemma":[0.80922025,0.0000018707194,0.18424721,0.0002725328,0.000061141356,0.0000071233635,0.000006608807,0.000007674089,0.006175576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988183,0.00004135659,0.00019184017,0.0004127112,0.00030651613,0.0002292945],"domain_scores_gemma":[0.9992821,0.00020092743,0.00005642605,0.00028519167,0.00009392207,0.00008140764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020868819,0.00013067789,0.00011264505,0.00011186198,0.00018400051,0.00011840773,0.0002600251,0.000043207983,0.00032114398],"category_scores_gemma":[0.00005032849,0.00010168894,0.00003909514,0.0005619339,0.000031927666,0.00038273755,0.000078278186,0.000107532745,0.0006059933],"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.000022652046,0.00054936047,0.0007373089,0.0000103813245,0.00007332316,0.00004054381,0.00168572,0.5371285,0.001345453,0.00976067,0.004371412,0.44427463],"study_design_scores_gemma":[0.00043541196,0.00026487847,0.001319022,0.0000109777275,0.0000029709065,0.00002705349,0.000010266632,0.99448895,0.0021299613,0.00013186873,0.0010220275,0.000156627],"about_ca_topic_score_codex":0.0000069954463,"about_ca_topic_score_gemma":0.0000019796644,"teacher_disagreement_score":0.5880196,"about_ca_system_score_codex":0.000029870542,"about_ca_system_score_gemma":0.000015514257,"threshold_uncertainty_score":0.77890205},"labels":[],"label_agreement":null},{"id":"W2132963119","doi":"10.5539/apr.v5n1p78","title":"Development of Software for Making Contour Plot Using Matlab to Be Used for Teaching Purpose","year":2013,"lang":"en","type":"article","venue":"Applied Physics Research","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universitas Pendidikan Indonesia","keywords":"Plot (graphics); Contour line; Computer science; Software; MATLAB; Work (physics); Engineering drawing; Computer graphics (images); Artificial intelligence; Statistics; Mathematics; Programming language; Mechanical engineering; Cartography","score_opus":0.1836084677638924,"score_gpt":0.4112609130004095,"score_spread":0.22765244523651712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132963119","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.18586338,0.0000049231953,0.8123893,0.00013828879,0.000048155212,0.0014297382,0.0000043679383,0.000031100513,0.00009071014],"genre_scores_gemma":[0.46293756,6.484858e-8,0.53639627,0.00007625996,0.000090775226,0.00042908883,0.000012747437,0.000009920266,0.000047279227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985086,0.000035202927,0.00024026085,0.00032368244,0.0005282408,0.00036403083],"domain_scores_gemma":[0.99843425,0.0005949481,0.000063551845,0.00023976857,0.00059162057,0.00007583764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010108805,0.00009785062,0.000151864,0.00015019948,0.00044692014,0.0001804977,0.00047439034,0.000035632052,0.0000027974875],"category_scores_gemma":[0.00009457974,0.00010001147,0.000036990878,0.00046786052,0.000022817967,0.00021609412,0.00028432359,0.000117847194,0.000010587449],"study_design_candidate":"bench_or_experimental","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.000026529144,0.00013691351,0.000011306254,0.00014054598,0.00003541501,1.3181972e-7,0.0060706316,0.015933355,0.33338714,0.28015086,0.0010910197,0.36301616],"study_design_scores_gemma":[0.0014328648,0.00016669347,0.0002284738,0.00009266471,0.000008038921,0.0000010258713,0.0007108739,0.5313663,0.35940316,0.08268782,0.023394324,0.00050777115],"about_ca_topic_score_codex":0.000011384807,"about_ca_topic_score_gemma":0.000004522593,"teacher_disagreement_score":0.51543295,"about_ca_system_score_codex":0.00009657731,"about_ca_system_score_gemma":0.00030907558,"threshold_uncertainty_score":0.40783495},"labels":[],"label_agreement":null},{"id":"W2133160845","doi":"10.1142/s0218195913600091","title":"THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS","year":2013,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Treewidth; Mathematics; Combinatorics; Planar graph; 1-planar graph; Book embedding; Planar straight-line graph; Pathwidth; Partial k-tree; Chordal graph; Clique-sum; Outerplanar graph; Discrete mathematics; Embedding; Bounded function; Graph; Line graph; Computer science; Mathematical analysis","score_opus":0.01220426644043338,"score_gpt":0.28457366787008476,"score_spread":0.2723694014296514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133160845","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.0045812237,0.00043585416,0.98333746,0.009352705,0.00066174526,0.0010687266,0.000047201862,0.000053641506,0.00046140995],"genre_scores_gemma":[0.65910804,0.000076108074,0.33741015,0.0009846409,0.0009861836,0.0008924846,0.0001795974,0.000021227414,0.00034155723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718815,0.00008958249,0.001042263,0.00032764848,0.0010814643,0.0002708683],"domain_scores_gemma":[0.9925651,0.0020215642,0.0007958208,0.0003029646,0.004140089,0.00017446784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029189,0.00019987782,0.00021920372,0.0005098164,0.00044161384,0.00070259237,0.0019781531,0.000072330164,0.000048661648],"category_scores_gemma":[0.00015634682,0.00015728771,0.00028114693,0.0008364184,0.000118886164,0.0010844548,0.00017454097,0.00022949946,0.00008179721],"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.000055274966,0.00035131763,0.00045276023,0.000023911549,0.00040970024,0.0000024087244,0.00016893737,0.10803629,0.00030200434,0.5698002,0.017364461,0.30303276],"study_design_scores_gemma":[0.0008334097,0.00014717257,0.0047973245,0.000016502223,0.000019996114,0.00022382142,0.00006553746,0.03595935,0.00025620853,0.80187106,0.15558629,0.00022333127],"about_ca_topic_score_codex":0.000008693845,"about_ca_topic_score_gemma":0.0000027996234,"teacher_disagreement_score":0.6545268,"about_ca_system_score_codex":0.00013806617,"about_ca_system_score_gemma":0.00033115377,"threshold_uncertainty_score":0.6775114},"labels":[],"label_agreement":null},{"id":"W2133422013","doi":"","title":"Smallest enclosing circle centered on a query line segment","year":2008,"lang":"en","type":"article","venue":"Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"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":"Combinatorics; Line segment; Line (geometry); Set (abstract data type); Time complexity; Mathematics; Center (category theory); Plane (geometry); Computational geometry; Preprocessor; Computer science; Algorithm; Geometry; Artificial intelligence; Crystallography","score_opus":0.01847114744654815,"score_gpt":0.19933524309998635,"score_spread":0.1808640956534382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133422013","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.51340514,0.0005898571,0.4756174,0.002224824,0.0004980516,0.00039371604,0.00005222738,0.0005583933,0.0066603883],"genre_scores_gemma":[0.96669877,0.0012173107,0.027137019,0.0016799293,0.00042303145,0.000006984979,0.00017753497,0.00004616609,0.0026132318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963497,0.00030802377,0.00044934676,0.0011010846,0.0007122625,0.0010796144],"domain_scores_gemma":[0.99758446,0.00023663057,0.00032046615,0.0008824305,0.0002593684,0.0007166473],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00036084402,0.0005750903,0.00048156822,0.0010263079,0.0022106308,0.00025000982,0.0018480005,0.0004057062,0.00020038903],"category_scores_gemma":[0.00005979591,0.0007466394,0.00040834077,0.0018865578,0.0002825141,0.0017636678,0.00087149534,0.0006118305,0.00022563123],"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.003318228,0.0030486344,0.010155794,0.00032453894,0.00091913616,0.011451836,0.035019185,0.5048229,0.019128468,0.24104534,0.06670267,0.10406327],"study_design_scores_gemma":[0.02698061,0.0019119714,0.12616938,0.0012354434,0.0003923923,0.007547055,0.0075236424,0.5565163,0.029572336,0.004774851,0.23256923,0.0048067947],"about_ca_topic_score_codex":0.00037302688,"about_ca_topic_score_gemma":0.00011594653,"teacher_disagreement_score":0.45329365,"about_ca_system_score_codex":0.0013004519,"about_ca_system_score_gemma":0.001368275,"threshold_uncertainty_score":0.9994985},"labels":[],"label_agreement":null},{"id":"W2133520610","doi":"10.1145/1250790.1250796","title":"Voronoi diagrams in n · 2 <sup>o(√lg lg n)</sup> time","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Voronoi diagram; Combinatorics; Computational geometry; Intersection (aeronautics); Mathematics; Sorting; Integer (computer science); Triangulation; Convex hull; Euclidean geometry; Regular polygon; Plane (geometry); Point (geometry); Discrete geometry; Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.007702465312969854,"score_gpt":0.22976409578845294,"score_spread":0.22206163047548308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133520610","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.15136078,0.00006768378,0.8311924,0.0006761079,0.00012663078,0.00011529961,4.3865865e-7,0.000120899036,0.016339801],"genre_scores_gemma":[0.94072026,0.000004244086,0.05255418,0.00079034886,0.00018563581,0.0000051808697,0.000013459737,0.000005675189,0.005720992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892056,0.000034199584,0.00024041523,0.0002950278,0.00024213408,0.00026766694],"domain_scores_gemma":[0.9994168,0.00015756386,0.000034495577,0.0002460611,0.00005497518,0.00009007291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000660115,0.00010071015,0.00010343935,0.00020424281,0.000059228933,0.00009304921,0.00035442543,0.00005363726,0.00014736278],"category_scores_gemma":[0.00004009278,0.00009411296,0.000041631643,0.00073040737,0.000015817768,0.000410784,0.00011803024,0.000087745146,0.0006499211],"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.000017431215,0.0003339,0.0033771822,0.000011457678,0.000018139734,0.00006529752,0.0013973899,0.08775584,0.001652539,0.20143276,0.008666906,0.69527113],"study_design_scores_gemma":[0.000527679,0.0000926715,0.030994156,0.000009590686,0.0000023623447,0.000020270887,0.00002652721,0.9339228,0.0039324113,0.007211395,0.022966933,0.00029317755],"about_ca_topic_score_codex":0.000038160255,"about_ca_topic_score_gemma":0.00005343655,"teacher_disagreement_score":0.84616697,"about_ca_system_score_codex":0.000051070627,"about_ca_system_score_gemma":0.0000483665,"threshold_uncertainty_score":0.83536375},"labels":[],"label_agreement":null},{"id":"W2133642716","doi":"10.1142/s021819591000344x","title":"CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; General position; Embedding; Planar graph; Discrete mathematics; Parameterized complexity; Disjoint sets; Graph; Computer science","score_opus":0.010859052222396621,"score_gpt":0.28850990657733566,"score_spread":0.277650854354939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133642716","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.059126657,0.00011270199,0.9365734,0.001815221,0.0010127402,0.000299048,0.00010018487,0.000044489105,0.00091558276],"genre_scores_gemma":[0.7693168,0.0000135716655,0.22983672,0.0002625298,0.00040583193,0.000029179515,0.00009127151,0.000009460064,0.000034635552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968781,0.00007884736,0.0012089512,0.0003270594,0.0013112098,0.00019586318],"domain_scores_gemma":[0.9942068,0.0008729023,0.001070728,0.00034131712,0.0033132068,0.00019505396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009845251,0.00020305684,0.00032186744,0.0011259533,0.00012157175,0.0001489343,0.001736088,0.000109564826,0.00013844355],"category_scores_gemma":[0.00020835595,0.00020226724,0.00029532783,0.0011856051,0.00021624952,0.0008077609,0.00013153882,0.00043498038,0.00002885298],"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.00006836258,0.00069749577,0.00223603,0.000029493132,0.00038181854,0.000015226518,0.00023952643,0.041987725,0.007197928,0.8537715,0.001188768,0.09218609],"study_design_scores_gemma":[0.002099591,0.00027055014,0.024913974,0.00004255987,0.000059131653,0.0012656538,0.00010638282,0.026030986,0.004528233,0.89415556,0.046018302,0.00050905097],"about_ca_topic_score_codex":0.0000069784364,"about_ca_topic_score_gemma":0.0000046269374,"teacher_disagreement_score":0.7101902,"about_ca_system_score_codex":0.00005757834,"about_ca_system_score_gemma":0.0005295452,"threshold_uncertainty_score":0.8248219},"labels":[],"label_agreement":null},{"id":"W2134408180","doi":"10.1142/s0218195905001786","title":"MAXIMIZING A VORONOI REGION: THE CONVEX CASE","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"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":"Voronoi diagram; Power diagram; Mathematics; Centroidal Voronoi tessellation; Combinatorics; Plane (geometry); Regular polygon; Weighted Voronoi diagram; Position (finance); Point (geometry); Set (abstract data type); Geometry; Computer science","score_opus":0.01837095015847291,"score_gpt":0.2848444143815391,"score_spread":0.2664734642230662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134408180","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.0056978385,0.0009803745,0.9739338,0.017478637,0.00061150815,0.00032157483,0.000010065376,0.000059057038,0.00090713636],"genre_scores_gemma":[0.8548314,0.000059872924,0.1403846,0.0020385992,0.002328706,0.000075288975,0.00002309104,0.000014202913,0.00024424613],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99728817,0.0001146169,0.0009460881,0.00031189737,0.0011148826,0.0002243253],"domain_scores_gemma":[0.995683,0.0007877494,0.0007982797,0.00033756334,0.0022306542,0.00016271813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007297308,0.00020583585,0.00022767886,0.0005340272,0.00036466485,0.00043291197,0.0017398311,0.000072165516,0.00006270944],"category_scores_gemma":[0.000080501726,0.00016980141,0.00024864884,0.001063002,0.000109711385,0.0011264494,0.00024146435,0.00034712112,0.00010742018],"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.00002567895,0.00026433068,0.00013860333,0.0000066831485,0.00025218693,0.0002491964,0.00029733105,0.3530383,0.000046375615,0.21297643,0.0037622093,0.42894268],"study_design_scores_gemma":[0.0014742058,0.000118313925,0.0015755761,0.000036394995,0.00006172988,0.043505903,0.00018079934,0.16887198,0.00036605005,0.068294175,0.71508366,0.00043119083],"about_ca_topic_score_codex":0.0000056906724,"about_ca_topic_score_gemma":0.0000042114116,"teacher_disagreement_score":0.84913355,"about_ca_system_score_codex":0.00021088758,"about_ca_system_score_gemma":0.0003500967,"threshold_uncertainty_score":0.6924301},"labels":[],"label_agreement":null},{"id":"W2134543674","doi":"10.4230/lipics.stacs.2013.269","title":"Algorithms for Designing Pop-Up Cards","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Chemical, Bioengineering, Environmental, and Transport Systems; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; Deutsche Forschungsgemeinschaft; Division of Emerging Frontiers in Research and Innovation; National Science Foundation","keywords":"Polygon (computer graphics); Polyhedron; Simple polygon; Closing (real estate); Computer science; Simple (philosophy); Combinatorics; Linkage (software); Mathematics; Algorithm; Computer graphics (images); Regular polygon; Geometry","score_opus":0.025406681989880116,"score_gpt":0.2709988723429491,"score_spread":0.245592190353069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134543674","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.01734612,0.000051408515,0.9770514,0.0005100455,0.0019130339,0.0017333623,0.00011720238,0.00021960992,0.0010578107],"genre_scores_gemma":[0.3443434,0.000014536428,0.6495937,0.002078177,0.00056909875,0.00095823733,0.000694437,0.000045075558,0.0017033246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976983,0.000030361367,0.00084018667,0.0003076455,0.00046054926,0.0006629762],"domain_scores_gemma":[0.9979873,0.00025528023,0.00030767522,0.00052575814,0.0007071846,0.0002168212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005822314,0.00031540703,0.00032959308,0.00030029312,0.00048053052,0.00079273846,0.00090161036,0.00016079108,0.000026828735],"category_scores_gemma":[0.00012469571,0.00029452986,0.0002522424,0.00041074873,0.00004615382,0.0026758285,0.00024564596,0.00018772409,0.00018632837],"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.00010670211,0.0005471391,0.0012433312,0.0011435172,0.00054979615,0.0000035398102,0.020469174,0.011106432,0.0017287519,0.10915255,0.13177808,0.722171],"study_design_scores_gemma":[0.0027084625,0.00036172138,0.00056581706,0.0000621918,0.000027859329,0.000045215427,0.00045043006,0.89535385,0.005480727,0.0077872067,0.08653248,0.00062404876],"about_ca_topic_score_codex":0.000019192279,"about_ca_topic_score_gemma":0.0000032018452,"teacher_disagreement_score":0.8842474,"about_ca_system_score_codex":0.00010724088,"about_ca_system_score_gemma":0.00012969937,"threshold_uncertainty_score":0.9999507},"labels":[],"label_agreement":null},{"id":"W2135068828","doi":"10.1109/sffcs.1999.814581","title":"Dynamic planar convex hull operations in near-logarithmic amortized time","year":2003,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"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":"Amortized analysis; Convex hull; Combinatorics; Logarithm; Binary logarithm; Mathematics; Tangent; Regular polygon; Computational geometry; Planar; Constant (computer programming); Data structure; Time complexity; Set (abstract data type); Discrete mathematics; Computer science; Algorithm; Geometry; Mathematical analysis","score_opus":0.007351887216501374,"score_gpt":0.23318777536988466,"score_spread":0.2258358881533833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135068828","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.15595771,0.000058239944,0.83323634,0.0009763897,0.0002461547,0.00023301049,0.00000202912,0.00012174254,0.009168385],"genre_scores_gemma":[0.7867853,0.000005070868,0.2065633,0.0007906913,0.000010527048,0.000021454769,0.000028292285,0.0000054525544,0.005789937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907833,0.00009366813,0.00021702088,0.00027244314,0.00016407917,0.00017443828],"domain_scores_gemma":[0.9995773,0.000060466296,0.000022028069,0.0002213403,0.000059459708,0.000059392914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026900944,0.000091617556,0.000114694994,0.00013409436,0.000127324,0.0001824672,0.0002328422,0.00004437832,0.0002533424],"category_scores_gemma":[0.000058270645,0.00008876183,0.000031000287,0.00058066787,0.000024148148,0.00036082102,0.000028450126,0.00008392427,0.0004491217],"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.000013095987,0.00041507508,0.0009723145,0.000012679899,0.000037492617,0.0000603974,0.0009794692,0.28963557,0.020965757,0.6697512,0.004017143,0.013139801],"study_design_scores_gemma":[0.000525253,0.00003648825,0.0031359806,0.0000037491122,0.0000017735352,0.000024210693,0.0000077643335,0.9883184,0.00079328433,0.003056705,0.0039536585,0.00014273668],"about_ca_topic_score_codex":0.000034424556,"about_ca_topic_score_gemma":0.00014650612,"teacher_disagreement_score":0.69868284,"about_ca_system_score_codex":0.0000471367,"about_ca_system_score_gemma":0.0001777624,"threshold_uncertainty_score":0.5772701},"labels":[],"label_agreement":null},{"id":"W2135300727","doi":"10.1145/1998196.1998201","title":"Three problems about dynamic convex hulls","year":2011,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Convex hull; Combinatorics; Amortized analysis; Line segment; Mathematics; Data structure; Computational geometry; Line (geometry); Regular polygon; Plane (geometry); Binary logarithm; Competitive analysis; Range (aeronautics); Set (abstract data type); Upper and lower bounds; Discrete mathematics; Algorithm; Computer science; Geometry; Mathematical analysis","score_opus":0.031298762390318806,"score_gpt":0.23084325159840186,"score_spread":0.19954448920808304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135300727","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.008801561,0.000092463946,0.9607883,0.00018204201,0.0003245156,0.00011787307,4.703322e-7,0.00015587159,0.02953689],"genre_scores_gemma":[0.8476729,0.000004916591,0.15061839,0.00038215477,0.000028114804,0.000013213729,0.0000040958416,0.0000038706808,0.0012723636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993462,0.000011755158,0.00013517652,0.00022086418,0.00014740186,0.00013861242],"domain_scores_gemma":[0.9995681,0.000021531796,0.00003835467,0.00024035106,0.000076695615,0.000054976263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013660919,0.00007240386,0.00006939822,0.00007617608,0.000068430956,0.000055513927,0.00035443465,0.000030415506,0.00020265754],"category_scores_gemma":[0.000007729465,0.00006246288,0.000032451175,0.00027074935,0.000017513474,0.00032232507,0.000067634304,0.000047728245,0.00030981132],"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.0000034337572,0.00012469529,0.00082071894,0.000015126887,0.000023777457,0.0000065444406,0.001147096,0.0007697484,0.001779234,0.8505809,0.0017897511,0.14293902],"study_design_scores_gemma":[0.00038548274,0.00015645701,0.06036532,0.000013544718,0.0000053398467,0.000029088158,0.0000135992195,0.7976792,0.003901924,0.13072461,0.0064079897,0.00031746388],"about_ca_topic_score_codex":0.00003059018,"about_ca_topic_score_gemma":0.00007953711,"teacher_disagreement_score":0.8388713,"about_ca_system_score_codex":0.000013384475,"about_ca_system_score_gemma":0.00004198569,"threshold_uncertainty_score":0.3982101},"labels":[],"label_agreement":null},{"id":"W2135499999","doi":"10.1007/s00453-001-0084-9","title":"Improved Algorithms for Uniform Partitions of Points","year":2002,"lang":"en","type":"article","venue":"Algorithmica","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":"Parameterized complexity; Integer (computer science); Algorithm; Mathematics; Theory of computation; Combinatorics; Time complexity; Constant (computer programming); Set (abstract data type); Running time; Space (punctuation); Discrete mathematics; Computer science","score_opus":0.03377768051008838,"score_gpt":0.26075356987466114,"score_spread":0.22697588936457275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135499999","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.0012730454,0.00007919871,0.9957259,0.0014200499,0.00033621528,0.00022189508,0.000026990449,0.00006775825,0.00084893615],"genre_scores_gemma":[0.17374901,0.000019014027,0.82438576,0.0003011872,0.00022220274,0.00007468396,0.00003264788,0.000009235653,0.0012062315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992189,0.000016699243,0.00022975879,0.0002194622,0.00013791322,0.00017728368],"domain_scores_gemma":[0.99930495,0.000106167085,0.00008676988,0.00025061922,0.00018695727,0.000064551525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014266741,0.00008530902,0.0001156534,0.00010725708,0.00010471492,0.000036692316,0.0002936294,0.000041210784,0.00006254566],"category_scores_gemma":[0.000046377918,0.000084720305,0.00008095412,0.00036902417,0.000026920878,0.0002897378,0.000058800357,0.000045675064,0.00002257661],"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.0000057868438,0.0003821985,0.000010870528,0.000037078247,0.00006666752,0.000002208683,0.0005524357,0.0007573017,0.0034831925,0.114957966,0.011594798,0.8681495],"study_design_scores_gemma":[0.00042979454,0.00015435506,0.0000945829,0.000006247076,0.000007518583,0.000008994961,0.0000066787884,0.95288515,0.01794591,0.014368079,0.013975249,0.000117451134],"about_ca_topic_score_codex":0.000005361389,"about_ca_topic_score_gemma":0.0000012739678,"teacher_disagreement_score":0.9521278,"about_ca_system_score_codex":0.000019269275,"about_ca_system_score_gemma":0.00002234967,"threshold_uncertainty_score":0.34547937},"labels":[],"label_agreement":null},{"id":"W2135989110","doi":"10.7155/jgaa.00079","title":"The Maximum Number of Edges in a Three-Dimensional Grid-Drawing","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":28,"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":"Grid; Computer science; Geometry; Mathematics; Combinatorics","score_opus":0.012468721534286395,"score_gpt":0.26028148832077197,"score_spread":0.24781276678648556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135989110","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.08126003,0.0009173566,0.9153892,0.0020777162,0.0001536531,0.0001118927,0.0000024189467,0.0000056557233,0.00008207491],"genre_scores_gemma":[0.8338745,0.00022541721,0.16542336,0.00011673911,0.00031395405,0.00002291186,0.0000018799378,0.0000051890074,0.000015999563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927104,0.000014601677,0.00032198743,0.0000941569,0.0002082852,0.00008991538],"domain_scores_gemma":[0.99933696,0.00011760358,0.00019964276,0.00011307158,0.00018361915,0.000049121372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034049177,0.000058181737,0.000100200785,0.00011092265,0.00016308427,0.000050236555,0.00022242445,0.000024677087,0.0000013323989],"category_scores_gemma":[0.000011824001,0.000040871197,0.000057910333,0.0005533536,0.00005526117,0.00019928066,0.000046839745,0.000105718485,0.0000013267477],"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.000016641443,0.00035115372,0.002607691,0.000016890346,0.00006349272,0.000008685356,0.0002983947,0.03381747,0.0013982363,0.40809128,0.00021832837,0.55311173],"study_design_scores_gemma":[0.0011888655,0.00011045808,0.046746276,0.00006546035,0.000017014429,0.00044195546,0.00006547011,0.010869891,0.0019291512,0.93049103,0.007909219,0.00016522204],"about_ca_topic_score_codex":0.0000150401065,"about_ca_topic_score_gemma":0.00001889956,"teacher_disagreement_score":0.7526145,"about_ca_system_score_codex":0.000014434636,"about_ca_system_score_gemma":0.00009479914,"threshold_uncertainty_score":0.16666791},"labels":[],"label_agreement":null},{"id":"W2136013120","doi":"","title":"I/O-efficient triangular range search and its application.","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on 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 New Brunswick","funders":"","keywords":"Combinatorics; Range (aeronautics); Range query (database); Binary logarithm; Data structure; Set (abstract data type); Mathematics; Computational geometry; Point (geometry); Discrete mathematics; Computer science; Algorithm; Search engine; Geometry; Web search query; Sargable; Information retrieval","score_opus":0.024349150862565387,"score_gpt":0.25993228784615396,"score_spread":0.23558313698358857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136013120","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.5343537,0.00013650296,0.4551019,0.005908967,0.00065854687,0.00053727033,0.000059943228,0.000117006886,0.0031261675],"genre_scores_gemma":[0.9859684,0.000003851479,0.0123986,0.0010979204,0.00020335194,0.00003716116,0.000065289045,0.000011082913,0.0002143184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821794,0.000061438535,0.00025441637,0.00058726646,0.000501378,0.00037757275],"domain_scores_gemma":[0.9982653,0.00021140522,0.000054899978,0.00030360944,0.00053588056,0.00062887487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047203802,0.00019141565,0.00016767849,0.0009132479,0.00038396096,0.00026963215,0.00053241674,0.00012011449,0.00014845947],"category_scores_gemma":[0.000116206385,0.00020689402,0.000049529324,0.001093221,0.000060819613,0.00014352419,0.00007809948,0.0003581481,0.0003016212],"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.0000050448602,0.000041114174,0.00014267533,0.000010002231,0.0000139392105,0.000008727355,0.00012948836,0.10486467,0.0006303305,0.84890413,0.00024306413,0.045006827],"study_design_scores_gemma":[0.00042858702,0.00005365932,0.012619535,0.000008051327,0.000003945112,0.000027714828,0.000016336067,0.9756297,0.00026640858,0.007960628,0.0027244044,0.00026105726],"about_ca_topic_score_codex":0.00082883856,"about_ca_topic_score_gemma":0.0019996017,"teacher_disagreement_score":0.87076503,"about_ca_system_score_codex":0.00007755655,"about_ca_system_score_gemma":0.0010421913,"threshold_uncertainty_score":0.8436893},"labels":[],"label_agreement":null},{"id":"W2136104372","doi":"10.37236/1567","title":"The Rectilinear Crossing Number of $K_{10}$ is $62$","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"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; Crossing number (knot theory); Graph; Enhanced Data Rates for GSM Evolution; Line (geometry); Discrete mathematics; Geometry; Computer science; Intersection (aeronautics)","score_opus":0.009994745284637953,"score_gpt":0.274939942040069,"score_spread":0.26494519675543104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136104372","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.56662697,0.005363792,0.41941088,0.0049412367,0.0013202835,0.00011012257,3.2405762e-7,0.000020796188,0.0022055695],"genre_scores_gemma":[0.9974463,0.0005162601,0.00018576333,0.00014812575,0.0001496782,7.705498e-7,1.596454e-7,0.000006021347,0.0015469134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855155,0.00013694924,0.00041134714,0.00009267417,0.00049317203,0.00031430335],"domain_scores_gemma":[0.99827594,0.00040303558,0.0004472738,0.00028645917,0.0005443656,0.000042953616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016295357,0.00009233156,0.0001441861,0.000052878953,0.00046940165,0.00019575129,0.0008941057,0.000036915942,0.000017131906],"category_scores_gemma":[0.00012719602,0.00005477708,0.00011719073,0.000847513,0.00007538004,0.00027408433,0.00007914718,0.0003638301,0.000012325402],"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.00007751116,0.00013100546,0.00047203267,0.0000048661113,0.000096678334,0.000005831752,0.0008240548,0.0009583243,0.000381171,0.96854204,0.004088995,0.024417488],"study_design_scores_gemma":[0.000692949,0.00036207357,0.0006996483,0.000020189273,0.000026933265,0.00080706994,0.000050819905,0.014036606,0.006471966,0.8177788,0.158928,0.00012492001],"about_ca_topic_score_codex":0.000003985702,"about_ca_topic_score_gemma":0.0000018788911,"teacher_disagreement_score":0.4308193,"about_ca_system_score_codex":0.00013064503,"about_ca_system_score_gemma":0.0006618363,"threshold_uncertainty_score":0.36103055},"labels":[],"label_agreement":null},{"id":"W2136119829","doi":"","title":"On the Complexity of Point Recolouring in Geometric Graphs","year":2008,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Mathematics; Sequence (biology); Binary number; Point (geometry); Planar graph; Planar; Graph; Range (aeronautics); Algorithm; Discrete mathematics; Computer science; Geometry","score_opus":0.07866227640533384,"score_gpt":0.2516093661659636,"score_spread":0.17294708976062972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136119829","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.77385646,0.000020937752,0.21874554,0.0015581155,0.00010873779,0.00009244706,3.5290532e-7,0.000023562467,0.0055938326],"genre_scores_gemma":[0.9878808,0.00000837182,0.011654383,0.00031873182,0.000007899696,0.0000040079894,7.4697647e-7,0.0000012675066,0.00012374243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993986,0.000051240288,0.00015162861,0.00012849651,0.00017982868,0.000090225476],"domain_scores_gemma":[0.9994392,0.00026832573,0.000044258835,0.00018257367,0.000046062996,0.000019614641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030175337,0.00004659801,0.00007040749,0.00035361917,0.000076125434,0.000010745252,0.00026879026,0.000015246548,0.00004896385],"category_scores_gemma":[0.00009518686,0.000031970467,0.000033530498,0.0016693054,0.00005246278,0.00010899432,0.00006728008,0.00006301165,0.0000153257],"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.0000037106995,0.000093638926,0.0010674635,0.000002538245,0.0000035893463,0.0000037622294,0.00018756028,0.0067902356,0.00015310309,0.98666984,0.0010473912,0.0039771507],"study_design_scores_gemma":[0.00047445073,0.00023052424,0.43703026,0.000015320615,0.0000012243739,0.000034129447,0.000026894462,0.13735168,0.019339364,0.40507975,0.00023895888,0.00017743009],"about_ca_topic_score_codex":0.000038522703,"about_ca_topic_score_gemma":0.000020313222,"teacher_disagreement_score":0.5815901,"about_ca_system_score_codex":0.0000174335,"about_ca_system_score_gemma":0.000027967044,"threshold_uncertainty_score":0.13037178},"labels":[],"label_agreement":null},{"id":"W2136616318","doi":"","title":"GUARDING SIMPLE POLYGONS WITH SEMI-OPEN EDGE GUARDS","year":2013,"lang":"en","type":"article","venue":"","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 Windsor","funders":"","keywords":"Guard (computer science); Polygon (computer graphics); Enhanced Data Rates for GSM Evolution; Computer science; Simple polygon; Combinatorics; Characterization (materials science); Algorithm; Mathematics; Regular polygon; Computer vision; Geometry; Physics; Optics; Computer network","score_opus":0.016476914800052946,"score_gpt":0.2541067957062841,"score_spread":0.23762988090623113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136616318","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.04376437,0.000022354774,0.90164053,0.0018590417,0.00012111428,0.00027967006,8.015629e-7,0.0001222658,0.052189827],"genre_scores_gemma":[0.905124,0.0000014102866,0.08872785,0.0011030203,0.000091001406,0.00004054769,0.000009277501,0.0000055128007,0.004897393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991848,0.000029753339,0.00012657793,0.00027349417,0.00019434447,0.00019104443],"domain_scores_gemma":[0.9993691,0.000060751445,0.00004015172,0.00031324857,0.00013077338,0.00008598252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014636436,0.000092697584,0.00009730555,0.000081242586,0.00016733352,0.0006270863,0.0006999564,0.000025572526,0.0003613404],"category_scores_gemma":[0.000014544144,0.00006986483,0.000024415342,0.00047054194,0.0000139517115,0.0012307223,0.0003623256,0.000055869805,0.00035099944],"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.000009996981,0.00018041566,0.0029458564,0.000016135298,0.000085604726,0.000011651466,0.0008455424,0.014816187,0.0080082165,0.44862312,0.2179993,0.306458],"study_design_scores_gemma":[0.0018380748,0.0005943388,0.042381577,0.00003703731,0.000019859366,0.00015819678,0.00027306774,0.7049984,0.030816767,0.061279796,0.15642126,0.0011816466],"about_ca_topic_score_codex":0.00024394967,"about_ca_topic_score_gemma":0.00003094869,"teacher_disagreement_score":0.8613596,"about_ca_system_score_codex":0.000023851435,"about_ca_system_score_gemma":0.000096568445,"threshold_uncertainty_score":0.60470074},"labels":[],"label_agreement":null},{"id":"W2136910207","doi":"10.1007/s00454-006-1232-4","title":"Distinct Distances in Homogeneous Sets in Euclidean Space","year":2006,"lang":"en","type":"article","venue":"Discrete & 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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Homogeneous; Omega; Combinatorics; Euclidean space; Space (punctuation); Mathematics; Constant (computer programming); Set (abstract data type); Euclidean geometry; Euclidean distance; Point (geometry); Physics; Geometry; Computer science","score_opus":0.0077357791002921105,"score_gpt":0.24469735313444796,"score_spread":0.23696157403415585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136910207","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.56580526,0.00057941343,0.4293424,0.00085391855,0.00030644005,0.00021431882,0.000026324338,0.00009589788,0.0027760626],"genre_scores_gemma":[0.963079,0.000005529744,0.03603281,0.00014605295,0.00012733524,0.000027941698,0.00031039052,0.000015084486,0.00025589537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99744123,0.00013840148,0.0006184644,0.00068938045,0.00066393375,0.00044857687],"domain_scores_gemma":[0.99889934,0.00044344564,0.00016596993,0.0002811317,0.00011964975,0.00009046764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004580431,0.0002652769,0.0002897441,0.00089949527,0.00013139569,0.00022909812,0.0005679636,0.00008203623,0.000033449178],"category_scores_gemma":[0.00007721281,0.00028023854,0.00009877085,0.0028296183,0.00006740261,0.00058640866,0.00018682802,0.00021514695,0.00006105246],"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.00002334285,0.00022928092,0.056606323,0.000028389924,0.000010310083,0.00014972659,0.00017599543,0.78845066,0.00007277856,0.13998736,0.0005087667,0.013757049],"study_design_scores_gemma":[0.00068754656,0.00004697584,0.56412584,0.00003879649,0.00000289215,0.00003334319,0.000026119686,0.34294695,0.00007598884,0.09026404,0.0013950699,0.000356485],"about_ca_topic_score_codex":0.00028106928,"about_ca_topic_score_gemma":0.0006207243,"teacher_disagreement_score":0.5075195,"about_ca_system_score_codex":0.00017584595,"about_ca_system_score_gemma":0.00014933645,"threshold_uncertainty_score":0.99996495},"labels":[],"label_agreement":null},{"id":"W2137498124","doi":"10.1006/jagm.2000.1132","title":"Efficient Algorithms for Petersen's Matching Theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Algorithms","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":"McGill University; Carleton University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Algorithm; Planar graph; Discrete mathematics; Graph algorithms; Graph","score_opus":0.021894238488722132,"score_gpt":0.2809147616313767,"score_spread":0.25902052314265456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137498124","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.03921706,0.00022540877,0.95686406,0.0016904891,0.001594943,0.00011868304,0.0000021992585,0.00002671662,0.00026041715],"genre_scores_gemma":[0.30597633,0.000033395547,0.6919147,0.00040461932,0.0013091015,0.0000048277066,0.0000024511878,0.0000127188405,0.00034189006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864435,0.000052120726,0.0004438589,0.0001787183,0.00044966498,0.0002312753],"domain_scores_gemma":[0.9987185,0.00022580972,0.00033604173,0.00017078145,0.00042104628,0.00012782088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009394324,0.00012475903,0.00019981028,0.00026169224,0.00015554806,0.00016446215,0.00043885713,0.00004526262,0.0000112893695],"category_scores_gemma":[0.00005953081,0.00010248601,0.00019620551,0.00038700312,0.000021062257,0.00025636127,0.00006682112,0.00014290573,0.0000094738625],"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.00007553714,0.0003625984,0.000027224482,0.000022303933,0.00012354905,0.00017829884,0.0017873637,0.3513112,0.003272425,0.04746327,0.0016930094,0.59368324],"study_design_scores_gemma":[0.0011698544,0.0004405018,0.0006613691,0.00004263046,0.00002151333,0.001283424,0.0001243449,0.948006,0.001198061,0.034188017,0.012648643,0.0002156842],"about_ca_topic_score_codex":0.0000020825357,"about_ca_topic_score_gemma":3.8479442e-7,"teacher_disagreement_score":0.59669477,"about_ca_system_score_codex":0.000063419466,"about_ca_system_score_gemma":0.00011205828,"threshold_uncertainty_score":0.4179258},"labels":[],"label_agreement":null},{"id":"W2137815516","doi":"10.1007/978-3-642-03367-4_20","title":"Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba; University of Toronto; University of Waterloo","funders":"","keywords":"Hausdorff distance; Hausdorff space; Polygon covering; Polygon (computer graphics); Rectilinear polygon; Combinatorics; Mathematics; Regular polygon; Krein–Milman theorem; Monotone polygon; Core (optical fiber); Bounded function; Discrete mathematics; Simple polygon; Convex set; Computer science; Convex optimization; Geometry; Mathematical analysis","score_opus":0.01974554928092759,"score_gpt":0.25061121552652094,"score_spread":0.23086566624559335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137815516","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.0017167387,0.00047924154,0.99271685,0.0009199358,0.0008504805,0.0006406934,0.000012293735,0.00010428676,0.0025594973],"genre_scores_gemma":[0.8117125,0.000034027416,0.18470871,0.0021360104,0.00036900747,0.000014232875,0.000025879557,0.00003365499,0.00096597744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541694,0.000041706928,0.0006986805,0.001563192,0.0016333987,0.00064610044],"domain_scores_gemma":[0.99715483,0.00050353626,0.00061385747,0.0011786167,0.00034146418,0.00020767175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070982415,0.0006428529,0.0007560115,0.0009679133,0.0003227473,0.00038792216,0.0019307255,0.00025548294,0.00002083288],"category_scores_gemma":[0.00006095966,0.00055524684,0.00014380607,0.0009847374,0.0006070806,0.00047839177,0.00038526361,0.00064992195,0.000014484925],"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.00017588623,0.0001577923,0.000097098266,0.00007719862,0.000046158733,0.00018242933,0.0011136947,0.105982855,0.0009449216,0.23094237,0.000051719693,0.6602279],"study_design_scores_gemma":[0.002865761,0.004388036,0.0015850345,0.002744329,0.000051018313,0.00029462224,0.0000018239125,0.7135517,0.0226217,0.24309717,0.0064336346,0.0023651824],"about_ca_topic_score_codex":0.000018581644,"about_ca_topic_score_gemma":0.00007758142,"teacher_disagreement_score":0.8099958,"about_ca_system_score_codex":0.0004907496,"about_ca_system_score_gemma":0.00084290555,"threshold_uncertainty_score":0.9996899},"labels":[],"label_agreement":null},{"id":"W2137815559","doi":"10.1142/s0219265904001234","title":"TRAVERSAL OF A QUASI-PLANAR SUBDIVISION WITHOUT USING MARK BITS","year":2004,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Consejo Nacional de Ciencia y Tecnología","keywords":"Subdivision; Traverse; Tree traversal; Planar; Graph traversal; Planar graph; Computer science; Algorithm; Combinatorics; Graph; Planar straight-line graph; Mathematics; Computer graphics (images); Geography","score_opus":0.017670687493388817,"score_gpt":0.26118974007892976,"score_spread":0.24351905258554093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137815559","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.33251855,0.00012809483,0.6659903,0.00012429587,0.0011335989,0.000036676553,2.7177052e-7,0.000009488853,0.000058691086],"genre_scores_gemma":[0.9672144,0.000032124026,0.032218836,0.000101111036,0.00041333865,3.3281373e-7,9.4125926e-7,0.000005672132,0.000013252489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988614,0.000080396814,0.000521715,0.0001294723,0.00027926225,0.00012777344],"domain_scores_gemma":[0.998846,0.00008027898,0.0005172132,0.00011879431,0.00036038423,0.00007733158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005676783,0.00009906335,0.00020883266,0.0003244443,0.00007203214,0.0000602637,0.00025359858,0.00007177613,0.000010101733],"category_scores_gemma":[0.00005777876,0.000087364126,0.00013431019,0.0004780416,0.000020830721,0.000623556,0.000030758074,0.00020364329,0.0000017493697],"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.00014597145,0.00022527066,0.00068062905,0.000015492935,0.000088162815,0.000023423394,0.0005745247,0.9542079,0.0066534793,0.010600529,0.00030265766,0.02648197],"study_design_scores_gemma":[0.0018539364,0.0013976243,0.0031840715,0.0004546088,0.00004255175,0.0014158702,0.00012845019,0.97491956,0.009922987,0.0059866207,0.00046348156,0.00023022847],"about_ca_topic_score_codex":0.000020004816,"about_ca_topic_score_gemma":0.000011874806,"teacher_disagreement_score":0.6346958,"about_ca_system_score_codex":0.00011039418,"about_ca_system_score_gemma":0.0001087699,"threshold_uncertainty_score":0.35626057},"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":"W2138394562","doi":"10.1142/s0218195902000906","title":"AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"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":"Subdivision; Tree traversal; Mathematics; Pointer (user interface); Algorithm; Binary logarithm; Running time; Constant (computer programming); Combinatorics; Planar; Graph traversal; Computer science; Computer graphics (images); Artificial intelligence","score_opus":0.017631964689593434,"score_gpt":0.29424230258391576,"score_spread":0.2766103378943223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138394562","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.0036705246,0.00046068407,0.99328864,0.00084458274,0.0008509529,0.0005734011,0.00007981681,0.00008196511,0.00014942003],"genre_scores_gemma":[0.49372748,0.00004871458,0.50408506,0.00042567297,0.0013057046,0.00011099873,0.00013205051,0.000020501751,0.0001438194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971698,0.000084495085,0.0009221239,0.0004462914,0.0011104312,0.00026687852],"domain_scores_gemma":[0.99550575,0.0004775849,0.00074871496,0.00030413852,0.002697617,0.0002661676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006557059,0.00024711946,0.00029350913,0.0009848403,0.0002543035,0.00053299434,0.0017266211,0.000106139516,0.00010542415],"category_scores_gemma":[0.000053329164,0.0002535885,0.00026968482,0.0008027144,0.00006884496,0.0019034493,0.00009184434,0.00024580973,0.000038253136],"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.000028599277,0.00083877845,0.00008006985,0.000010457692,0.00021167166,0.000007946975,0.00021500871,0.09089607,0.0011122695,0.027188104,0.00090542604,0.8785056],"study_design_scores_gemma":[0.0014271257,0.00033438887,0.0010340484,0.000015814043,0.000029987406,0.00025984753,0.000039233943,0.9317876,0.00038707786,0.023250211,0.04115685,0.00027782956],"about_ca_topic_score_codex":0.0000030929266,"about_ca_topic_score_gemma":9.1713446e-7,"teacher_disagreement_score":0.8782278,"about_ca_system_score_codex":0.00018431213,"about_ca_system_score_gemma":0.00016610931,"threshold_uncertainty_score":0.99999166},"labels":[],"label_agreement":null},{"id":"W2138685411","doi":"10.1109/tmag.2007.914827","title":"An Adaptive Remeshing Technique Ensuring High Quality Meshes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Center for Diagnosis and Research on Alzheimer's Disease","funders":"","keywords":"Polygon mesh; Computer science; Bubble; Quality (philosophy); Computational science; Computer graphics (images); Parallel computing","score_opus":0.04624943060061796,"score_gpt":0.27801744120513994,"score_spread":0.23176801060452198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138685411","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.06590139,0.000023950448,0.93270946,0.00015642894,0.00041797437,0.00018958753,0.00000824259,0.00025883882,0.0003341435],"genre_scores_gemma":[0.78577447,0.000031641164,0.21371838,0.00013222032,0.000055016757,0.000033187374,0.0000021299768,0.0000085028605,0.00024444613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986543,0.0001655703,0.00026917874,0.00036632302,0.00034937783,0.00019522686],"domain_scores_gemma":[0.9991004,0.00013963779,0.00006741781,0.00044224178,0.00014514149,0.00010518415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028664363,0.00014773564,0.000136663,0.00019113102,0.00041524944,0.000064494074,0.00035701768,0.000082975814,0.000033098455],"category_scores_gemma":[0.000006111037,0.0001595471,0.00006711593,0.0004739472,0.00005161416,0.0004611358,0.0000025886366,0.00022824515,0.000023868668],"study_design_candidate":"bench_or_experimental","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.00007004512,0.00092535873,0.000032941825,0.00002457421,0.000045919547,0.000054405544,0.0020057147,0.58319646,0.11848057,0.018663311,0.00020273884,0.27629796],"study_design_scores_gemma":[0.00072162045,0.0017869218,0.01044092,0.00003739156,0.000025108056,0.0001704983,0.00006235131,0.1567415,0.822356,0.006015176,0.0008499036,0.00079260016],"about_ca_topic_score_codex":0.00006458513,"about_ca_topic_score_gemma":0.000024755493,"teacher_disagreement_score":0.7198731,"about_ca_system_score_codex":0.000053600215,"about_ca_system_score_gemma":0.00008497667,"threshold_uncertainty_score":0.6506142},"labels":[],"label_agreement":null},{"id":"W2138801591","doi":"10.1007/978-3-642-22300-6_26","title":"On Rectilinear Partitions with Minimum Stabbing Number","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Partition (number theory); Hyperplane; Combinatorics; Bounding overwatch; Partition problem; Mathematics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.024096210405924745,"score_gpt":0.24811051834533537,"score_spread":0.22401430793941063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138801591","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.0005442386,0.000055751738,0.9803487,0.00034583008,0.0011252551,0.00026755937,0.0000046193263,0.00014058384,0.017167429],"genre_scores_gemma":[0.43891832,0.000027725097,0.5562095,0.0022487838,0.0006947515,0.000024822233,0.000020394498,0.000048110927,0.0018075603],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971266,0.00003285426,0.00035417255,0.0012119198,0.0008231756,0.00045130248],"domain_scores_gemma":[0.99801886,0.0004269529,0.00020385208,0.000892134,0.00030088145,0.00015729932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004722655,0.0003964173,0.00031592566,0.0005491479,0.00031558485,0.00034169422,0.0012613955,0.00017801343,0.000108273016],"category_scores_gemma":[0.000057853893,0.00033826992,0.00008004135,0.00072845106,0.0003108743,0.0005145219,0.00036888203,0.0005604983,0.00019236472],"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.000038225106,0.00012458612,0.000057659825,0.00003202089,0.000029526931,0.00013820372,0.001137807,0.20578617,0.00008173659,0.2542497,0.00020974826,0.53811467],"study_design_scores_gemma":[0.0005247898,0.0006826694,0.0001973518,0.0005722021,0.000016749435,0.00019529392,1.9482279e-7,0.32055467,0.0035316776,0.6679805,0.0046289903,0.0011149058],"about_ca_topic_score_codex":0.000011031732,"about_ca_topic_score_gemma":0.000058267946,"teacher_disagreement_score":0.53699976,"about_ca_system_score_codex":0.00016778581,"about_ca_system_score_gemma":0.0005198323,"threshold_uncertainty_score":0.99990696},"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":"W2139188177","doi":"10.1142/s0218195906002075","title":"THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION","year":2006,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"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 British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Euclidean geometry; Steiner tree problem; Eccentricity (behavior); RADIUS; Point (geometry); Function (biology); Geometry; Discrete mathematics; Computer science","score_opus":0.011293344345689578,"score_gpt":0.2740421019614167,"score_spread":0.26274875761572714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139188177","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.040169973,0.00079717493,0.955654,0.0018192042,0.00016338851,0.0010224347,0.0001846173,0.000022161596,0.00016703228],"genre_scores_gemma":[0.9586421,0.000051695763,0.04044487,0.00010583008,0.00035756436,0.00021248223,0.00012093001,0.000008150027,0.000056368528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683285,0.00012497374,0.0013186568,0.00032584765,0.0012106557,0.00018702367],"domain_scores_gemma":[0.9927274,0.0011072604,0.0010012998,0.00033940372,0.0046953717,0.00012927942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096636947,0.00018066242,0.00028138928,0.00061267504,0.00019191598,0.0001451483,0.0011559698,0.00006500371,0.000020038942],"category_scores_gemma":[0.00010261601,0.00015804052,0.00014492199,0.0016876886,0.00016616716,0.0004391991,0.0002904105,0.00016359976,0.00001289688],"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.000109200926,0.00081575505,0.005234619,0.00009071912,0.0002474176,0.00000159854,0.0002817147,0.5053636,0.0010745759,0.26728782,0.00081711804,0.21867588],"study_design_scores_gemma":[0.0036629469,0.0007579596,0.060507886,0.00016844177,0.00017933792,0.0003362522,0.0008727494,0.07170545,0.0145828845,0.47491843,0.37128484,0.0010228474],"about_ca_topic_score_codex":0.000031370986,"about_ca_topic_score_gemma":0.000014788793,"teacher_disagreement_score":0.9184721,"about_ca_system_score_codex":0.00013911011,"about_ca_system_score_gemma":0.0003292444,"threshold_uncertainty_score":0.6444706},"labels":[],"label_agreement":null},{"id":"W2139662558","doi":"10.21914/anziamj.v46i0.1015","title":"Additive models in high dimensions","year":2005,"lang":"en","type":"article","venue":"ANZIAM Journal","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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 Ottawa","funders":"Marsden Fund; Victoria University; Royal Society Te Apārangi; Victoria University of Wellington; Royal Society","keywords":"Curse of dimensionality; Mathematics; Smoothness; Additive model; Applied mathematics; Nonparametric statistics; Multivariate statistics; Measure (data warehouse); Convergence (economics); Monomial; Pure mathematics; Statistics; Computer science; Mathematical analysis","score_opus":0.016973959800591187,"score_gpt":0.24586139467865442,"score_spread":0.22888743487806323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139662558","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.16244103,0.0002611509,0.8320207,0.0032938125,0.00035787054,0.000044727498,0.0000017947438,0.000026038035,0.0015528422],"genre_scores_gemma":[0.9241651,0.000081134785,0.07439884,0.0007486196,0.0003513752,0.0000021239457,0.0000026681696,0.0000026922528,0.00024743102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929976,0.000050284056,0.00017678668,0.00012481892,0.00019735484,0.00015099258],"domain_scores_gemma":[0.99961656,0.000058171037,0.00005748863,0.0000966341,0.00009161493,0.0000795293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023048402,0.000060378738,0.00007155795,0.00018212035,0.00012312447,0.00009634426,0.00021271003,0.000026676997,0.000043482916],"category_scores_gemma":[0.000017658831,0.000055004744,0.000034259127,0.00031205086,0.000009207478,0.0009832527,0.000056387395,0.00017175762,0.000052886804],"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.0000065947206,0.00014202105,0.00007673627,7.536414e-7,0.000012668947,0.000050534167,0.0007857688,0.5361807,0.0004142622,0.17596704,0.012585601,0.27377737],"study_design_scores_gemma":[0.00073119916,0.000084699765,0.0066509503,0.000025488063,0.0000034903492,0.0004152101,0.000026345046,0.86473936,0.0013435945,0.1081794,0.017613435,0.00018684502],"about_ca_topic_score_codex":0.0000052496384,"about_ca_topic_score_gemma":0.000017029719,"teacher_disagreement_score":0.76172405,"about_ca_system_score_codex":0.000052676216,"about_ca_system_score_gemma":0.000086459484,"threshold_uncertainty_score":0.22430284},"labels":[],"label_agreement":null},{"id":"W2140124945","doi":"","title":"On the perimeter of fat objects.","year":2010,"lang":"en","type":"article","venue":"","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":"Perimeter; Constant (computer programming); Object (grammar); Generalization; Boundary (topology); Mathematics; Fraction (chemistry); Point (geometry); Function (biology); Mathematical analysis; Computer science; Combinatorics; Geometry; Artificial intelligence","score_opus":0.011666269080071972,"score_gpt":0.2304899567960108,"score_spread":0.21882368771593882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140124945","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.5226537,0.00000575515,0.42677337,0.0014050272,0.0005716265,0.00007054747,3.279451e-7,0.000035122037,0.048484504],"genre_scores_gemma":[0.9815018,2.489758e-7,0.017039755,0.0006196182,0.00004134461,0.0000021334838,3.9771663e-7,9.930856e-7,0.000793716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968463,0.000013982217,0.00005872372,0.000081859835,0.000114000366,0.000046785528],"domain_scores_gemma":[0.99956983,0.0001545269,0.000019633182,0.0001995477,0.000042102216,0.000014374209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011061883,0.000030679697,0.000029969378,0.000033248314,0.00004090618,0.000028658756,0.00023207646,0.000013999876,0.00014164206],"category_scores_gemma":[0.000044709974,0.000017452028,0.000023430322,0.00015140888,0.000014660421,0.000070794325,0.000042119787,0.000056813173,0.000047213198],"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":[8.469736e-7,0.000017121552,0.000015899375,6.262157e-7,0.0000021460048,1.5769592e-7,0.00012028987,0.00017026984,0.040269572,0.9487328,0.0015099233,0.009160374],"study_design_scores_gemma":[0.00021068672,0.00019338999,0.005165542,0.000004111285,0.0000026525472,0.000008612398,0.000025080875,0.14726493,0.73945844,0.09925616,0.008251752,0.00015866624],"about_ca_topic_score_codex":0.000003816648,"about_ca_topic_score_gemma":0.0000056676004,"teacher_disagreement_score":0.84947664,"about_ca_system_score_codex":0.0000014940958,"about_ca_system_score_gemma":0.000014051958,"threshold_uncertainty_score":0.15508811},"labels":[],"label_agreement":null},{"id":"W2140185923","doi":"10.1142/s1793830909000415","title":"LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Unit disk graph; Vertex (graph theory); Combinatorics; Bipartite graph; Mathematics; Graph; Locality; Computer science; Database","score_opus":0.013291419705873185,"score_gpt":0.25607892269689475,"score_spread":0.24278750299102156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140185923","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.02386261,0.00014800491,0.975343,0.00019731629,0.000017098613,0.00022318897,0.000010020776,0.00002207044,0.00017670995],"genre_scores_gemma":[0.8224985,0.00007233217,0.1773479,0.000012902477,0.0000135274895,0.000022261771,0.000017428387,0.000002810064,0.000012359859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934095,0.0000110200845,0.0002676297,0.00016617341,0.00013771703,0.00007653063],"domain_scores_gemma":[0.999372,0.00006546884,0.00017151362,0.00017717856,0.00016472422,0.000049100727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012603283,0.00008111518,0.0001367543,0.000110375615,0.00009540506,0.00003144661,0.000111881775,0.000034762983,0.0000011136151],"category_scores_gemma":[0.0000091796865,0.00007692404,0.00002286263,0.0004828997,0.00011055136,0.00015700706,0.00003805345,0.00004141463,4.4199393e-7],"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.0000014749475,0.000052583226,0.0000542517,0.00007211474,0.000010952194,8.271448e-8,0.00034764054,0.0018135945,0.00068691414,0.82525545,0.0000044367675,0.17170048],"study_design_scores_gemma":[0.0003458754,0.0001358255,0.0049117096,0.00007311725,0.000038083203,0.000026326969,0.00091191597,0.7307185,0.007130118,0.25517955,0.00033477144,0.0001942001],"about_ca_topic_score_codex":0.0000055143887,"about_ca_topic_score_gemma":0.0000012147075,"teacher_disagreement_score":0.79863584,"about_ca_system_score_codex":0.000006003621,"about_ca_system_score_gemma":0.000026907404,"threshold_uncertainty_score":0.31368715},"labels":[],"label_agreement":null},{"id":"W2140414285","doi":"10.1007/978-3-642-36763-2_33","title":"The Visible Perimeter of an Arrangement of Disks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Science Foundation; Hungarian Scientific Research Fund; École Polytechnique Fédérale de Lausanne; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Perimeter; Stacking; Combinatorics; Opacity; Order (exchange); Plane (geometry); Point (geometry); Square (algebra); Mathematics; Set (abstract data type); Square tiling; Upper and lower bounds; Geometry; Computer science; Grid; Physics; Optics; Mathematical analysis","score_opus":0.018032913260998183,"score_gpt":0.2567467583968348,"score_spread":0.23871384513583663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140414285","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.0019447067,0.00047263963,0.99413157,0.0002941491,0.0009736954,0.00030304395,0.000002952026,0.000024447218,0.001852829],"genre_scores_gemma":[0.5799247,0.00005067005,0.41891786,0.0002600282,0.00029099235,0.00001147624,0.0000067917103,0.000016729906,0.0005207619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977006,0.000039366623,0.0005007725,0.00063423795,0.0008463504,0.0002786921],"domain_scores_gemma":[0.9977796,0.00039232615,0.00035036742,0.0009994835,0.00039668774,0.00008153083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007753214,0.00024129098,0.00030089356,0.00039146593,0.00017850235,0.00022162726,0.0021293352,0.00010868658,0.0000257143],"category_scores_gemma":[0.00004582868,0.00017249765,0.00009859487,0.00045376027,0.00047599635,0.0004832234,0.0005975493,0.0002328936,0.0000113971155],"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.0000046401224,0.000035087487,0.000011729996,0.00002508609,0.000011970002,0.0000022697436,0.0004433312,0.05004068,0.0014812945,0.046306588,0.000020492986,0.9016168],"study_design_scores_gemma":[0.0002484365,0.00052835466,0.0006788158,0.00016360481,0.000009525782,0.000015046586,4.3469075e-7,0.7714488,0.03247134,0.19158626,0.0024483204,0.00040108396],"about_ca_topic_score_codex":0.000021701133,"about_ca_topic_score_gemma":0.000026349191,"teacher_disagreement_score":0.90121573,"about_ca_system_score_codex":0.00006328709,"about_ca_system_score_gemma":0.00029057064,"threshold_uncertainty_score":0.703425},"labels":[],"label_agreement":null},{"id":"W2140619995","doi":"10.1016/s0095-8956(03)00037-6","title":"Crossing-number critical graphs have bounded path-width","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":31,"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":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Combinatorics; Crossing number (knot theory); Bounded function; Mathematics; 1-planar graph; Subdivision; Pathwidth; Embedding; Book embedding; Discrete mathematics; Planar graph; Graph; Assertion; Chordal graph; Line graph; Computer science","score_opus":0.010836903398999743,"score_gpt":0.2721763294949098,"score_spread":0.26133942609591004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140619995","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.18642919,0.0007112554,0.7590039,0.0011361486,0.03511484,0.00018086439,0.0000036304637,0.0000937387,0.017326461],"genre_scores_gemma":[0.9742781,0.000011216246,0.024668138,0.0002763896,0.0004365166,0.0000019252905,6.6815585e-7,0.000010367018,0.0003166984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979731,0.00050707615,0.00053866813,0.00017963597,0.0005482257,0.00025332038],"domain_scores_gemma":[0.99808055,0.00054829323,0.00026775664,0.00024409048,0.00068181916,0.00017750997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017776552,0.00016012453,0.0002712449,0.00012731859,0.00042688372,0.00073532306,0.00045434656,0.00009282848,0.000120268334],"category_scores_gemma":[0.0012523474,0.00014215776,0.0001842174,0.00037261785,0.00023375773,0.0014438031,0.000061440296,0.0002730151,0.000014655223],"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.000113380745,0.00014075542,0.00017967405,0.00000776873,0.000029279203,0.000049301354,0.00039431464,0.00006054175,0.00029422663,0.9966277,0.0007689511,0.0013341365],"study_design_scores_gemma":[0.0007949502,0.00031550787,0.00018072383,0.000023091088,0.000015161128,0.0005218391,0.00006040431,0.000080426405,0.0049908697,0.9449464,0.047912017,0.00015862148],"about_ca_topic_score_codex":6.7368114e-7,"about_ca_topic_score_gemma":2.7078926e-7,"teacher_disagreement_score":0.7878489,"about_ca_system_score_codex":0.000056515542,"about_ca_system_score_gemma":0.00042289242,"threshold_uncertainty_score":0.7090737},"labels":[],"label_agreement":null},{"id":"W2141015333","doi":"10.1007/s00373-015-1545-2","title":"Geometric Spanning Cycles in Bichromatic Point Sets","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 Toronto; University of Waterloo","funders":"","keywords":"Spanning tree; Plane (geometry); Point (geometry); Colored; Cycle basis; Enhanced Data Rates for GSM Evolution","score_opus":0.027968230855121273,"score_gpt":0.2527124176888726,"score_spread":0.22474418683375133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141015333","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.9183454,0.0019293906,0.07758814,0.00038071643,0.0005774537,0.000103250546,5.536783e-7,0.000082895654,0.0009921975],"genre_scores_gemma":[0.9956398,0.000046400124,0.0041484176,0.00010525927,0.0000078980975,0.0000072620282,0.0000032274156,0.0000037759553,0.000037983235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915034,0.00004210915,0.00018242109,0.0002126798,0.00024790937,0.00016452887],"domain_scores_gemma":[0.99951077,0.000074717995,0.000054863278,0.00016198533,0.000078390316,0.00011926463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004319278,0.00009094508,0.0001252411,0.00060417096,0.00006175926,0.000114005634,0.00017840767,0.000039971717,0.0000010934414],"category_scores_gemma":[0.00007831409,0.00008804824,0.000024692408,0.0022738709,0.000016206666,0.00031795315,0.0001212101,0.00008232578,0.0000071283284],"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.000004083292,0.00019767623,0.024298465,0.000033599987,0.000013121291,0.000040843264,0.001323661,0.0016432564,0.00003556397,0.9228125,0.0019664469,0.04763076],"study_design_scores_gemma":[0.00091423385,0.0001621764,0.073473744,0.000024414201,0.0000043542054,0.000037569902,0.00010906326,0.081881806,0.0001708177,0.8421624,0.0008352061,0.00022423177],"about_ca_topic_score_codex":0.000029694427,"about_ca_topic_score_gemma":0.0000027250405,"teacher_disagreement_score":0.08065014,"about_ca_system_score_codex":0.000032642765,"about_ca_system_score_gemma":0.000052731728,"threshold_uncertainty_score":0.3590503},"labels":[],"label_agreement":null},{"id":"W2141096989","doi":"","title":"Bounded-Curvature Path Normalization","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"","keywords":"Bounded function; Normalization (sociology); Curvature; Mathematics; Path (computing); Computer science; Mathematical analysis; Geometry","score_opus":0.012956058346223341,"score_gpt":0.2180384118051253,"score_spread":0.20508235345890194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141096989","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.025005406,0.0001224298,0.9345096,0.004137985,0.0009086764,0.00026946815,0.00006960259,0.00020045498,0.034776375],"genre_scores_gemma":[0.9668527,0.0000038118558,0.028645413,0.002322484,0.000300948,0.000019216808,0.00066412287,0.0000139096355,0.0011773856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799144,0.0000764457,0.00034433982,0.00054739666,0.00059308525,0.00044727558],"domain_scores_gemma":[0.9985313,0.00013795788,0.00012996644,0.00031294275,0.0005617643,0.00032608362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024645755,0.00024034065,0.00017608576,0.00092610205,0.0004415869,0.00055685395,0.00057339884,0.0001365606,0.0001962646],"category_scores_gemma":[0.00005364798,0.00026434506,0.00007494643,0.0015957438,0.000051191204,0.00058825425,0.000051062372,0.0002131482,0.000329548],"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.00000280946,0.00004061392,0.00042024668,0.0000068870822,0.000011310187,0.000021140315,0.000039447263,0.11869648,0.000027178507,0.86388063,0.008944138,0.007909096],"study_design_scores_gemma":[0.0005667185,0.00013242924,0.050768103,0.000039831153,0.000009168016,0.000053486358,0.000017674953,0.64844424,0.00013629539,0.25788528,0.0413304,0.0006163693],"about_ca_topic_score_codex":0.0039796922,"about_ca_topic_score_gemma":0.0057394374,"teacher_disagreement_score":0.9418473,"about_ca_system_score_codex":0.00028558352,"about_ca_system_score_gemma":0.0013718163,"threshold_uncertainty_score":0.99998087},"labels":[],"label_agreement":null},{"id":"W2141214294","doi":"10.1142/s021819590300127x","title":"COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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":"Convex polygon; Center (category theory); Mathematics; Regular polygon; Polygon (computer graphics); Simple polygon; Combinatorics; Convex set; Point (geometry); Set (abstract data type); Planar; Polygon covering; Geometry; Computer science; Convex optimization; Computer graphics (images)","score_opus":0.014468167253318398,"score_gpt":0.2792880748208776,"score_spread":0.2648199075675592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141214294","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.029724915,0.0005759394,0.9664597,0.0009538188,0.00053324987,0.0002601872,0.00003003547,0.000015634536,0.0014465186],"genre_scores_gemma":[0.9192182,0.000030388652,0.08017632,0.0002752339,0.00020345165,0.0000116749625,0.000025697216,0.000009053134,0.00004999731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705607,0.00014569546,0.0011911746,0.00021975485,0.0012228843,0.0001644062],"domain_scores_gemma":[0.9944595,0.00095258595,0.0013777817,0.0002663491,0.0028529998,0.00009079712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009157154,0.0001640321,0.000304515,0.0007031457,0.00011490436,0.00008287017,0.0013961247,0.000059062862,0.000053942036],"category_scores_gemma":[0.00015696944,0.00013524314,0.00026179946,0.0011711153,0.00014366933,0.00039202516,0.00013703713,0.00021611921,0.000009054026],"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.000045708104,0.00085522776,0.0036310218,0.00003697958,0.00053154305,0.0000059378954,0.0004547816,0.32926524,0.0016864843,0.5921723,0.0008407164,0.07047406],"study_design_scores_gemma":[0.007854016,0.00089329795,0.053965174,0.0004446194,0.00022580435,0.0031170344,0.0007865478,0.18197975,0.03682093,0.4611762,0.25147128,0.0012653548],"about_ca_topic_score_codex":0.0000039471074,"about_ca_topic_score_gemma":7.0845573e-7,"teacher_disagreement_score":0.8894933,"about_ca_system_score_codex":0.000071297785,"about_ca_system_score_gemma":0.00039151288,"threshold_uncertainty_score":0.55150557},"labels":[],"label_agreement":null},{"id":"W2141507454","doi":"","title":"Multi-guard covers for polygonal regions","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on 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 British Columbia","funders":"","keywords":"Guard (computer science); Polygon (computer graphics); Boundary (topology); Simple polygon; Combinatorics; Cover (algebra); Regular polygon; Convex hull; Mathematics; Time complexity; Computer science; Geometry; Mathematical analysis; Engineering","score_opus":0.040816492942253306,"score_gpt":0.2785055720344605,"score_spread":0.2376890790922072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141507454","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.03887135,0.000019737123,0.94681084,0.008949122,0.0020736991,0.000468068,0.00021387415,0.00013492361,0.002458378],"genre_scores_gemma":[0.83193415,0.0000019059665,0.16381283,0.0028469365,0.00024013371,0.000054833305,0.00026663335,0.00001438547,0.0008282209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817383,0.000037268164,0.00029967033,0.0006061885,0.00039673704,0.0004863217],"domain_scores_gemma":[0.99780625,0.0004264451,0.0001118774,0.00036463706,0.0006510819,0.0006396817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030773788,0.00023248483,0.000191338,0.00094287726,0.00049891666,0.00034794357,0.00075179583,0.00015109101,0.00016191998],"category_scores_gemma":[0.00026246303,0.00026002605,0.0001289523,0.0008796998,0.00008915256,0.00037215662,0.00005045527,0.0003329096,0.000186281],"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.000010888937,0.00006939303,0.00014421932,0.000007944155,0.000032499604,0.000010081274,0.00008333612,0.03591024,0.0012171156,0.93750167,0.008409715,0.016602887],"study_design_scores_gemma":[0.0013230062,0.00019878987,0.01770095,0.000021929633,0.000011494711,0.000065891945,0.000035373523,0.8655634,0.00044856578,0.06922896,0.044757415,0.00064422045],"about_ca_topic_score_codex":0.0009854819,"about_ca_topic_score_gemma":0.009584568,"teacher_disagreement_score":0.8682727,"about_ca_system_score_codex":0.00012456776,"about_ca_system_score_gemma":0.0022399079,"threshold_uncertainty_score":0.9999852},"labels":[],"label_agreement":null},{"id":"W2141565952","doi":"10.1145/2229163.2229173","title":"Entropy, triangulation, and point location in planar subdivisions","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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":"Division of Computing and Communication Foundations; Office of International Science and Engineering","keywords":"Point location; Subdivision; Triangulation; Data structure; Point (geometry); Upper and lower bounds; Preprocessor; Distribution (mathematics); Computational geometry","score_opus":0.02101595205208065,"score_gpt":0.26423632378495143,"score_spread":0.24322037173287078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141565952","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.018501967,0.00020056029,0.9782203,0.0023525048,0.0004252461,0.0001717306,0.000004219169,0.0000682203,0.000055239325],"genre_scores_gemma":[0.8838943,0.00003580345,0.11563149,0.00017590131,0.00007671224,0.000027800146,0.000011054042,0.0000055163027,0.00014137212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991101,0.0000713029,0.0002083061,0.00021425092,0.0001981236,0.00019789391],"domain_scores_gemma":[0.9993056,0.00017803149,0.000042421238,0.0003074082,0.00006023773,0.000106277024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030574403,0.00010141307,0.00009559184,0.0003162771,0.00015347326,0.00006102435,0.00017444551,0.000053716103,0.000026402298],"category_scores_gemma":[0.000043546497,0.00010181589,0.000028986511,0.00071966153,0.000018545255,0.0007537555,0.000007177843,0.00011756072,0.0000522526],"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.000018319366,0.000475182,0.0005223069,0.00001118253,0.000022387827,0.0000023983816,0.0015808812,0.017007671,0.0006553419,0.032287326,0.00018330695,0.9472337],"study_design_scores_gemma":[0.0041904016,0.0005896067,0.3110359,0.000096077354,0.00005073568,0.00016402394,0.00030714777,0.5983257,0.01115026,0.06437156,0.008688271,0.001030256],"about_ca_topic_score_codex":0.00002830492,"about_ca_topic_score_gemma":0.000016451324,"teacher_disagreement_score":0.9462034,"about_ca_system_score_codex":0.00005668358,"about_ca_system_score_gemma":0.00003460837,"threshold_uncertainty_score":0.41519314},"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":"W2142763365","doi":"10.1109/tmag.2004.824714","title":"Toward Optimal Mesh Quality Improvements for Adaptive Finite Element Electromagnetics With Tetrahedra","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Tetrahedron; Benchmark (surveying); Finite element method; Electromagnetics; Computer science; Smoothing; Mesh generation; Adaptive mesh refinement; Quality (philosophy); Computational electromagnetics; Mathematical optimization; Computational science; Electromagnetic field; Electronic engineering; Mathematics; Physics; Structural engineering; Engineering; Geometry","score_opus":0.031366421182820195,"score_gpt":0.2701173491325584,"score_spread":0.23875092794973823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142763365","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.012708078,0.00003657089,0.98511004,0.00077659846,0.00037058746,0.0006681999,0.00005345058,0.00011893068,0.0001575478],"genre_scores_gemma":[0.66272956,0.000024767285,0.33628395,0.00032731472,0.00004616382,0.00012390429,0.000008823737,0.000013288554,0.0004422008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832016,0.00004319162,0.0003485329,0.0004660195,0.000454495,0.00036758592],"domain_scores_gemma":[0.999,0.00015956933,0.00010479568,0.00034271486,0.00026671976,0.00012621394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019847583,0.00022992893,0.00017920113,0.00017335232,0.00024136434,0.00013673643,0.00034483877,0.00007343501,0.00002561838],"category_scores_gemma":[0.000006605277,0.00022065369,0.00010123901,0.0004812933,0.000048461876,0.00025624075,0.0000036078347,0.00017814431,0.000015372752],"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.00022804731,0.00068743044,0.0000016711581,0.000030945634,0.00007795359,0.0000050475282,0.0007519845,0.85896367,0.0053578066,0.012537287,0.00005662491,0.12130156],"study_design_scores_gemma":[0.011022777,0.03254621,0.00058852317,0.000075315846,0.00022240702,0.000032864013,0.00031499242,0.47880232,0.45998317,0.010945232,0.00385801,0.0016081543],"about_ca_topic_score_codex":0.000038152913,"about_ca_topic_score_gemma":0.00006746105,"teacher_disagreement_score":0.6500215,"about_ca_system_score_codex":0.00013203928,"about_ca_system_score_gemma":0.00022601441,"threshold_uncertainty_score":0.8997996},"labels":[],"label_agreement":null},{"id":"W2143973853","doi":"10.1007/978-3-319-03841-4_33","title":"Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Combinatorics; Planar graph; Embedding; Vertex (graph theory); Book embedding; Vertex cover; Planar; Approximation algorithm; Time complexity; Planar straight-line graph; Discrete mathematics; Mathematics; Graph; Computer science; 1-planar graph; Chordal graph","score_opus":0.01653059770991138,"score_gpt":0.2465548600993402,"score_spread":0.2300242623894288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143973853","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.0009979379,0.00045238633,0.9938268,0.00048291648,0.0016370497,0.0003596681,0.0000088850165,0.000084490326,0.0021498825],"genre_scores_gemma":[0.35677353,0.00007105783,0.6401928,0.0008818153,0.00026908042,0.000019970474,0.0000484358,0.000033286837,0.0017100135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690765,0.000036351412,0.00060194026,0.0010891119,0.0009289637,0.00043595635],"domain_scores_gemma":[0.9974572,0.0006473546,0.00036983538,0.0009733058,0.00039737634,0.00015491867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048206854,0.00039264018,0.0004383622,0.0011235155,0.0002985213,0.00021501038,0.0019523255,0.00023462449,0.00007142414],"category_scores_gemma":[0.00008719348,0.00038051908,0.00014189754,0.000815641,0.00040584055,0.00059373025,0.0006727274,0.00036218876,0.00009719851],"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.000009116781,0.000073524636,0.000056951107,0.00009062724,0.000041579693,0.000022751274,0.0012313541,0.20927484,0.0021524932,0.18086746,0.00075135735,0.6054279],"study_design_scores_gemma":[0.00025795365,0.00015042779,0.00031395745,0.00022690158,0.000010964156,0.000047927173,2.5619926e-7,0.8132453,0.00300614,0.18033275,0.0018957854,0.0005116522],"about_ca_topic_score_codex":0.000021241769,"about_ca_topic_score_gemma":0.000040893105,"teacher_disagreement_score":0.6049163,"about_ca_system_score_codex":0.00023426092,"about_ca_system_score_gemma":0.00044926102,"threshold_uncertainty_score":0.9998647},"labels":[],"label_agreement":null},{"id":"W2144337080","doi":"10.1007/s00454-012-9420-x","title":"An Incidence Theorem in Higher Dimensions","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":120,"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":"Isaac Newton Institute for Mathematical Sciences","keywords":"Mathematics; Combinatorics; Bounded function; Dimension (graph theory); Polynomial; Degree (music); Incidence (geometry); Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.024675720790977365,"score_gpt":0.2908872514977361,"score_spread":0.26621153070675874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144337080","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.41037077,0.00046361896,0.5856595,0.0006138544,0.0008714023,0.00016857024,0.000008556426,0.0001526596,0.0016910828],"genre_scores_gemma":[0.92726445,0.000005319422,0.07120722,0.0009290761,0.00029568528,0.000022742177,0.00012573239,0.000013712332,0.0001360912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9978286,0.00019228586,0.00039843738,0.00044870132,0.00064699556,0.00048499127],"domain_scores_gemma":[0.9986809,0.0003714593,0.00011925886,0.0003944326,0.0001582522,0.00027568053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007189911,0.00021549348,0.00020019722,0.0006131857,0.00019311582,0.00015616223,0.0006226037,0.00008623544,0.00016891812],"category_scores_gemma":[0.000062833664,0.00021014822,0.00007746338,0.0019186224,0.00005969597,0.002136133,0.0002031376,0.00020821806,0.00018023852],"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.00001269551,0.0003006261,0.022696093,0.000009287957,0.000017556371,0.000009015037,0.00063441996,0.25086927,0.0004092331,0.7108425,0.00029800946,0.0139012765],"study_design_scores_gemma":[0.00048557227,0.00009400368,0.6631436,0.000024606106,0.0000072586777,0.000035711044,0.00005292406,0.27298772,0.0002357686,0.060620584,0.00186059,0.00045169215],"about_ca_topic_score_codex":0.000018763301,"about_ca_topic_score_gemma":0.0000036837441,"teacher_disagreement_score":0.65022194,"about_ca_system_score_codex":0.00009368606,"about_ca_system_score_gemma":0.00010178977,"threshold_uncertainty_score":0.8569596},"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":"W2144911699","doi":"10.1016/j.eswa.2005.01.019","title":"An ANN-based element extraction method for automatic mesh generation","year":2005,"lang":"en","type":"article","venue":"Expert Systems with Applications","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quadrilateral; Hexahedron; Computer science; Polygon mesh; Finite element method; Discretization; Artificial neural network; Tetrahedron; Mesh generation; Domain (mathematical analysis); Element (criminal law); Boundary (topology); Extended finite element method; Boundary element method; Algorithm; Artificial intelligence; Mathematics; Geometry; Structural engineering; Mathematical analysis; Engineering","score_opus":0.02655501869568558,"score_gpt":0.34333901438745673,"score_spread":0.3167839956917712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144911699","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.0004679841,0.00023946176,0.9954819,0.0014605502,0.00015284299,0.0017694337,0.00000891492,0.00030238568,0.00011654783],"genre_scores_gemma":[0.31754643,0.0000020543282,0.67527056,0.00033746156,0.00083715055,0.005680112,0.00018478169,0.00001261481,0.00012881731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985766,0.00010530757,0.0003543301,0.000468733,0.00030288243,0.00019218013],"domain_scores_gemma":[0.99871737,0.00011910444,0.0001898443,0.00056876056,0.00028893907,0.00011596839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047818955,0.00015158401,0.00014495452,0.00016580302,0.0003934888,0.00026214533,0.0003102459,0.000057651254,0.000010073124],"category_scores_gemma":[0.000007813339,0.00013528233,0.000042613472,0.00041555878,0.000010920488,0.0006344336,0.000011271426,0.00004925575,0.000024894962],"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.000010349074,0.0005066827,0.000020442376,0.00004576068,0.000041112697,3.498314e-7,0.0006527487,0.5205509,0.060623445,0.11744859,0.0072225174,0.2928771],"study_design_scores_gemma":[0.00035519307,0.00011406377,0.00005413391,0.000008354064,0.0000073946208,0.000012291788,0.00003610681,0.8837967,0.008713741,0.000078611774,0.10665986,0.00016357307],"about_ca_topic_score_codex":0.000029695466,"about_ca_topic_score_gemma":0.00003655263,"teacher_disagreement_score":0.3632458,"about_ca_system_score_codex":0.00013837148,"about_ca_system_score_gemma":0.00015422922,"threshold_uncertainty_score":0.5516653},"labels":[],"label_agreement":null},{"id":"W2144946213","doi":"10.1142/s0218195900000310","title":"THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"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":"Graph drawing; Graph; Computer science; Lattice graph; Theoretical computer science; Mathematics; Algorithm; Line graph; Voltage graph","score_opus":0.019812903323334543,"score_gpt":0.32708899494590643,"score_spread":0.3072760916225719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144946213","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.0047707027,0.00041226472,0.9873509,0.0037076278,0.00046593865,0.00052316516,0.00002984406,0.00006772722,0.0026718709],"genre_scores_gemma":[0.33252406,0.000069612724,0.6635395,0.0015867576,0.0014106008,0.00022567024,0.00011044029,0.000026576583,0.0005067499],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961808,0.00015987984,0.0011205104,0.00045205376,0.0017603812,0.0003263842],"domain_scores_gemma":[0.9956762,0.0010925229,0.00050797674,0.0003801386,0.0020374635,0.00030570014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014769001,0.0002594502,0.00027928784,0.000893586,0.0005998707,0.0007135387,0.002584717,0.00008085546,0.0000795442],"category_scores_gemma":[0.000086016196,0.00021596467,0.00030883309,0.0022671695,0.00008538815,0.0007634793,0.0001814886,0.00036708702,0.00012033062],"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.00006859793,0.00035893076,0.00003275669,0.0000033906085,0.00018685553,0.0000049695773,0.00009588789,0.38057914,0.00007785786,0.16708906,0.0012050804,0.45029745],"study_design_scores_gemma":[0.0024421979,0.00029311774,0.005173785,0.000037670274,0.00006270441,0.001377903,0.000074446405,0.24620156,0.00025686555,0.34043714,0.4030574,0.0005852141],"about_ca_topic_score_codex":0.0000056996223,"about_ca_topic_score_gemma":0.0000029251944,"teacher_disagreement_score":0.44971225,"about_ca_system_score_codex":0.00014533394,"about_ca_system_score_gemma":0.0004302308,"threshold_uncertainty_score":0.88067836},"labels":[],"label_agreement":null},{"id":"W2145386666","doi":"","title":"Direct Planar Tree Transformation and Counterexample","year":2008,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Counterexample; General position; Transformation (genetics); Object (grammar); Mathematics; Combinatorics; Position (finance); Tree (set theory); Planar; Simple (philosophy); Plane (geometry); Regular polygon; Enhanced Data Rates for GSM Evolution; Sequence (biology); Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.024342180376070034,"score_gpt":0.22225021915582918,"score_spread":0.19790803877975915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145386666","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.08376016,0.00005933375,0.88673544,0.0005365914,0.00008004754,0.0000562972,0.0000011030347,0.00008698533,0.028684024],"genre_scores_gemma":[0.9816431,0.000039193455,0.017389463,0.00035630874,0.00002917584,0.0000032951045,0.000008894129,0.0000014091521,0.00052916835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996145,0.000013902305,0.000084094216,0.000109184846,0.00011093567,0.000067430905],"domain_scores_gemma":[0.99981076,0.000037781054,0.00001444324,0.000076341945,0.000027054375,0.000033631055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000072279596,0.000044139942,0.000048109272,0.000058521342,0.0001132943,0.000032339485,0.00008182401,0.000015709444,0.000010906974],"category_scores_gemma":[0.000004615994,0.00003851745,0.000012898859,0.00014134457,0.000012039755,0.00044729444,0.000008964668,0.000020055913,0.000017175105],"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.00002766845,0.00016241333,0.0013081065,0.000036681082,0.00004552514,0.000027524682,0.010280769,0.0021592798,0.009992973,0.62186813,0.026061647,0.32802925],"study_design_scores_gemma":[0.0017769791,0.0003743195,0.122211725,0.000015258816,0.000009689867,0.00065440463,0.000075859316,0.64796084,0.03589885,0.009056976,0.18131629,0.000648791],"about_ca_topic_score_codex":0.000017853043,"about_ca_topic_score_gemma":0.000020419255,"teacher_disagreement_score":0.89788294,"about_ca_system_score_codex":0.000007532959,"about_ca_system_score_gemma":0.00001919999,"threshold_uncertainty_score":0.15706961},"labels":[],"label_agreement":null},{"id":"W2145427355","doi":"10.1142/s0218195900000115","title":"POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Visibility polygon; Visibility graph; Visibility; Mathematics; Graph; Set (abstract data type); Line segment; Dual graph; Line (geometry); Algorithm; Computer science; Combinatorics; Planar graph; Simple polygon; Geometry; Geography","score_opus":0.0072309491043516605,"score_gpt":0.2539805635127922,"score_spread":0.24674961440844054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145427355","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.08583861,0.0003203077,0.9100437,0.0023209546,0.00044008222,0.00027785427,0.0000650242,0.00005174163,0.00064173975],"genre_scores_gemma":[0.7522665,0.00022017857,0.24534042,0.0009699251,0.0008453799,0.000048361602,0.00021969092,0.00000827932,0.00008120246],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759555,0.000077301884,0.0009938612,0.00026480612,0.00092043343,0.00014806107],"domain_scores_gemma":[0.99723154,0.00036786665,0.0005493668,0.00021194314,0.0014753768,0.0001639084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189653,0.00017569093,0.00021652391,0.0006141256,0.00015794313,0.00039061543,0.0007052787,0.00007844565,0.00033946877],"category_scores_gemma":[0.000053637803,0.00017713725,0.00012504679,0.000642627,0.00007284396,0.0025518816,0.000103729384,0.0002216369,0.00010451526],"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.000050848932,0.00014494595,0.00037576898,0.000006170686,0.00013518236,0.0000027027338,0.000151655,0.09887744,0.00010137886,0.014468875,0.0002662802,0.8854188],"study_design_scores_gemma":[0.003399633,0.00036358426,0.04570068,0.00010843833,0.00008162775,0.001399508,0.0001507506,0.23468092,0.0014095942,0.5357033,0.17627583,0.0007261303],"about_ca_topic_score_codex":0.000017781354,"about_ca_topic_score_gemma":0.0000016866677,"teacher_disagreement_score":0.8846926,"about_ca_system_score_codex":0.00015724372,"about_ca_system_score_gemma":0.00020115853,"threshold_uncertainty_score":0.7223447},"labels":[],"label_agreement":null},{"id":"W2145677964","doi":"","title":"A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron.","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Tetrahedron; Partition (number theory); Combinatorics; Mathematics; Algorithm; Mathematical optimization; Computer science; Convex set; Convex optimization; Geometry","score_opus":0.025794518208532104,"score_gpt":0.24950504614207109,"score_spread":0.223710527933539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145677964","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.0032453286,0.00028427204,0.99290866,0.0011846478,0.00063094974,0.00047428661,0.000075253985,0.000030796058,0.0011658262],"genre_scores_gemma":[0.8421531,0.000011884152,0.15624286,0.0010965628,0.000077820136,0.000057803918,0.000051061223,0.000011902209,0.00029703302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840707,0.00009021469,0.0003718752,0.000393015,0.00040259975,0.0003352121],"domain_scores_gemma":[0.9978896,0.0007261823,0.00015988782,0.00031198675,0.0006692489,0.00024313728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033717786,0.00018384735,0.00019397693,0.0005874856,0.00030837473,0.00015200826,0.0005426913,0.00008560322,0.00011194905],"category_scores_gemma":[0.00020801992,0.00016494759,0.00009999934,0.0011430398,0.00008872232,0.0001705947,0.000022126918,0.00010406138,0.00002762435],"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.0000042121846,0.00005278459,0.0001815118,0.00001697108,0.000059622296,0.0000038124497,0.00016803882,0.114970334,0.000041503776,0.7207063,0.0018905936,0.16190434],"study_design_scores_gemma":[0.0005546192,0.00017363716,0.0067545213,0.000020750898,0.000014827127,0.000026901347,0.00005579989,0.942519,0.00029220432,0.040022213,0.0093288105,0.00023672075],"about_ca_topic_score_codex":0.00059354503,"about_ca_topic_score_gemma":0.00053312216,"teacher_disagreement_score":0.8389077,"about_ca_system_score_codex":0.00010902889,"about_ca_system_score_gemma":0.0017043283,"threshold_uncertainty_score":0.67263675},"labels":[],"label_agreement":null},{"id":"W2146326862","doi":"10.1109/iccitechn.2008.4803063","title":"Smallest and some new equiprojective polyhedra","year":2008,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Polyhedron; Dual polyhedron; Combinatorics; Regular polygon; Convex polytope; Mathematics; Integer points in convex polyhedra; Prism; Boundary (topology); Geometry; Convex set; Algorithm; Linear programming; Convex optimization; Physics; Mathematical analysis","score_opus":0.03207011078101623,"score_gpt":0.23444813432266517,"score_spread":0.20237802354164894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146326862","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.1362266,0.00027615431,0.8555914,0.0016761891,0.0001770273,0.00007519095,2.5835354e-7,0.000093488045,0.005883659],"genre_scores_gemma":[0.9135243,0.000038191232,0.07976222,0.0008581675,0.00017847055,0.0000021317378,0.000001306452,0.0000022453185,0.0056329397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995127,0.000012424357,0.00007423719,0.0001896346,0.000113407696,0.00009761077],"domain_scores_gemma":[0.9997247,0.000039048064,0.00001865136,0.00011139536,0.000030617797,0.000075589196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004866152,0.00005610913,0.000054407978,0.000076127275,0.00011433407,0.000040879804,0.00012786375,0.00002065261,0.000019772531],"category_scores_gemma":[0.000013845409,0.000049600574,0.00001601843,0.00020151396,0.000018017428,0.00036231295,0.00010170354,0.0000350553,0.00003367278],"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.0000057556313,0.000031683587,0.0012655248,0.000002771877,0.000014759367,0.000022601653,0.0010733177,0.0005606454,0.0017802931,0.913267,0.00849595,0.0734797],"study_design_scores_gemma":[0.0034922736,0.0010017094,0.32987756,0.000024220173,0.000015959069,0.0017421502,0.000104805804,0.30824804,0.037750952,0.27173382,0.044510853,0.0014976593],"about_ca_topic_score_codex":0.000066251385,"about_ca_topic_score_gemma":0.0000070649053,"teacher_disagreement_score":0.77729774,"about_ca_system_score_codex":0.000010456891,"about_ca_system_score_gemma":0.00011562078,"threshold_uncertainty_score":0.20226528},"labels":[],"label_agreement":null},{"id":"W2146448055","doi":"10.1007/s00454-003-2853-5","title":"Spanning Trees Crossing Few Barriers","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"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":"University of British Columbia; National Science Foundation","keywords":"Spanning tree; Combinatorics; Disjoint sets; Mathematics; Multiplicative function; Minimum spanning tree; Tree (set theory); Shortest-path tree; Minimum degree spanning tree; Line segment; Regular polygon; Plane (geometry); Line (geometry); Discrete mathematics; Geometry","score_opus":0.013820528404470164,"score_gpt":0.26648596864009155,"score_spread":0.2526654402356214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146448055","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.10584158,0.0004957007,0.8875955,0.00039414887,0.0006874995,0.00014427905,0.000009256581,0.00021887165,0.0046132025],"genre_scores_gemma":[0.81738657,0.0000032653618,0.18135326,0.00066560815,0.00011436345,0.0000133108515,0.00006470708,0.000017132927,0.0003818076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747676,0.0001742811,0.00045767397,0.00066563865,0.0007654236,0.0004602002],"domain_scores_gemma":[0.99852145,0.00037006862,0.00017903627,0.0003463884,0.00026936294,0.0003136832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059756666,0.00027877616,0.00024922428,0.00055193936,0.00091395935,0.00093900715,0.0005358349,0.00009091325,0.0001684773],"category_scores_gemma":[0.0003833211,0.00028992706,0.00016709813,0.0019545385,0.00012764505,0.0009998037,0.00013221512,0.00021540647,0.00012442927],"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.000007909456,0.000040487987,0.0032166091,0.000015784655,0.000058249538,0.000021301008,0.00071234454,0.62355816,0.00032311186,0.3543273,0.0009140207,0.016804734],"study_design_scores_gemma":[0.0016486401,0.00018935323,0.059909098,0.00007892124,0.000032338165,0.00021845028,0.00041903587,0.7696875,0.00230455,0.12966785,0.034571543,0.0012727176],"about_ca_topic_score_codex":0.0000091842285,"about_ca_topic_score_gemma":0.000002591333,"teacher_disagreement_score":0.711545,"about_ca_system_score_codex":0.00009336784,"about_ca_system_score_gemma":0.0004773674,"threshold_uncertainty_score":0.9999553},"labels":[],"label_agreement":null},{"id":"W2146986633","doi":"","title":"Speed-Constrained Geodesic Fr echet Distance Inside a Simple Polygon","year":2010,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Simple polygon; Geodesic; Polygon (computer graphics); Tree traversal; Simple (philosophy); Path (computing); Mathematics; Shortest path problem; Combinatorics; Geometry; Monotone polygon; Computer science; Algorithm; Telecommunications; Graph","score_opus":0.012402516864988824,"score_gpt":0.2468450217936542,"score_spread":0.23444250492866536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146986633","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.24229279,0.000014500142,0.7450767,0.0010275248,0.00043144805,0.00009099765,0.0000031695906,0.00016925202,0.01089362],"genre_scores_gemma":[0.9219992,0.0000012891617,0.07624528,0.00070983876,0.00015669677,0.0000032144821,0.000014919662,0.000004634405,0.0008649071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990728,0.000023225364,0.0001791356,0.00030779827,0.00021167102,0.00020537837],"domain_scores_gemma":[0.99930376,0.00010012588,0.000054153406,0.00035289483,0.00008624951,0.000102840095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020848167,0.000108592336,0.00009693572,0.000095556155,0.00012348681,0.00016286931,0.000372873,0.000053398366,0.00015228952],"category_scores_gemma":[0.000067775225,0.00010013388,0.00004810365,0.00041637925,0.000038439808,0.0004635022,0.00009607335,0.00015727238,0.000115368995],"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.000006172734,0.00008668604,0.000576949,0.000007062844,0.000011651593,0.000013121528,0.00020668565,0.0026505538,0.07383668,0.832175,0.0028423485,0.08758706],"study_design_scores_gemma":[0.00065840787,0.00008945973,0.011947017,0.0000059940494,0.000006628779,0.00008193898,0.000025669278,0.7601786,0.0772259,0.08492375,0.06435976,0.00049684645],"about_ca_topic_score_codex":0.00004349237,"about_ca_topic_score_gemma":0.00019376846,"teacher_disagreement_score":0.75752807,"about_ca_system_score_codex":0.000013853234,"about_ca_system_score_gemma":0.00010732597,"threshold_uncertainty_score":0.40833414},"labels":[],"label_agreement":null},{"id":"W2147026670","doi":"10.1007/s00453-010-9430-0","title":"Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Delaunay triangulation; Bowyer–Watson algorithm; Constrained Delaunay triangulation; Leverage (statistics); Preprocessor; Theory of computation; Computer science; Point set triangulation; Pitteway triangulation; Computation; Set (abstract data type); Minimum-weight triangulation; Mathematics; Algorithm; Combinatorics; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.010255348993698373,"score_gpt":0.2685664990955038,"score_spread":0.2583111501018054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147026670","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.056294434,0.000058274352,0.94173694,0.000875247,0.00051482837,0.00023860001,0.0000052644396,0.00008679229,0.00018959932],"genre_scores_gemma":[0.5920597,0.0000013557658,0.40723172,0.00018199426,0.00027286788,0.000033054246,0.000014588375,0.000005905685,0.00019881857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991887,0.00001713397,0.00017440642,0.00033876384,0.00013174984,0.00014920853],"domain_scores_gemma":[0.9992749,0.0001947061,0.00007026996,0.00022895161,0.00014928317,0.00008187853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030076795,0.00008973628,0.0000968584,0.00008613522,0.0001903771,0.00017547507,0.00019976521,0.000060997303,0.000009995492],"category_scores_gemma":[0.00014021748,0.00008730297,0.000036124427,0.00021300658,0.0000234401,0.0004138571,0.000073613235,0.00008310725,0.0000057673606],"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.000014284498,0.000040121304,0.000016852666,0.000011509322,0.000010137539,0.0000010515388,0.0002152494,0.00008470999,0.013756359,0.023297345,0.00032675025,0.9622256],"study_design_scores_gemma":[0.0012086757,0.000096829535,0.004960474,0.000008072359,0.00001313393,0.00005728023,0.000010415506,0.83123696,0.030344974,0.12131574,0.010493654,0.00025377414],"about_ca_topic_score_codex":0.0000016902303,"about_ca_topic_score_gemma":0.000004054708,"teacher_disagreement_score":0.9619719,"about_ca_system_score_codex":0.000007641361,"about_ca_system_score_gemma":0.000062075975,"threshold_uncertainty_score":0.35601118},"labels":[],"label_agreement":null},{"id":"W2147347210","doi":"10.1109/focs.2009.34","title":"Instance-Optimal Geometric Algorithms","year":2009,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":43,"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":"Permutation (music); Mathematics; Algorithm; Random permutation; Convex hull; Constant (computer programming); Upper and lower bounds; Multilinear map; Class (philosophy); Mathematical proof; Regular polygon; Combinatorics; Set (abstract data type); Order (exchange); Discrete mathematics; Computer science; Block (permutation group theory); Artificial intelligence","score_opus":0.01445412203769846,"score_gpt":0.2488348487213628,"score_spread":0.23438072668366433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147347210","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.009140373,0.00014646159,0.9721153,0.0016426262,0.00023041149,0.000054734985,3.3119494e-7,0.00016890664,0.016500862],"genre_scores_gemma":[0.66715837,0.000010623791,0.3293165,0.0011824148,0.00010877981,0.0000017407185,0.0000033043327,0.000001438754,0.0022168288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992678,0.000013845756,0.00012353974,0.0002171881,0.00022631655,0.00015127673],"domain_scores_gemma":[0.99960905,0.00003249028,0.000028640408,0.00019133219,0.00007482046,0.000063644766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013276526,0.00006964241,0.000067866255,0.0002723793,0.00008058071,0.000111311034,0.00026988058,0.000026666941,0.000039848437],"category_scores_gemma":[0.000021862897,0.000062825085,0.00003462757,0.001545193,0.0000061232986,0.0004678302,0.000036472335,0.000051943254,0.00011324613],"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.0000014752302,0.0000590806,0.000019567655,7.160042e-7,0.0000032512212,0.0000058356477,0.000049408074,0.007968857,0.00027598496,0.1903925,0.0037093696,0.79751396],"study_design_scores_gemma":[0.00074793486,0.00048949936,0.03325894,0.0000059563,0.00000431434,0.000062758,0.000013111308,0.86030126,0.009851138,0.029533727,0.0652682,0.00046312876],"about_ca_topic_score_codex":0.0000017923767,"about_ca_topic_score_gemma":4.2114e-7,"teacher_disagreement_score":0.8523324,"about_ca_system_score_codex":0.000022447983,"about_ca_system_score_gemma":0.000038471324,"threshold_uncertainty_score":0.25619325},"labels":[],"label_agreement":null},{"id":"W2147508044","doi":"10.1145/1824777.1824781","title":"Finding one tight cycle","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Contractible space; Homotopy; Genus; Surface (topology); Class (philosophy); Binary logarithm; Boundary (topology); Simple (philosophy); Set (abstract data type); Discrete mathematics; Pure mathematics; Computer science; Geometry; Botany; Mathematical analysis","score_opus":0.022929474871582388,"score_gpt":0.2668963827719354,"score_spread":0.243966907900353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147508044","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.016762603,0.000010898714,0.9778851,0.0027756281,0.0014239068,0.00009626784,0.0000053103186,0.00019133788,0.0008489184],"genre_scores_gemma":[0.62547827,0.000007161924,0.37334955,0.0002787894,0.00014122101,0.000020170362,0.0000041622307,0.000007158713,0.00071350625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990739,0.000023587805,0.00015236327,0.0003000364,0.00026692022,0.00018316932],"domain_scores_gemma":[0.9990955,0.00013589377,0.000036888374,0.0005673295,0.00006720417,0.00009715696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016410388,0.000103970335,0.00008883388,0.00019895905,0.00030868815,0.00012243612,0.0005086132,0.00007032509,0.00020524146],"category_scores_gemma":[0.000024249322,0.00010823382,0.00006707173,0.0005355291,0.000023859136,0.00040660857,0.00001173326,0.00030601933,0.0002726259],"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.0000034282602,0.00023038195,0.0000045290412,0.000003578719,0.000023685318,0.0000041743856,0.00020161043,0.0072946814,0.007883548,0.011248047,0.0000972222,0.9730051],"study_design_scores_gemma":[0.0015930617,0.000391718,0.00856228,0.000032539727,0.000041192216,0.0001263944,0.00003180509,0.691445,0.17237437,0.09352349,0.030941103,0.0009370425],"about_ca_topic_score_codex":0.000012505632,"about_ca_topic_score_gemma":0.000020678022,"teacher_disagreement_score":0.9720681,"about_ca_system_score_codex":0.000019220955,"about_ca_system_score_gemma":0.00005033058,"threshold_uncertainty_score":0.4413647},"labels":[],"label_agreement":null},{"id":"W2147664710","doi":"","title":"Application of computational geometry to network p-center location problems","year":2008,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Ackermann function; Center (category theory); Combinatorics; Measure (data warehouse); Function (biology); Mathematics; Computational geometry; Tree (set theory); Inverse; Binary logarithm; Geometry; Algorithm; Discrete mathematics; Computer science; Data mining; Crystallography","score_opus":0.0278149769113654,"score_gpt":0.2411485933884939,"score_spread":0.2133336164771285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147664710","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.04200441,0.000086117616,0.9519481,0.0024424002,0.000489463,0.00066648395,0.00008714267,0.00011306759,0.0021627916],"genre_scores_gemma":[0.9214062,0.0000073208025,0.07499099,0.0024163174,0.00022990964,0.000081545666,0.00065042457,0.000022134613,0.00019516237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967913,0.00011475198,0.00072752114,0.00081317994,0.0009680473,0.000585203],"domain_scores_gemma":[0.9965782,0.0003302673,0.00029306934,0.0004852986,0.0016312917,0.0006818405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044524702,0.00033066727,0.0003633215,0.0015453844,0.0004931975,0.000118996904,0.0008842593,0.0001523529,0.00008388958],"category_scores_gemma":[0.00013293349,0.00038128765,0.00010845798,0.00422971,0.00011379204,0.00045503897,0.000118528376,0.0002474058,0.00042274946],"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.000010502227,0.00010063162,0.0026241732,0.000024148,0.000032006385,0.0000059201748,0.00018136876,0.8067718,0.000022738845,0.17158754,0.0037666145,0.014872559],"study_design_scores_gemma":[0.00077669433,0.00030433736,0.099998474,0.00009307703,0.000008872715,0.00010596673,0.00001952005,0.8427004,0.00005906496,0.04510209,0.010230828,0.0006006583],"about_ca_topic_score_codex":0.0013700455,"about_ca_topic_score_gemma":0.0010339536,"teacher_disagreement_score":0.8794018,"about_ca_system_score_codex":0.0003311849,"about_ca_system_score_gemma":0.0017826947,"threshold_uncertainty_score":0.9998639},"labels":[],"label_agreement":null},{"id":"W2147807119","doi":"10.1016/s0166-218x(00)00172-4","title":"Three-dimensional orthogonal graph drawing algorithms","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","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":"McGill University","funders":"","keywords":"Bounded function; Combinatorics; Vertex (graph theory); Mathematics; Minimum bounding box; Intersection (aeronautics); Graph drawing; Grid; Enhanced Data Rates for GSM Evolution; Graph; Degree (music); Discrete mathematics; Geometry; Computer science; Image (mathematics); Engineering","score_opus":0.014679116435725587,"score_gpt":0.23931201544788847,"score_spread":0.22463289901216288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147807119","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.04330986,0.000055497887,0.94539183,0.00022096821,0.00011659631,0.0002120076,0.0000055403857,0.0001910535,0.01049664],"genre_scores_gemma":[0.20088202,0.000005511889,0.7981248,0.00040274905,0.00017551015,0.00004755781,0.00005268407,0.000019599409,0.00028957645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853545,0.000008151617,0.00032551773,0.00035605973,0.0005063253,0.00026846802],"domain_scores_gemma":[0.99925417,0.00011686164,0.000079269674,0.000392858,0.00005054483,0.00010631964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024959806,0.00018465299,0.00018736687,0.0001037688,0.00023126947,0.00014618762,0.00043130285,0.000062266176,0.0002957845],"category_scores_gemma":[0.000008006476,0.00016646333,0.00009028586,0.00049811695,0.000042275562,0.00022173887,0.00010033316,0.00012353202,0.00032643552],"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.000008046292,0.00015798477,0.000008490512,0.00003876203,0.000048665912,0.0000112388125,0.0005558637,0.019199463,0.0018819448,0.7970002,0.0011629772,0.17992632],"study_design_scores_gemma":[0.00044625363,0.000035777914,0.00040171007,0.000025696745,0.000017749428,0.00004651528,0.000017315428,0.5947886,0.0017363909,0.39985153,0.002238771,0.0003936575],"about_ca_topic_score_codex":0.000002244916,"about_ca_topic_score_gemma":0.0000037957232,"teacher_disagreement_score":0.5755892,"about_ca_system_score_codex":0.00001804045,"about_ca_system_score_gemma":0.000057250694,"threshold_uncertainty_score":0.67881775},"labels":[],"label_agreement":null},{"id":"W2148015778","doi":"10.1145/1824777.1824782","title":"On the bichromatic <i>k</i> -set problem","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Combinatorics; Conjecture; Upper and lower bounds; Mathematics; Integer (computer science); Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.018571819834400153,"score_gpt":0.25108339719550715,"score_spread":0.232511577361107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148015778","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.0110831885,0.0000066694797,0.9754172,0.011081015,0.00094344007,0.00023829156,0.000007752772,0.00016116879,0.0010612635],"genre_scores_gemma":[0.7889512,0.0000069747375,0.20770109,0.0022173559,0.00011424109,0.000107670494,0.0000050548847,0.000011567576,0.000884832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989852,0.000054482258,0.00017044683,0.00028080394,0.00033259456,0.00017652051],"domain_scores_gemma":[0.9984815,0.0005334847,0.000047346006,0.000804153,0.00006424875,0.00006925412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002970773,0.00012668816,0.0000846756,0.00012467359,0.00039653073,0.00014895816,0.0007353122,0.00005752192,0.00017269819],"category_scores_gemma":[0.000042307365,0.000088663204,0.00007417716,0.00059062126,0.00003972512,0.00021534495,0.000011029132,0.0003689081,0.00037889535],"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.000008901138,0.00040374172,0.0000017214069,0.000011038877,0.000056510235,0.00000716781,0.0007534521,0.016571414,0.004635874,0.15232508,0.0031175064,0.8221076],"study_design_scores_gemma":[0.0010840963,0.000721592,0.0009560445,0.00005758797,0.00003651875,0.00014273364,0.000063134685,0.5053565,0.041256655,0.42686674,0.0227479,0.0007104886],"about_ca_topic_score_codex":0.000009638248,"about_ca_topic_score_gemma":0.000015610225,"teacher_disagreement_score":0.8213971,"about_ca_system_score_codex":0.00001632661,"about_ca_system_score_gemma":0.0000606043,"threshold_uncertainty_score":0.48700595},"labels":[],"label_agreement":null},{"id":"W2148022401","doi":"","title":"When can a graph form an orthogonal polyhedron","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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":"Polyhedron; Vertex (graph theory); Combinatorics; Mathematics; Regular polygon; Integer points in convex polyhedra; Convex polytope; Graph; Convex set; Algorithm; Geometry; Convex optimization; Linear programming","score_opus":0.02769961273247762,"score_gpt":0.24791843677306832,"score_spread":0.2202188240405907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148022401","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.1965676,0.00006324326,0.7842578,0.011525442,0.0008469725,0.0003614997,0.00014146301,0.00022655234,0.006009423],"genre_scores_gemma":[0.94769937,0.000003896831,0.046501003,0.0049406206,0.00019544207,0.000026672622,0.0004200264,0.000017977509,0.00019501317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975035,0.00006582982,0.00037192402,0.0007422988,0.00070679496,0.00060965796],"domain_scores_gemma":[0.997836,0.000096156364,0.00012194741,0.0004440198,0.00049295154,0.0010089035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029504608,0.00030443445,0.00023100934,0.0014393266,0.00048351754,0.00046953792,0.0009090025,0.00013647952,0.00022412413],"category_scores_gemma":[0.000059591483,0.00033589467,0.0001049784,0.0012646262,0.0000844984,0.0007306299,0.00006685455,0.00028175118,0.00017415159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073423885,0.0000792566,0.00021316916,0.0000065176678,0.00002463793,0.000044335065,0.00040380566,0.1325382,0.00003401557,0.836016,0.0004273116,0.030205432],"study_design_scores_gemma":[0.001213973,0.00055337854,0.028838325,0.00005412619,0.000010775118,0.00013832522,0.00007921081,0.09085364,0.00018925098,0.87413245,0.0031465676,0.00078994915],"about_ca_topic_score_codex":0.006978568,"about_ca_topic_score_gemma":0.035903946,"teacher_disagreement_score":0.7511318,"about_ca_system_score_codex":0.0004594894,"about_ca_system_score_gemma":0.003656898,"threshold_uncertainty_score":0.9999093},"labels":[],"label_agreement":null},{"id":"W2148103003","doi":"10.1111/cgf.12162","title":"An Efficient Algorithm for Determining an Aesthetic Shape Connecting Unorganized 2D Points","year":2013,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Boundary (topology); Mathematics; Algorithm; Euclidean geometry; Graph; Greedy algorithm; Computer science; Topology (electrical circuits); Geometry; Combinatorics","score_opus":0.015186877846450035,"score_gpt":0.2548097368812492,"score_spread":0.23962285903479916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148103003","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.24981816,0.000033553555,0.748168,0.00042283387,0.00082629634,0.0004444787,0.0000036939593,0.00027411157,0.000008900341],"genre_scores_gemma":[0.52848667,0.0000014902084,0.47009566,0.0011263177,0.00017349393,0.00004199643,0.000047140602,0.000022797565,0.000004409771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792004,0.000117634176,0.00039683355,0.000725322,0.00030781227,0.00053239026],"domain_scores_gemma":[0.9983758,0.0001551188,0.0001681025,0.0005973041,0.00043938047,0.00026432108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046846355,0.0002557825,0.00024115518,0.00036641676,0.00058168446,0.0006979938,0.00092127686,0.000104682586,0.000014300153],"category_scores_gemma":[0.000015805055,0.00025963492,0.00012196766,0.0006946368,0.000040665967,0.0008649013,0.0002233124,0.00014968953,0.000029487042],"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.000002843461,0.0002091545,0.00014584804,0.000009642752,0.000015539485,0.000004343689,0.0005991277,0.008704992,0.00027234858,0.035536677,0.00027677126,0.95422274],"study_design_scores_gemma":[0.0007393235,0.0006026952,0.0009676987,0.000019128012,0.000007960518,0.000091767324,0.000044396285,0.9885445,0.000596442,0.007410799,0.0006311211,0.0003441454],"about_ca_topic_score_codex":0.000011669994,"about_ca_topic_score_gemma":0.000005250335,"teacher_disagreement_score":0.9798395,"about_ca_system_score_codex":0.000029433939,"about_ca_system_score_gemma":0.00006617057,"threshold_uncertainty_score":0.9999856},"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":"W2148592822","doi":"10.46298/dmtcs.2072","title":"Coloring and Guarding Arrangements","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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":"Ministerio de Ciencia e Innovación; European Social Fund; Fonds De La Recherche Scientifique - FNRS; Generalitat de Catalunya; European Commission","keywords":"Hypergraph; Combinatorics; Vertex (graph theory); Chromatic scale; Mathematics; Bounded function; Monochromatic color; Discrete mathematics; Graph; Physics","score_opus":0.014122451922976868,"score_gpt":0.25474507892729725,"score_spread":0.24062262700432038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148592822","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.092321515,0.000023657278,0.90231854,0.00071995816,0.00028856192,0.0002526081,4.9103187e-7,0.00011099234,0.003963688],"genre_scores_gemma":[0.604691,0.000002765597,0.3950281,0.00018847999,0.00005510776,0.000016083639,5.8782416e-7,0.000004346878,0.000013452237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815154,0.000038448827,0.00028525825,0.0005113798,0.00061400735,0.00039939382],"domain_scores_gemma":[0.9988418,0.00022242502,0.00007812419,0.00044015938,0.00019400928,0.00022347586],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008410607,0.00016519711,0.00017688899,0.00018803061,0.0004489041,0.0010845285,0.00097390777,0.000032034382,0.00005357437],"category_scores_gemma":[0.00009077661,0.00013511092,0.000042190157,0.0007643828,0.00068289915,0.0011302496,0.00091923133,0.00010632705,0.000099420555],"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":[4.3412925e-7,0.000025038818,0.000026879567,0.00001683511,0.000005044323,0.0000015230058,0.00067302166,0.0001666516,0.0017353984,0.9795534,0.00005218864,0.017743565],"study_design_scores_gemma":[0.000105349696,0.00005349996,0.00048589357,0.000026309124,0.000003488674,0.000019185893,0.000024743635,0.69551057,0.0013464232,0.3022365,0.000043381737,0.00014468083],"about_ca_topic_score_codex":0.0000018191782,"about_ca_topic_score_gemma":1.183297e-7,"teacher_disagreement_score":0.6953439,"about_ca_system_score_codex":0.00002821231,"about_ca_system_score_gemma":0.000041901232,"threshold_uncertainty_score":0.99995244},"labels":[],"label_agreement":null},{"id":"W2148824790","doi":"10.1007/3-540-45848-4_26","title":"Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Grid; Integer (computer science); Planar graph; Planar; Plane (geometry); Line (geometry); Graph; Prism; Discrete mathematics; Geometry; Computer science; Physics; Computer graphics (images); Optics","score_opus":0.023111314092956158,"score_gpt":0.26273113543295257,"score_spread":0.2396198213399964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148824790","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.0031923628,0.00033866792,0.99146837,0.0011859485,0.0011218064,0.00034281306,0.0000045131346,0.000097522076,0.0022479831],"genre_scores_gemma":[0.79823637,0.00008483631,0.19868486,0.001865663,0.0005596082,0.000011101824,0.000014485566,0.000030379728,0.00051270996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967755,0.000037217764,0.00051498006,0.0013774057,0.0008232088,0.00047167088],"domain_scores_gemma":[0.99810284,0.00063438463,0.00018130972,0.000730759,0.0001884897,0.00016222917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045956727,0.0004431028,0.0004088691,0.0015345555,0.00022153548,0.00039257,0.0011676094,0.00018170675,0.000028530514],"category_scores_gemma":[0.0001165198,0.00039929544,0.00006939339,0.0011894396,0.00032448713,0.00048730502,0.0007075885,0.00085388974,0.000026459364],"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.00001294189,0.0000929015,0.00013544182,0.00002056375,0.000010567604,0.00017767875,0.0005613398,0.29783422,0.00035569718,0.1362238,0.000053620777,0.56452125],"study_design_scores_gemma":[0.0004877568,0.00025672428,0.0014052927,0.00031548578,0.0000047053345,0.000057672645,6.400745e-8,0.8219533,0.00044947985,0.17396213,0.00061900873,0.00048839214],"about_ca_topic_score_codex":0.00003011516,"about_ca_topic_score_gemma":0.00024445364,"teacher_disagreement_score":0.795044,"about_ca_system_score_codex":0.0002017929,"about_ca_system_score_gemma":0.00023255676,"threshold_uncertainty_score":0.99984586},"labels":[],"label_agreement":null},{"id":"W2148852797","doi":"10.1145/2185520.2185592","title":"Efficient geometrically exact continuous collision detection","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":117,"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 British Columbia","funders":"","keywords":"Collision detection; Computer science; Solver; Rounding; Algorithm; Collision; Curvature; Nonlinear system; Degenerate energy levels; Mathematics; Geometry; Physics","score_opus":0.018383710757754784,"score_gpt":0.24996401306419552,"score_spread":0.23158030230644075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148852797","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.14686325,0.0001287774,0.85096335,0.00038427062,0.0011394216,0.00017371387,0.000004412466,0.00018521395,0.0001575744],"genre_scores_gemma":[0.9789725,0.00003875001,0.020382307,0.0003828216,0.000092858085,0.000030414785,0.0000037719947,0.000009969242,0.000086584005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985649,0.00009083326,0.00024923834,0.0002911056,0.0004814289,0.00032251154],"domain_scores_gemma":[0.99862665,0.0003830404,0.00007932156,0.0005656851,0.0001665849,0.00017870587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047232248,0.00015398662,0.00013524998,0.00083051866,0.00042385558,0.000099647834,0.00043179278,0.0001103174,0.000025324853],"category_scores_gemma":[0.000096422875,0.00014953269,0.00013676022,0.0029233163,0.00003152518,0.0002743441,0.000014475147,0.00024563467,0.000082080216],"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.00006842187,0.0019168343,0.00029204346,0.000021940457,0.00009555548,0.0000048514553,0.0006837236,0.24056886,0.00556127,0.016749388,0.00024481455,0.7337923],"study_design_scores_gemma":[0.0029733293,0.0018525962,0.06439358,0.00007330195,0.00016456276,0.00026507178,0.00013545903,0.7322654,0.14109641,0.009389528,0.045580216,0.001810508],"about_ca_topic_score_codex":0.000013618844,"about_ca_topic_score_gemma":0.0000060543675,"teacher_disagreement_score":0.8321093,"about_ca_system_score_codex":0.00006375014,"about_ca_system_score_gemma":0.000034809495,"threshold_uncertainty_score":0.6097766},"labels":[],"label_agreement":null},{"id":"W2149305893","doi":"10.1142/s0218195907002471","title":"A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS","year":2007,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","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":"Voronoi diagram; Algorithm; Correctness; Intersection (aeronautics); Approximation algorithm; Mathematics; Triangulation; Planar; Metric (unit); Bowyer–Watson algorithm; Computer science; Delaunay triangulation","score_opus":0.011804474993635954,"score_gpt":0.28480258702338795,"score_spread":0.272998112029752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149305893","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.00059260166,0.00033450194,0.9955174,0.0011263965,0.0003773232,0.0011822139,0.00012465267,0.00009150413,0.00065340626],"genre_scores_gemma":[0.045643434,0.000026664418,0.95018613,0.00066599256,0.002145116,0.00047400853,0.0005862868,0.000029257497,0.00024309436],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99661094,0.000045416087,0.0011267437,0.00046882912,0.0014051318,0.0003429514],"domain_scores_gemma":[0.9939017,0.00080501294,0.0010225223,0.00030682824,0.00371527,0.00024862093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012185506,0.00027778037,0.0003115042,0.0013693224,0.00030191525,0.00032195894,0.0015053065,0.00011377779,0.000015709866],"category_scores_gemma":[0.00003475175,0.00026399942,0.00022906002,0.0014820338,0.00009472628,0.00097291864,0.0000889825,0.00025604555,0.000030576866],"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.00007905263,0.0004782248,0.00013279275,0.000021633132,0.0003319613,0.000010663864,0.000095608746,0.06158021,0.00030048614,0.28910625,0.000993004,0.6468701],"study_design_scores_gemma":[0.0042950017,0.0005947652,0.0039303983,0.00006681877,0.00012710154,0.0016219815,0.0001458932,0.15107253,0.0024788324,0.32548022,0.5092888,0.0008976307],"about_ca_topic_score_codex":0.00000379693,"about_ca_topic_score_gemma":0.0000032978987,"teacher_disagreement_score":0.6459725,"about_ca_system_score_codex":0.0002605757,"about_ca_system_score_gemma":0.00043783474,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W2149317979","doi":"10.1016/j.tcs.2010.10.038","title":"On the red/blue spanning tree problem","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","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 Regina","funders":"Division of Biological Infrastructure; National Natural Science Foundation of China","keywords":"Combinatorics; Spanning tree; Mathematics; Shortest-path tree; Euclidean minimum spanning tree; Minimum spanning tree; Vertex (graph theory); k-minimum spanning tree; Convex hull; Tree (set theory); Minimum degree spanning tree; Path (computing); K-ary tree; Regular polygon; Geometry; Tree structure; Graph; Binary tree; Computer science","score_opus":0.00984460314560611,"score_gpt":0.23983971626585446,"score_spread":0.22999511312024834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149317979","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.11805861,0.0000032548269,0.86276734,0.0074875206,0.0009385506,0.0001646003,3.868862e-7,0.00014626526,0.010433462],"genre_scores_gemma":[0.8403347,4.1152535e-7,0.157947,0.001444459,0.00022591911,0.00000989915,5.6207324e-7,0.000004615248,0.0000324121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979003,0.0000896503,0.00021170608,0.0006023684,0.00077819807,0.000417776],"domain_scores_gemma":[0.9980892,0.000666128,0.0000628707,0.00080363563,0.00019765228,0.00018054806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002017695,0.00015358225,0.0001122849,0.00017232633,0.00076284475,0.0006512678,0.0024186105,0.000045261433,0.00007289787],"category_scores_gemma":[0.00019994026,0.00009794082,0.000056652963,0.0014434428,0.0012432716,0.00045694792,0.0006418757,0.00040778008,0.0001363782],"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.0000030516223,0.000034381876,0.0000075578555,0.0000011660916,0.0000016704491,0.0000033152432,0.00021636469,0.0012169875,0.003423929,0.945429,0.0003373044,0.049325258],"study_design_scores_gemma":[0.00008723851,0.00012628158,0.00064577285,0.000009511003,0.0000014598926,0.000030921812,0.000001932251,0.55702555,0.008807887,0.43243963,0.0006912076,0.0001326341],"about_ca_topic_score_codex":9.78773e-7,"about_ca_topic_score_gemma":0.0000011518199,"teacher_disagreement_score":0.7222761,"about_ca_system_score_codex":0.000021902237,"about_ca_system_score_gemma":0.00013966321,"threshold_uncertainty_score":0.62801903},"labels":[],"label_agreement":null},{"id":"W2149491715","doi":"10.1109/acv.1998.732878","title":"Structural lines for triangulations of terrain","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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 British Columbia","funders":"","keywords":"Triangulation; Terrain; Curvature; Surface (topology); Skeleton (computer programming); Triangulated irregular network; Geometry; Mathematics; Computer science; Geography; Cartography","score_opus":0.04957254116366572,"score_gpt":0.2799106782503227,"score_spread":0.23033813708665696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149491715","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.042610236,0.000048148413,0.95488113,0.001079707,0.00017785624,0.000103343766,0.0000025572144,0.0000317602,0.0010652633],"genre_scores_gemma":[0.82278943,6.0155736e-7,0.1753827,0.00007999393,0.000072881,0.000005342246,0.000004598388,0.0000011107472,0.0016633661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996782,0.000008541334,0.0001120114,0.000083558574,0.0000662262,0.00005147895],"domain_scores_gemma":[0.99970514,0.00007748047,0.000032507636,0.000093567396,0.00007435981,0.000016937996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000052000316,0.000031413838,0.000046933877,0.000061512066,0.000044225293,0.00001907921,0.00011563922,0.000013489689,0.00007124065],"category_scores_gemma":[0.000038824703,0.000026399859,0.000034370227,0.00018031345,0.0000069276725,0.00015208876,0.000017282133,0.000010265179,0.0000033976798],"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.0000043845325,0.000040769835,0.0001718427,0.000016534916,0.00001808961,2.3322295e-7,0.0009929939,0.026436545,0.0054252073,0.63525957,0.009480224,0.32215363],"study_design_scores_gemma":[0.00022841274,0.00003578655,0.0015598251,0.0000012065342,0.0000015003924,0.0000018608632,0.0000046667265,0.9833212,0.0028574904,0.009560975,0.0023863593,0.000040747585],"about_ca_topic_score_codex":0.0000023415055,"about_ca_topic_score_gemma":0.0000037490906,"teacher_disagreement_score":0.9568846,"about_ca_system_score_codex":0.0000036827344,"about_ca_system_score_gemma":0.0000060403945,"threshold_uncertainty_score":0.107655495},"labels":[],"label_agreement":null},{"id":"W2149627013","doi":"10.1061/9780784413609.034","title":"Uncertainty Management in Feature-Based Geometric Modelling and Data Exchange","year":2014,"lang":"en","type":"article","venue":"","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":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"A priori and a posteriori; Representation (politics); Feature (linguistics); Computer science; Cover (algebra); Homeomorphism (graph theory); Topology (electrical circuits); Theoretical computer science; Algorithm; Mathematics; Discrete mathematics","score_opus":0.04859503971836485,"score_gpt":0.274054038715118,"score_spread":0.22545899899675317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149627013","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.0028519714,0.00024418195,0.9934265,0.00081671064,0.000095927855,0.00010567393,0.0000012130885,0.0000424414,0.0024153483],"genre_scores_gemma":[0.70205784,0.000037348025,0.29677343,0.0006156384,0.000042413536,0.000006567375,0.00004590728,0.0000027748213,0.00041807335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992043,0.000039838855,0.000092450275,0.00036251152,0.00017443803,0.00012650469],"domain_scores_gemma":[0.9993717,0.00009009896,0.000024582765,0.00044749072,0.000024009989,0.00004211519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005559213,0.00006848218,0.00007032527,0.00041403098,0.0000476063,0.00010120424,0.00044656813,0.000023912542,0.000006339939],"category_scores_gemma":[0.000013180776,0.00006217892,0.000008575563,0.0009566193,0.0000075517537,0.0002759293,0.0003114716,0.000048892838,0.0000068209342],"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.0000025703678,0.000026420646,0.000079442114,0.00001940279,0.000003715604,0.0000019229997,0.000018317967,0.702345,0.0000026474736,0.039466556,0.00093611004,0.2570979],"study_design_scores_gemma":[0.0003062258,0.000018111492,0.00067988207,0.0000061618825,0.0000020069429,9.020103e-7,0.0000026266764,0.98251456,0.000041095413,0.0025342405,0.013813403,0.00008079956],"about_ca_topic_score_codex":0.00003226191,"about_ca_topic_score_gemma":0.00002512007,"teacher_disagreement_score":0.6992059,"about_ca_system_score_codex":0.000017323326,"about_ca_system_score_gemma":0.000010725476,"threshold_uncertainty_score":0.25355828},"labels":[],"label_agreement":null},{"id":"W2149884111","doi":"","title":"Computing Nice Sweeps for Polyhedra and Polygons","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Polyhedron; Monotone polygon; Combinatorics; Regular polygon; Polygon (computer graphics); Mathematics; Rectilinear polygon; Simple polygon; Convex polygon; Convex set; Polygon covering; Krein–Milman theorem; Convex polytope; Computer science; Geometry; Convex optimization","score_opus":0.02848420590755417,"score_gpt":0.2638921882300127,"score_spread":0.23540798232245852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149884111","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.05836974,0.00014440653,0.92965,0.00874744,0.00052218064,0.00035198347,0.00008242012,0.00011025488,0.0020215341],"genre_scores_gemma":[0.8975875,0.0000053054073,0.09885318,0.0031116295,0.0001693905,0.000015532203,0.0001319824,0.000013581505,0.00011194438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982315,0.000037065598,0.00031028234,0.00060900796,0.00032941185,0.0004827648],"domain_scores_gemma":[0.9982468,0.00044457254,0.000107944215,0.00024333138,0.00039557525,0.0005617658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028376022,0.0002329645,0.00021305589,0.00083715376,0.0005611164,0.00050392735,0.00047441674,0.000104639716,0.000022340777],"category_scores_gemma":[0.0001735885,0.00026400297,0.00007329984,0.0008575887,0.00007523085,0.00044994042,0.00007588167,0.00017328392,0.000055633183],"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.0000061734668,0.00003061606,0.00008947203,0.000014445992,0.00002380174,0.000008179873,0.0001950317,0.116861336,0.0000517458,0.82960445,0.00036039753,0.052754335],"study_design_scores_gemma":[0.0026295255,0.0005565732,0.03587692,0.00013485528,0.00002193716,0.00014169178,0.00014553677,0.6357786,0.00039447888,0.3145851,0.008680854,0.0010539391],"about_ca_topic_score_codex":0.001705321,"about_ca_topic_score_gemma":0.0023359552,"teacher_disagreement_score":0.8392177,"about_ca_system_score_codex":0.00023491253,"about_ca_system_score_gemma":0.0016298281,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W2150037097","doi":"10.1007/s00373-010-0957-2","title":"Every Large Point Set contains Many Collinear Points or an Empty Pentagon","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Carleton University","funders":"","keywords":"Pentagon; Conjecture; Integer (computer science); Set (abstract data type); Plane (geometry); Point (geometry)","score_opus":0.01543672156284936,"score_gpt":0.26288012353766144,"score_spread":0.24744340197481207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150037097","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.87591684,0.00007092629,0.12128166,0.0004888683,0.0016204342,0.00020060604,0.000020525047,0.00013527086,0.00026488653],"genre_scores_gemma":[0.9932167,0.00004595262,0.0056825797,0.0006458363,0.00004943072,0.000012412851,0.000040437215,0.000008725425,0.00029791018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885,0.000055376284,0.00020577449,0.0003635958,0.00027134852,0.0002539269],"domain_scores_gemma":[0.9991443,0.00007053357,0.00007878589,0.00035102767,0.00016197616,0.00019334652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043615932,0.000149416,0.00015404563,0.00015569251,0.00031064267,0.00022844477,0.0003403769,0.000089678644,0.00003971681],"category_scores_gemma":[0.000036391288,0.00013004463,0.000050349336,0.0005903863,0.000029076176,0.00056209724,0.00015768876,0.00021454506,0.000009880959],"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.00002581845,0.00029527405,0.003435378,0.000013832004,0.000015699807,0.000028478189,0.00040366195,0.000049804847,0.0004570369,0.9919471,0.0013960508,0.0019318758],"study_design_scores_gemma":[0.004592326,0.0015254641,0.048697434,0.000022956108,0.00003927741,0.00025925104,0.00034444203,0.39788252,0.0036366093,0.50043744,0.041465655,0.001096612],"about_ca_topic_score_codex":0.000017070497,"about_ca_topic_score_gemma":0.00004658676,"teacher_disagreement_score":0.49150965,"about_ca_system_score_codex":0.000014589002,"about_ca_system_score_gemma":0.00008530721,"threshold_uncertainty_score":0.53030664},"labels":[],"label_agreement":null},{"id":"W2150278422","doi":"10.20382/jocg.v3i1a5","title":"Colouring the triangles determined by a point set","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Australian Government","keywords":"Mathematics; Set (abstract data type); Combinatorics; Point (geometry); Geometry; Computer science","score_opus":0.02403805481280369,"score_gpt":0.20679438843507247,"score_spread":0.18275633362226879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150278422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21173434,0.00016038155,0.7844769,0.00084638444,0.00046567136,0.00011023131,0.000008490766,0.000032958313,0.0021646656],"genre_scores_gemma":[0.958671,0.000021292646,0.040119298,0.00036421895,0.00012925502,2.7927211e-7,0.000007311556,0.000007461415,0.0006798965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998475,0.00019082369,0.00039041415,0.00019624896,0.0005489484,0.00019853252],"domain_scores_gemma":[0.9981416,0.00043457624,0.0005266154,0.00017525762,0.0005764414,0.00014551765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059170945,0.00014966741,0.00021789175,0.0007885746,0.00025419422,0.000099571735,0.000999841,0.00006153733,0.00006022402],"category_scores_gemma":[0.00008785094,0.00012489285,0.00019794436,0.0015542132,0.000068851834,0.00094379456,0.00017391382,0.00022500748,0.000013399184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015920268,0.0018855669,0.00543575,0.0001180935,0.0018608317,0.0019757643,0.01232348,0.27297267,0.0042891474,0.46255547,0.090016596,0.14497459],"study_design_scores_gemma":[0.019449012,0.0054541677,0.08117853,0.00034635182,0.000632626,0.004888559,0.0041021593,0.29867104,0.016326005,0.15276583,0.41317657,0.003009154],"about_ca_topic_score_codex":0.000010099214,"about_ca_topic_score_gemma":0.000001987761,"teacher_disagreement_score":0.7469366,"about_ca_system_score_codex":0.000120188764,"about_ca_system_score_gemma":0.00024693736,"threshold_uncertainty_score":0.50929826},"labels":[],"label_agreement":null},{"id":"W2150278829","doi":"10.1142/s0218195903001281","title":"PROPERTIES OF ARRANGEMENT GRAPHS","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"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; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; General position; Hyperplane; Hamiltonian path; Line segment; Graph; Discrete mathematics; Geometry","score_opus":0.01914964241694904,"score_gpt":0.2647208432120246,"score_spread":0.24557120079507555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150278829","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.02303578,0.0012584323,0.97285634,0.00072754896,0.0005992521,0.00027232553,0.000010714063,0.000027281134,0.0012123347],"genre_scores_gemma":[0.8688473,0.000065191736,0.13051778,0.00023789758,0.00017887849,0.00004627682,0.0000136290055,0.000009106115,0.00008391108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997332,0.00010036621,0.0009350126,0.00023254586,0.0012428311,0.00015727304],"domain_scores_gemma":[0.995987,0.00019499299,0.00079918234,0.00021606138,0.0026887013,0.000114042836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066551287,0.00015974212,0.0002424233,0.001000078,0.0000990782,0.00011991941,0.0010970975,0.00005278214,0.00005196458],"category_scores_gemma":[0.00010290504,0.00015007833,0.00021906105,0.0010977213,0.00008291294,0.00062919664,0.00008693245,0.0001601922,0.00002389939],"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.00003052672,0.0006321315,0.0006198494,0.00003214146,0.000383582,0.0000065685927,0.00020445134,0.16940272,0.004184246,0.772146,0.00058781926,0.051769987],"study_design_scores_gemma":[0.0032913182,0.0004223217,0.0065245386,0.00019397825,0.00010341048,0.0009748266,0.00024139707,0.01582308,0.050281096,0.6589404,0.2624107,0.0007929402],"about_ca_topic_score_codex":0.000002246996,"about_ca_topic_score_gemma":5.4971275e-7,"teacher_disagreement_score":0.84581155,"about_ca_system_score_codex":0.00008809561,"about_ca_system_score_gemma":0.00036665276,"threshold_uncertainty_score":0.61200166},"labels":[],"label_agreement":null},{"id":"W2151289047","doi":"","title":"The Bichromatic Rectangle Problem in High Dimensions.","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"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 Saskatchewan","funders":"","keywords":"Rectangle; Set (abstract data type); Point (geometry); Combinatorics; Space (punctuation); Algorithm; Mathematics; Computer science; Discrete mathematics; Geometry","score_opus":0.015620461884556005,"score_gpt":0.2340983481156226,"score_spread":0.2184778862310666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151289047","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.4230486,0.0009821801,0.4303276,0.105819106,0.0023637866,0.0018423136,0.000052036397,0.00043778785,0.035126626],"genre_scores_gemma":[0.97259444,0.000016156715,0.024265049,0.0026560805,0.00006559964,0.000018727345,0.000044710905,0.000006028886,0.00033317896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981718,0.00012540369,0.00036842946,0.00042569704,0.00045985178,0.00044880368],"domain_scores_gemma":[0.9985186,0.00049530255,0.00009823186,0.00032791216,0.00025713237,0.000302849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049355126,0.00018302313,0.00016897614,0.00074239273,0.0004674363,0.00036518648,0.00067396986,0.000077008575,0.000037411082],"category_scores_gemma":[0.0001399644,0.00015573438,0.00004834282,0.0018319645,0.000048055357,0.00028134964,0.000035998186,0.00023179206,0.00016887813],"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.0000049683417,0.000042277497,0.000111264155,0.0000028948907,0.000008059198,0.000026614493,0.000097997996,0.06875783,0.000027456455,0.8346088,0.00260729,0.093704574],"study_design_scores_gemma":[0.0005504475,0.00027253502,0.066503964,0.000074885145,0.0000035666667,0.00003523578,0.00003664212,0.40236756,0.000053861262,0.5250234,0.0047052014,0.00037271148],"about_ca_topic_score_codex":0.0014630558,"about_ca_topic_score_gemma":0.0052489536,"teacher_disagreement_score":0.5495459,"about_ca_system_score_codex":0.00028798718,"about_ca_system_score_gemma":0.0012317031,"threshold_uncertainty_score":0.63506633},"labels":[],"label_agreement":null},{"id":"W2151369108","doi":"10.1142/s0218195909003088","title":"EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Intersection (aeronautics); Complement (music); Disjoint sets; Class (philosophy); Mathematics; Set (abstract data type); Object (grammar); Theoretical computer science; Computer science; Combinatorics; Artificial intelligence","score_opus":0.019258034141779803,"score_gpt":0.30260727728707343,"score_spread":0.28334924314529364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151369108","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.018348088,0.0003733728,0.97487473,0.0037013313,0.0011446237,0.0003680901,0.000057083467,0.000087453496,0.0010452169],"genre_scores_gemma":[0.914805,0.000045260316,0.0824102,0.0012017117,0.0011282795,0.000021973528,0.0002642699,0.000013147746,0.00011014102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962836,0.00008284034,0.0010389135,0.0005617832,0.0017667003,0.00026617112],"domain_scores_gemma":[0.9954423,0.00053619384,0.00094578584,0.0006326892,0.0022373307,0.00020573782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084741256,0.00027134863,0.00030990646,0.0024552518,0.00023350024,0.00041528288,0.0029796066,0.000098250835,0.000047357225],"category_scores_gemma":[0.00019457437,0.00026617077,0.00018801812,0.002740204,0.000063692925,0.0007199901,0.00027184995,0.00037039188,0.00012662078],"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.000079553014,0.00071053806,0.00005503903,0.0000055808487,0.00016439855,0.000021946387,0.00007584113,0.6709178,0.00023135,0.03627611,0.0024894553,0.28897238],"study_design_scores_gemma":[0.0031035654,0.0011865197,0.029982926,0.00017253472,0.00008778142,0.0012224881,0.000097006305,0.7811897,0.0018076451,0.07530924,0.10491905,0.0009215434],"about_ca_topic_score_codex":0.0000043731175,"about_ca_topic_score_gemma":7.979695e-7,"teacher_disagreement_score":0.8964569,"about_ca_system_score_codex":0.00027871222,"about_ca_system_score_gemma":0.00037832552,"threshold_uncertainty_score":0.9999791},"labels":[],"label_agreement":null},{"id":"W2151490491","doi":"10.1002/jgt.21912","title":"Crossing Numbers of Periodic Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"Grantová Agentura České Republiky","keywords":"Mathematics; Combinatorics; Crossing number (knot theory); Graph; Limit (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.022121964918611042,"score_gpt":0.2670039297928634,"score_spread":0.24488196487425237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151490491","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.49763495,0.0008766628,0.49966195,0.00014354206,0.00069827086,0.000023002836,4.870722e-7,0.000008650371,0.0009524852],"genre_scores_gemma":[0.973288,0.000010871533,0.026453292,0.00010846081,0.00007060539,2.5828336e-7,3.034337e-7,0.000003035391,0.00006518037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902225,0.00013756994,0.00032628627,0.000075760996,0.00034576707,0.000092355076],"domain_scores_gemma":[0.99890476,0.00010404078,0.0003498372,0.00013028545,0.0004037958,0.000107270615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015288057,0.00006279983,0.00014171274,0.00032290537,0.000080350714,0.00010590862,0.00035167998,0.000028847835,0.000007222424],"category_scores_gemma":[0.00012115757,0.000051766146,0.00013696394,0.00053842756,0.00011142238,0.00047542382,0.000040685503,0.0001016694,0.0000025479367],"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.00015921067,0.00018233364,0.0022515445,0.000021599793,0.00011067764,0.000042767064,0.0069803973,0.011488149,0.005187961,0.90427816,0.0026550663,0.066642135],"study_design_scores_gemma":[0.0008433466,0.00034425984,0.004388667,0.000052337757,0.000020154179,0.0003475485,0.00034276958,0.0014407053,0.0056137987,0.9839298,0.0025478126,0.00012877316],"about_ca_topic_score_codex":0.0000017962482,"about_ca_topic_score_gemma":4.9202924e-7,"teacher_disagreement_score":0.47565305,"about_ca_system_score_codex":0.000016354486,"about_ca_system_score_gemma":0.00024792165,"threshold_uncertainty_score":0.21109623},"labels":[],"label_agreement":null},{"id":"W2151606606","doi":"10.1142/s0218195904001433","title":"PATHWIDTH AND LAYERED DRAWINGS OF TREES","year":2004,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Graph drawing; Mathematics; Line (geometry); Layer (electronics); Planar; Pathwidth; Geometry; Graph; Upper and lower bounds; Computer science; Line graph; Computer graphics (images); Mathematical analysis; Materials science; Artificial intelligence","score_opus":0.009141361070416429,"score_gpt":0.26573960444992983,"score_spread":0.2565982433795134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151606606","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.06456247,0.0006119151,0.93202317,0.0019990802,0.00028258294,0.00018479385,0.000022056289,0.000027105361,0.00028683024],"genre_scores_gemma":[0.8206175,0.000064052874,0.17867748,0.0002572166,0.00030952427,0.00001889831,0.000024780167,0.0000067867036,0.000023757824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978082,0.000038193524,0.00080499914,0.0002440058,0.0009651744,0.00013942798],"domain_scores_gemma":[0.9968818,0.0003212596,0.0007264323,0.0001669725,0.0017709163,0.00013265393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041788068,0.00015336751,0.0002445939,0.00086987065,0.00010150569,0.00014279963,0.0009044144,0.00006120928,0.000015486265],"category_scores_gemma":[0.000070623355,0.00015225675,0.00014417816,0.0008256572,0.00009927331,0.00073933677,0.00016723908,0.00016404483,0.000010609247],"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.000040071343,0.0004424155,0.0008597368,0.000019654753,0.0002523326,0.000014385696,0.00035007464,0.442187,0.002018773,0.41334608,0.00013851831,0.14033094],"study_design_scores_gemma":[0.0043030255,0.00044584105,0.04837407,0.0001400977,0.000059077018,0.0012315463,0.00013041122,0.014370604,0.0066000046,0.88455445,0.039268214,0.0005226486],"about_ca_topic_score_codex":0.000007745579,"about_ca_topic_score_gemma":0.0000026458204,"teacher_disagreement_score":0.75605506,"about_ca_system_score_codex":0.00009647586,"about_ca_system_score_gemma":0.0003547559,"threshold_uncertainty_score":0.620885},"labels":[],"label_agreement":null},{"id":"W2152434295","doi":"10.1007/3-540-45995-2_42","title":"On the Spanning Ratio of Gabriel Graphs and β-skeletons","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":77,"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; McGill University; Carleton University","funders":"","keywords":"Combinatorics; Spanning tree; Spanner; Minimum spanning tree; Mathematics; Euclidean geometry; Delaunay triangulation; Euclidean minimum spanning tree; Minimum degree spanning tree; Graph; Discrete mathematics; Computer science; Geometry","score_opus":0.019683777115230446,"score_gpt":0.23207563186094182,"score_spread":0.21239185474571137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152434295","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.0010178206,0.00034257007,0.9932287,0.0015032038,0.0005811454,0.0002379594,0.0000025526856,0.00004309294,0.0030430031],"genre_scores_gemma":[0.8451791,0.000110063,0.15086389,0.002650054,0.00021471435,0.000010218076,0.00000467426,0.000022772449,0.00094451284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797225,0.000034683217,0.0003365522,0.0007256638,0.00066939846,0.0002614349],"domain_scores_gemma":[0.9978399,0.0010321006,0.00021652842,0.0006649505,0.00017305269,0.000073439944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058015593,0.00026812707,0.00026171474,0.0005833593,0.00026854174,0.00024150184,0.0011497922,0.00012285198,0.000024233397],"category_scores_gemma":[0.00011736349,0.00020122969,0.00007542964,0.0006188717,0.00045965213,0.00026163703,0.0004461648,0.0004088413,0.00000908254],"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.0000021756348,0.000017737304,0.000012919723,0.000013655065,0.000009941249,0.000008858551,0.0005543005,0.06997497,0.00023238815,0.68813974,0.00009517505,0.24093813],"study_design_scores_gemma":[0.00011251493,0.00015511143,0.00023107558,0.0001617247,0.000005473642,0.00002731382,1.1571088e-7,0.57386875,0.0014574656,0.42331085,0.00042445995,0.0002451297],"about_ca_topic_score_codex":0.0000062139698,"about_ca_topic_score_gemma":0.0000064594856,"teacher_disagreement_score":0.8441613,"about_ca_system_score_codex":0.000046611338,"about_ca_system_score_gemma":0.00014703901,"threshold_uncertainty_score":0.82059085},"labels":[],"label_agreement":null},{"id":"W2152446315","doi":"10.1142/s0218195903001153","title":"On Computing a Largest Empty Arbitrarily Oriented Rectangle","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"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 Windsor","funders":"","keywords":"Rectangle; Mathematics; Combinatorics; Bounded function; Point (geometry); Set (abstract data type); Binary logarithm; Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.010404289121629183,"score_gpt":0.28026560062544614,"score_spread":0.269861311503817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152446315","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.018130181,0.000320888,0.9748742,0.0010473359,0.0012198257,0.00031799913,0.000023254686,0.000082966406,0.0039833775],"genre_scores_gemma":[0.7980837,0.000021306558,0.19982783,0.001258521,0.0005504993,0.000030101148,0.000063306245,0.000019082196,0.00014563739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965354,0.00017797334,0.001009266,0.0004353559,0.0015544136,0.00028754794],"domain_scores_gemma":[0.99520636,0.001071942,0.0008377464,0.00030485063,0.0023537637,0.00022532359],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091702776,0.00026076316,0.00030118463,0.0011891287,0.0002724619,0.00029631783,0.0012281784,0.00009781363,0.000092702496],"category_scores_gemma":[0.00031733265,0.00026317447,0.00026108482,0.0016725117,0.00006609881,0.0006656605,0.000112099515,0.0004158336,0.00012664121],"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.00003683926,0.0006049967,0.00034101264,0.0000076923825,0.00020308443,0.00002565927,0.000098759025,0.2118528,0.00016568592,0.7556893,0.0014741842,0.029499969],"study_design_scores_gemma":[0.004185327,0.00066213,0.008252819,0.0001505768,0.000068039306,0.0018585771,0.00010599931,0.062589005,0.00276132,0.54947114,0.3688957,0.0009993181],"about_ca_topic_score_codex":0.0000026614723,"about_ca_topic_score_gemma":9.105567e-7,"teacher_disagreement_score":0.77995354,"about_ca_system_score_codex":0.00024273277,"about_ca_system_score_gemma":0.00049150933,"threshold_uncertainty_score":0.99998206},"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":"W2154954519","doi":"10.1002/nme.1519","title":"3D hybrid mesh generation for reservoir simulation","year":2005,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Polygon mesh; Volume mesh; T-vertices; Mesh generation; Computer science; Quadrilateral; Finite volume method; Grid; Computational science; Mathematical optimization; Finite element method; Algorithm; Mathematics; Geometry; Engineering; Computer graphics (images); Structural engineering","score_opus":0.057717493473883066,"score_gpt":0.41808717933143613,"score_spread":0.3603696858575531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154954519","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.0020763979,0.00016716281,0.9922181,0.0017603858,0.0034689032,0.00022498713,0.0000061361584,0.000055337805,0.000022614522],"genre_scores_gemma":[0.13288248,0.00001614302,0.8646684,0.0002128135,0.0020543982,0.000057738012,0.0000200219,0.000014113439,0.00007388879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866396,0.00007013241,0.0004854104,0.00025526824,0.0003072569,0.00021795108],"domain_scores_gemma":[0.9983297,0.00090415374,0.00013218669,0.000118326876,0.00043092447,0.000084717234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001300624,0.00013051151,0.0001540782,0.00038762836,0.000092033806,0.00023956948,0.00051650894,0.000047741916,0.0000086023165],"category_scores_gemma":[0.0012674055,0.00013495369,0.00012813514,0.00022148085,0.0000055156897,0.0008084605,0.000063888925,0.0001640557,0.000002398413],"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.000016038846,0.0000295676,0.000007269743,0.000003924009,0.000021507645,0.000001426723,0.00005294577,0.74934024,0.0044344664,0.0056070667,0.00019830649,0.24028726],"study_design_scores_gemma":[0.0005437527,0.00005621949,0.000053692205,0.000015291851,0.000004101652,0.00003300275,0.0000017951079,0.91208225,0.0073640463,0.002509686,0.07719687,0.00013926718],"about_ca_topic_score_codex":0.0000011692222,"about_ca_topic_score_gemma":5.870519e-7,"teacher_disagreement_score":0.24014798,"about_ca_system_score_codex":0.0002574794,"about_ca_system_score_gemma":0.00005198247,"threshold_uncertainty_score":0.55032516},"labels":[],"label_agreement":null},{"id":"W2155070046","doi":"10.1142/s021819590900312x","title":"ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"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; Universities Space Research Association","keywords":"Combinatorics; Convex polygon; Polygon (computer graphics); Mathematics; Polygon covering; Rectilinear polygon; Regular polygon; Simple polygon; Set (abstract data type); Line segment; Star-shaped polygon; Line (geometry); Convex set; Geometry; Computer science; Convex optimization","score_opus":0.015199704029000286,"score_gpt":0.28677835300601806,"score_spread":0.2715786489770178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155070046","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.15688933,0.00011369259,0.84064776,0.0014127691,0.00020861675,0.00024329871,0.000034763707,0.00001908522,0.00043067423],"genre_scores_gemma":[0.93434423,0.000012976098,0.064886115,0.00041488986,0.00022076088,0.000013682467,0.000047252553,0.000009010726,0.00005110416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972229,0.000060108323,0.0010200064,0.00026904736,0.0012691708,0.0001587523],"domain_scores_gemma":[0.9955438,0.00055969734,0.0013400498,0.00022610556,0.0022183189,0.000112079244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043179386,0.0001936568,0.00034511826,0.0011915187,0.00006845047,0.00007016755,0.0010136064,0.000060459755,0.000036400343],"category_scores_gemma":[0.000077969176,0.00017388682,0.00017894867,0.0010982448,0.00008282971,0.00040678825,0.00007332063,0.00021236176,0.0000074527857],"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.00049302075,0.0013357878,0.00044801334,0.00004033704,0.0005672383,0.000020387128,0.0007529294,0.7482831,0.0063831033,0.11133969,0.00043228202,0.12990415],"study_design_scores_gemma":[0.011811513,0.009705707,0.022148011,0.0014470011,0.000282677,0.0022904389,0.00068774616,0.4141492,0.052022994,0.47523934,0.008692331,0.0015230551],"about_ca_topic_score_codex":0.0000026976602,"about_ca_topic_score_gemma":7.235798e-7,"teacher_disagreement_score":0.77745485,"about_ca_system_score_codex":0.0001013209,"about_ca_system_score_gemma":0.00028667971,"threshold_uncertainty_score":0.7090898},"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":"W2155100327","doi":"10.1007/978-3-642-31770-5_10","title":"Crossing Angles of Geometric Graphs","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Calgary","funders":"","keywords":"Combinatorics; Bounded function; Crossing number (knot theory); Vertex (graph theory); Graph drawing; 1-planar graph; Mathematics; Graph; Spatial network; Computer science; Line graph; Mathematical analysis","score_opus":0.021919141543357588,"score_gpt":0.2545826128338116,"score_spread":0.23266347129045403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155100327","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.00088045123,0.0032220157,0.9924974,0.00013592135,0.001615961,0.00019782272,0.0000047613844,0.00007529553,0.0013703641],"genre_scores_gemma":[0.58686084,0.000058036825,0.4121939,0.00031326403,0.00036539973,0.0000032792705,0.000008239555,0.000018384644,0.00017864165],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705875,0.0000279319,0.00053948036,0.0008605404,0.0010150211,0.0004982629],"domain_scores_gemma":[0.9977925,0.00048644815,0.00038116353,0.0008198585,0.00037078583,0.0001492487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095434434,0.0003543564,0.00042895303,0.0024470272,0.00028466404,0.00045502317,0.0018234903,0.0002220945,0.000025369822],"category_scores_gemma":[0.00010531897,0.00033695306,0.00015037808,0.002229675,0.0006524866,0.0007981191,0.00078761345,0.00039627764,0.000021294769],"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.000002362466,0.00003302408,0.00011202719,0.00003673696,0.000008799855,0.000008302424,0.00034467466,0.036962584,0.00038896772,0.04089516,0.000010294572,0.92119706],"study_design_scores_gemma":[0.00061297225,0.00037371778,0.0048692087,0.00057202816,0.000030210744,0.00017256156,2.3536649e-7,0.39183757,0.019591851,0.57484907,0.005531089,0.0015594675],"about_ca_topic_score_codex":0.000012631776,"about_ca_topic_score_gemma":0.00001218694,"teacher_disagreement_score":0.9196376,"about_ca_system_score_codex":0.00013475804,"about_ca_system_score_gemma":0.0005364733,"threshold_uncertainty_score":0.99990827},"labels":[],"label_agreement":null},{"id":"W2155175290","doi":"10.1016/j.tcs.2012.03.021","title":"Euclidean chains and their shortcuts","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Chinese University of Hong Kong; University of Hong Kong","keywords":"Computer science; Combinatorics; Euclidean geometry; Euclidean distance; Mathematics; Algebra over a field; Algorithm; Artificial intelligence; Pure mathematics; Geometry","score_opus":0.01138904384297347,"score_gpt":0.2426906368052338,"score_spread":0.23130159296226033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155175290","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.09871715,0.00012001571,0.8969374,0.0010654406,0.00064735784,0.00008823559,7.197933e-7,0.000123165,0.00230057],"genre_scores_gemma":[0.9251858,0.0000058460164,0.07365341,0.0007996422,0.00031809747,0.0000034691118,8.5251315e-7,0.000004024008,0.000028858416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851096,0.0000718715,0.00017029195,0.00040133393,0.00034373096,0.00050180126],"domain_scores_gemma":[0.9988902,0.00019837797,0.000036545745,0.00039438985,0.00010664584,0.0003738166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014564635,0.00014180467,0.0001272479,0.00017645306,0.0003978829,0.0003014864,0.00082942017,0.000032876935,0.000019031722],"category_scores_gemma":[0.000051721756,0.00010619865,0.000033611715,0.00089222274,0.000939327,0.0010933729,0.00077308447,0.000109621586,0.000038474896],"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.0000012804733,0.00003449953,0.00016389218,0.000002092598,0.0000019319518,6.3772495e-7,0.00066639605,0.000073487856,0.0006541699,0.93076354,0.000072818206,0.067565225],"study_design_scores_gemma":[0.0001604872,0.00013207835,0.00970979,0.000011709231,0.0000026628225,0.00012598156,0.000012024852,0.87999505,0.0096894475,0.09830839,0.0015555788,0.0002968037],"about_ca_topic_score_codex":9.3135145e-7,"about_ca_topic_score_gemma":2.0979753e-7,"teacher_disagreement_score":0.87992156,"about_ca_system_score_codex":0.00002750141,"about_ca_system_score_gemma":0.00005537076,"threshold_uncertainty_score":0.4330655},"labels":[],"label_agreement":null},{"id":"W2155875791","doi":"10.1016/j.ipl.2003.09.019","title":"A note on maximum independent sets in rectangle intersection graphs","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Computational Geometry and Mesh Generation","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":"Combinatorics; Mathematics; Rectangle; Intersection (aeronautics); Upper and lower bounds; Intersection graph; Running time; Integer (computer science); Constant (computer programming); Time complexity; Approximation algorithm; Independent set; Discrete mathematics; Graph; Algorithm; Computer science; Line graph; Geometry","score_opus":0.010233888979936713,"score_gpt":0.23899568601044968,"score_spread":0.22876179703051297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155875791","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.2050064,0.000011609793,0.789466,0.0015743828,0.0005427529,0.00014332964,6.8895116e-7,0.00011019315,0.0031445955],"genre_scores_gemma":[0.9819676,0.0000012940158,0.01272837,0.0052423747,0.000012525469,0.000021617523,0.000013425272,0.0000033764975,0.000009376617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990016,0.00005518752,0.0003084,0.00015041654,0.00031424314,0.00017014703],"domain_scores_gemma":[0.999578,0.000031290157,0.00014628559,0.00013441393,0.00007014731,0.000039852424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036975075,0.000106316096,0.0000782913,0.00057968096,0.00011844216,0.00029065605,0.00017374448,0.000048644564,0.0000065471068],"category_scores_gemma":[0.00007494896,0.000108174536,0.000031512587,0.000828624,0.000013145657,0.002732573,0.000021834658,0.00015589966,0.00006587302],"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.000053647702,0.00013587104,0.00075943203,0.00011701515,0.000011335905,0.000011998154,0.012220218,0.11462406,0.003992071,0.033252697,0.0025608558,0.8322608],"study_design_scores_gemma":[0.0063818656,0.0006093936,0.032266848,0.0007430492,0.000018785076,0.00039002203,0.000905651,0.7657507,0.05520372,0.06610902,0.06941857,0.0022023476],"about_ca_topic_score_codex":0.0000067907936,"about_ca_topic_score_gemma":0.0000063354987,"teacher_disagreement_score":0.83005846,"about_ca_system_score_codex":0.00014701993,"about_ca_system_score_gemma":0.00007254849,"threshold_uncertainty_score":0.44112295},"labels":[],"label_agreement":null},{"id":"W2156148354","doi":"10.1016/j.jda.2008.12.002","title":"Algorithms for optimal outlier removal","year":2009,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"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; Convex hull; Mathematics; Combinatorics; Set (abstract data type); Regular polygon; Bounding overwatch; Point (geometry); Constant (computer programming); Outlier; Minimum bounding box; Algorithm; Mathematical optimization; Computer science; Geometry; Statistics; Artificial intelligence","score_opus":0.02320484431757027,"score_gpt":0.30016347908188373,"score_spread":0.2769586347643135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156148354","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.0042919083,0.00064967654,0.98920465,0.004249863,0.0010578166,0.00014307514,0.000007387398,0.000029748491,0.00036587968],"genre_scores_gemma":[0.06328785,0.000043284213,0.9339125,0.0006146132,0.0014474937,0.0000025894844,0.00000781083,0.000009138033,0.00067470345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841356,0.000046005633,0.00054806384,0.00021995461,0.00050506345,0.00026737203],"domain_scores_gemma":[0.9986687,0.00010490399,0.0003707317,0.00021457308,0.00046996918,0.00017114478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069321116,0.00015559512,0.00026407975,0.0002414026,0.00013885259,0.00019905895,0.0005618733,0.00006759004,0.000008794291],"category_scores_gemma":[0.0000938951,0.00012882269,0.00026284283,0.000377384,0.000020902853,0.0009152669,0.000045551147,0.00017089899,0.000006908689],"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.000077253186,0.00018475467,0.00000820746,0.000009313805,0.000093660405,0.00013225262,0.00051843806,0.021348925,0.0022340876,0.020452451,0.009421118,0.94551957],"study_design_scores_gemma":[0.0027910061,0.0027768586,0.0020033296,0.00005849975,0.00006445438,0.0018489045,0.0000772829,0.870294,0.006254332,0.038848627,0.07447219,0.0005105389],"about_ca_topic_score_codex":9.535105e-7,"about_ca_topic_score_gemma":1.9841222e-7,"teacher_disagreement_score":0.945009,"about_ca_system_score_codex":0.00005370925,"about_ca_system_score_gemma":0.0001539158,"threshold_uncertainty_score":0.5253237},"labels":[],"label_agreement":null},{"id":"W2156308991","doi":"10.46298/dmtcs.346","title":"Stacks, Queues and Tracks: Layouts of Graph Subdivisions","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Combinatorics; Subdivision; Vertex (graph theory); Queue; Mathematics; Bounded function; Graph; Discrete mathematics; Planar graph; Computer science; Geography","score_opus":0.011698854125213405,"score_gpt":0.267115975801654,"score_spread":0.2554171216764406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156308991","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.084407344,0.000137934,0.91288954,0.0008481061,0.00013537401,0.00015764395,0.0000050664316,0.00008383332,0.0013351769],"genre_scores_gemma":[0.6177095,0.000011769115,0.38210166,0.00011019494,0.000049824677,0.0000032250964,0.0000013682532,0.0000045764964,0.000007841006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790204,0.000058608184,0.00044462518,0.00050313293,0.00074455404,0.00034701911],"domain_scores_gemma":[0.9984488,0.00037516723,0.00013669604,0.0005603219,0.00025483564,0.00022416073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094028504,0.00018360639,0.00025503014,0.00028192016,0.0002870877,0.00032573263,0.0011077153,0.000045966844,0.000025720778],"category_scores_gemma":[0.00011841747,0.00014665381,0.00007447212,0.0010391534,0.0013286418,0.0007826084,0.0006292932,0.0001218876,0.000015284717],"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.0000018062713,0.00008768157,0.000016016951,0.000022996737,0.000005718937,0.000001229722,0.0018475926,0.0008591644,0.00090201176,0.9779512,0.00003280392,0.018271752],"study_design_scores_gemma":[0.00014563114,0.000108672575,0.0002836942,0.0000424071,0.0000075042935,0.000023247983,0.00003834966,0.713289,0.0048918533,0.28093252,0.000073349,0.00016374423],"about_ca_topic_score_codex":0.0000013021969,"about_ca_topic_score_gemma":0.0000011715613,"teacher_disagreement_score":0.7124299,"about_ca_system_score_codex":0.000019910352,"about_ca_system_score_gemma":0.000096171716,"threshold_uncertainty_score":0.5980369},"labels":[],"label_agreement":null},{"id":"W215657516","doi":"10.1016/s0020-0190(00)00093-4","title":"Covering a set of points by two axis-parallel boxes","year":2000,"lang":"en","type":"article","venue":"Information Processing Letters","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 British Columbia","funders":"","keywords":"Measure (data warehouse); Combinatorics; Monotone polygon; Set (abstract data type); Mathematics; Set function; Space (punctuation); Simple (philosophy); Cover (algebra); Function (biology); Computational geometry; Binary logarithm; Set cover problem; Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.007962567998770969,"score_gpt":0.2328252668648898,"score_spread":0.22486269886611884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W215657516","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.18038575,0.000043586715,0.81498355,0.002861485,0.00007568321,0.00007785432,0.000005602122,0.00008736611,0.0014791065],"genre_scores_gemma":[0.93168235,0.0000066026923,0.061878838,0.006201705,0.00004670472,0.00001093813,0.00007712183,0.0000038289922,0.000091901195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914706,0.000018291406,0.00032267952,0.00009709358,0.00028163922,0.00013323266],"domain_scores_gemma":[0.99958944,0.000022434064,0.00015342559,0.00012247717,0.000074491494,0.000037743954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017372581,0.00008570305,0.00008782572,0.00012108958,0.00011056098,0.00021263525,0.00025728322,0.000022198004,0.00003877361],"category_scores_gemma":[0.0000147157225,0.00008715585,0.00002918027,0.00037072596,0.000023770115,0.0036587338,0.000028469101,0.000059446767,0.00006998523],"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.00002296767,0.000021674829,0.000121009114,0.00011778405,0.000014090704,8.6540746e-7,0.00472229,0.11515261,0.005031262,0.00188809,0.014574399,0.85833293],"study_design_scores_gemma":[0.0017478463,0.0000705901,0.0012305004,0.00013735972,0.0000098783385,0.000049925682,0.00007039258,0.8334569,0.017640555,0.0017413534,0.14332959,0.0005151087],"about_ca_topic_score_codex":0.000011609842,"about_ca_topic_score_gemma":3.6304536e-7,"teacher_disagreement_score":0.8578178,"about_ca_system_score_codex":0.000025654519,"about_ca_system_score_gemma":0.000049472088,"threshold_uncertainty_score":0.35541126},"labels":[],"label_agreement":null},{"id":"W2156824148","doi":"","title":"Generalized jewels and the point placement problem","year":2009,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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 Windsor","funders":"","keywords":"Combinatorics; Vertex (graph theory); Uniqueness; Mathematics; Generalization; Graph; Upper and lower bounds; Rigidity (electromagnetism); Point (geometry); Discrete mathematics; Algorithm; Computer science; Geometry; Mathematical analysis; Physics","score_opus":0.010582041916876249,"score_gpt":0.2351023335578228,"score_spread":0.22452029164094656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156824148","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.014453376,0.00018294314,0.9487147,0.023630433,0.00007782825,0.00022743444,1.6087034e-7,0.00006854254,0.012644606],"genre_scores_gemma":[0.8397587,0.00002878524,0.15231647,0.0057400344,0.000068309375,0.000011476995,0.000002175034,0.0000013540644,0.0020726845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994752,0.000047904996,0.000108842556,0.00014477795,0.00013626156,0.00008701692],"domain_scores_gemma":[0.99972355,0.00004617639,0.000026909394,0.00013611314,0.00003554377,0.000031680993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033211865,0.00005338058,0.000060314098,0.0000327702,0.0001038637,0.00013036365,0.00015477045,0.000012308513,0.000018278863],"category_scores_gemma":[0.0000087100625,0.000031029176,0.000021045258,0.00014975919,0.000016532967,0.00016417356,0.000051017934,0.000029933488,0.00001053166],"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.000009739562,0.000013834616,0.0000037701,7.665859e-7,0.0000036385318,4.9082416e-7,0.00021133707,0.0020173234,0.0003203832,0.95852584,0.0023836382,0.036509234],"study_design_scores_gemma":[0.00307293,0.00014801425,0.0023331298,0.00000535684,0.000006453673,0.000034478286,0.0000244881,0.68206054,0.0024277056,0.29701507,0.012696032,0.0001758364],"about_ca_topic_score_codex":0.000004893562,"about_ca_topic_score_gemma":0.0000016279556,"teacher_disagreement_score":0.82530534,"about_ca_system_score_codex":0.00000812873,"about_ca_system_score_gemma":0.000017811863,"threshold_uncertainty_score":0.12653331},"labels":[],"label_agreement":null},{"id":"W2156882907","doi":"10.46298/dmtcs.2126","title":"A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":"Toronto Metropolitan University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; European Social Fund; Fonds De La Recherche Scientifique - FNRS; European Science Foundation","keywords":"Combinatorics; Mathematics; Clique graph; Randomized algorithm; Algorithm; Clique; Block graph; Hamiltonian path; Graph; Polygon (computer graphics); Simple polygon; Clique problem; Discrete mathematics; Graph power; Chordal graph; Monotone polygon; Line graph; Computer science; 1-planar graph","score_opus":0.02834525095212346,"score_gpt":0.31036754161977864,"score_spread":0.28202229066765516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156882907","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.024448201,0.000032021955,0.9731909,0.0006514297,0.00020038168,0.0009838714,0.000006584147,0.00003923685,0.00044734185],"genre_scores_gemma":[0.53140694,0.0000010548852,0.4683402,0.00015533608,0.0000377281,0.000050229934,0.0000031465477,0.0000039819347,0.0000013606308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997215,0.00033718612,0.0006727865,0.0005102103,0.0008618418,0.00040299917],"domain_scores_gemma":[0.99657863,0.0020182845,0.00021223818,0.0006875457,0.0003585182,0.00014479303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010714979,0.0001878537,0.0004635826,0.00030005357,0.00017763885,0.00031464838,0.0018165642,0.000052570384,0.00000344709],"category_scores_gemma":[0.00082865526,0.00012043252,0.00019030701,0.001641702,0.0012439302,0.0004346012,0.00042397025,0.00013802307,0.0000028808288],"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.00013821623,0.00012269207,0.0000034298678,0.000025553161,0.0000062799513,0.000001665699,0.004101998,0.0006892413,0.00005791613,0.9821106,0.000021003389,0.012721407],"study_design_scores_gemma":[0.004321287,0.00008712448,0.000009259167,0.000017650864,0.00000597695,0.000010021787,0.000062417465,0.5120723,0.00048639864,0.48283988,0.000006207421,0.000081477505],"about_ca_topic_score_codex":0.0000059468216,"about_ca_topic_score_gemma":0.0000013861721,"teacher_disagreement_score":0.51138306,"about_ca_system_score_codex":0.00003905402,"about_ca_system_score_gemma":0.00021696965,"threshold_uncertainty_score":0.49110958},"labels":[],"label_agreement":null},{"id":"W2157063365","doi":"","title":"An improved algorithm for Hausdorff Voronoi diagram for non-crossing sets ∗†‡","year":2006,"lang":"en","type":"article","venue":"","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":"Voronoi diagram; Parallelizable manifold; Speedup; Algorithm; Computer science; Hausdorff distance; Bowyer–Watson algorithm; Mathematics; Parallel computing; Geometry; Artificial intelligence","score_opus":0.010991983929216676,"score_gpt":0.2794585868755338,"score_spread":0.26846660294631713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157063365","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.0064052856,0.00002632846,0.99185586,0.00028575084,0.0005187182,0.0005961281,0.00001621547,0.00013198079,0.00016372112],"genre_scores_gemma":[0.22666675,3.1297995e-7,0.77152705,0.00023330322,0.0003917738,0.00012582034,0.00012085586,0.000008383862,0.000925722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990434,0.000012814478,0.00020813831,0.0003701398,0.00010723552,0.0002582613],"domain_scores_gemma":[0.9993213,0.00012013265,0.0000652329,0.00023653555,0.00019271717,0.00006407061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027246808,0.00011649567,0.000114090806,0.00007929552,0.00038773788,0.00061194296,0.000283234,0.000052988296,0.0000037743853],"category_scores_gemma":[0.00001330162,0.00010903707,0.00008094651,0.00018935156,0.00002246965,0.0006305065,0.00003563934,0.00003128072,0.0000038650173],"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.0000045009406,0.00009877543,0.000013387286,0.000008926959,0.0000056987233,2.8727044e-7,0.000059758233,0.0029859778,0.006946293,0.0075562513,0.0019777482,0.9803424],"study_design_scores_gemma":[0.0006776521,0.00019478494,0.00092084846,0.0000024187123,0.0000045240945,0.0000028066706,0.00000477899,0.9650022,0.01754764,0.009166667,0.00631304,0.00016264696],"about_ca_topic_score_codex":0.00006400599,"about_ca_topic_score_gemma":0.000049172446,"teacher_disagreement_score":0.9801797,"about_ca_system_score_codex":0.000031797797,"about_ca_system_score_gemma":0.0001096471,"threshold_uncertainty_score":0.59009796},"labels":[],"label_agreement":null},{"id":"W2157209894","doi":"10.5508/jhs.2009.v9.r46","title":"Review of J.L. Berquist and C.V. Camp, Constuctions of Space II","year":2010,"lang":"en","type":"article","venue":"Journal of Hebrew Scriptures","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Space (punctuation); Chemistry; Physics; Philosophy; Linguistics","score_opus":0.007829684036234874,"score_gpt":0.25395091130138864,"score_spread":0.24612122726515376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157209894","genre_codex":"review","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.28304985,0.59190917,0.1064312,0.011352991,0.004877138,0.0002968083,0.00001569437,0.000021800151,0.0020453725],"genre_scores_gemma":[0.7941022,0.009578065,0.17690122,0.018546073,0.0006621192,0.000002327121,0.0000031653296,0.000010458983,0.00019440592],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915534,0.00004142087,0.00040931802,0.00008293778,0.00024122566,0.000069739086],"domain_scores_gemma":[0.9987228,0.00006748605,0.00047033714,0.00015011347,0.0005225944,0.0000666648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004976362,0.00006656358,0.00022524777,0.00014591005,0.00006918791,0.000018175295,0.00023185693,0.000032991942,0.00003776829],"category_scores_gemma":[0.00024408959,0.00005210905,0.00008242827,0.0002619693,0.00008181388,0.00026878336,0.00007764715,0.00017833112,7.463544e-7],"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.000021750344,0.00028048726,0.00081717555,0.001440203,0.00011912063,0.000012156402,0.0007463624,0.00019341968,0.1445446,0.116792664,0.70048594,0.034546092],"study_design_scores_gemma":[0.00069402566,0.00057684054,0.009682939,0.001938939,0.000091814734,0.0016006115,0.00005618253,0.00069181295,0.03659594,0.010135397,0.9377364,0.00019912737],"about_ca_topic_score_codex":0.000008176101,"about_ca_topic_score_gemma":0.00000872369,"teacher_disagreement_score":0.58233106,"about_ca_system_score_codex":0.000005311309,"about_ca_system_score_gemma":0.0001343503,"threshold_uncertainty_score":0.21249455},"labels":[],"label_agreement":null},{"id":"W2157282884","doi":"10.5555/1070432.1070466","title":"On levels in arrangements of surfaces in three dimensions","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; SPHERES; Mathematics; Dimension (graph theory); Surface (topology); Geometry; Computational geometry; Discrete geometry; Physics","score_opus":0.037823890343511885,"score_gpt":0.2789078124501802,"score_spread":0.24108392210666832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157282884","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.887386,0.000030352658,0.109526075,0.0006295706,0.000062762876,0.00006732514,5.4381917e-7,0.000010753229,0.0022866111],"genre_scores_gemma":[0.97214997,0.000001768123,0.02750605,0.0001834427,0.00000832539,0.0000024135265,7.35912e-7,0.0000010708881,0.00014624931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950546,0.00001877185,0.00014171684,0.00012211569,0.0001354275,0.00007650128],"domain_scores_gemma":[0.9997559,0.000074814685,0.000023737026,0.00010964804,0.000020571148,0.000015319747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016636225,0.000040006937,0.000060612398,0.00016267446,0.000012292711,0.00000983311,0.00013487044,0.000015309774,0.000033832886],"category_scores_gemma":[0.000016727352,0.000035688085,0.000011917029,0.0003845825,0.000005735348,0.00017388134,0.000042115546,0.00003370449,0.000023846176],"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.000006375696,0.00032371076,0.009006792,0.0000046050945,0.000004459747,0.0000024970504,0.00042608852,0.6296258,0.005838841,0.29892498,0.00028028403,0.055555545],"study_design_scores_gemma":[0.000630879,0.00006983352,0.4277848,0.000025883124,5.8798264e-7,6.019957e-7,0.000008581634,0.5300218,0.013025236,0.028023189,0.0003071935,0.000101415506],"about_ca_topic_score_codex":0.000030180197,"about_ca_topic_score_gemma":0.0008447038,"teacher_disagreement_score":0.418778,"about_ca_system_score_codex":0.000019574074,"about_ca_system_score_gemma":0.000020557769,"threshold_uncertainty_score":0.14553179},"labels":[],"label_agreement":null},{"id":"W2157291615","doi":"10.1002/nme.980","title":"Geometry independence for a meshing engine for 2D manifolds","year":2004,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Polygon mesh; Geometry; Mesh generation; Topology (electrical circuits); Embedding; Euclidean geometry; Computer science; Computational geometry; Delaunay triangulation; Software; Geometry processing; Mathematics; Computational science; Engineering; Finite element method; Combinatorics; Structural engineering; Artificial intelligence; Programming language","score_opus":0.02951716386430982,"score_gpt":0.38258531545297125,"score_spread":0.35306815158866145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157291615","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.0011421031,0.00020346617,0.9919684,0.00139256,0.00484756,0.0003601036,0.0000127755575,0.00006355959,0.000009495611],"genre_scores_gemma":[0.07843217,0.000012909078,0.9203255,0.0001971773,0.0007953141,0.00015540939,0.000010174613,0.000021292424,0.000050033268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984824,0.000028420744,0.00049471785,0.000306253,0.00036106477,0.00032715074],"domain_scores_gemma":[0.9979718,0.0012064697,0.00014295916,0.00011992143,0.0004419178,0.00011693926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017164785,0.0001690005,0.0002200376,0.0005791716,0.00009945121,0.00026316775,0.0008433191,0.00009463184,0.000003564418],"category_scores_gemma":[0.0018240947,0.00017367475,0.00021627633,0.0003881921,0.0000071092113,0.0006459401,0.000092268834,0.00024306329,9.121895e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040605028,0.0000571238,0.000015000868,0.000026447799,0.00006279508,0.0000062656413,0.00013086079,0.7765878,0.0040127947,0.06482494,0.0000484352,0.15418692],"study_design_scores_gemma":[0.0018296232,0.00019245333,0.00020484516,0.00008737996,0.000010360602,0.00022236088,0.000015293139,0.91720814,0.012789231,0.04984212,0.017328475,0.00026971937],"about_ca_topic_score_codex":0.0000043578034,"about_ca_topic_score_gemma":7.305717e-7,"teacher_disagreement_score":0.15391721,"about_ca_system_score_codex":0.00033047207,"about_ca_system_score_gemma":0.000106918065,"threshold_uncertainty_score":0.7082251},"labels":[],"label_agreement":null},{"id":"W2157363043","doi":"10.1016/s0012-365x(03)00240-1","title":"Geometric thickness in a grid","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","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":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; McGill University","keywords":"Mathematics; Grid; Combinatorics; Discrete mathematics; Geometry","score_opus":0.019560097313012927,"score_gpt":0.25778395519751834,"score_spread":0.23822385788450542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157363043","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.02474978,0.0001321827,0.96320665,0.00016060387,0.00041286834,0.0001245922,0.0000012630957,0.00005460291,0.011157487],"genre_scores_gemma":[0.6690441,0.000014640984,0.33016646,0.0001724131,0.00006992092,0.000023418443,0.0000064078486,0.000009325863,0.00049332675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991002,0.000048884023,0.00023319162,0.00018992083,0.00025200867,0.00017580925],"domain_scores_gemma":[0.9993914,0.00016013908,0.00006496441,0.0002858751,0.00004946277,0.000048208734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048065133,0.00009432902,0.00012539544,0.00032235569,0.00005256725,0.00009998789,0.00028975078,0.000038817114,0.000025912293],"category_scores_gemma":[0.00027727764,0.0000844903,0.0000393393,0.001582943,0.000012978949,0.00024670182,0.000054863143,0.00008524862,0.00007615558],"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":[6.922782e-7,0.0001237335,0.00025520977,0.000064565844,0.0000055845685,0.000011775815,0.001143029,0.0037851264,0.0001740826,0.9902277,0.00053369504,0.0036748203],"study_design_scores_gemma":[0.0019402689,0.0001883926,0.006310807,0.00016604431,0.000023347462,0.00029332878,0.000588949,0.41252232,0.011074821,0.53796524,0.027645746,0.0012807619],"about_ca_topic_score_codex":0.00000208139,"about_ca_topic_score_gemma":0.0000032504117,"teacher_disagreement_score":0.6442943,"about_ca_system_score_codex":0.000028144996,"about_ca_system_score_gemma":0.000051134157,"threshold_uncertainty_score":0.34454143},"labels":[],"label_agreement":null},{"id":"W2158382416","doi":"10.4230/lipics.swat.2016.30","title":"Time-Space Trade-offs for Triangulating a Simple Polygon","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Simple polygon; Workspace; Simple (philosophy); Polygon (computer graphics); Combinatorics; Binary logarithm; Space (punctuation); Computer science; SIMPLE algorithm; Algorithm; Mathematics; Time complexity; Monotone polygon; Discrete mathematics; Artificial intelligence; Geometry; Physics; Computer network","score_opus":0.015556284487119173,"score_gpt":0.2561525916758043,"score_spread":0.2405963071886851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158382416","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.05237209,0.00003536757,0.94182247,0.002425447,0.000656458,0.0012862767,0.00033706572,0.00025317096,0.00081167236],"genre_scores_gemma":[0.8174745,0.000011874142,0.17704563,0.0016782745,0.00072263053,0.00033351555,0.00051231385,0.000059604085,0.0021616616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976388,0.000039123228,0.0008942349,0.00033359442,0.0004226689,0.0006715811],"domain_scores_gemma":[0.9980222,0.00059123326,0.00041553515,0.00056027406,0.00020771695,0.0002030476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071317336,0.00032138868,0.0003625904,0.0002924496,0.0004252728,0.00032409126,0.000779191,0.00016290326,0.000031970456],"category_scores_gemma":[0.00026885318,0.0002463389,0.0002943394,0.00040853242,0.000060579758,0.0019121375,0.00020898807,0.000115756644,0.000114205846],"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.0005654218,0.0007622695,0.0007939392,0.0007813868,0.00046150692,0.0000053164263,0.014048383,0.0034971978,0.0120418,0.14147367,0.07584801,0.7497211],"study_design_scores_gemma":[0.00898086,0.00072226836,0.0005977314,0.00016259923,0.000045901656,0.000060096518,0.00023251417,0.6519787,0.013949859,0.009175235,0.31315672,0.0009375693],"about_ca_topic_score_codex":0.000002949945,"about_ca_topic_score_gemma":0.000004271317,"teacher_disagreement_score":0.7651024,"about_ca_system_score_codex":0.00012770387,"about_ca_system_score_gemma":0.00012417258,"threshold_uncertainty_score":0.99999887},"labels":[],"label_agreement":null},{"id":"W2159036680","doi":"10.1109/pdcat.2005.210","title":"Scalable Parallel Quadrilateral Mesh Generation Coupled with Mesh Partitioning","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Science Fund for Distinguished Young Scholars; Ministry of Economy, Trade and Industry; National Natural Science Foundation of China","keywords":"Parallel computing; Polygon mesh; Computer science; Scalability; Mesh generation; Partition (number theory); Quadrilateral; Load balancing (electrical power); T-vertices; Finite element method; Mathematics; Geometry","score_opus":0.01996890241354976,"score_gpt":0.24054085822073346,"score_spread":0.2205719558071837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159036680","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.10626985,0.000047245805,0.88836145,0.002404387,0.00014412626,0.00013979818,5.244786e-7,0.00019126269,0.0024413604],"genre_scores_gemma":[0.72522557,0.000007843527,0.27060005,0.00088679057,0.00035027662,0.00002852937,0.00003943974,0.000005899082,0.002855602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881876,0.000042539396,0.00022787988,0.00035019824,0.00032456874,0.00023605888],"domain_scores_gemma":[0.99939835,0.000031187887,0.00006799832,0.0002480883,0.0001592264,0.00009516287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022614114,0.00013128,0.00011726129,0.00010102148,0.0002567926,0.00032651742,0.0002142125,0.00004331968,0.00020672378],"category_scores_gemma":[0.000009464405,0.00010887921,0.000035483947,0.00039335736,0.000019753892,0.0011750263,0.000051323605,0.000071511306,0.0001706776],"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.000020936135,0.00014368955,0.00061259203,0.0000066322905,0.000040011535,0.0000067052415,0.00044133313,0.62456894,0.0060865288,0.3385289,0.010365944,0.019177763],"study_design_scores_gemma":[0.00047764392,0.00008371816,0.0010666534,0.0000058748865,0.0000054403317,0.000025649822,0.0000059214476,0.98761684,0.0046379925,0.00059568085,0.005294311,0.0001842651],"about_ca_topic_score_codex":0.000024039724,"about_ca_topic_score_gemma":0.00015058162,"teacher_disagreement_score":0.61895573,"about_ca_system_score_codex":0.000049979993,"about_ca_system_score_gemma":0.00008610159,"threshold_uncertainty_score":0.44399655},"labels":[],"label_agreement":null},{"id":"W2159212328","doi":"10.48550/arxiv.cs/0203025","title":"Sufficiently Fat Polyhedra are not 2-castable","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","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; University of New Brunswick","funders":"","keywords":"Polyhedron; Materials science; Mathematics; Combinatorics","score_opus":0.07773222066829577,"score_gpt":0.2660771771894717,"score_spread":0.18834495652117594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159212328","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.68132824,0.0008942295,0.30958197,0.0022296468,0.0032127441,0.0003129857,0.000029555405,0.00033081614,0.002079851],"genre_scores_gemma":[0.9811525,0.00007973359,0.008050561,0.0010569403,0.00073249434,0.000036693873,0.00005466557,0.00002182107,0.008814591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975083,0.00009512701,0.00042056586,0.0009876176,0.0005498565,0.00043853806],"domain_scores_gemma":[0.99808013,0.000114376206,0.0003273218,0.0010535552,0.00026005373,0.00016458497],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024868597,0.00034150408,0.00033646333,0.00023693942,0.0002441894,0.00033365187,0.0012275872,0.00023394627,0.0001522982],"category_scores_gemma":[0.000096060765,0.00035581927,0.00018529904,0.00046193213,0.000041821757,0.00031765547,0.0014986835,0.000531537,0.0008868588],"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.00007067969,0.0027483725,0.22647943,0.0009336747,0.0005090449,0.00055356,0.006193349,0.5606791,0.011533321,0.041453768,0.08400337,0.06484236],"study_design_scores_gemma":[0.0012206162,0.00022903159,0.35225266,0.0003957126,0.00007644812,0.000060359478,0.00008185377,0.48687193,0.029449573,0.0038605507,0.1230545,0.002446749],"about_ca_topic_score_codex":0.00006471174,"about_ca_topic_score_gemma":0.000015205042,"teacher_disagreement_score":0.3015314,"about_ca_system_score_codex":0.00011654206,"about_ca_system_score_gemma":0.00011468848,"threshold_uncertainty_score":0.99989104},"labels":[],"label_agreement":null},{"id":"W2160761829","doi":"10.1016/j.disc.2009.07.030","title":"On the transversal number and VC-dimension of families of positive homothets of a convex body","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","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 Alberta","funders":"","keywords":"Transversal (combinatorics); Mathematics; Dimension (graph theory); Convex body; Combinatorics; Regular polygon; Discrete mathematics; Convex hull; Mathematical analysis; Geometry","score_opus":0.008605788005068239,"score_gpt":0.24061121999814877,"score_spread":0.23200543199308055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160761829","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.7704426,0.000025297666,0.22692256,0.0004268017,0.000023699877,0.0001315306,0.000010163833,0.0000074812147,0.0020098733],"genre_scores_gemma":[0.9848271,0.000008815529,0.015069292,0.00005829793,0.000004602427,9.539131e-7,0.000002389644,0.0000022899062,0.000026242677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993914,0.000032677635,0.00021466565,0.00009027333,0.00021102437,0.000060009403],"domain_scores_gemma":[0.9993051,0.0002812107,0.0001381262,0.00017123969,0.00008697615,0.000017333616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016643685,0.000068886155,0.00015739087,0.000043091986,0.000029024168,0.000009058945,0.00013331688,0.000024177334,0.000006948523],"category_scores_gemma":[0.00003650439,0.000046113604,0.000045339242,0.00016206267,0.000061052146,0.00007061294,0.000022132568,0.00003531245,0.0000012472822],"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.0000136399885,0.00013759125,0.000020225487,0.0000613057,0.00002482282,7.076791e-7,0.007112075,0.00036752262,0.024400244,0.96566695,0.0000600521,0.0021348689],"study_design_scores_gemma":[0.0007324804,0.0008261632,0.006098212,0.0003703219,0.00005428769,0.00002031108,0.00087079796,0.2762014,0.44155625,0.27304363,0.000015643294,0.00021048603],"about_ca_topic_score_codex":0.0000027814704,"about_ca_topic_score_gemma":3.599121e-7,"teacher_disagreement_score":0.6926233,"about_ca_system_score_codex":0.0000036194904,"about_ca_system_score_gemma":0.000016770462,"threshold_uncertainty_score":0.18804581},"labels":[],"label_agreement":null},{"id":"W2161871333","doi":"","title":"Guaranteed Voronoi Diagrams of Uncertain Sites","year":2008,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":61,"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 British Columbia","funders":"","keywords":"Voronoi diagram; Weighted Voronoi diagram; Power diagram; Generalization; Centroidal Voronoi tessellation; Point (geometry); Set (abstract data type); Diagram; Computer science; Computational geometry; Bowyer–Watson algorithm; Point location; Plane (geometry); Mathematics; Combinatorics; Algorithm; Geometry","score_opus":0.0370004252898863,"score_gpt":0.24858189099239938,"score_spread":0.21158146570251307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161871333","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.2892373,0.00008554333,0.7072675,0.00022832118,0.00008752628,0.000045710938,5.1371944e-7,0.000050466428,0.0029971253],"genre_scores_gemma":[0.9443441,0.000009601917,0.054492373,0.00021228827,0.00003727806,0.000002605838,0.000004399167,0.000001618457,0.0008957585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945885,0.000022597233,0.00013650686,0.00013764725,0.0001576782,0.00008674322],"domain_scores_gemma":[0.9996204,0.0000741073,0.000039010556,0.00016623324,0.00007176082,0.000028533994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009276692,0.000051672,0.00007683848,0.00006588922,0.000060291382,0.0000119092565,0.00022511462,0.000019172108,0.00003722879],"category_scores_gemma":[0.000027139933,0.000043951997,0.000038078157,0.00034537897,0.000026053489,0.00016447666,0.000052435124,0.00002565898,0.000031170115],"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.000018254368,0.00039713195,0.018469943,0.000031591764,0.000051374795,0.000033390508,0.002654011,0.037456576,0.03676705,0.79386955,0.013405629,0.096845515],"study_design_scores_gemma":[0.00081315986,0.0002837795,0.056753248,0.000011723831,0.000005766588,0.00011523036,0.00003760054,0.82171875,0.09644523,0.013746833,0.009695686,0.00037300322],"about_ca_topic_score_codex":0.000025145117,"about_ca_topic_score_gemma":0.000008306394,"teacher_disagreement_score":0.7842622,"about_ca_system_score_codex":0.000007875864,"about_ca_system_score_gemma":0.000044128017,"threshold_uncertainty_score":0.17923105},"labels":[],"label_agreement":null},{"id":"W2162892932","doi":"10.1007/978-3-642-32241-9_21","title":"Monotone Paths in Planar Convex Subdivisions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Calgary","funders":"","keywords":"Monotone polygon; Subdivision; Computer science; Planar; Regular polygon; Algorithm; Mathematics; Computer graphics (images); Geometry; Geography","score_opus":0.01972377283854687,"score_gpt":0.2497572131925377,"score_spread":0.23003344035399084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162892932","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.00047005014,0.0012349227,0.99357504,0.0006141468,0.0018245766,0.0003726775,0.0000071088316,0.00009990751,0.0018015637],"genre_scores_gemma":[0.7400743,0.00014412617,0.2567259,0.0017795278,0.00079265545,0.000020108886,0.000032792435,0.000034152,0.00039646745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966018,0.000049086066,0.0005705692,0.0011743075,0.000930305,0.0006739071],"domain_scores_gemma":[0.9979255,0.0005294682,0.00022130537,0.000929106,0.00017697745,0.0002176182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010374767,0.00043822327,0.0004721359,0.0013798256,0.000196075,0.0002897834,0.0019833294,0.00029632362,0.00003972518],"category_scores_gemma":[0.00008137464,0.00042755343,0.0001019032,0.0010000352,0.00028371598,0.000813496,0.0006708859,0.0007210361,0.000119844684],"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.0000064870856,0.000083342886,0.00040052354,0.000026758109,0.000008709861,0.00009525243,0.0010400447,0.0638823,0.00034981943,0.11279957,0.00005173638,0.82125545],"study_design_scores_gemma":[0.00052925764,0.00016956429,0.0032993292,0.00031773848,0.000008003178,0.00010043365,2.3407846e-7,0.6866929,0.001651449,0.29962507,0.006547164,0.0010589011],"about_ca_topic_score_codex":0.000028185055,"about_ca_topic_score_gemma":0.00009626313,"teacher_disagreement_score":0.82019657,"about_ca_system_score_codex":0.00028074728,"about_ca_system_score_gemma":0.00049393706,"threshold_uncertainty_score":0.9998176},"labels":[],"label_agreement":null},{"id":"W2164326577","doi":"10.1109/sibgra.1999.805604","title":"Mesh collapse compression","year":2003,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia","keywords":"Polygon mesh; Vertex (graph theory); Topology (electrical circuits); Triangle mesh; Computer science; Encoding (memory); Tree (set theory); Enhanced Data Rates for GSM Evolution; Sequence (biology); Algorithm; Combinatorics; Mathematics; Theoretical computer science; Graph; Artificial intelligence; Computer graphics (images)","score_opus":0.015587899998487906,"score_gpt":0.24629847073439784,"score_spread":0.23071057073590995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164326577","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.008249683,0.000059580296,0.9450581,0.00020589808,0.00026790446,0.00005529483,1.5664969e-7,0.00009252871,0.046010874],"genre_scores_gemma":[0.8672444,0.0000040891728,0.12866648,0.00048212375,0.000021730646,0.0000040391465,0.0000013007236,0.000001695058,0.0035741294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950033,0.000045537243,0.00008241579,0.00014731246,0.0001380294,0.00008634434],"domain_scores_gemma":[0.9997095,0.000043238568,0.000019482919,0.00012651642,0.000053728803,0.000047535395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012885129,0.000045956906,0.00004535156,0.00005127372,0.000084410676,0.000066569395,0.00015360698,0.000018746126,0.00007807567],"category_scores_gemma":[0.000027666154,0.00003873092,0.000020224828,0.00030519944,0.0000060462144,0.00020157489,0.000033142045,0.000027367143,0.00010787437],"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":[6.09094e-7,0.000027862803,0.000064967535,0.0000012637651,0.0000022584027,0.0000012101037,0.00004240359,0.0012619453,0.0025881347,0.97637486,0.008884932,0.0107495375],"study_design_scores_gemma":[0.0008724162,0.0001128114,0.0025405819,0.000011159179,0.000003887919,0.00006471265,0.00002718013,0.32033533,0.12925234,0.09004707,0.45634273,0.00038978318],"about_ca_topic_score_codex":0.0000013982602,"about_ca_topic_score_gemma":7.681154e-7,"teacher_disagreement_score":0.8863278,"about_ca_system_score_codex":0.000009777173,"about_ca_system_score_gemma":0.000032915712,"threshold_uncertainty_score":0.1579401},"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":"W2165133602","doi":"10.1016/j.jcta.2013.06.009","title":"Distinct distances on two lines","year":2013,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","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 British Columbia","funders":"","keywords":"Omega; Combinatorics; Line (geometry); Mathematics; Plane (geometry); Physics; Geometry","score_opus":0.013910387833546624,"score_gpt":0.2673390019252354,"score_spread":0.25342861409168876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165133602","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.41700032,0.0027123555,0.4436976,0.004086042,0.123294264,0.0006890495,0.000028093515,0.00017821066,0.008314064],"genre_scores_gemma":[0.98671436,0.00009954075,0.0077053662,0.00012436122,0.00459104,0.0000121950725,0.00000939798,0.000016879567,0.00072684104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977149,0.0003884533,0.0007330559,0.000284305,0.00068007776,0.0001992314],"domain_scores_gemma":[0.99704653,0.00050142006,0.0010956004,0.0004473169,0.00076919247,0.00013992624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011779681,0.00028674954,0.00049928215,0.00023658879,0.00015231776,0.00055329123,0.0012937923,0.00013395591,0.000052946143],"category_scores_gemma":[0.00040984125,0.00022757247,0.00027483888,0.00024394874,0.00008270505,0.00067855767,0.0005225993,0.0006567385,0.000017292363],"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.0002471584,0.00014122916,0.000016635286,0.000034880886,0.000085747844,0.000025963553,0.00025817353,0.0032072957,0.00006905307,0.98184806,0.001920602,0.012145186],"study_design_scores_gemma":[0.0006458163,0.00054753333,0.00022312917,0.00017669213,0.000024869158,0.00004710503,0.000023476932,0.00082287414,0.0011038616,0.9714236,0.024714006,0.0002470365],"about_ca_topic_score_codex":0.0000031947247,"about_ca_topic_score_gemma":9.4733315e-7,"teacher_disagreement_score":0.56971407,"about_ca_system_score_codex":0.00009355049,"about_ca_system_score_gemma":0.00034700808,"threshold_uncertainty_score":0.9280136},"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":"W2165471099","doi":"10.1109/tro.2006.870640","title":"Online polygon search by a seven-state boundary 1-searcher","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Boundary (topology); Polygon (computer graphics); Computer science; Automaton; Continuous automaton; Finite-state machine; State (computer science); Theoretical computer science; Mathematics; Algorithm; Mobile automaton; Automata theory; Mathematical analysis","score_opus":0.02030572362550257,"score_gpt":0.26479197745723665,"score_spread":0.24448625383173408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165471099","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.014056648,0.00009645752,0.98271185,0.002012102,0.0005167696,0.00014568298,0.000055378136,0.00016335375,0.00024175734],"genre_scores_gemma":[0.87925905,0.00004747456,0.107236005,0.00057010807,0.00013067701,0.000011914263,0.0000556061,0.000025394103,0.012663746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854356,0.00009445292,0.00024097161,0.00034253107,0.0004637862,0.00031468147],"domain_scores_gemma":[0.9993071,0.00011119653,0.00003552051,0.00031446316,0.00013055054,0.000101184625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018236689,0.00015124927,0.00012277052,0.00021785426,0.0003106849,0.00019097528,0.00032914637,0.00006354253,0.000028304605],"category_scores_gemma":[0.0000018024624,0.0001581706,0.00008383321,0.0007213589,0.000054044085,0.00030739434,0.000003925244,0.0003031196,0.00010197526],"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.000009510049,0.0005501923,0.000005141248,0.0000072767284,0.000014887475,0.0000064166898,0.00008606148,0.96010524,0.0022957686,0.0005520606,0.0018626074,0.034504864],"study_design_scores_gemma":[0.00061453896,0.00022853258,0.00050869473,0.000017793694,0.000013396329,0.000032246575,0.000017040798,0.96317005,0.029619936,0.0024152438,0.0030210097,0.00034151375],"about_ca_topic_score_codex":0.00010088802,"about_ca_topic_score_gemma":0.00008032512,"teacher_disagreement_score":0.8754758,"about_ca_system_score_codex":0.00009575049,"about_ca_system_score_gemma":0.00016862167,"threshold_uncertainty_score":0.645001},"labels":[],"label_agreement":null},{"id":"W2165519853","doi":"","title":"Minimizing the Number of Arcs Linking a Permutation of Points in the Plane","year":2006,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of British Columbia","funders":"","keywords":"Permutation (music); Combinatorics; Arc (geometry); Point (geometry); Finite set; Set (abstract data type); Plane (geometry); Mathematics; Discrete mathematics; Computer science; Geometry; Physics; Mathematical analysis","score_opus":0.013398656662069061,"score_gpt":0.25490116066463103,"score_spread":0.24150250400256196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165519853","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.7015162,0.000026152848,0.29252085,0.0010009698,0.000058446516,0.00007859661,5.888055e-7,0.0000075405997,0.0047906437],"genre_scores_gemma":[0.9754791,0.0000012735314,0.024245478,0.00015689875,0.000037182803,0.000003000561,0.000006677706,0.0000011445767,0.00006924005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939334,0.00007283295,0.00018965655,0.000081252845,0.00020207255,0.0000608471],"domain_scores_gemma":[0.99945706,0.00028412513,0.000077104865,0.0001266468,0.00005069437,0.000004389157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004257205,0.00003747692,0.000053620617,0.000045092966,0.00003584128,0.000024093846,0.00024772395,0.00001589737,0.00000847642],"category_scores_gemma":[0.000017965747,0.000021642016,0.00002365427,0.00036969356,0.000017705695,0.00011070922,0.00003087392,0.000041684132,0.000003470435],"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.000012755166,0.00019524351,0.01799309,0.000039287155,0.000010463585,0.0000043020514,0.008005143,0.03818433,0.005215614,0.9024133,0.0005434521,0.02738299],"study_design_scores_gemma":[0.0008177625,0.00006642006,0.336793,0.00007687083,0.000011753426,0.00008744551,0.00076613406,0.48767656,0.027015168,0.14551087,0.0009808585,0.00019715769],"about_ca_topic_score_codex":0.00010024975,"about_ca_topic_score_gemma":0.000042331805,"teacher_disagreement_score":0.75690246,"about_ca_system_score_codex":0.0000057150537,"about_ca_system_score_gemma":0.000025227728,"threshold_uncertainty_score":0.08825358},"labels":[],"label_agreement":null},{"id":"W2165542100","doi":"10.1142/s021819590900299x","title":"DETERMINING A SET OF MAXIMUM INSCRIBED RECTANGLES FOR LABEL PLACEMENT IN A REGION","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inscribed figure; Polygon (computer graphics); Set (abstract data type); Regular polygon; Convex polygon; Combinatorics; Orientation (vector space); Mathematics; Computer science; Algorithm; Geometry","score_opus":0.034106281611396255,"score_gpt":0.3253124541080849,"score_spread":0.2912061724966887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165542100","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.033465408,0.00027377033,0.9629788,0.0022796402,0.00028426267,0.00046200267,0.000025142304,0.000023071934,0.00020790209],"genre_scores_gemma":[0.76650953,0.00003345022,0.23249145,0.00042002185,0.00036376156,0.00006712444,0.00006466145,0.000007648436,0.00004237993],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976288,0.00006151191,0.0010617296,0.00027445247,0.00078910205,0.00018438463],"domain_scores_gemma":[0.99659616,0.0005900978,0.0008691938,0.00017508314,0.001678278,0.00009116834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006032851,0.0001638385,0.0002847402,0.0013352839,0.00007236239,0.000103468126,0.0009938355,0.000070439724,0.0000072964835],"category_scores_gemma":[0.00012470796,0.00017221636,0.0001554553,0.0010620849,0.000037385515,0.00059298566,0.00007467366,0.00015685581,0.000003447208],"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.00023698343,0.00083560275,0.0007242617,0.00003505466,0.00017630955,0.000023612032,0.0006479873,0.333614,0.0017805793,0.10808037,0.0010262497,0.552819],"study_design_scores_gemma":[0.007232293,0.0014152142,0.017634787,0.00030564674,0.0000582071,0.00079028035,0.00021906072,0.2363884,0.0033883215,0.6953465,0.036561407,0.00065992924],"about_ca_topic_score_codex":0.0000021459578,"about_ca_topic_score_gemma":0.0000019687013,"teacher_disagreement_score":0.7330441,"about_ca_system_score_codex":0.00017539384,"about_ca_system_score_gemma":0.00031413767,"threshold_uncertainty_score":0.7022779},"labels":[],"label_agreement":null},{"id":"W2165642222","doi":"10.1145/2582112.2595648","title":"Animation of an Algorithm for Drawing Graphs in 3D","year":2014,"lang":"en","type":"article","venue":"","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 Lethbridge","funders":"","keywords":"Animation; Computer science; Computer graphics (images); Grid; Graph; Computer animation; Mode (computer interface); Graph drawing; Algorithm; Volume (thermodynamics); Theoretical computer science; Mathematics; Geometry","score_opus":0.013157916696989243,"score_gpt":0.2605177824624743,"score_spread":0.24735986576548508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165642222","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.052010134,0.000005076068,0.9471154,0.00006641638,0.00009171531,0.000080933445,4.5334565e-7,0.000023139732,0.0006067198],"genre_scores_gemma":[0.42860577,2.92614e-7,0.5712637,0.000059720547,0.000019949384,0.0000053714584,0.0000064498518,0.000001106567,0.000037687478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999584,0.000025825004,0.00012428238,0.00011785725,0.000085227424,0.00006278368],"domain_scores_gemma":[0.999722,0.00006644045,0.000034755943,0.00009704692,0.00006108576,0.00001869091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031836572,0.000033643,0.00005456433,0.00013153038,0.000026670572,0.00002609427,0.000121867386,0.000017308696,0.0000027449587],"category_scores_gemma":[0.000020811973,0.000032444663,0.000017246426,0.00025981278,0.0000050200206,0.00038213885,0.000017745071,0.000015109074,0.0000011930555],"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":[7.784473e-7,0.000030771753,0.000045832257,0.000004657902,0.00000108925,5.38231e-8,0.00012532265,0.004610404,0.0013821464,0.16196087,0.000021688451,0.8318164],"study_design_scores_gemma":[0.00019448924,0.000088719346,0.0032647832,0.0000030477374,6.239292e-7,8.120076e-7,0.000004677065,0.96428615,0.006312455,0.025415557,0.00038817603,0.000040512445],"about_ca_topic_score_codex":0.000011518343,"about_ca_topic_score_gemma":0.000014545119,"teacher_disagreement_score":0.9596757,"about_ca_system_score_codex":0.0000060710095,"about_ca_system_score_gemma":0.000014361461,"threshold_uncertainty_score":0.1323055},"labels":[],"label_agreement":null},{"id":"W2165818093","doi":"10.3109/10929080500483473","title":"Augmenting the effective field of view of optical tracking cameras - a way to overcome difficulties during intraoperative camera alignment","year":2006,"lang":"en","type":"article","venue":"Computer Aided Surgery","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Center of Competence in Research Chemical Biology","keywords":"Computer vision; Tracking (education); Computer science; Orientation (vector space); Field of view; Artificial intelligence; Field (mathematics); The Internet; Computer graphics (images); Mathematics; Psychology","score_opus":0.010383389785635945,"score_gpt":0.23915030191885936,"score_spread":0.22876691213322342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165818093","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.57223797,0.00014742227,0.4265921,0.00040047313,0.0003409839,0.00021915381,0.0000014873053,0.00002550915,0.00003490152],"genre_scores_gemma":[0.98597014,0.000007680698,0.01344257,0.00026557202,0.00024251343,0.000034120214,0.0000052341193,0.000007543564,0.00002464562],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99827224,0.00019041693,0.00057172345,0.00033930407,0.00037269824,0.00025362163],"domain_scores_gemma":[0.99741894,0.001858708,0.00017574914,0.00029477352,0.00019773863,0.00005406793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051060674,0.00017838711,0.00038656095,0.00019284624,0.0001565963,0.00010013713,0.0003095942,0.00004417894,0.0000074011846],"category_scores_gemma":[0.00006698042,0.00013710713,0.00016658985,0.00055494165,0.000045942674,0.00028150124,0.0002753885,0.000116183095,0.000003917938],"study_design_candidate":"bench_or_experimental","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.000108520115,0.000742054,0.008958257,0.00046435592,0.00034935857,0.000059059294,0.008905551,0.3345658,0.113451734,0.026609521,0.0037179922,0.5020678],"study_design_scores_gemma":[0.00043405854,0.00020804326,0.29435766,0.00043761026,0.00002759138,0.00003943835,0.00007192508,0.056744844,0.6462739,0.00070779683,0.0002686441,0.0004284457],"about_ca_topic_score_codex":0.0000965124,"about_ca_topic_score_gemma":0.000009518832,"teacher_disagreement_score":0.5328222,"about_ca_system_score_codex":0.000054805856,"about_ca_system_score_gemma":0.000041571853,"threshold_uncertainty_score":0.55910665},"labels":[],"label_agreement":null},{"id":"W2166181110","doi":"","title":"Polygons Flip Finitely: Flaws and a Fix","year":2006,"lang":"en","type":"article","venue":"Smith ScholarWorks (Smith College)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical proof; Polygon (computer graphics); Simple (philosophy); Regular polygon; Computer science; Planar; Mathematics; Algorithm; Combinatorics; Epistemology; Geometry; Computer graphics (images); Telecommunications","score_opus":0.00444281512422724,"score_gpt":0.19430712330117653,"score_spread":0.1898643081769493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166181110","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.2886848,0.008865815,0.67514485,0.005218974,0.0016556615,0.0008343585,0.00006679639,0.000650929,0.018877823],"genre_scores_gemma":[0.92072743,0.00007705571,0.06945411,0.00073919975,0.00051564124,0.000045905064,0.000012634781,0.00002358763,0.008404413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978264,0.00013962411,0.00040174814,0.0006762703,0.0004946907,0.00046126186],"domain_scores_gemma":[0.998677,0.0002530664,0.00013522476,0.0005350503,0.00020388978,0.000195733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055761077,0.0002765114,0.0002632578,0.00035092415,0.00061227835,0.0005683662,0.0005606934,0.00016299135,0.000042555177],"category_scores_gemma":[0.00008608538,0.0002724098,0.000094189796,0.0014738532,0.000072824885,0.0011563101,0.00029704906,0.00041457178,0.00008890577],"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.0001392489,0.00070834503,0.016959062,0.000114460236,0.0001581813,0.00030836623,0.0006198578,0.029326323,0.0012538104,0.64486814,0.15852883,0.14701541],"study_design_scores_gemma":[0.0040176627,0.00047912812,0.27525762,0.00029914564,0.00007640861,0.00039868272,0.00011958949,0.32991418,0.004166956,0.039914664,0.34349313,0.0018628358],"about_ca_topic_score_codex":0.000046040546,"about_ca_topic_score_gemma":0.00003507715,"teacher_disagreement_score":0.63204265,"about_ca_system_score_codex":0.000066918255,"about_ca_system_score_gemma":0.00030383855,"threshold_uncertainty_score":0.9999728},"labels":[],"label_agreement":null},{"id":"W2166241301","doi":"10.1002/jgt.21910","title":"The Same Upper Bound for Both: The 2‐page and the Rectilinear Crossing Numbers of the <i>n</i>‐Cube","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","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; Natural Sciences and Engineering Research Council of Canada","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Cube (algebra); Combinatorics; Mathematics; Upper and lower bounds; Crossing number (knot theory); Discrete mathematics; Mathematical analysis; Cartography","score_opus":0.017772153538751296,"score_gpt":0.2642326023264179,"score_spread":0.24646044878766657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166241301","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.6674773,0.0077427803,0.29851842,0.020934455,0.0036177984,0.0005587766,0.0000051552784,0.000014941154,0.0011303853],"genre_scores_gemma":[0.9954226,0.0000865227,0.0025109574,0.0011424331,0.00032294064,0.0000048163715,1.6757505e-7,0.0000069693583,0.0005026128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856204,0.00050998805,0.00034166814,0.00009320061,0.00035859982,0.00013450584],"domain_scores_gemma":[0.99681884,0.002094291,0.00042893476,0.00029989216,0.00031136387,0.000046672732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061581796,0.00008541081,0.00013458895,0.000045817942,0.00089245307,0.00043815392,0.00077369495,0.00003087458,0.0000011501713],"category_scores_gemma":[0.0006149529,0.000031481235,0.00020493285,0.00035159214,0.000685152,0.00025131044,0.00011549384,0.00020116272,3.9898194e-7],"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.00084105664,0.00005911652,0.00042244457,0.000013632942,0.00019990192,0.000001559093,0.011822265,0.0027559544,0.0010842198,0.9292227,0.009746195,0.04383097],"study_design_scores_gemma":[0.0016767592,0.00013541707,0.0019778549,0.000041760042,0.000059069356,0.00022634541,0.0012809266,0.009430339,0.0021011021,0.9530383,0.029936705,0.0000954713],"about_ca_topic_score_codex":0.000006598677,"about_ca_topic_score_gemma":0.000010215041,"teacher_disagreement_score":0.32794526,"about_ca_system_score_codex":0.00001707999,"about_ca_system_score_gemma":0.00021499798,"threshold_uncertainty_score":0.68641174},"labels":[],"label_agreement":null},{"id":"W2166438223","doi":"","title":"Decomposing Polygons Into Diameter Bounded Components","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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 Saskatchewan","funders":"","keywords":"Simple polygon; Polygon (computer graphics); Polygon covering; Visibility polygon; Mathematics; Combinatorics; Bounded function; Rectilinear polygon; Heuristics; Bounding overwatch; Decomposition; Intersection (aeronautics); Point in polygon; Reduction (mathematics); Polygon mesh; Algorithm; Computer science; Monotone polygon; Mathematical optimization; Geometry; Artificial intelligence","score_opus":0.032631385377684945,"score_gpt":0.25722298217696493,"score_spread":0.22459159679927998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166438223","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.109020926,0.00013767571,0.8703347,0.0027542582,0.0013317707,0.0002924673,0.000023626995,0.00014704965,0.015957532],"genre_scores_gemma":[0.8806578,0.0000042206634,0.116032824,0.002790922,0.00007071046,0.000018157327,0.00012258581,0.000016982432,0.00028580253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752367,0.00020298203,0.00040892512,0.0006947588,0.0005944716,0.00057517615],"domain_scores_gemma":[0.99793774,0.00035524886,0.0001273035,0.00042357977,0.0004096693,0.000746445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038665655,0.00030331258,0.00025888043,0.0013022696,0.00065142877,0.0006134442,0.0006826255,0.00012259222,0.0002680276],"category_scores_gemma":[0.00018091693,0.00034157504,0.000113413545,0.0014373497,0.00008901035,0.00050490955,0.000057966263,0.00027094912,0.00048315164],"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.000005461706,0.000085403386,0.0007454548,0.0000111035515,0.00004795249,0.000033253935,0.00022110721,0.030465081,0.00029282365,0.94848657,0.0014759029,0.018129917],"study_design_scores_gemma":[0.0015752643,0.00031376237,0.028688714,0.0001112598,0.000021989807,0.00017310209,0.00008162184,0.4710554,0.0013312718,0.44336,0.051830765,0.0014568741],"about_ca_topic_score_codex":0.002044334,"about_ca_topic_score_gemma":0.0026787198,"teacher_disagreement_score":0.77163684,"about_ca_system_score_codex":0.00040919732,"about_ca_system_score_gemma":0.0015815935,"threshold_uncertainty_score":0.9999036},"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":"W2167470173","doi":"","title":"A note on fi-drawable k-trees","year":2008,"lang":"en","type":"article","venue":"","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":"McGill University","funders":"","keywords":"Realizability; Graph; Mathematics; Computer science; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.0221468409450255,"score_gpt":0.2492318438455225,"score_spread":0.227085002900497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167470173","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.030530209,0.000018832994,0.9379904,0.0012107911,0.00023697318,0.000046879148,3.2363678e-7,0.00012993299,0.029835615],"genre_scores_gemma":[0.9266221,0.000007019933,0.06268074,0.0013174097,0.000090106514,0.000003965452,0.0000023805885,0.0000021246824,0.009274182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994611,0.000014731277,0.000077747834,0.00016995822,0.00017547482,0.00010097205],"domain_scores_gemma":[0.999651,0.00006420421,0.00001795253,0.00018326449,0.00004128495,0.000042262123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057892332,0.000053284373,0.000049198414,0.000075566546,0.00014061571,0.000032593467,0.00019878376,0.000019500674,0.000051983174],"category_scores_gemma":[0.000019607429,0.000044847136,0.000027157937,0.0002881129,0.000010679616,0.00021045843,0.000047066915,0.00003639223,0.00035769088],"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.000018108722,0.000354735,0.00065522525,0.0000065212807,0.000017683205,0.000089962225,0.0011915986,0.19126287,0.0063404944,0.5660823,0.11391145,0.12006904],"study_design_scores_gemma":[0.0005480641,0.000299914,0.018026669,0.0000089226905,0.0000018886162,0.00010805385,0.0000053627004,0.7860575,0.04623475,0.010615698,0.13776743,0.0003257934],"about_ca_topic_score_codex":0.000012056978,"about_ca_topic_score_gemma":0.0000064169785,"teacher_disagreement_score":0.8960919,"about_ca_system_score_codex":0.000014069621,"about_ca_system_score_gemma":0.000050964667,"threshold_uncertainty_score":0.4597512},"labels":[],"label_agreement":null},{"id":"W2167511304","doi":"10.1142/s0129054109006486","title":"ON SPANNERS OF GEOMETRIC GRAPHS","year":2009,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"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":"Combinatorics; Spanner; Mathematics; Upper and lower bounds; Graph; Discrete mathematics; Geometric graph theory; Graph power; Line graph; Computer science","score_opus":0.015589209680839705,"score_gpt":0.3018274943960976,"score_spread":0.28623828471525786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167511304","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.16753477,0.00004018536,0.82865304,0.0014127691,0.0018039865,0.000046385354,0.0000019134259,0.000009397707,0.0004975447],"genre_scores_gemma":[0.84434044,0.000017804286,0.15528266,0.0002362096,0.000107901076,2.952448e-7,0.0000014074627,0.0000016436682,0.0000116286465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742836,0.00003512164,0.0006788218,0.00019549175,0.0015268786,0.00013535145],"domain_scores_gemma":[0.99588436,0.0002512002,0.000790436,0.00025680207,0.002726986,0.00009020898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009498012,0.000097681426,0.00018413698,0.002611527,0.00008175672,0.00015660019,0.002319537,0.000024999177,0.000011558756],"category_scores_gemma":[0.00027115372,0.00008808978,0.00014175469,0.0024590413,0.00017950486,0.0014410064,0.00011522066,0.00010864116,0.000004441821],"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.000030044206,0.0004080939,0.00016656275,0.0000030544172,0.000045421337,0.000008553197,0.00024419252,0.10039481,0.005283048,0.5489275,0.0005278991,0.34396085],"study_design_scores_gemma":[0.0027825101,0.004642044,0.14351563,0.00036464643,0.00003546886,0.00057085353,0.000029517332,0.3510478,0.09767773,0.39653122,0.0022201065,0.0005824401],"about_ca_topic_score_codex":0.000002932983,"about_ca_topic_score_gemma":3.3966705e-7,"teacher_disagreement_score":0.6768057,"about_ca_system_score_codex":0.00007691457,"about_ca_system_score_gemma":0.00045767345,"threshold_uncertainty_score":0.43103155},"labels":[],"label_agreement":null},{"id":"W2167525805","doi":"10.1007/s10107-010-0435-x","title":"Tightening simple mixed-integer sets with guaranteed bounds","year":2010,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"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":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Simple (philosophy); Mathematics; Integer (computer science); Integer programming; Numerical analysis; Mathematical optimization; Applied mathematics; Combinatorics; Computer science; Mathematical analysis","score_opus":0.010920119536309126,"score_gpt":0.25208788986587644,"score_spread":0.24116777032956732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167525805","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.0932856,0.000015152776,0.90404105,0.00032763762,0.00015915443,0.00020184167,4.499251e-7,0.00026276408,0.0017063598],"genre_scores_gemma":[0.62763476,1.1716134e-7,0.3720734,0.0000894567,0.0000624601,0.00002859764,0.000004738297,0.000008905711,0.00009756867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871254,0.000027977723,0.000247,0.00031729744,0.0003726787,0.00032250676],"domain_scores_gemma":[0.9991678,0.00018632173,0.00007502333,0.00034407942,0.00010727424,0.00011951745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042553502,0.00015166428,0.0001696095,0.00009753068,0.00021676847,0.00043799463,0.00038801454,0.000063638225,0.00005463743],"category_scores_gemma":[0.00011583158,0.000112563874,0.000057907833,0.00044532647,0.00006624331,0.00031846826,0.00011671295,0.00025440918,0.00011431062],"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.000010824874,0.0002513101,0.00017488142,0.00008496423,0.000037372076,0.00003661226,0.0010004354,0.00026025696,0.0024087247,0.6413355,0.00032366265,0.35407546],"study_design_scores_gemma":[0.00075555104,0.00030446964,0.0002725547,0.0000760549,0.00002982144,0.00047384505,0.00010616587,0.74676263,0.0057513593,0.18569015,0.05915561,0.0006218104],"about_ca_topic_score_codex":0.000002707551,"about_ca_topic_score_gemma":0.000010965636,"teacher_disagreement_score":0.74650234,"about_ca_system_score_codex":0.000012562277,"about_ca_system_score_gemma":0.000051927444,"threshold_uncertainty_score":0.45902213},"labels":[],"label_agreement":null},{"id":"W21679978","doi":"10.1016/j.juro.2011.03.179","title":"A Helly Theorem For Intersections Of Sets Starshaped Via Staircase n-Paths.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.010268898581256644,"score_gpt":0.24391671476360244,"score_spread":0.23364781618234579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21679978","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.48729134,0.000066115455,0.51015514,0.00017165903,0.0014160536,0.0002636017,0.000012518369,0.00007910658,0.00054445816],"genre_scores_gemma":[0.987097,0.0000014029273,0.012587026,0.000060868268,0.000016761462,0.000033657667,0.00003091854,0.000007806927,0.00016452913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990855,0.000048893802,0.00026236137,0.00024519794,0.00018760697,0.00017045105],"domain_scores_gemma":[0.9991386,0.00017814038,0.000119585704,0.00026175444,0.00025716252,0.000044765377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025697023,0.000105469895,0.00013455402,0.00014694268,0.00011983772,0.000047990598,0.00028486652,0.000044528955,0.000010111483],"category_scores_gemma":[0.00003588976,0.0001087035,0.000089686124,0.00043368834,0.000029675302,0.00026479544,0.000078598336,0.000056720783,0.0000087187955],"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.000016602238,0.00021131725,0.00011251056,0.00001741104,0.000014768625,0.0000027968756,0.00018066801,0.0010759954,0.004392411,0.9869257,0.0013177242,0.005732099],"study_design_scores_gemma":[0.00079636904,0.00025500823,0.0010851301,0.000011161167,0.000009570554,0.0000116244755,0.000022189017,0.09226001,0.015450785,0.8887725,0.0011847072,0.0001409724],"about_ca_topic_score_codex":0.00005477116,"about_ca_topic_score_gemma":0.000023942717,"teacher_disagreement_score":0.49980572,"about_ca_system_score_codex":0.000044051252,"about_ca_system_score_gemma":0.000076132914,"threshold_uncertainty_score":0.44328},"labels":[],"label_agreement":null},{"id":"W2168122044","doi":"","title":"Towards a Dynamic Data Structure for Ecient Bounded Line Range Search","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on 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 New Brunswick","funders":"","keywords":"Intersection (aeronautics); Bounded function; Rectangle; Line (geometry); Data structure; Combinatorics; Line segment; Mathematics; Range (aeronautics); Binary logarithm; Plane (geometry); Algorithm; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.05768482059480392,"score_gpt":0.3178930795238237,"score_spread":0.2602082589290198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168122044","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.11015383,0.0000436753,0.87680274,0.007866596,0.001903693,0.0006155371,0.0016067016,0.000099294055,0.00090791215],"genre_scores_gemma":[0.86357,0.0000027947515,0.13214767,0.0015028176,0.00029256693,0.000019375217,0.002167508,0.000016265114,0.00028102915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975026,0.000055841603,0.00033545293,0.0009124671,0.0006473991,0.0005462069],"domain_scores_gemma":[0.9972662,0.00029677723,0.00009334601,0.00090923335,0.000828493,0.0006059604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005410891,0.00025709777,0.00023065544,0.00096421264,0.00047704543,0.0006170951,0.0019196304,0.00016579572,0.00027312443],"category_scores_gemma":[0.00027023812,0.00026787954,0.00006908753,0.0011534131,0.000096778196,0.00051214616,0.00022538955,0.0004385904,0.00006574687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.0000309454,0.00009290464,0.00014112856,0.000045874443,0.00006934257,0.000016521968,0.00022638786,0.05865796,0.0007832988,0.72090036,0.004599666,0.21443562],"study_design_scores_gemma":[0.0006155839,0.00012974642,0.0061769374,0.000013969696,0.000008006304,0.000024699115,0.00001584282,0.92731506,0.00013111645,0.054160126,0.011077412,0.00033148538],"about_ca_topic_score_codex":0.0013451928,"about_ca_topic_score_gemma":0.026703179,"teacher_disagreement_score":0.8686571,"about_ca_system_score_codex":0.00016974329,"about_ca_system_score_gemma":0.0037358487,"threshold_uncertainty_score":0.99997735},"labels":[],"label_agreement":null},{"id":"W2168192372","doi":"10.1142/s0218195907002264","title":"POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM","year":2007,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Polygon (computer graphics); Polygon covering; Visibility polygon; Simple polygon; Rectilinear polygon; Cardinality (data modeling); Decomposition; Cover (algebra); Star-shaped polygon; Rectangle; Point (geometry); Discrete mathematics; Geometry; Regular polygon; Computer science; Convex set","score_opus":0.007288858907567653,"score_gpt":0.28497267076778005,"score_spread":0.2776838118602124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168192372","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.00975762,0.00056581636,0.98090625,0.0056529865,0.0004566802,0.0004038014,0.000010073972,0.000043979086,0.0022027707],"genre_scores_gemma":[0.8062577,0.00010237933,0.19087015,0.0013544684,0.0010772718,0.000047967424,0.00007253219,0.000013306373,0.000204223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971394,0.00010096808,0.0009887631,0.00029307458,0.0012542903,0.00022349994],"domain_scores_gemma":[0.99582523,0.0013027005,0.0007459812,0.00019298126,0.0017662741,0.0001668573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002054898,0.00019136567,0.0002412796,0.00082207803,0.00027213962,0.0003506741,0.001071315,0.000074198135,0.000032642485],"category_scores_gemma":[0.00006211674,0.00015350459,0.00019186914,0.00090984785,0.0001920073,0.0007852293,0.0002145228,0.00030674651,0.00004786806],"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.00034394974,0.00037516592,0.00057961146,0.000017147153,0.0004238049,0.000027320651,0.00032670473,0.071987525,0.00040534616,0.70081514,0.0022706506,0.22242765],"study_design_scores_gemma":[0.0073431274,0.00026763527,0.03926462,0.00010015328,0.00011284457,0.0043934155,0.00016179224,0.05436902,0.00094057265,0.64467937,0.24764755,0.00071987504],"about_ca_topic_score_codex":0.0000023890736,"about_ca_topic_score_gemma":0.0000036227032,"teacher_disagreement_score":0.7965001,"about_ca_system_score_codex":0.00011321278,"about_ca_system_score_gemma":0.00021597782,"threshold_uncertainty_score":0.6259736},"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":"W2169634760","doi":"10.1287/opre.48.2.308.12385","title":"Close-Point Spatial Tests and Their Application to Random Number Generators","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Universität Salzburg","keywords":"Mathematics; Hypercube; Point process; Poisson point process; Torus; Poisson distribution; Square root; Unit square; Convergence (economics); Random number generation; Combinatorics; Transformation (genetics); Discrete mathematics; Statistics; Geometry","score_opus":0.026182642608794555,"score_gpt":0.3463407485235901,"score_spread":0.32015810591479554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169634760","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.35703346,0.000052875446,0.63589936,0.0034827364,0.00006201578,0.0005533472,0.00000615553,0.00005743833,0.0028525894],"genre_scores_gemma":[0.9699945,0.000036652003,0.027285395,0.00029849863,0.0002615631,0.0002559566,0.000030269475,0.000008251769,0.0018289355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853235,0.00023746715,0.00019509533,0.00042899835,0.00035692265,0.00024918036],"domain_scores_gemma":[0.9989198,0.00015695664,0.0000072728144,0.0003987623,0.00034903843,0.00016819745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091321213,0.00010032676,0.00010192534,0.00017446927,0.0006468803,0.0004953162,0.00032387892,0.00004867339,0.0002582162],"category_scores_gemma":[0.00009347336,0.0000857466,0.000025121295,0.0009772244,0.00004406619,0.000388569,0.000118792115,0.00015539736,0.0007486853],"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.000032996926,0.00013902741,0.00021813458,0.0000060850357,0.000014655375,0.0000021538726,0.0016593556,0.06272031,0.018382667,0.03757841,0.003929847,0.8753164],"study_design_scores_gemma":[0.0008567222,0.0001341954,0.0038109047,0.000010989444,0.000001979769,0.000033900207,0.00004322804,0.9188971,0.019583635,0.0038382218,0.05253188,0.0002572774],"about_ca_topic_score_codex":0.00026602336,"about_ca_topic_score_gemma":0.0003910022,"teacher_disagreement_score":0.87505907,"about_ca_system_score_codex":0.00005127806,"about_ca_system_score_gemma":0.00014544823,"threshold_uncertainty_score":0.96230847},"labels":[],"label_agreement":null},{"id":"W2169705039","doi":"10.1145/997817.997822","title":"Separating point sets in polygonal environments","year":2004,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Queen's University","funders":"","keywords":"Geodesic; Polygon (computer graphics); Chord (peer-to-peer); Point (geometry); Combinatorics; Pairwise comparison; Mathematics; Path (computing); Computer science; Set (abstract data type); Algorithm; Artificial intelligence; Geometry","score_opus":0.011987282412256817,"score_gpt":0.24901934514887175,"score_spread":0.23703206273661492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169705039","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.2288789,0.000025426125,0.7668526,0.0009559694,0.000097070675,0.000051798626,2.6287196e-7,0.000025395106,0.0031125578],"genre_scores_gemma":[0.90313673,0.000001578736,0.09606753,0.0005474165,0.000020840958,0.000003998083,0.000003618644,0.0000016065915,0.00021669002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942875,0.000014877133,0.000120693716,0.00017030959,0.00015235272,0.000113018796],"domain_scores_gemma":[0.9998149,0.000017787048,0.000021654765,0.00010562966,0.0000045466804,0.000035459045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012041421,0.00005228131,0.000046006164,0.00007807272,0.000040456627,0.0000414701,0.0001480773,0.000018874278,0.000024437917],"category_scores_gemma":[0.000008314315,0.000050470757,0.000017600523,0.00020462697,0.00000662085,0.00032348963,0.00007276425,0.000045051183,0.00011022442],"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.000005237979,0.0002626517,0.0016179034,0.0000042672814,0.000009268552,0.000036722795,0.0011931737,0.5086851,0.015745012,0.4117586,0.000254356,0.060427677],"study_design_scores_gemma":[0.0035690502,0.00028554935,0.20379107,0.000044611454,0.000003626137,0.00013621847,0.0000910585,0.48820794,0.083413556,0.21409264,0.0055607073,0.00080398645],"about_ca_topic_score_codex":0.000020012474,"about_ca_topic_score_gemma":0.000016641785,"teacher_disagreement_score":0.6742578,"about_ca_system_score_codex":0.000055651275,"about_ca_system_score_gemma":0.0000370183,"threshold_uncertainty_score":0.20581378},"labels":[],"label_agreement":null},{"id":"W2169970642","doi":"10.1109/sfcs.1993.366829","title":"A compact piecewise-linear Voronoi diagram for convex sites in the plane","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"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":"Voronoi diagram; Disjoint sets; Power diagram; Weighted Voronoi diagram; Combinatorics; Plane (geometry); Mathematics; Metric (unit); Regular polygon; Computational geometry; Diagram; Piecewise linear function; Algorithm; Geometry","score_opus":0.05622928526534061,"score_gpt":0.27435663683395467,"score_spread":0.21812735156861407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169970642","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.057172757,0.00021970834,0.9320582,0.0065075955,0.00016874976,0.0003883634,0.0000049629994,0.00007519912,0.0034044334],"genre_scores_gemma":[0.9830364,0.00000829792,0.014598117,0.0014874123,0.00011891193,0.00001757217,0.000019922307,0.0000026618975,0.00071069336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933773,0.000044925975,0.00014150221,0.0001739971,0.00015018332,0.00015163576],"domain_scores_gemma":[0.99932355,0.00038649712,0.000031377345,0.0001896579,0.000037660317,0.000031253476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025536158,0.000074606425,0.000086815206,0.00007233491,0.000080090256,0.000096789896,0.00035947294,0.000025163074,0.000076579854],"category_scores_gemma":[0.000045064047,0.000050475115,0.00003910326,0.00030508213,0.000014736934,0.00019937826,0.000021988397,0.000054286185,0.000071832175],"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.000030600055,0.0011418908,0.0054703364,0.000057788322,0.000052273415,0.000022716373,0.007675291,0.052417487,0.0018549246,0.50831765,0.18672329,0.23623574],"study_design_scores_gemma":[0.00037173287,0.00009929538,0.0047615897,0.0000025397192,0.0000020735342,0.000009475637,0.000022573195,0.9719697,0.0005252283,0.0020500598,0.02009412,0.00009159317],"about_ca_topic_score_codex":0.000015383,"about_ca_topic_score_gemma":0.00003921941,"teacher_disagreement_score":0.9258636,"about_ca_system_score_codex":0.000012013634,"about_ca_system_score_gemma":0.00001048872,"threshold_uncertainty_score":0.20583156},"labels":[],"label_agreement":null},{"id":"W2170243444","doi":"10.1007/s00453-010-9465-2","title":"Geometric Spanners for Weighted Point Sets","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"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; Australian Research Council; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Danmarks Grundforskningsfond; Center for Massive Data Algorithmics; Technische Universität Dortmund; National Research Foundation; Australian Government","keywords":"Combinatorics; Mathematics; Geodesic; Metric space; Bounded function; Boundary (topology); Euclidean space; Dimension (graph theory); Regular polygon; Convex body; Function (biology); Discrete mathematics; Convex hull; Geometry; Mathematical analysis","score_opus":0.01012109591005427,"score_gpt":0.25234805686041034,"score_spread":0.24222696095035606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170243444","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.024705486,0.00003630974,0.97023845,0.0024128577,0.0015881817,0.00022277041,0.000009079245,0.00013790136,0.00064896507],"genre_scores_gemma":[0.38168666,0.0000027174317,0.61676985,0.00061426155,0.00036814873,0.000043735465,0.000041277177,0.000009309713,0.00046405933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907225,0.000015421912,0.00016726549,0.0003174558,0.00019899526,0.00022861524],"domain_scores_gemma":[0.9991634,0.0001948621,0.00006062835,0.00030054024,0.0001771949,0.00010339705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002680749,0.000103777755,0.000103727194,0.00032388972,0.00014288216,0.00011284578,0.00042723387,0.00006564138,0.00003116596],"category_scores_gemma":[0.000094875075,0.00009875748,0.00007273501,0.00095247594,0.00002038802,0.00031825434,0.000086624066,0.00012582695,0.00007206076],"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.0000061277647,0.00009750832,0.000026645015,0.000009642297,0.000028080356,0.000004815997,0.000107332555,0.00018268847,0.0051654777,0.07977828,0.015944768,0.8986486],"study_design_scores_gemma":[0.00085315225,0.00017463215,0.0019235235,0.000004341211,0.00001228415,0.000040718864,0.000008522653,0.793556,0.037904706,0.06818645,0.096954934,0.00038074373],"about_ca_topic_score_codex":0.0000067649316,"about_ca_topic_score_gemma":0.000003765873,"teacher_disagreement_score":0.89826787,"about_ca_system_score_codex":0.000015844656,"about_ca_system_score_gemma":0.00007359844,"threshold_uncertainty_score":0.40272135},"labels":[],"label_agreement":null},{"id":"W2170431684","doi":"10.1016/j.tcs.2013.11.031","title":"Fixed-orientation equilateral triangle matching of point sets","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Equilateral triangle; Combinatorics; Mathematics; General position; Vertex (graph theory); Discrete mathematics; Delaunay triangulation; Graph; Geometry","score_opus":0.009409666610581204,"score_gpt":0.2569229396507219,"score_spread":0.24751327304014067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170431684","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.285155,0.000009965751,0.7124199,0.0006898946,0.00051705044,0.0001610966,7.505823e-7,0.00006719486,0.00097913],"genre_scores_gemma":[0.76582205,8.4332163e-7,0.2337884,0.00029856907,0.00006619043,0.000007596518,0.0000023696143,0.000003433367,0.000010539567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807835,0.00009847227,0.000366997,0.00046857476,0.00064717303,0.00034040833],"domain_scores_gemma":[0.9987221,0.00021394793,0.000115088835,0.00043569627,0.00034316475,0.00017001106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010123084,0.00012987391,0.00017982612,0.00025444137,0.00022164219,0.0003481045,0.0010807903,0.000035592715,0.00013679874],"category_scores_gemma":[0.000058024005,0.00010989989,0.00006657135,0.0011492104,0.0005794812,0.0015556676,0.0005430013,0.00009947111,0.00011632128],"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.0000034587779,0.00004578811,0.000026283547,0.00000699063,0.0000029512878,0.0000014146934,0.00072254264,0.0026941856,0.007030276,0.9323271,0.00007532379,0.057063665],"study_design_scores_gemma":[0.00023242565,0.00015560769,0.0028021063,0.000017225,0.0000022683955,0.000019165944,0.000008529483,0.57861155,0.017187204,0.40081683,0.000015653242,0.00013143512],"about_ca_topic_score_codex":0.000012586615,"about_ca_topic_score_gemma":2.726862e-7,"teacher_disagreement_score":0.57591736,"about_ca_system_score_codex":0.000043258584,"about_ca_system_score_gemma":0.000106218635,"threshold_uncertainty_score":0.44815874},"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":"W2171339242","doi":"10.1109/ipps.1993.262857","title":"Parallel algorithms for rectilinear link distance problems","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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":"Computer science; Parallel algorithm; Algorithm; Link (geometry); Diagonal; Polygon (computer graphics); Partition (number theory); Computational geometry; Mathematics; Combinatorics","score_opus":0.050144279568418326,"score_gpt":0.26516522532125203,"score_spread":0.2150209457528337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171339242","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.0001065635,0.00039531227,0.9926193,0.003381023,0.00033664197,0.0002388403,0.0000018377804,0.0001418864,0.002778595],"genre_scores_gemma":[0.049186356,0.00004283415,0.9263644,0.00046723578,0.00038466483,0.00009051054,0.000009962936,0.0000066346997,0.023447374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992913,0.000014149675,0.00014832611,0.00025925573,0.00013553626,0.00015143333],"domain_scores_gemma":[0.999527,0.00008361863,0.000037907113,0.00019594622,0.00010419161,0.000051343915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013301866,0.00007334706,0.00007335539,0.0000471068,0.00011369655,0.000097799995,0.00024736434,0.000031197935,0.000045702956],"category_scores_gemma":[0.000030328085,0.00006495641,0.00004635312,0.00028726168,0.000010333454,0.0002765004,0.00003659731,0.00004227476,0.00006462826],"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.0000036678578,0.000101566875,0.000029863022,0.000023394325,0.000014666573,0.0000014285004,0.00034756426,0.03521296,0.00018652903,0.253354,0.020236313,0.69048804],"study_design_scores_gemma":[0.0002177436,0.000059229664,0.000056764165,0.0000032253292,0.0000011774458,0.00000394946,0.0000016452232,0.8164327,0.00026823193,0.007796115,0.17507346,0.000085711654],"about_ca_topic_score_codex":0.0000025204176,"about_ca_topic_score_gemma":0.0000052796745,"teacher_disagreement_score":0.7812198,"about_ca_system_score_codex":0.000015763706,"about_ca_system_score_gemma":0.000010607312,"threshold_uncertainty_score":0.26488456},"labels":[],"label_agreement":null},{"id":"W2171692255","doi":"10.1002/nme.542","title":"Guaranteed‐quality triangular mesh generation for domains with curved boundaries","year":2002,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":53,"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 British Columbia","funders":"","keywords":"Boundary (topology); Polygon mesh; Discretization; Mesh generation; Chew's second algorithm; Ruppert's algorithm; Delaunay triangulation; Parametric statistics; Mathematics; Algorithm; Computer science; Set (abstract data type); Geometry; Finite element method; Mathematical analysis; Constrained Delaunay triangulation; Engineering; Structural engineering","score_opus":0.07348093694971325,"score_gpt":0.3958678314643191,"score_spread":0.32238689451460584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171692255","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.0023597002,0.00025640643,0.9924489,0.0013549681,0.0032276704,0.0002575713,0.000010004207,0.000053875356,0.000030898915],"genre_scores_gemma":[0.079361595,0.000015061587,0.9193664,0.0002210942,0.00082354504,0.000081532286,0.000010816476,0.000015529873,0.00010442932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847424,0.00012539543,0.0005110663,0.0002749497,0.00037469657,0.00023965337],"domain_scores_gemma":[0.9985581,0.00069143187,0.00016842943,0.00013412068,0.00036405577,0.00008383579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015359266,0.00015547838,0.00022671167,0.00030951758,0.00017686807,0.000567381,0.00050023926,0.00005929674,0.00001618363],"category_scores_gemma":[0.0010563822,0.00013936164,0.00014187944,0.00031911713,0.000022696977,0.00051679654,0.000043506385,0.00017744894,0.0000013147111],"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.00018588455,0.00024852995,0.000202606,0.000041066993,0.00030895643,0.000024462443,0.0011389694,0.509457,0.020727724,0.19549942,0.0011991214,0.27096626],"study_design_scores_gemma":[0.0013713929,0.0001456727,0.00012747331,0.00002382823,0.0000078629955,0.0001510739,0.000009426425,0.9366947,0.0037047858,0.004044285,0.053523015,0.00019647885],"about_ca_topic_score_codex":0.0000041295616,"about_ca_topic_score_gemma":0.0000018395606,"teacher_disagreement_score":0.42723772,"about_ca_system_score_codex":0.00017194539,"about_ca_system_score_gemma":0.00004851695,"threshold_uncertainty_score":0.5683003},"labels":[],"label_agreement":null},{"id":"W2171698682","doi":"10.1007/s00454-010-9291-y","title":"More Colourful Simplices","year":2010,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Combinatorics; General position; Mathematics; Vertex (graph theory); Convex hull; Regular polygon; Simplex; Position (finance); Point (geometry); Set (abstract data type); Geometry; Graph; Computer science","score_opus":0.007892612822278692,"score_gpt":0.269471527868626,"score_spread":0.2615789150463473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171698682","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.35293734,0.000092312875,0.64093894,0.002239411,0.0010188518,0.0001761014,0.000020141373,0.00025844734,0.002318465],"genre_scores_gemma":[0.88981,0.0000023034454,0.108120084,0.0012469686,0.0002479839,0.000022984386,0.00017686652,0.00001480205,0.00035798785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785215,0.000048684647,0.0003852239,0.0006069022,0.00074217835,0.0003648404],"domain_scores_gemma":[0.9984568,0.0004136926,0.00016711526,0.0004298585,0.0003568833,0.00017567295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036426552,0.00024232274,0.00021066234,0.0004678267,0.0003461952,0.00036617732,0.00089391216,0.00011778781,0.00018444548],"category_scores_gemma":[0.00013831657,0.0002395066,0.00013773017,0.001523493,0.00010106439,0.0008177184,0.00029138773,0.00037142652,0.0002557851],"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.000023465736,0.00023494945,0.0037218786,0.00003547601,0.00010198884,0.000034395413,0.0006315884,0.244075,0.0045089293,0.6556902,0.004526167,0.08641595],"study_design_scores_gemma":[0.0008364228,0.00012788127,0.14436854,0.000013102364,0.000017374616,0.00015262417,0.000070114664,0.72936404,0.0011612069,0.07878255,0.04437576,0.00073037244],"about_ca_topic_score_codex":0.000013825259,"about_ca_topic_score_gemma":0.000006160856,"teacher_disagreement_score":0.5769077,"about_ca_system_score_codex":0.000028383034,"about_ca_system_score_gemma":0.0001889969,"threshold_uncertainty_score":0.97667956},"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":"W2173897734","doi":"","title":"Triangulating and Guarding Realistic Polygons.","year":2008,"lang":"en","type":"article","venue":"TU/e Research Portal","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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":"Constant (computer programming); Boundary (topology); Computer science; Simple (philosophy); Regular polygon; Polygon (computer graphics); Algorithm; Object (grammar); Combinatorics; Computational geometry; Mathematics; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.14128034599406464,"score_gpt":0.3862284673020629,"score_spread":0.24494812130799826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173897734","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.81003976,0.0006608576,0.16192088,0.0012655455,0.00023088099,0.00029059645,0.000003676724,0.00015495406,0.025432877],"genre_scores_gemma":[0.98923784,0.000036897953,0.009317692,0.00003844562,0.00021172453,0.000009648376,0.000009952394,0.000005218854,0.0011325473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998491,0.0001386476,0.00017397208,0.00028591242,0.0006013303,0.000309177],"domain_scores_gemma":[0.99915344,0.0002980881,0.000033429176,0.00021704534,0.00016110776,0.00013688744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010924696,0.00006879007,0.00009768987,0.0002630647,0.00050011487,0.0001017137,0.00022344629,0.000034487235,0.00003093723],"category_scores_gemma":[0.00040540015,0.00006672565,0.000029147443,0.0006616262,0.00008719135,0.00031897172,0.00020240065,0.0001810691,0.000025513818],"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.00006601019,0.00026681108,0.011646887,0.00010476328,0.00010614107,0.0024204485,0.0057137157,0.0039449967,0.01690484,0.6081607,0.055646952,0.29501778],"study_design_scores_gemma":[0.002741059,0.0007736735,0.22077534,0.00012836284,0.00001308278,0.0035956593,0.0005188845,0.71040976,0.006863843,0.03837661,0.0147584025,0.0010453416],"about_ca_topic_score_codex":0.000089750705,"about_ca_topic_score_gemma":0.0000086107275,"teacher_disagreement_score":0.70646477,"about_ca_system_score_codex":0.000017490154,"about_ca_system_score_gemma":0.0001623885,"threshold_uncertainty_score":0.38465297},"labels":[],"label_agreement":null},{"id":"W2175772512","doi":"10.1016/j.jda.2012.04.009","title":"Kinetic Euclidean minimum spanning tree in the plane","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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 Victoria","funders":"","keywords":"Euclidean minimum spanning tree; Delaunay triangulation; Mathematics; Combinatorics; Spanning tree; Constrained Delaunay triangulation; Minimum spanning tree; Bowyer–Watson algorithm; Plane (geometry); Euclidean geometry; Euclidean space; Pitteway triangulation; Triangulation; Geometry; Kruskal's algorithm","score_opus":0.021837724064157616,"score_gpt":0.27487479110109514,"score_spread":0.2530370670369375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175772512","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.2465991,0.002841013,0.7402255,0.0056478237,0.0018637222,0.00014901135,0.0000025112136,0.000017490356,0.0026538484],"genre_scores_gemma":[0.95381457,0.000024460443,0.04487934,0.00033095208,0.0008668284,0.0000013754064,0.0000023017124,0.000004094628,0.00007606379],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987789,0.00013169198,0.000360575,0.00008353927,0.00042695168,0.00021835584],"domain_scores_gemma":[0.99928266,0.00019836107,0.00021852269,0.00015375449,0.00006494893,0.00008173066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010882511,0.00008848252,0.00013488882,0.00018843902,0.00005864526,0.00010053246,0.00049383927,0.00003064065,0.00000872343],"category_scores_gemma":[0.00006558034,0.000056987923,0.00007609415,0.0004282326,0.000017303022,0.0006692137,0.000052587526,0.00019820996,0.000010143223],"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.00011313384,0.0010337431,0.016837679,0.00006373827,0.00021281361,0.0004898148,0.03575942,0.024667406,0.007264788,0.05912881,0.022918014,0.83151066],"study_design_scores_gemma":[0.004498749,0.0018296906,0.6040669,0.0002923951,0.0001152272,0.0046181153,0.0023068401,0.28807756,0.004305057,0.020116497,0.068731,0.0010419698],"about_ca_topic_score_codex":0.0000060558946,"about_ca_topic_score_gemma":0.000003009846,"teacher_disagreement_score":0.83046865,"about_ca_system_score_codex":0.00002406145,"about_ca_system_score_gemma":0.000039974504,"threshold_uncertainty_score":0.23239},"labels":[],"label_agreement":null},{"id":"W2176328280","doi":"","title":"Reconfiguring Convex Polygons.","year":2000,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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); Rectilinear polygon; Star-shaped polygon; Polygon covering; Monotone polygon; Regular polygon; Combinatorics; Mathematics; Vertex (graph theory); Convex polygon; Point in polygon; Simple polygon; Bounded function; Convex set; Geometry; Computer science; Mathematical analysis; Convex optimization; Graph","score_opus":0.007517519266372527,"score_gpt":0.2056582864475253,"score_spread":0.19814076718115275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176328280","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.07120175,0.00008886104,0.64631534,0.0018788216,0.00024101452,0.00006187185,3.363041e-7,0.00023677452,0.27997524],"genre_scores_gemma":[0.9287458,0.000014134007,0.042404547,0.0013030545,0.00009592505,0.000003832058,0.000002516233,0.0000023423636,0.027427832],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957556,0.000014363657,0.00008389489,0.00014390158,0.000089445835,0.00009283188],"domain_scores_gemma":[0.9997553,0.00002586801,0.000010030392,0.00014650068,0.000020432704,0.000041838957],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007814651,0.000041915962,0.000042827665,0.000043119195,0.00006342478,0.00007362753,0.00018723945,0.000016212212,0.0020261589],"category_scores_gemma":[0.000004214768,0.000039108523,0.000021328216,0.00019760363,0.0000062853633,0.00025498224,0.000015885867,0.00003050687,0.00075023994],"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.0000015552529,0.00001825052,0.00003392239,0.0000013914748,0.0000042927027,0.0000027367325,0.000092013564,0.0018274182,0.00058906875,0.101578474,0.0032022016,0.8926487],"study_design_scores_gemma":[0.0005770821,0.00009658645,0.0096869655,0.000010493707,0.0000034885593,0.00009429972,0.000011821021,0.4330463,0.03849886,0.023950504,0.49359924,0.00042436173],"about_ca_topic_score_codex":0.000008511689,"about_ca_topic_score_gemma":0.0000016456273,"teacher_disagreement_score":0.8922243,"about_ca_system_score_codex":0.0000074586833,"about_ca_system_score_gemma":0.000023629254,"threshold_uncertainty_score":0.9988861},"labels":[],"label_agreement":null},{"id":"W2178140869","doi":"","title":"The Ordinary Line Problem Revisited.","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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; University of Windsor","funders":"","keywords":"Line (geometry); Combinatorics; Plane (geometry); Mathematics; Set (abstract data type); Line segment; Computer science; Geometry","score_opus":0.012826908672160542,"score_gpt":0.2647592608315623,"score_spread":0.2519323521594018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178140869","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.0014739186,0.00030085124,0.96226054,0.0026020329,0.0001505743,0.000082044884,1.3106387e-7,0.00009099912,0.033038914],"genre_scores_gemma":[0.5412089,0.00007417527,0.43012,0.0019802474,0.000545909,0.000007125082,0.0000104277215,0.0000062605486,0.026046928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994445,0.000016638622,0.00013258646,0.0001283159,0.00014664695,0.00013134771],"domain_scores_gemma":[0.99941,0.0002443776,0.00002929375,0.00019133651,0.00008549927,0.000039502134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000755673,0.00004418284,0.000034592536,0.0000406435,0.00020646385,0.00010514029,0.00029056447,0.000016672422,0.000009963748],"category_scores_gemma":[0.0000337724,0.000027288712,0.000023299895,0.0004500394,0.00001119179,0.00017012382,0.00009398767,0.00004737977,0.00004522912],"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.0000036135966,0.000016360875,0.00004427008,0.0000021842613,0.000004167143,0.0000041865806,0.000032643293,0.00047960837,0.00035671427,0.6464525,0.010055484,0.34254828],"study_design_scores_gemma":[0.0002379888,0.0001674833,0.0042674155,0.000010615861,0.0000030228794,0.000059189995,0.000012146856,0.09624892,0.0068572294,0.07996831,0.81197476,0.00019292513],"about_ca_topic_score_codex":0.0000017746421,"about_ca_topic_score_gemma":0.000004742083,"teacher_disagreement_score":0.8019193,"about_ca_system_score_codex":0.000011798335,"about_ca_system_score_gemma":0.000023149469,"threshold_uncertainty_score":0.1587974},"labels":[],"label_agreement":null},{"id":"W2178828915","doi":"10.1007/978-3-319-27261-0_13","title":"Small-Area Orthogonal Drawings of 3-Connected Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Approx; Combinatorics; Planar graph; Graph; Computer science; Outerplanar graph; Discrete mathematics; Mathematics; Line graph; Pathwidth","score_opus":0.037818409343440565,"score_gpt":0.24690534692133578,"score_spread":0.2090869375778952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178828915","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.0014352513,0.0006146295,0.99265516,0.00034781278,0.0015399687,0.00028465345,0.000008971579,0.00011671532,0.0029968112],"genre_scores_gemma":[0.50431025,0.00002946332,0.49381,0.0007997213,0.0003972272,0.000009929271,0.000044577173,0.000036411522,0.000562398],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964695,0.000040492076,0.00064028933,0.0012076783,0.0011838258,0.00045820585],"domain_scores_gemma":[0.99705994,0.00046067126,0.00040906094,0.0009137013,0.00094757,0.00020907227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010702347,0.0004408284,0.0005317171,0.0013395319,0.0001592282,0.0002408677,0.0023014366,0.00027457703,0.000030411053],"category_scores_gemma":[0.0001826808,0.00041999784,0.00016169055,0.0013068161,0.0004766931,0.00047169536,0.00090360036,0.00050587865,0.000017438968],"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.0000151250315,0.000061933955,0.000084709245,0.00005320249,0.000028943881,0.000057559835,0.00076762115,0.17244238,0.00085786474,0.22650833,0.00010410143,0.5990182],"study_design_scores_gemma":[0.0003863535,0.0002555896,0.00024864203,0.00023993423,0.000011811098,0.00008579806,1.3975766e-7,0.42832878,0.0026243846,0.565743,0.00146833,0.0006072026],"about_ca_topic_score_codex":0.000014262351,"about_ca_topic_score_gemma":0.00006318643,"teacher_disagreement_score":0.598411,"about_ca_system_score_codex":0.00015914108,"about_ca_system_score_gemma":0.0012151574,"threshold_uncertainty_score":0.9998252},"labels":[],"label_agreement":null},{"id":"W2180211925","doi":"10.1007/978-3-642-34191-5_25","title":"Meshes Preserving Minimum Feature Size","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Vertex (graph theory); Polygon mesh; Triangulation; Computer science; Combinatorics; Graph; Feature (linguistics); Planar graph; Algorithm; Mathematics; Geometry; Computer graphics (images)","score_opus":0.0172671400611577,"score_gpt":0.24559672507108687,"score_spread":0.22832958500992917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180211925","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.00012835216,0.0026352217,0.9861042,0.0019630021,0.0027664367,0.00034862393,0.0000047349395,0.00017995248,0.005869506],"genre_scores_gemma":[0.15135807,0.0001183474,0.83800024,0.0026432062,0.0025817049,0.000017787936,0.000017187103,0.000052829233,0.005210622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962684,0.000047105837,0.0004167952,0.0013297999,0.0012011268,0.0007367672],"domain_scores_gemma":[0.99689174,0.0010168311,0.0002733245,0.0012475449,0.00032057406,0.00024996445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009432514,0.0005348279,0.00045762915,0.0006210531,0.00033287387,0.00065071444,0.0030581376,0.00038371567,0.000078679645],"category_scores_gemma":[0.00022474406,0.0004982828,0.00015631196,0.0008265603,0.00028344206,0.0011947011,0.0016581428,0.00077862944,0.00007999249],"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.000008306579,0.000054289434,0.000073513766,0.00007098103,0.000024753572,0.000049134425,0.0010055952,0.052147824,0.0007839126,0.034082472,0.000694313,0.9110049],"study_design_scores_gemma":[0.00053868565,0.00022941353,0.0012154899,0.0005089455,0.000026509408,0.00020548906,2.5651985e-7,0.68035334,0.004723754,0.27210993,0.03839174,0.0016964645],"about_ca_topic_score_codex":0.000007130476,"about_ca_topic_score_gemma":0.00002923647,"teacher_disagreement_score":0.90930843,"about_ca_system_score_codex":0.0002304353,"about_ca_system_score_gemma":0.0005210587,"threshold_uncertainty_score":0.99974686},"labels":[],"label_agreement":null},{"id":"W2181254386","doi":"","title":"Polygons Cuttable by a Circular Saw.","year":2000,"lang":"en","type":"article","venue":"","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":"Circular saw; Polygon (computer graphics); Regular polygon; Mathematics; Geometry; Projection (relational algebra); Rest (music); Point in polygon; Combinatorics; Computer science; Algorithm; Physics; Acoustics; Telecommunications","score_opus":0.005260923355703075,"score_gpt":0.2050842753366063,"score_spread":0.19982335198090323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181254386","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.02844429,0.00028803363,0.90942395,0.0015776488,0.00011088937,0.000064513784,0.000001752349,0.00016387213,0.05992505],"genre_scores_gemma":[0.9015237,0.000029110979,0.044062987,0.0024826392,0.00008542121,0.000009430145,0.000019687901,0.0000050692033,0.05178194],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941224,0.000019827863,0.00009072478,0.00019077917,0.00015015666,0.0001362643],"domain_scores_gemma":[0.999686,0.000020952062,0.000011287653,0.00019690245,0.000024567615,0.00006031176],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000081902,0.000056387875,0.000051895026,0.000039336417,0.00009424765,0.0001008782,0.00024185702,0.000022649916,0.0011687397],"category_scores_gemma":[0.0000043696796,0.000053229156,0.000029250896,0.000356084,0.000007932063,0.0003199824,0.000025144473,0.000035959747,0.0005572705],"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.000003950719,0.00019819762,0.0001517669,0.0000063802145,0.000026289692,0.000008756919,0.00025515162,0.009048973,0.01290533,0.115956046,0.2525758,0.60886335],"study_design_scores_gemma":[0.0002888022,0.00005167394,0.0005694301,0.0000031093723,0.0000033098638,0.000034975634,0.0000051076054,0.21908252,0.012080345,0.007827951,0.7598324,0.00022042076],"about_ca_topic_score_codex":0.000032554504,"about_ca_topic_score_gemma":0.0000014629454,"teacher_disagreement_score":0.8730794,"about_ca_system_score_codex":0.000013074139,"about_ca_system_score_gemma":0.00003496328,"threshold_uncertainty_score":0.99974436},"labels":[],"label_agreement":null},{"id":"W2182520915","doi":"","title":"Exact Algorithms and APX-Hardness Results for Geometric Set Cover","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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":"Combinatorics; Cover (algebra); Mathematics; Vertex cover; Monotone polygon; Rectangle; Set cover problem; Unit square; Approximation algorithm; Time complexity; Algorithm; Line segment; Computational geometry; Square (algebra); Set (abstract data type); Computer science; Geometry","score_opus":0.0761986086665031,"score_gpt":0.2723684118473931,"score_spread":0.19616980318088997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182520915","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.01547483,0.00016423617,0.97104615,0.0012778456,0.0011326883,0.00056766166,0.00056382525,0.00011348465,0.009659308],"genre_scores_gemma":[0.925945,0.0000196079,0.07094517,0.0014748276,0.0001623698,0.00005501487,0.00038935032,0.000017189666,0.0009914985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776,0.00006863647,0.00042608508,0.0007894457,0.00043971653,0.0005160958],"domain_scores_gemma":[0.99772996,0.00045646995,0.00016473446,0.00034154902,0.00066670106,0.00064058043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056818686,0.0002792645,0.0002640793,0.0017681078,0.00038160157,0.00029541715,0.000580746,0.00013901536,0.00010206006],"category_scores_gemma":[0.00031773702,0.00029991023,0.0000829177,0.0017753313,0.00008205545,0.0005082962,0.0000838292,0.00018069724,0.00013434741],"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.0001675831,0.000197924,0.00063967664,0.00008734328,0.00017642629,0.000074995936,0.0014606015,0.023817442,0.000024835632,0.61277586,0.03442097,0.32615635],"study_design_scores_gemma":[0.0030335174,0.00088045833,0.057584118,0.00007405007,0.000031134914,0.00011073302,0.00010757743,0.8117409,0.00037650575,0.079310216,0.045568693,0.0011821274],"about_ca_topic_score_codex":0.0015649346,"about_ca_topic_score_gemma":0.00046549345,"teacher_disagreement_score":0.9104701,"about_ca_system_score_codex":0.0001696815,"about_ca_system_score_gemma":0.0010840598,"threshold_uncertainty_score":0.9999453},"labels":[],"label_agreement":null},{"id":"W2183482302","doi":"","title":"Computing a planar widest empty -siphon in o(n 3 ) time","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"","keywords":"Combinatorics; Planar; Plane (geometry); Computational geometry; Euclidean geometry; Euclidean space; Time complexity; Mathematics; Set (abstract data type); Chain (unit); Binary logarithm; Property (philosophy); Algorithm; Geometry; Computer science; Physics; Computer graphics (images)","score_opus":0.02081391544154621,"score_gpt":0.254161815478128,"score_spread":0.2333479000365818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183482302","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.28204116,0.000060922797,0.7036916,0.0020296972,0.00059087493,0.00031234647,0.000028297594,0.00013942705,0.011105679],"genre_scores_gemma":[0.9678163,0.0000019575223,0.028968168,0.0025246968,0.00016480291,0.000003965386,0.00015756575,0.00001474929,0.00034778955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731374,0.000084367864,0.00053627265,0.0006653627,0.00069044874,0.0007098305],"domain_scores_gemma":[0.9980246,0.0006030337,0.00013660964,0.00031622904,0.0003112133,0.000608303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011848295,0.00027065506,0.000268095,0.002102816,0.0002656483,0.00029960796,0.0008848709,0.00014662856,0.00013471706],"category_scores_gemma":[0.00015417545,0.00031466293,0.00007261945,0.0023003502,0.00007567289,0.00036701752,0.000072140996,0.00034929987,0.0006849624],"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.000045824127,0.0002189977,0.007862096,0.000027597089,0.000046030218,0.00048751806,0.0008863578,0.19172639,0.00030866158,0.6898923,0.0046476014,0.10385063],"study_design_scores_gemma":[0.0011920352,0.00023433023,0.25742018,0.00014620606,0.0000055099,0.000116730516,0.00009007425,0.67993504,0.00025076856,0.054732803,0.004996753,0.0008795367],"about_ca_topic_score_codex":0.0030906568,"about_ca_topic_score_gemma":0.010401089,"teacher_disagreement_score":0.6857751,"about_ca_system_score_codex":0.00049160287,"about_ca_system_score_gemma":0.0012305145,"threshold_uncertainty_score":0.99993056},"labels":[],"label_agreement":null},{"id":"W2183879331","doi":"10.46298/dmtcs.628","title":"The Erdős-Sós conjecture for geometric graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":"Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Mathematics; Conjecture; General position; Graph; Planar graph; Regular polygon; Discrete mathematics; Geometry","score_opus":0.010941072128076173,"score_gpt":0.25271982659157555,"score_spread":0.24177875446349936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183879331","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.00796689,0.00010071374,0.9857351,0.0032015957,0.0007674336,0.0008206087,0.000003489306,0.00014984103,0.0012542972],"genre_scores_gemma":[0.60973763,0.0000075349844,0.38960212,0.0003854228,0.00010715546,0.00009854078,0.0000030443869,0.000009958294,0.000048588383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972137,0.00006624741,0.00046847336,0.0006479358,0.00089634006,0.00070726895],"domain_scores_gemma":[0.99629307,0.001804141,0.0001620221,0.00093051366,0.00053997146,0.000270301],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001756598,0.00025263312,0.0002371362,0.00032082343,0.0014005991,0.0019860934,0.0027662052,0.00006482175,0.000034640703],"category_scores_gemma":[0.00043763695,0.00015656423,0.00016421622,0.002564726,0.0013819631,0.00075812364,0.00071222166,0.00017443854,0.00010186695],"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.0000014245365,0.00003560563,0.000004541704,0.000015797017,0.000009044358,5.889119e-7,0.00026482323,0.00039338102,0.00020305111,0.96857566,0.00065446855,0.029841645],"study_design_scores_gemma":[0.00012277467,0.00008794929,0.00010771188,0.000009950567,0.0000048915954,0.000015948313,0.000014076863,0.49823067,0.00078999967,0.5000777,0.00039424826,0.00014404862],"about_ca_topic_score_codex":0.0000017483208,"about_ca_topic_score_gemma":4.805187e-7,"teacher_disagreement_score":0.60177076,"about_ca_system_score_codex":0.000039876682,"about_ca_system_score_gemma":0.0001353699,"threshold_uncertainty_score":0.99989945},"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":"W2184499742","doi":"","title":"Convexifying Polygons Without Losing Visibilities","year":2011,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"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; University of Ottawa","funders":"","keywords":"Vertex (graph theory); Simple polygon; Combinatorics; Polygon (computer graphics); Star-shaped polygon; Rectilinear polygon; Regular polygon; Visibility polygon; Polygon covering; Mathematics; Point in polygon; Enhanced Data Rates for GSM Evolution; Convex set; Computer science; Geometry; Graph; Artificial intelligence; Telecommunications; Convex optimization","score_opus":0.06451392659182047,"score_gpt":0.2615321981476595,"score_spread":0.197018271555839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184499742","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.061962157,0.000053471787,0.8944149,0.000118058924,0.00027809502,0.00005259437,2.527236e-7,0.00016218703,0.04295829],"genre_scores_gemma":[0.8284541,0.0000014706595,0.16980933,0.00036384555,0.00004216555,0.0000027250205,9.257299e-7,0.0000025501702,0.0013229151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994164,0.000025685858,0.00011879588,0.00018919086,0.00012348888,0.00012643103],"domain_scores_gemma":[0.9996273,0.00003494886,0.00002887923,0.00019868283,0.00006042836,0.000049756603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001449922,0.00006284908,0.000062341394,0.00008676087,0.0001045407,0.00007138634,0.00022221809,0.000021382322,0.0001246254],"category_scores_gemma":[0.000019036172,0.00005621087,0.000028906108,0.00020184292,0.000021162283,0.00046923058,0.00008560552,0.000041698426,0.00007872327],"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.0000054878374,0.00006514365,0.004747655,0.000010418874,0.000015715204,0.0000041366325,0.0039173677,0.0001479018,0.0020914897,0.9487691,0.0004668076,0.03975876],"study_design_scores_gemma":[0.0010558863,0.00036170843,0.052016336,0.00005553537,0.000019584637,0.0001344476,0.0007582877,0.54231614,0.19372351,0.20072645,0.007774703,0.0010573878],"about_ca_topic_score_codex":0.000038333186,"about_ca_topic_score_gemma":0.00000678651,"teacher_disagreement_score":0.7664919,"about_ca_system_score_codex":0.000012765015,"about_ca_system_score_gemma":0.000044387245,"threshold_uncertainty_score":0.22922127},"labels":[],"label_agreement":null},{"id":"W2185134590","doi":"","title":"Turning Orthogonally Convex Polyhedra into Orthoballs","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Convex polytope; Regular polygon; Combinatorics; Mathematics; Planar graph; Face (sociological concept); Graph; Convex set; Computer science; Geometry; Convex optimization","score_opus":0.01531333210797006,"score_gpt":0.2375764296703209,"score_spread":0.22226309756235083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185134590","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.053022806,0.00007097038,0.9205445,0.005569782,0.00092203106,0.00022015715,0.000018775145,0.00018717746,0.01944378],"genre_scores_gemma":[0.9402767,0.0000040846267,0.0525176,0.0061470936,0.0002652846,0.000018934028,0.00018798503,0.00001819159,0.000564123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973096,0.00017788859,0.0004474896,0.00076135166,0.00073700014,0.00056664896],"domain_scores_gemma":[0.99740976,0.00051809964,0.00016932638,0.00044107664,0.00064851536,0.0008132325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006040669,0.00031600922,0.0002993062,0.001192807,0.00051170116,0.00051865436,0.00094235217,0.0001467934,0.00036579007],"category_scores_gemma":[0.00031682107,0.00034614728,0.00011373761,0.0014501147,0.0000877151,0.000502536,0.00010683771,0.00032693363,0.0005854032],"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.0000058250025,0.000031458996,0.0007798558,0.00001274567,0.00002924169,0.000016718017,0.00016263324,0.094756275,0.000095414565,0.8131275,0.0015727674,0.08940953],"study_design_scores_gemma":[0.0006387271,0.0002484382,0.036746915,0.00006111389,0.000009550008,0.000054041044,0.000029975563,0.7949308,0.00013103441,0.12671351,0.039739687,0.0006961969],"about_ca_topic_score_codex":0.002031949,"about_ca_topic_score_gemma":0.005116633,"teacher_disagreement_score":0.8872539,"about_ca_system_score_codex":0.00023554501,"about_ca_system_score_gemma":0.0017274276,"threshold_uncertainty_score":0.999899},"labels":[],"label_agreement":null},{"id":"W2185561909","doi":"","title":"The spanning ratio of the Delaunay triangulation is greater than = 2","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Euclidean minimum spanning tree; Mathematics; Spanning tree; Shortest path problem; Pitteway triangulation; Discrete mathematics; Graph; Kruskal's algorithm","score_opus":0.02716924511353718,"score_gpt":0.24636877119434886,"score_spread":0.21919952608081167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185561909","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.1947235,0.0001868844,0.7559499,0.04038236,0.0013300339,0.0006140855,0.000045135836,0.000072123454,0.0066959364],"genre_scores_gemma":[0.99408,0.000003935244,0.0022839182,0.0026953088,0.00011096702,0.0000070453266,0.000022783743,0.0000056263216,0.0007904009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983165,0.00011651016,0.00036259237,0.0003372212,0.0005635203,0.00030360452],"domain_scores_gemma":[0.99845123,0.00025305268,0.0001967018,0.00042506435,0.00049203215,0.00018193075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037194148,0.0001688947,0.00014436821,0.00034439316,0.0006906922,0.00029473004,0.000827364,0.00007658174,0.000047128222],"category_scores_gemma":[0.00012308783,0.00011789169,0.00011378137,0.0012692572,0.00007630718,0.00026451558,0.00004355647,0.00017618513,0.000038717866],"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.000022446919,0.000027910826,0.0010969948,0.000004389261,0.000042398016,0.0000035470791,0.0006675211,0.13437961,0.0001687174,0.76312596,0.003571637,0.09688886],"study_design_scores_gemma":[0.0005344506,0.00020374978,0.33833608,0.00005136142,0.000014008984,0.00002064663,0.000044389108,0.53130543,0.0012820086,0.124281466,0.0036311971,0.00029521683],"about_ca_topic_score_codex":0.00044828682,"about_ca_topic_score_gemma":0.00065140007,"teacher_disagreement_score":0.7993565,"about_ca_system_score_codex":0.0001317954,"about_ca_system_score_gemma":0.0010203697,"threshold_uncertainty_score":0.5312316},"labels":[],"label_agreement":null},{"id":"W2187335805","doi":"","title":"Drawing some planar graphs with integer edge-lengths.","year":2011,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Planar graph; Combinatorics; Bipartite graph; Mathematics; 1-planar graph; Planar; Pathwidth; Book embedding; Integer (computer science); Enhanced Data Rates for GSM Evolution; Chordal graph; Outerplanar graph; Discrete mathematics; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.023574514460229963,"score_gpt":0.21497864729753344,"score_spread":0.19140413283730348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187335805","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.029079847,0.00006222034,0.9437332,0.00024531412,0.0003054316,0.000078009594,4.1321582e-7,0.00017534816,0.026320215],"genre_scores_gemma":[0.8777573,0.0000037266284,0.120546244,0.0007349321,0.00006256404,0.000007180817,0.0000033795704,0.0000047698677,0.00087988004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930805,0.000021634534,0.00011286341,0.00023649345,0.00017060224,0.00015033684],"domain_scores_gemma":[0.9995791,0.00003344187,0.000033753386,0.00021962749,0.00006614138,0.000067962115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012286888,0.00008814338,0.00007504995,0.00014688505,0.00009469259,0.00006280666,0.00031061095,0.000027068249,0.00006433571],"category_scores_gemma":[0.000007649451,0.00006552148,0.000029179915,0.0003481778,0.000022334294,0.00070154225,0.000047826637,0.00006799271,0.000094098],"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.0000076119118,0.00004904736,0.0003101249,0.0000038103196,0.000017103233,0.000012280896,0.0008277186,0.00021174195,0.00022696584,0.9806165,0.0012154926,0.016501602],"study_design_scores_gemma":[0.002515724,0.0015580371,0.04703457,0.00011197892,0.000048196216,0.00024069274,0.00044122548,0.212594,0.08577579,0.6208706,0.026803726,0.0020054353],"about_ca_topic_score_codex":0.000024314171,"about_ca_topic_score_gemma":0.000011011328,"teacher_disagreement_score":0.84867746,"about_ca_system_score_codex":0.000010662939,"about_ca_system_score_gemma":0.000048221445,"threshold_uncertainty_score":0.26718885},"labels":[],"label_agreement":null},{"id":"W2188040650","doi":"","title":"Bottleneck Bichromatic Plane Matching of Points","year":2014,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Plane (geometry); Bottleneck; Matching (statistics); Set (abstract data type); Point (geometry); Combinatorics; Line segment; Line (geometry); Algorithm; Point set registration; Computer science; Mathematics; Geometry","score_opus":0.008593895359271573,"score_gpt":0.22201809244388976,"score_spread":0.21342419708461818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188040650","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.16367458,0.00001005585,0.8297957,0.00036346907,0.00013932704,0.000029218414,2.2806354e-7,0.000043534452,0.0059438776],"genre_scores_gemma":[0.8006899,7.6586787e-7,0.19878396,0.00022337161,0.000032963824,0.0000010276669,0.0000025124639,0.0000015423932,0.00026400576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948907,0.000033788878,0.00014005211,0.000111305264,0.00015293865,0.00007285613],"domain_scores_gemma":[0.9996074,0.00011212821,0.000048575108,0.00016963376,0.000032268897,0.000030032279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023873308,0.00004432479,0.00007449505,0.00006995656,0.00003144006,0.000025920885,0.00020958879,0.000015950216,0.000039395713],"category_scores_gemma":[0.000028521315,0.00003792307,0.000021036174,0.00017289007,0.000007401903,0.00015829351,0.000058171638,0.00002370707,0.000060845523],"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.0000019106697,0.000056246725,0.00017099726,0.000041298677,0.000012323762,8.0591906e-7,0.0004052166,0.004735471,0.009083953,0.92380583,0.0012938074,0.060392153],"study_design_scores_gemma":[0.0005319045,0.00017647265,0.014738375,0.00004449385,0.00000603575,0.000033124204,0.000020771595,0.6948838,0.04437301,0.24166884,0.0032844166,0.0002387503],"about_ca_topic_score_codex":0.000011377353,"about_ca_topic_score_gemma":0.0000029697692,"teacher_disagreement_score":0.69014835,"about_ca_system_score_codex":0.0000052137975,"about_ca_system_score_gemma":0.000016496066,"threshold_uncertainty_score":0.1546458},"labels":[],"label_agreement":null},{"id":"W2188204494","doi":"10.1016/j.jctb.2015.06.002","title":"On the crossing number of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:math>","year":2015,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"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":"Scroll; Parity (physics); Simple (philosophy); Mathematics; Discrete mathematics; Computer science; Combinatorics; Physics; Theology; Particle physics; Philosophy","score_opus":0.01957744043638374,"score_gpt":0.2515529048650365,"score_spread":0.23197546442865277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188204494","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.6618028,0.0007928045,0.002810408,0.0009154398,0.011980504,0.000030943465,0.00006703319,0.00007354729,0.32152647],"genre_scores_gemma":[0.9918294,0.00029493158,0.0019044642,0.0012299371,0.0038328154,0.0001155485,0.0001155086,0.00025827842,0.0004191437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.992372,0.0008620485,0.001784529,0.00089621946,0.0027895744,0.0012956628],"domain_scores_gemma":[0.99225634,0.0022866614,0.0026898263,0.0014755502,0.00049642596,0.0007951843],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0045481822,0.0005824687,0.00033338793,0.00038830526,0.0015322613,0.0021273247,0.002203498,0.0011456177,0.16143316],"category_scores_gemma":[0.002718612,0.000925665,0.001302187,0.0012067339,0.0014579967,0.002299889,0.0013500771,0.0014326046,0.00070026144],"study_design_candidate":"bench_or_experimental","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.0026969172,0.00030351063,0.00000856237,0.00026945368,0.00079287123,0.00050678966,0.003125605,0.004286032,0.001121649,0.8073876,0.17767191,0.0018291294],"study_design_scores_gemma":[0.0026460458,0.0028615498,0.00008133262,0.0009942042,0.0006416068,0.0018360626,0.0016373036,0.029459411,0.93926466,0.011125505,0.008457347,0.0009949658],"about_ca_topic_score_codex":0.00024218597,"about_ca_topic_score_gemma":0.00011674688,"teacher_disagreement_score":0.938143,"about_ca_system_score_codex":0.00002451205,"about_ca_system_score_gemma":0.0027213215,"threshold_uncertainty_score":0.9997676},"labels":[],"label_agreement":null},{"id":"W2189399420","doi":"10.82308/1812","title":"Guarding problems and geometric split trees","year":2011,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Simple (philosophy); Tree (set theory); Mathematics; Monotone polygon; Point (geometry); Terrain; Polygon (computer graphics); Computer science; Algorithm; Combinatorics; Theoretical computer science; Geometry; Geography","score_opus":0.040205523948977036,"score_gpt":0.22023665030972378,"score_spread":0.18003112636074675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189399420","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.95426244,0.0004595538,0.0024100314,0.000045645455,0.00064904,0.00038942444,0.00004120044,0.00040130765,0.041341357],"genre_scores_gemma":[0.9613845,0.00007327581,0.03750735,0.00024615292,0.000035501773,0.00003611851,0.00000929264,0.000024009618,0.0006838495],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767894,0.0001544244,0.00043400517,0.0007844499,0.00048399705,0.0004642012],"domain_scores_gemma":[0.9986715,0.00017081313,0.0001746523,0.0005120717,0.00020742031,0.0002635663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009251048,0.0002879025,0.00026705573,0.0006949299,0.000752332,0.00015562894,0.0006627903,0.00013590143,0.00006489946],"category_scores_gemma":[0.00026994638,0.00028997785,0.00010664081,0.0018704385,0.00004859127,0.001737848,0.00047403103,0.00032063795,0.00014814627],"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.00001025653,0.0001228195,0.00026129864,0.00003438971,0.000048583533,0.000023291994,0.000022807117,0.00028622404,0.008062856,0.4661392,0.000005375213,0.5249829],"study_design_scores_gemma":[0.0034923519,0.0012768044,0.08916253,0.0002597133,0.00014812248,0.00065071875,0.0000974569,0.018283062,0.184058,0.5359394,0.16348562,0.0031462475],"about_ca_topic_score_codex":0.00008512755,"about_ca_topic_score_gemma":0.000040861076,"teacher_disagreement_score":0.52183664,"about_ca_system_score_codex":0.00012313877,"about_ca_system_score_gemma":0.000019494562,"threshold_uncertainty_score":0.99995524},"labels":[],"label_agreement":null},{"id":"W2189441165","doi":"","title":"Pushing the boundaries of polytopal realizability","year":2011,"lang":"en","type":"article","venue":"","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":"McMaster University; University of New Brunswick","funders":"","keywords":"Realizability; Combinatorics; Upper and lower bounds; Mathematics; Vertex (graph theory); Polytope; Dimension (graph theory); Graph; Discrete mathematics; Algorithm","score_opus":0.042671183234211596,"score_gpt":0.23274993730202126,"score_spread":0.19007875406780966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189441165","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.088024125,0.000037598005,0.89059305,0.0005380879,0.00023746303,0.000051997784,4.81611e-7,0.000039161387,0.020478033],"genre_scores_gemma":[0.96462834,9.517107e-7,0.035043195,0.00016320393,0.000021937118,0.0000018957833,6.153352e-7,8.860383e-7,0.00013897651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995682,0.000038580074,0.00011287643,0.00009788169,0.000118509466,0.000063901454],"domain_scores_gemma":[0.9996008,0.000049846698,0.000037101963,0.00022989885,0.000065367385,0.000016971058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030618533,0.000034024557,0.000043404478,0.000024775018,0.00013547113,0.00006920422,0.00030320205,0.000012630056,0.000046299425],"category_scores_gemma":[0.00004328433,0.000021368607,0.000025716454,0.00020224821,0.0000799892,0.00022176957,0.00009262034,0.00002902373,0.0000053660706],"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.0000029238831,0.000025405574,0.001446102,0.0000030016408,0.000004365311,2.7104576e-7,0.0021937296,0.000043545537,0.0002853108,0.9800434,0.00038375534,0.015568196],"study_design_scores_gemma":[0.0003015006,0.00020839545,0.37823954,0.000009497869,0.000010350618,0.000027059887,0.00022735639,0.062443003,0.09949661,0.43231624,0.026461238,0.00025919036],"about_ca_topic_score_codex":0.00031879058,"about_ca_topic_score_gemma":0.00005409751,"teacher_disagreement_score":0.8766042,"about_ca_system_score_codex":0.000005429193,"about_ca_system_score_gemma":0.00006918941,"threshold_uncertainty_score":0.104194805},"labels":[],"label_agreement":null},{"id":"W2189549633","doi":"10.1016/j.tcs.2017.01.030","title":"The within-strip discrete unit disk cover problem","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"University of Waterloo","funders":"","keywords":"STRIPS; Cardinality (data modeling); Cover (algebra); Set cover problem; Approximation algorithm; Unit disk; Set (abstract data type); Mathematics; Unit (ring theory); Plane (geometry); Combinatorics; Unit disk graph; Discrete mathematics; Algorithm; Computer science; Geometry; Telecommunications","score_opus":0.01477852363600524,"score_gpt":0.27497184750959625,"score_spread":0.260193323873591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189549633","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.01550996,0.000026200005,0.9704873,0.004663545,0.0012469764,0.00020119445,0.0000017610703,0.00010808506,0.0077549675],"genre_scores_gemma":[0.91654307,0.0000066635494,0.082688615,0.00032812488,0.00022750246,0.000009559756,0.0000010488623,0.0000054889465,0.00018991159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975968,0.00010404365,0.0002855763,0.00062584283,0.00088343443,0.0005043219],"domain_scores_gemma":[0.99735177,0.00033808974,0.00019262914,0.0015939348,0.00028036535,0.00024320587],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.002235634,0.00017352648,0.00013769699,0.00008152647,0.003813645,0.0037568992,0.005195406,0.000039604056,0.000011339617],"category_scores_gemma":[0.00023287437,0.00010935201,0.000065268876,0.00049397163,0.0034965992,0.0013976787,0.001930611,0.00021345094,0.00014540709],"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.0000062679524,0.00001735641,0.00007760941,0.000002116203,0.0000039941856,0.000004321418,0.000189841,0.0018790005,0.000159321,0.9618135,0.00009310587,0.03575355],"study_design_scores_gemma":[0.00017418421,0.000103064434,0.0042338017,0.0000149556245,0.0000033617212,0.00002176411,0.000002618864,0.6572856,0.0018977717,0.33395237,0.0021403776,0.00017015889],"about_ca_topic_score_codex":0.0000043198525,"about_ca_topic_score_gemma":0.000002049061,"teacher_disagreement_score":0.9010331,"about_ca_system_score_codex":0.000036170626,"about_ca_system_score_gemma":0.00023810082,"threshold_uncertainty_score":0.9992153},"labels":[],"label_agreement":null},{"id":"W2191739325","doi":"10.1016/j.tcs.2015.11.048","title":"Space-efficient algorithm for computing a centerpoint of a set of points in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">R</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math>","year":2015,"lang":"lv","type":"article","venue":"Theoretical Computer Science","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":"Simon Fraser University","funders":"","keywords":"Algorithm; Set (abstract data type); Space (punctuation); Point (geometry); Computer science; Scroll; Mathematics; Geometry; Programming language","score_opus":0.021527318223237855,"score_gpt":0.256776298198295,"score_spread":0.23524897997505714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2191739325","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.56385833,0.00027398212,0.36504725,0.0008942346,0.0031119105,0.00008407625,0.00017367654,0.00012062045,0.0664359],"genre_scores_gemma":[0.920297,0.000055480556,0.07740047,0.0007134544,0.0010023214,0.00014641196,0.0001981383,0.0001513213,0.000035352066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99154806,0.00040318398,0.0016700847,0.001750337,0.002780965,0.0018473929],"domain_scores_gemma":[0.99408346,0.0015000432,0.0013665924,0.0017008773,0.0004051665,0.0009438669],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0040701106,0.0005973981,0.0003647879,0.00064808776,0.00089418463,0.0012281385,0.0028156356,0.00079313025,0.017816437],"category_scores_gemma":[0.00090419815,0.0009812961,0.0008514051,0.0020663724,0.002907562,0.0011150112,0.003339696,0.00085698406,0.0003406791],"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.0006725064,0.0003551192,0.0000047523026,0.00044415504,0.00022827054,0.00033195727,0.003955568,0.022709783,0.0007190842,0.9518817,0.009753126,0.008943983],"study_design_scores_gemma":[0.0015103054,0.0013400146,0.00005553769,0.000583994,0.0001531139,0.0006196452,0.0003342539,0.6407015,0.35328677,0.0006379746,0.00021494307,0.0005619902],"about_ca_topic_score_codex":0.00033123026,"about_ca_topic_score_gemma":0.00006915465,"teacher_disagreement_score":0.9512437,"about_ca_system_score_codex":0.000028838866,"about_ca_system_score_gemma":0.0020150756,"threshold_uncertainty_score":0.99980867},"labels":[],"label_agreement":null},{"id":"W2196269078","doi":"10.1016/j.tcs.2015.06.040","title":"Matchings in higher-order Gabriel graphs","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","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; Order (exchange); Mathematics; Computer science; Discrete mathematics; Business","score_opus":0.02564039760582372,"score_gpt":0.2643235027200953,"score_spread":0.2386831051142716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196269078","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.07317453,0.000035684352,0.91552466,0.0032956921,0.0012042287,0.0001105271,3.956164e-7,0.00014106065,0.0065132445],"genre_scores_gemma":[0.79150486,0.0000012650138,0.20725846,0.0010945159,0.00009348263,0.000005168908,0.0000010220348,0.00000406516,0.00003717668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777484,0.00009823903,0.00026445495,0.00060957967,0.00080923,0.0004436606],"domain_scores_gemma":[0.99871445,0.0001366172,0.000048718248,0.00047461345,0.00029982446,0.00032577058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017163202,0.00014769685,0.0001569521,0.000377323,0.00015312138,0.00039329304,0.0015529845,0.00004444071,0.000028554303],"category_scores_gemma":[0.00008856419,0.00012989515,0.00003514774,0.0030981093,0.00081432454,0.0009788419,0.0007036238,0.00017256537,0.00009978568],"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.00000502657,0.000052007603,0.0000967955,0.0000019192903,0.0000010398437,0.000012016426,0.00040913362,0.0033003634,0.00014727777,0.9765324,0.00015757463,0.01928446],"study_design_scores_gemma":[0.0003113586,0.00010766789,0.0025620963,0.000010858753,0.0000010008964,0.000023946248,0.0000041298335,0.41945642,0.0007426612,0.5760222,0.00058360596,0.00017404766],"about_ca_topic_score_codex":0.000008388803,"about_ca_topic_score_gemma":0.0000012123319,"teacher_disagreement_score":0.7183303,"about_ca_system_score_codex":0.000073631694,"about_ca_system_score_gemma":0.00025993772,"threshold_uncertainty_score":0.52969706},"labels":[],"label_agreement":null},{"id":"W2197147576","doi":"10.20382/jocg.v7i1a10","title":"Recursively-Regular Subdivisions and Applications","year":2013,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Social Fund; Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst","keywords":"Subdivision; Mathematics; Embedding; Combinatorics; Projection (relational algebra); Cone (formal languages); Polyhedron; Class (philosophy); Graph; Tree (set theory); Discrete mathematics; Computer science; Algorithm","score_opus":0.011312073626481756,"score_gpt":0.21660931250940735,"score_spread":0.2052972388829256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2197147576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05306294,0.0010022343,0.94251925,0.0013705277,0.00063236285,0.00036012888,0.000029587472,0.00005273511,0.00097020867],"genre_scores_gemma":[0.6953404,0.00064611924,0.3007777,0.00041939627,0.0009367777,0.0000050114368,0.00013055949,0.000033789256,0.0017102321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976343,0.00019230168,0.0006089674,0.00049406843,0.0008251629,0.00024519276],"domain_scores_gemma":[0.99591696,0.00049980526,0.0010779772,0.00035582625,0.0018174995,0.00033192063],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004298014,0.00031008598,0.0004883224,0.002370284,0.00028392288,0.0003456798,0.0012509616,0.00025616356,0.000038932983],"category_scores_gemma":[0.00007285414,0.00033936076,0.0002855019,0.0015238248,0.00011973773,0.00088528363,0.0010847705,0.00072494295,0.000023654939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002995524,0.00028055452,0.0003219598,0.00013412895,0.00042367232,0.00009467646,0.00025775007,0.585337,0.00009761476,0.33692437,0.005227622,0.07087074],"study_design_scores_gemma":[0.002868131,0.0006400228,0.024634697,0.0004975064,0.000416059,0.00083526515,0.0003394045,0.15079503,0.00027281264,0.52535784,0.29166898,0.0016742711],"about_ca_topic_score_codex":0.000011300963,"about_ca_topic_score_gemma":9.745773e-7,"teacher_disagreement_score":0.6422775,"about_ca_system_score_codex":0.00022024509,"about_ca_system_score_gemma":0.0007078677,"threshold_uncertainty_score":0.9999058},"labels":[],"label_agreement":null},{"id":"W2199106736","doi":"","title":"Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time","year":2009,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","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":"Mathematics; Voronoi diagram; Computational geometry; Combinatorics; Point location; Convex hull; Bounded function; Time complexity; Planar; Regular polygon; Discrete geometry; Euclidean geometry; Geometry; Point (geometry); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.008734252923532524,"score_gpt":0.2361341490770921,"score_spread":0.22739989615355957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2199106736","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.5362123,0.00057315035,0.41125014,0.048335712,0.00049181,0.0009362981,0.00004077999,0.00054494874,0.001614862],"genre_scores_gemma":[0.9171587,0.000019153691,0.08238061,0.00020041004,0.000028312848,0.000021149333,0.00008107863,0.000007874752,0.00010271894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760824,0.000055917706,0.00080386497,0.00067281164,0.00045697845,0.00040216208],"domain_scores_gemma":[0.9988054,0.00006619288,0.00026306597,0.0005504762,0.0002468079,0.000068056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006027974,0.0002585009,0.00039469165,0.0030321355,0.00008193366,0.000053211515,0.0008927953,0.00033568472,0.0000063932603],"category_scores_gemma":[0.00029124544,0.0002875964,0.000071514165,0.0052420567,0.00015542237,0.00086346886,0.00009490743,0.0004166312,0.00003952632],"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.0001790254,0.0013901797,0.002061088,0.00005849092,0.000054938864,0.00021677128,0.0009000936,0.573925,0.0076724165,0.1314816,0.0014375148,0.28062287],"study_design_scores_gemma":[0.0105936825,0.0015928841,0.13000058,0.0005213123,0.000029572826,0.00024013015,0.00006611738,0.68753177,0.015638215,0.13440552,0.017895814,0.0014844426],"about_ca_topic_score_codex":0.00003969166,"about_ca_topic_score_gemma":0.00013205667,"teacher_disagreement_score":0.3809464,"about_ca_system_score_codex":0.00022392311,"about_ca_system_score_gemma":0.00028232968,"threshold_uncertainty_score":0.9999576},"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":"W2206212529","doi":"10.1007/978-3-662-49529-2_19","title":"Improved Spanning Ratio for Low Degree Plane Spanners","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Spanner; Degree (music); Computer science; Plane (geometry); Graph; Approx; Spanning tree; Combinatorics; Mathematics; Theoretical computer science; Physics; Geometry; Distributed computing","score_opus":0.024979081227070352,"score_gpt":0.2514166378433761,"score_spread":0.22643755661630574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206212529","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.00005373874,0.0002491464,0.99346894,0.0012356703,0.0028067199,0.00065795606,0.000017331613,0.00014938434,0.0013610852],"genre_scores_gemma":[0.08478808,0.000031190302,0.9066957,0.0021464627,0.0024051394,0.000056703313,0.000045422526,0.000059134858,0.003772161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966891,0.000022969083,0.0005235568,0.0014574612,0.0006656723,0.0006412418],"domain_scores_gemma":[0.9974426,0.0007828448,0.00032778087,0.00086239574,0.00040489063,0.00017948993],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008037253,0.00048090087,0.00043628257,0.00083208794,0.00034748012,0.00051110267,0.00200689,0.00027435555,0.000015984058],"category_scores_gemma":[0.00015779956,0.00040590976,0.00015296784,0.00043376882,0.0002873472,0.0007375301,0.00057955406,0.00034238116,0.000028621782],"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.000015500123,0.000017427503,0.0000052746755,0.000042069627,0.000018051203,0.000014865396,0.00024012726,0.04199489,0.0027326958,0.04811193,0.000076101205,0.90673107],"study_design_scores_gemma":[0.0006045205,0.00027588246,0.00005529819,0.0003198775,0.000010412468,0.000047263828,9.427635e-8,0.8728807,0.007685175,0.11456848,0.0028176953,0.0007346177],"about_ca_topic_score_codex":0.000004285589,"about_ca_topic_score_gemma":0.0000297198,"teacher_disagreement_score":0.90599644,"about_ca_system_score_codex":0.00026439413,"about_ca_system_score_gemma":0.0007669868,"threshold_uncertainty_score":0.9998393},"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":"W2211252052","doi":"10.1111/j.1467-8659.2010.01655.x","title":"Spectral Mesh Processing","year":2010,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":211,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Geometry processing; Computer science; Laplacian smoothing; Smoothing; Eigenvalues and eigenvectors; Theoretical computer science; Curse of dimensionality; Computer graphics; Laplace operator; Graphics; Graph; Polygon mesh; Algorithm; Mesh generation; Artificial intelligence; Computer graphics (images); Mathematics; Computer vision; Finite element method","score_opus":0.010684261856116324,"score_gpt":0.23978864279892365,"score_spread":0.22910438094280733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211252052","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.038859166,0.000058356967,0.9561173,0.0018795043,0.001975595,0.0001099061,9.923637e-7,0.00028347364,0.0007157267],"genre_scores_gemma":[0.8294553,0.0000045133525,0.168616,0.0013304197,0.0004913768,0.0000075193316,0.000009995137,0.000009182602,0.000075685275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873585,0.000023669578,0.00021070045,0.00040061199,0.0002925449,0.00033663088],"domain_scores_gemma":[0.9992105,0.000045451492,0.00007836851,0.00038855826,0.00015163753,0.00012553502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002292613,0.0001509963,0.00012379511,0.0002635019,0.00028460604,0.0003685196,0.0007279096,0.00008298886,0.00001029034],"category_scores_gemma":[0.000009452223,0.00014739852,0.00009569918,0.00081852963,0.000054141507,0.0006475966,0.00024109514,0.00032663357,0.00003301479],"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.0000018343083,0.000058432895,0.0008472834,0.000008836732,0.000008959417,0.000008622832,0.0001289619,0.0002786344,0.00095774996,0.8548966,0.0035530305,0.13925102],"study_design_scores_gemma":[0.00025797327,0.00007987382,0.007059438,0.00000917304,0.0000039373704,0.000087318986,0.0000027529518,0.896167,0.0018225062,0.06525252,0.028988477,0.0002690753],"about_ca_topic_score_codex":0.0000033705346,"about_ca_topic_score_gemma":0.000025891992,"teacher_disagreement_score":0.8958883,"about_ca_system_score_codex":0.000008012468,"about_ca_system_score_gemma":0.00009454196,"threshold_uncertainty_score":0.6010737},"labels":[],"label_agreement":null},{"id":"W2212751721","doi":"10.1109/focs.2015.31","title":"Towards an Optimal Method for Dynamic Planar Point Location","year":2015,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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":"Binary logarithm; Logarithm; Combinatorics; Time complexity; Point (geometry); Point location; Log-log plot; Computer science; Planar; Mathematics; Algorithm; Discrete mathematics; Computer graphics (images); Geometry; Mathematical analysis","score_opus":0.03845279349619965,"score_gpt":0.3376689628572686,"score_spread":0.299216169361069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212751721","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.0020666306,0.000055139237,0.9948792,0.0013843504,0.0003077183,0.00016532367,0.0000014453074,0.00011472138,0.0010255082],"genre_scores_gemma":[0.16164345,6.888038e-7,0.8374295,0.00043736363,0.00006718961,0.000022627526,0.000048558333,0.0000036319527,0.00034696548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929726,0.000050655606,0.00012897002,0.00024008348,0.00017178652,0.000111263485],"domain_scores_gemma":[0.99932015,0.000043595515,0.000036914502,0.00019954328,0.00028607144,0.00011370281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005023398,0.00006901962,0.000071445975,0.00009534825,0.000055625907,0.000098156066,0.00026349284,0.00003291775,0.000004939016],"category_scores_gemma":[0.00005915853,0.00006274057,0.000024387196,0.00027726116,0.00000584864,0.00058544,0.000035727542,0.000029271709,0.000017532204],"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.000033332228,0.00009968633,0.000003744393,0.000010306289,0.000013392136,0.0000011921749,0.0011427107,0.2642982,0.0008378548,0.3526933,0.0034920792,0.37737423],"study_design_scores_gemma":[0.00027620653,0.00021197836,0.00016790531,0.0000015262475,0.0000029434123,0.000011112939,0.00007409381,0.9700409,0.002028794,0.023556035,0.0035359424,0.00009254778],"about_ca_topic_score_codex":0.000018235934,"about_ca_topic_score_gemma":0.000015986841,"teacher_disagreement_score":0.7057427,"about_ca_system_score_codex":0.00005327899,"about_ca_system_score_gemma":0.00018634647,"threshold_uncertainty_score":0.25584862},"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":"W2220384749","doi":"10.1007/978-3-540-77120-3_10","title":"Dilation-Optimal Edge Deletion in Polygonal Cycles","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Dilation (metric space); Convex polygon; Combinatorics; Regular polygon; Polygon (computer graphics); Path (computing); Time complexity; Running time; Enhanced Data Rates for GSM Evolution; Time dilation; Mathematics; Polygonal chain; Computer science; Algorithm; Geometry; Physics; Artificial intelligence","score_opus":0.02255068646276365,"score_gpt":0.2673628671819231,"score_spread":0.24481218071915944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220384749","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.0014065517,0.00042508976,0.9932818,0.00052196975,0.001492924,0.00028468468,0.0000035414741,0.000097276024,0.002486153],"genre_scores_gemma":[0.38820836,0.00003630444,0.60908705,0.0012795422,0.0009810987,0.000008553989,0.000038875725,0.000026966309,0.00033326828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996571,0.00003417813,0.0006096947,0.0012121868,0.0010228346,0.0005501068],"domain_scores_gemma":[0.99832946,0.00045901426,0.00022988592,0.00060088723,0.0002421098,0.0001386704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011833904,0.00039662057,0.00034628704,0.0018421088,0.00019919321,0.00036419698,0.0014445113,0.00030366506,0.000029109286],"category_scores_gemma":[0.00007638502,0.0004089078,0.00010275073,0.0011301392,0.00027874138,0.00077268557,0.0005714788,0.00063494686,0.000053754942],"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.000007657592,0.000031157953,0.00013435789,0.000011902575,0.000003720483,0.000043917804,0.0002995361,0.33131075,0.00013070312,0.03519669,0.000013078804,0.6328165],"study_design_scores_gemma":[0.00032343992,0.00010959003,0.004047566,0.00017795003,0.0000036324561,0.0000687502,1.3669288e-7,0.9085075,0.0011795089,0.08347128,0.0015203448,0.00059026846],"about_ca_topic_score_codex":0.000021803608,"about_ca_topic_score_gemma":0.00016791665,"teacher_disagreement_score":0.6322262,"about_ca_system_score_codex":0.00038100904,"about_ca_system_score_gemma":0.0005447504,"threshold_uncertainty_score":0.99983627},"labels":[],"label_agreement":null},{"id":"W2220646374","doi":"10.1007/978-3-319-29221-2_8","title":"Linear-Time Fitting of a k-Step Function","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Histogram; Computer science; Algorithm; Function (biology); Constant (computer programming); Set (abstract data type); Point (geometry); Plane (geometry); Line (geometry); Center (category theory); Mathematical optimization; Mathematics; Artificial intelligence; Geometry; Image (mathematics)","score_opus":0.013193087199052449,"score_gpt":0.2330798873075431,"score_spread":0.21988680010849063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220646374","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.0001086567,0.0002325526,0.9932393,0.0004444289,0.0013651903,0.000219392,0.0000048360416,0.00009371556,0.004291956],"genre_scores_gemma":[0.13518623,0.000028062197,0.85824996,0.0010386069,0.0016118009,0.000009050011,0.000012843841,0.0000394981,0.003823921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972715,0.000032584878,0.00053318415,0.0009645014,0.0008436773,0.00035457523],"domain_scores_gemma":[0.9978218,0.000543731,0.00038033238,0.0007454752,0.00040858577,0.00010006542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083953526,0.0003166177,0.00037892873,0.0008141443,0.00015393509,0.00012614632,0.0013643462,0.0002120464,0.000050624316],"category_scores_gemma":[0.000114676644,0.00026524015,0.00012554196,0.0006097659,0.00026787334,0.0005531871,0.0006745135,0.00029731222,0.000098954326],"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.000007903875,0.000017486193,0.000012531204,0.000025936739,0.00001077789,0.000008209121,0.000107898806,0.029600117,0.0016518402,0.02960596,0.00002861512,0.9389227],"study_design_scores_gemma":[0.00031991795,0.00028302832,0.00012711946,0.00043736168,0.000009824865,0.000034976285,3.6140396e-8,0.851413,0.00375143,0.14011277,0.0030409228,0.00046959225],"about_ca_topic_score_codex":0.0000032284795,"about_ca_topic_score_gemma":0.000005377532,"teacher_disagreement_score":0.93845314,"about_ca_system_score_codex":0.00013467616,"about_ca_system_score_gemma":0.00046225227,"threshold_uncertainty_score":0.99998},"labels":[],"label_agreement":null},{"id":"W22225833","doi":"10.48550/arxiv.1311.4860","title":"Computing Covers of Plane Forests","year":2013,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Cover (algebra); Disjoint sets; Combinatorics; Convex hull; Bounding overwatch; Mathematics; Plane (geometry); Function (biology); Pairwise comparison; Set (abstract data type); Regular polygon; Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.021014756440552698,"score_gpt":0.23658945077304488,"score_spread":0.21557469433249218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22225833","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.25570482,0.000055538007,0.72771096,0.0025779803,0.0006454886,0.00039566678,0.000045400866,0.00009349795,0.012770634],"genre_scores_gemma":[0.97102594,0.0000019771617,0.027582293,0.00094718236,0.00007700214,0.000009114155,0.000116533825,0.000009250788,0.00023071069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982726,0.000062591585,0.00038246508,0.0004098358,0.00049251184,0.00037998322],"domain_scores_gemma":[0.9981471,0.0003562695,0.00016674613,0.00028306872,0.00061803893,0.0004288298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020120092,0.00019212987,0.0002238279,0.0009199186,0.00018699966,0.00020671493,0.00063673424,0.000089155685,0.00037181377],"category_scores_gemma":[0.0001022704,0.00020685466,0.000072891504,0.0010624296,0.00007106092,0.0004206149,0.00007093161,0.0001661401,0.0004023142],"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.0000046905698,0.000059599526,0.0023955642,0.00002317211,0.00004708098,0.000013160798,0.00020433043,0.27314365,0.00013974671,0.6431535,0.00836522,0.07245034],"study_design_scores_gemma":[0.00047546296,0.00018289725,0.130055,0.00005604337,0.0000047624094,0.000028555625,0.00004508213,0.8132602,0.0003232982,0.053741105,0.0014727558,0.00035487115],"about_ca_topic_score_codex":0.0053902627,"about_ca_topic_score_gemma":0.0023376944,"teacher_disagreement_score":0.7153211,"about_ca_system_score_codex":0.00013650634,"about_ca_system_score_gemma":0.0010826933,"threshold_uncertainty_score":0.8435288},"labels":[],"label_agreement":null},{"id":"W2225340539","doi":"10.1007/s00440-017-0767-z","title":"The half plane UIPT is recurrent","year":2017,"lang":"en","type":"article","venue":"Probability Theory and Related Fields","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Institute for Mathematical Sciences; Simons Foundation","keywords":"Mathematics; Plane (geometry); Extension (predicate logic); Planar; Triangulation; Combinatorics; Geometry; Mathematical analysis; Pure mathematics; Computer science","score_opus":0.014785883025812924,"score_gpt":0.25312625371751524,"score_spread":0.2383403706917023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2225340539","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.40409583,0.0057535735,0.44052458,0.08527667,0.0062363534,0.0011416823,0.000008097792,0.00032735875,0.05663584],"genre_scores_gemma":[0.9967302,0.00016743004,0.00079438277,0.00019535318,0.000043327727,0.0000074887676,0.000001977206,0.0000020606917,0.0020577654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991985,0.0001610335,0.00015785506,0.00024414097,0.00010848636,0.0001300125],"domain_scores_gemma":[0.9988548,0.00036012213,0.00008977365,0.00059195724,0.000052836138,0.000050511342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014164271,0.00007676806,0.00007208442,0.000016857346,0.0011230063,0.0003143785,0.00048699195,0.00011366321,0.000026514845],"category_scores_gemma":[0.0003138264,0.000049298465,0.00003970536,0.000050546398,0.00014060114,0.0002984544,0.00020888081,0.00022739095,0.000021199949],"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.00002790433,0.000024768804,0.000080605634,0.000007746447,0.000017683918,0.0000014735666,0.0006489789,0.000050099734,0.000012296196,0.82863027,0.00032580795,0.1701724],"study_design_scores_gemma":[0.00016492176,0.000072304785,0.002186952,0.0000117257205,0.000006036081,0.000017079932,0.000009370892,0.007283018,0.00041917324,0.97932464,0.010418479,0.000086319655],"about_ca_topic_score_codex":0.000004725482,"about_ca_topic_score_gemma":0.0000063799826,"teacher_disagreement_score":0.5926344,"about_ca_system_score_codex":0.000008508326,"about_ca_system_score_gemma":0.0000291643,"threshold_uncertainty_score":0.86373705},"labels":[],"label_agreement":null},{"id":"W2227225096","doi":"10.20382/jocg.v13i1a2","title":"A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons","year":2015,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Beacon; Routing (electronic design automation); Robot; Computer science; Combinatorics; Obstacle; Electric beacon; Set (abstract data type); Mathematics; Computer network; Geography; Real-time computing; Artificial intelligence","score_opus":0.025251074845990165,"score_gpt":0.25554177658106697,"score_spread":0.23029070173507682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227225096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19415909,0.00017552223,0.80042785,0.0010259013,0.003262806,0.0003605235,0.000067523666,0.00003959415,0.0004811899],"genre_scores_gemma":[0.9273632,0.0000070498145,0.071396425,0.00020394096,0.0007238099,0.00000175496,0.00016317588,0.000021085667,0.00011954248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968038,0.000274519,0.000909497,0.0005259778,0.0011067251,0.0003794465],"domain_scores_gemma":[0.9945424,0.0011027819,0.001347911,0.00027496406,0.0024294565,0.00030247326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015530818,0.00036207362,0.00069342874,0.0034147694,0.00018630554,0.00030649517,0.0013777774,0.0003339707,0.000010641273],"category_scores_gemma":[0.00037219943,0.00042807893,0.000489592,0.0019205593,0.00007790829,0.00065024645,0.0005276867,0.00084646,0.0000033624885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023816343,0.00029238008,0.00063321285,0.00006774354,0.00012801118,0.00011987959,0.00016121696,0.8826686,0.000022364673,0.11152326,0.0009770999,0.0031680684],"study_design_scores_gemma":[0.0074951225,0.00068549946,0.0044611073,0.00036086515,0.00012915532,0.00008910411,0.00012779572,0.77454233,0.00012196704,0.20126425,0.009923155,0.00079964957],"about_ca_topic_score_codex":0.000019342671,"about_ca_topic_score_gemma":0.000010093488,"teacher_disagreement_score":0.7332041,"about_ca_system_score_codex":0.00087400904,"about_ca_system_score_gemma":0.004850964,"threshold_uncertainty_score":0.9998171},"labels":[],"label_agreement":null},{"id":"W2227867215","doi":"","title":"The relative neighbourhood graph is a part of every 30°-triangulation.","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Neighbourhood (mathematics); Combinatorics; Mathematics; Pitteway triangulation; Delaunay triangulation; Surface triangulation; Graph; Triangulation; Euclidean geometry; Discrete mathematics; Bowyer–Watson algorithm; Geometry; Mathematical analysis","score_opus":0.013994244323280247,"score_gpt":0.23946795981626898,"score_spread":0.22547371549298872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227867215","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.00731815,0.00038327972,0.97027934,0.006050985,0.0002327633,0.00011929098,0.0000016840322,0.00004876297,0.015565776],"genre_scores_gemma":[0.9514867,0.000033518183,0.043330338,0.00073651026,0.00018877807,0.000008048429,0.0000026777868,0.0000031315612,0.0042102984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921423,0.000049048438,0.0002196101,0.00015809113,0.0002491578,0.000109870496],"domain_scores_gemma":[0.99921906,0.0002635036,0.00009656376,0.00024308414,0.0001423167,0.000035466353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002715132,0.000064006126,0.0000671898,0.00006683859,0.00017469666,0.000060089544,0.00026262287,0.000028746266,0.00015960613],"category_scores_gemma":[0.000043017633,0.000044239805,0.00006662401,0.00048186912,0.00002706762,0.0004894007,0.000064244865,0.000051114657,0.0000718409],"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.000005133982,0.00004275121,0.00013390883,0.0000017229589,0.000033750177,2.3178863e-7,0.00088245404,0.0046800817,0.000120567485,0.7598106,0.010865819,0.22342296],"study_design_scores_gemma":[0.0010339334,0.00017366545,0.025367873,0.000021824131,0.000022038628,0.000010192919,0.00008926325,0.52593,0.019070748,0.23773259,0.19017129,0.00037660397],"about_ca_topic_score_codex":0.000005414084,"about_ca_topic_score_gemma":0.0000048381453,"teacher_disagreement_score":0.94416857,"about_ca_system_score_codex":0.000015787315,"about_ca_system_score_gemma":0.000058716418,"threshold_uncertainty_score":0.18040468},"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":"W2235983888","doi":"10.20382/jocg.v7i2a6","title":"Smoothed complexity of convex hulls by witnesses and collectors","year":2016,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut Universitaire de France; Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Convex hull; Hull; Combinatorics; Mathematics; Simple (philosophy); Regular polygon; Euclidean geometry; Point (geometry); Convex body; Gaussian; Convex polytope; Convex set; Geometry; Convex optimization; Physics; Engineering","score_opus":0.020225246466812365,"score_gpt":0.22677454725590304,"score_spread":0.20654930078909067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235983888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25903615,0.0006407818,0.7372045,0.0012297878,0.0007769946,0.00018011293,0.00013015766,0.000028819482,0.00077268924],"genre_scores_gemma":[0.9677948,0.00016879103,0.031059599,0.00011876851,0.0001655187,3.4161985e-7,0.000041915806,0.000015049153,0.00063522975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974447,0.000262882,0.00073615456,0.00041969333,0.0009107428,0.00022583702],"domain_scores_gemma":[0.9954107,0.00077387574,0.0016505931,0.00026080172,0.0016748708,0.0002291712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050399103,0.00031328373,0.0007434304,0.0018428613,0.00015962993,0.00012264364,0.0010474701,0.00022185137,0.000048975235],"category_scores_gemma":[0.00012167493,0.00030089665,0.0002669076,0.0012808685,0.00036713685,0.00057900674,0.00074786466,0.00040700386,0.0000025605632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001058518,0.0017314155,0.009199131,0.0014086685,0.0034525755,0.00041583116,0.0016984523,0.36120862,0.009177788,0.53575045,0.044189945,0.030708622],"study_design_scores_gemma":[0.013954704,0.0026653912,0.05408159,0.00221135,0.0007786751,0.00083949964,0.00053583505,0.0957729,0.017618407,0.74091625,0.06725308,0.0033723481],"about_ca_topic_score_codex":0.000015066917,"about_ca_topic_score_gemma":0.0000018497506,"teacher_disagreement_score":0.70875865,"about_ca_system_score_codex":0.00020735664,"about_ca_system_score_gemma":0.0009034653,"threshold_uncertainty_score":0.9999443},"labels":[],"label_agreement":null},{"id":"W2242269073","doi":"10.5555/2095116.2095220","title":"Competitive routing in the half-θ6-graph","year":2012,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"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":"Combinatorics; Delaunay triangulation; Mathematics; Discrete mathematics; Computer science","score_opus":0.021088163786151817,"score_gpt":0.25651639973690593,"score_spread":0.23542823595075413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242269073","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.03542367,0.00009534485,0.8828161,0.002310943,0.00036032364,0.000106276195,2.1234092e-7,0.000049986505,0.07883715],"genre_scores_gemma":[0.98248804,0.0000017741063,0.016055962,0.0011704138,0.0001314397,0.0000062484087,0.000002188285,0.0000011997479,0.00014273221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99942726,0.000083088315,0.00009431161,0.00009195879,0.00015008674,0.00015327084],"domain_scores_gemma":[0.9996098,0.00018667216,0.000022859114,0.0001294956,0.00002581352,0.000025307801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055732613,0.00004614469,0.00004219559,0.00006827369,0.00007415201,0.00006395521,0.00026638276,0.000015438469,0.00001690507],"category_scores_gemma":[0.00002712961,0.00003101139,0.000023005356,0.00048411803,0.000010283491,0.0003860625,0.00005461248,0.0000630171,0.000053443895],"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":[3.5133758e-7,0.000032705146,0.0016917504,6.1142316e-7,0.0000013526478,5.407742e-7,0.0013236928,0.00021844068,0.000057985882,0.98997414,0.00022404759,0.006474409],"study_design_scores_gemma":[0.0011343685,0.00014605082,0.6493619,0.00003832969,0.000010287213,0.0001419993,0.0030923416,0.19555838,0.006267252,0.043507714,0.09999264,0.0007487277],"about_ca_topic_score_codex":0.000025359268,"about_ca_topic_score_gemma":0.000025467682,"teacher_disagreement_score":0.9470644,"about_ca_system_score_codex":0.000011062186,"about_ca_system_score_gemma":0.00001441288,"threshold_uncertainty_score":0.12646078},"labels":[],"label_agreement":null},{"id":"W22433017","doi":"10.1080/08870446.2012.667099","title":"Simple Silhouettes for Complex Meshes.","year":2003,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institutes of Health Research","keywords":"Polygon mesh; Simple (philosophy); Computer science; Computer graphics (images); Computer vision","score_opus":0.0408017735939222,"score_gpt":0.2841221861399651,"score_spread":0.2433204125460429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22433017","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.0031027375,0.00003233946,0.9846205,0.00044497708,0.0001486673,0.0001387992,0.0000014872595,0.000098936645,0.011411544],"genre_scores_gemma":[0.6768344,0.0000011132224,0.3207064,0.0013358378,0.000044664994,0.000019106568,0.000013185192,0.0000031981351,0.0010420809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943405,0.00002377511,0.0001114484,0.00018608298,0.00010760682,0.00013705833],"domain_scores_gemma":[0.99953055,0.00014873112,0.000025014948,0.00016460595,0.00008562849,0.0000454625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017327875,0.000061753664,0.00006665123,0.00005464987,0.00011450398,0.000084821026,0.00018390919,0.000019052692,0.000103238075],"category_scores_gemma":[0.000072116774,0.000055860386,0.000043249183,0.00022336714,0.000008669834,0.00019989896,0.00002397327,0.000019952166,0.000033040906],"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.0000010030928,0.00002980363,0.00012965109,0.000004410544,0.0000066497314,3.4795852e-7,0.00004083207,0.0031417487,0.0027177334,0.943231,0.037521172,0.013175651],"study_design_scores_gemma":[0.0004022455,0.00007178353,0.0021315773,9.951766e-7,0.0000030381677,0.000007634338,0.000011898185,0.29759362,0.01962426,0.1306358,0.5493447,0.00017241163],"about_ca_topic_score_codex":0.0000023491148,"about_ca_topic_score_gemma":0.0000044536155,"teacher_disagreement_score":0.8125952,"about_ca_system_score_codex":0.000011558131,"about_ca_system_score_gemma":0.000039897088,"threshold_uncertainty_score":0.22779204},"labels":[],"label_agreement":null},{"id":"W2248326503","doi":"10.1016/j.tcs.2016.04.026","title":"Recognizing and drawing IC-planar graphs","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":55,"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; Deutsche Forschungsgemeinschaft","keywords":"Planar graph; Combinatorics; Planar straight-line graph; Book embedding; Mathematics; Planarity testing; Outerplanar graph; 1-planar graph; Planar; Time complexity; Graph drawing; Discrete mathematics; Rotation system; Pathwidth; Line graph; Graph; Computer science","score_opus":0.01154503844059302,"score_gpt":0.23778373087163776,"score_spread":0.22623869243104475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248326503","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.085712194,0.00004011372,0.91011965,0.0023099303,0.00047017293,0.00007312469,7.333932e-7,0.00011710689,0.0011569897],"genre_scores_gemma":[0.81113267,0.000010325729,0.18828067,0.000469723,0.000084863816,0.0000025757083,2.4839136e-7,0.0000032797113,0.000015672573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983203,0.00006935344,0.0001897971,0.0006075799,0.0004454107,0.00036760332],"domain_scores_gemma":[0.99885696,0.00037786015,0.000044906803,0.00035324245,0.0001442135,0.0002227905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011135186,0.00012438688,0.000119832606,0.00024319979,0.00042744083,0.00034604454,0.0008482776,0.000032158565,0.000018927652],"category_scores_gemma":[0.000105952786,0.000082541934,0.000032246895,0.00090542645,0.001063941,0.0009613605,0.00040700962,0.00006870567,0.000052111234],"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.0000019325685,0.000008942747,0.00007241752,0.0000017251557,0.0000015726093,0.0000037532045,0.000091952475,0.000007795163,0.006147433,0.75053513,0.000029957271,0.2430974],"study_design_scores_gemma":[0.00035687198,0.00018123178,0.004198351,0.00006369074,0.000003940138,0.00011606364,0.0000030844187,0.12812147,0.017457487,0.8487521,0.0004387843,0.00030692248],"about_ca_topic_score_codex":9.686615e-7,"about_ca_topic_score_gemma":3.0584343e-7,"teacher_disagreement_score":0.7254204,"about_ca_system_score_codex":0.000028149472,"about_ca_system_score_gemma":0.00007404883,"threshold_uncertainty_score":0.39201352},"labels":[],"label_agreement":null},{"id":"W2252238546","doi":"10.20382/jocg.v6i1a14","title":"A new algorithm for computing visibility graphs of polygonal obstacles in the plane","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Visibility; Visibility graph; Computer science; Plane (geometry); Algorithm; Planar graph; Mathematics; Graph; Theoretical computer science; Geometry; Physics; Regular polygon; Optics","score_opus":0.025050121115095053,"score_gpt":0.24938825684958482,"score_spread":0.22433813573448977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252238546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1390589,0.00018165004,0.85949296,0.00054161914,0.000351504,0.00014951183,0.000011710295,0.000010695721,0.00020144744],"genre_scores_gemma":[0.6437804,0.000004594736,0.35584652,0.00013651392,0.00014591498,1.09389454e-7,0.00001555676,0.000004302902,0.000066073735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806947,0.00019645673,0.0005362647,0.0002093831,0.0007975771,0.00019085029],"domain_scores_gemma":[0.99714565,0.0010833673,0.0005712201,0.00015555939,0.00088562735,0.00015854654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012992257,0.00013970083,0.00029415838,0.0012570019,0.0000896557,0.00007208958,0.0009101237,0.00006523108,0.0000049724817],"category_scores_gemma":[0.00014252763,0.0001234132,0.00019856635,0.0022546626,0.000049583155,0.0006209956,0.00010535637,0.00019980871,0.0000013333774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022059518,0.00044244344,0.0024402349,0.00003731476,0.0001587467,0.000097857956,0.002480365,0.66833115,0.00010029534,0.11095703,0.0038756023,0.21085837],"study_design_scores_gemma":[0.009807792,0.0020871186,0.063821614,0.00015080563,0.00010426017,0.0005812181,0.0025024822,0.7376823,0.00058099313,0.1650265,0.017020393,0.0006345069],"about_ca_topic_score_codex":0.000032963926,"about_ca_topic_score_gemma":0.0000052972164,"teacher_disagreement_score":0.5047215,"about_ca_system_score_codex":0.00012237675,"about_ca_system_score_gemma":0.0007785439,"threshold_uncertainty_score":0.5032644},"labels":[],"label_agreement":null},{"id":"W2252725190","doi":"10.4230/lipics.socg.2015.733","title":"A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Algorithm; Computer science; Combinatorics; Mathematics; Convex set; Convex optimization; Geometry","score_opus":0.03449451087858447,"score_gpt":0.29835211687478386,"score_spread":0.2638576059961994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252725190","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.08183502,0.000036709953,0.9146168,0.00038315353,0.0011017888,0.0011713095,0.00015684389,0.00016130517,0.000537053],"genre_scores_gemma":[0.47005826,0.000003341561,0.5266666,0.0016200667,0.00044419616,0.00025709605,0.0005886516,0.00004284522,0.00031895167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755365,0.00003834506,0.0009937609,0.00033261316,0.00043507438,0.0006465476],"domain_scores_gemma":[0.99802375,0.00034926768,0.00032609794,0.0004893565,0.00054398976,0.00026752838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010327023,0.00031748012,0.00040579418,0.0004440035,0.0002384137,0.0002959363,0.0007183829,0.00013492488,0.000010553505],"category_scores_gemma":[0.00023100073,0.00030316738,0.00019234672,0.00059740164,0.00005330024,0.0016933712,0.0004253268,0.0002686604,0.00011397218],"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.00055895397,0.0022056277,0.0064593772,0.0006674188,0.0007392627,0.000040008035,0.065716505,0.0570024,0.0010557424,0.07998439,0.022534968,0.76303536],"study_design_scores_gemma":[0.0040326267,0.00029520315,0.00013563034,0.000063584754,0.0000141801065,0.000048611357,0.00041476186,0.97478753,0.0006842995,0.005101785,0.01404736,0.0003743962],"about_ca_topic_score_codex":0.000032452343,"about_ca_topic_score_gemma":0.000058892387,"teacher_disagreement_score":0.91778517,"about_ca_system_score_codex":0.0001778033,"about_ca_system_score_gemma":0.00021481696,"threshold_uncertainty_score":0.99994206},"labels":[],"label_agreement":null},{"id":"W2252814391","doi":"10.2312/egs.20081035","title":"Shadowed Relighting of Dynamic Geometry with 1D BRDFs","year":2008,"lang":"en","type":"article","venue":"Eurographics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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 Toronto","funders":"","keywords":"Computer science; Computer graphics (images); Computer vision; Geometry; Artificial intelligence; Mathematics","score_opus":0.011155594711659889,"score_gpt":0.2133148873385698,"score_spread":0.2021592926269099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252814391","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.59470415,0.00025720833,0.40370604,0.00020706323,0.00014388794,0.00007262289,0.0000013016012,0.0000987184,0.0008090325],"genre_scores_gemma":[0.926568,0.00008554864,0.073062666,0.00014161253,0.00002816546,0.000002845101,0.000007939932,0.0000074676186,0.00009577979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989707,0.000042087715,0.00020505126,0.00025975812,0.00036049206,0.00016192223],"domain_scores_gemma":[0.99922824,0.00009934702,0.00012068991,0.00030935343,0.0001832585,0.000059110007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018570955,0.000100453435,0.000120178665,0.00037405844,0.00014935691,0.000026265909,0.00034470312,0.000036309444,0.0000041517137],"category_scores_gemma":[0.000037877904,0.00008893663,0.00005997262,0.0022335735,0.00007759887,0.0002367206,0.000079039244,0.000117747775,0.0000067310243],"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.00019476596,0.0018597102,0.14561377,0.00034463734,0.00055028853,0.00080993725,0.0073449505,0.038064126,0.01980765,0.52078545,0.004174127,0.26045057],"study_design_scores_gemma":[0.0027267903,0.0019694052,0.5905328,0.00016944317,0.000055380293,0.0012620632,0.00007941642,0.36383456,0.0077213575,0.0062445845,0.024069874,0.0013343754],"about_ca_topic_score_codex":0.0000058258543,"about_ca_topic_score_gemma":0.000005898772,"teacher_disagreement_score":0.51454085,"about_ca_system_score_codex":0.0000075721987,"about_ca_system_score_gemma":0.00006661845,"threshold_uncertainty_score":0.36267304},"labels":[],"label_agreement":null},{"id":"W2253735142","doi":"10.1007/s00454-015-9737-3","title":"How to Walk Your Dog in the Mountains with No Magic Leash","year":2015,"lang":"en","type":"article","venue":"Discrete & 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 Alberta","funders":"Directorate for Computer and Information Science and Engineering","keywords":"Mathematics; Homotopy; Euclidean geometry; Combinatorics; MAGIC (telescope); Boundary (topology); Approximation algorithm; Geometry; Pure mathematics; Mathematical analysis","score_opus":0.029618555784002163,"score_gpt":0.2758049609016351,"score_spread":0.24618640511763293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253735142","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.15787703,0.00012624936,0.8269309,0.010963944,0.0003532167,0.0004291834,0.000015678854,0.00009026466,0.003213576],"genre_scores_gemma":[0.922446,0.0000014893179,0.07319704,0.0029205873,0.00029392182,0.00004110675,0.00012857678,0.00001470643,0.0009565489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731076,0.00017049623,0.0002861445,0.00057942193,0.0012565702,0.00039659935],"domain_scores_gemma":[0.99842614,0.00026478554,0.00011275949,0.0004138558,0.00055111625,0.00023135371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075748813,0.00025564615,0.00021604473,0.0005881884,0.00015015803,0.0007464509,0.0010249102,0.000059202695,0.00001078181],"category_scores_gemma":[0.00018902628,0.00018450274,0.00006963851,0.0028468112,0.000052615473,0.0008436751,0.00021490778,0.00023411632,0.00025888978],"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.00006913486,0.00020282622,0.0053023724,0.000021799024,0.00004503163,0.00008630164,0.0026024512,0.84764296,0.000045668156,0.12550667,0.008215184,0.010259622],"study_design_scores_gemma":[0.0033038799,0.0013533623,0.18809815,0.0000877506,0.000029908748,0.00035044763,0.001832453,0.6833524,0.00009861667,0.055006605,0.06514193,0.0013444975],"about_ca_topic_score_codex":0.00003850321,"about_ca_topic_score_gemma":0.000022187136,"teacher_disagreement_score":0.764569,"about_ca_system_score_codex":0.00013289759,"about_ca_system_score_gemma":0.00029422797,"threshold_uncertainty_score":0.7523804},"labels":[],"label_agreement":null},{"id":"W2256871140","doi":"10.20382/jocg.v7i2a4","title":"Approximability of the discrete Fréchet distance","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Eidgenössische Technische Hochschule Zürich; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Measure (data warehouse); Approximation algorithm; Binary logarithm; Discrete mathematics; Simple (philosophy); Mathematical analysis","score_opus":0.016834781048207712,"score_gpt":0.21770333013737017,"score_spread":0.20086854908916246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256871140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19696623,0.00011304287,0.7996563,0.00095093297,0.00056774553,0.00008194824,0.000008386081,0.000012764322,0.0016426918],"genre_scores_gemma":[0.9558402,0.000004390465,0.043505374,0.00009047194,0.000097901604,1.0114024e-7,0.000003359649,0.0000042787597,0.00045396577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816114,0.00020618935,0.0004145821,0.00018301971,0.0008931685,0.00014193158],"domain_scores_gemma":[0.997393,0.00027013983,0.0006638544,0.00025446172,0.0012588712,0.00015967412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065458624,0.000121792815,0.00023940548,0.00046545788,0.00010543351,0.00004913982,0.0010557374,0.000054554315,0.000007715868],"category_scores_gemma":[0.00021834449,0.00009840698,0.00022119589,0.002226523,0.00012232426,0.0007875535,0.00025035496,0.0002073877,0.0000028638567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116025236,0.00022058035,0.0064305435,0.000030135645,0.00010396418,0.000024425068,0.00050235214,0.7924734,0.00012556669,0.19228493,0.0017847648,0.005903345],"study_design_scores_gemma":[0.008593085,0.0014441856,0.17058575,0.00027217774,0.00022146905,0.0006262056,0.0013324062,0.3689133,0.0052486993,0.2725361,0.16904938,0.0011772455],"about_ca_topic_score_codex":0.00000597918,"about_ca_topic_score_gemma":0.0000017258349,"teacher_disagreement_score":0.75887394,"about_ca_system_score_codex":0.00018301804,"about_ca_system_score_gemma":0.00061102724,"threshold_uncertainty_score":0.401292},"labels":[],"label_agreement":null},{"id":"W2257178227","doi":"10.1007/s00454-017-9939-y","title":"Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs","year":2017,"lang":"en","type":"article","venue":"Discrete & 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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Ministero dell’Istruzione, dell’Università e della Ricerca; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Rectangle; Embedding; Time complexity; Book embedding; Graph; Visibility; Crossing number (knot theory); Set (abstract data type)","score_opus":0.02211987090027542,"score_gpt":0.32635410914234164,"score_spread":0.30423423824206625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2257178227","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.32125574,0.00013841166,0.6723431,0.00083265064,0.00054077053,0.00023052725,0.00005124495,0.000104125495,0.0045034634],"genre_scores_gemma":[0.8963027,0.000008303245,0.103080295,0.00011360383,0.00009645659,0.00001765607,0.00013620651,0.000012428409,0.00023237272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974719,0.00012278817,0.00059624115,0.00068387564,0.0008184013,0.00030675475],"domain_scores_gemma":[0.9969298,0.0005145102,0.00058293913,0.0012582991,0.0005586834,0.0001557443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775901,0.00021939144,0.00030595207,0.00049063907,0.0008839577,0.00043952337,0.0016561114,0.00008701275,0.00009516683],"category_scores_gemma":[0.0007125351,0.00022902465,0.00021533624,0.0007221454,0.00016491843,0.0014702723,0.00067559135,0.00018081481,0.000034212822],"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.000060101564,0.00033836107,0.042491615,0.0001274929,0.00022580379,0.00002747014,0.00083731493,0.6772526,0.001719281,0.25138813,0.0033763673,0.022155443],"study_design_scores_gemma":[0.00059756497,0.00009804219,0.33746457,0.000048506517,0.000019182404,0.000021143696,0.000056429486,0.50922495,0.0013320332,0.15039515,0.0004164259,0.000326003],"about_ca_topic_score_codex":0.00013343949,"about_ca_topic_score_gemma":0.000015745038,"teacher_disagreement_score":0.57504696,"about_ca_system_score_codex":0.000048475547,"about_ca_system_score_gemma":0.00016224913,"threshold_uncertainty_score":0.9339354},"labels":[],"label_agreement":null},{"id":"W2261198898","doi":"10.22215/etd/2008-06271","title":"Approximation algorithms for geometric networks","year":2008,"lang":"en","type":"dissertation","venue":"","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; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Algorithm; Combinatorics; Mathematics","score_opus":0.025352231444012448,"score_gpt":0.2750849121170034,"score_spread":0.24973268067299098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261198898","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.00048708182,0.00084634084,0.9892754,0.00006194782,0.0024930264,0.0006461506,0.0000042253873,0.0002171309,0.005968708],"genre_scores_gemma":[0.040820073,0.0007366588,0.8569045,0.0004863469,0.0021102107,0.00078963296,0.01147084,0.000074060204,0.086607695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984198,0.000026850648,0.00037644396,0.000542726,0.00037240508,0.0002617703],"domain_scores_gemma":[0.99872404,0.000196539,0.000238214,0.00032144476,0.0004410031,0.00007877584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022097203,0.00023915093,0.00024545102,0.00072825275,0.00026188226,0.00017496265,0.00052615354,0.0002692416,0.000018784975],"category_scores_gemma":[0.00008061602,0.00023877571,0.00016861387,0.0014996806,0.000007098544,0.0004134838,0.000030918018,0.00015194711,0.00002710021],"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.000025039635,0.00013058717,0.000004890374,0.000114972136,0.00007182515,0.0000031450807,0.00028772317,0.047507957,0.000048731003,0.04746902,0.036385935,0.8679502],"study_design_scores_gemma":[0.00033892176,0.000096213356,0.00059623877,0.000017560986,0.000015607879,0.00001195355,0.000020166213,0.9817256,0.001219988,0.0027465196,0.012842165,0.0003690665],"about_ca_topic_score_codex":0.000007728586,"about_ca_topic_score_gemma":0.000010750016,"teacher_disagreement_score":0.93421763,"about_ca_system_score_codex":0.000061545456,"about_ca_system_score_gemma":0.00016824533,"threshold_uncertainty_score":0.9736991},"labels":[],"label_agreement":null},{"id":"W2261377644","doi":"10.1142/s0218195910003396","title":"VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","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 Calgary","funders":"","keywords":"Voronoi diagram; Mathematics; Dimension (graph theory); Combinatorics; Measure (data warehouse); Diagram; Discrete geometry; Similarity (geometry); Computational geometry; Discrete mathematics; Geometry; Image (mathematics); Computer science; Data mining; Artificial intelligence","score_opus":0.008520262516378265,"score_gpt":0.2823124643501812,"score_spread":0.27379220183380293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261377644","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.028475339,0.00029607237,0.96349823,0.005721961,0.001133019,0.00028327262,0.00006692483,0.000031877345,0.000493307],"genre_scores_gemma":[0.9292862,0.000030854757,0.06871332,0.0005699279,0.0010883107,0.00005710663,0.0000710721,0.000013858334,0.00016935669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969286,0.000082193634,0.0009949659,0.0003031173,0.0014744904,0.00021663442],"domain_scores_gemma":[0.995441,0.00087720086,0.001019035,0.00037984666,0.0021292,0.00015371232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007891085,0.00021040115,0.0002612505,0.00057290785,0.00021695916,0.00022322657,0.0022483235,0.00008893293,0.00008373379],"category_scores_gemma":[0.00009291863,0.00016813302,0.000284494,0.0010870901,0.00023164155,0.000687529,0.00023922077,0.00050970487,0.000026085729],"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.000031372452,0.0003158101,0.00062788377,0.000009127571,0.00023800824,0.000003917728,0.00014263949,0.15144153,0.0015324514,0.78024465,0.0004995693,0.06491303],"study_design_scores_gemma":[0.002583799,0.00031455175,0.09754945,0.00007844949,0.00012143461,0.0010843027,0.00027514962,0.22120292,0.0044404715,0.5081412,0.16330454,0.00090372155],"about_ca_topic_score_codex":0.000007677702,"about_ca_topic_score_gemma":0.000011666361,"teacher_disagreement_score":0.90081084,"about_ca_system_score_codex":0.000074140495,"about_ca_system_score_gemma":0.0004377341,"threshold_uncertainty_score":0.68562657},"labels":[],"label_agreement":null},{"id":"W2261811080","doi":"10.20382/jocg.v7i1a13","title":"The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Discretization; Terrain; Mathematics; Mathematical optimization; Geography; Mathematical analysis; Cartography","score_opus":0.018817839104994145,"score_gpt":0.21448614739666144,"score_spread":0.1956683082916673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261811080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06981621,0.00059313735,0.9246127,0.0033926663,0.00043631406,0.000121525205,0.0000044795884,0.000033775603,0.0009892008],"genre_scores_gemma":[0.88707983,0.00008214706,0.11138541,0.00017250284,0.00026846342,4.6276728e-7,0.000014663887,0.000009888345,0.0009866136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822235,0.00022379546,0.00041222834,0.00021448547,0.000684846,0.00024231576],"domain_scores_gemma":[0.9974555,0.00044921442,0.00047448877,0.00014002682,0.0012417838,0.00023899664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001178926,0.00014889607,0.00021097757,0.0007047036,0.0005332472,0.00032732042,0.00058031664,0.00006161163,0.000003830844],"category_scores_gemma":[0.00020540904,0.00012737112,0.00010455032,0.0014178059,0.0001202692,0.0011404566,0.00025929694,0.00021191734,0.000005273931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087159526,0.00008841282,0.0012259263,0.000010732468,0.00015381146,0.000069939866,0.00093797693,0.74066174,0.0000567842,0.22581975,0.0074651805,0.023422591],"study_design_scores_gemma":[0.0054779425,0.0012746789,0.01430254,0.0001393291,0.00016154913,0.0017113884,0.0030125487,0.5069116,0.00015027201,0.07359674,0.39237902,0.00088239985],"about_ca_topic_score_codex":0.000006660385,"about_ca_topic_score_gemma":0.0000031163909,"teacher_disagreement_score":0.81726366,"about_ca_system_score_codex":0.00016505929,"about_ca_system_score_gemma":0.0004847707,"threshold_uncertainty_score":0.51940435},"labels":[],"label_agreement":null},{"id":"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":"W2263548011","doi":"10.48550/arxiv.1506.07246","title":"$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Combinatorics; Planar; Vertex (graph theory); Mathematics; Planar graph; Graph; String (physics); Computer science","score_opus":0.10021248566080329,"score_gpt":0.22026674175588626,"score_spread":0.12005425609508297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263548011","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.58087784,0.00017629043,0.41789028,0.00014020075,0.00037643075,0.0001415607,0.000022501745,0.0000760625,0.00029884733],"genre_scores_gemma":[0.99579036,0.0001365236,0.003341857,0.000026588374,0.00011945909,8.2430694e-7,0.000054428496,0.0000063295142,0.0005236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987869,0.00010232492,0.00020132524,0.00062530604,0.000118754346,0.00016539238],"domain_scores_gemma":[0.9987771,0.00014139012,0.00022359988,0.00050860667,0.00021684913,0.00013245952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020663395,0.00016572665,0.00022536886,0.0002903029,0.000100364334,0.00008387576,0.0005471807,0.00012571455,0.000004732497],"category_scores_gemma":[0.000061688865,0.00019786075,0.00007845685,0.00041570465,0.00008199867,0.0005210273,0.0007198939,0.00019442757,0.0000102356225],"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.000021458265,0.00006785284,0.0039895964,0.000047599246,0.00007236826,0.000056618508,0.00029126173,0.45235735,0.0002778589,0.541532,0.00076677505,0.0005192825],"study_design_scores_gemma":[0.0007987835,0.00010568089,0.009151914,0.000084616535,0.00010043169,0.00001204693,0.00015127074,0.7172387,0.0023689766,0.26853168,0.0009577512,0.0004981506],"about_ca_topic_score_codex":0.00010542464,"about_ca_topic_score_gemma":0.000043241354,"teacher_disagreement_score":0.41491255,"about_ca_system_score_codex":0.00005909091,"about_ca_system_score_gemma":0.00025967322,"threshold_uncertainty_score":0.8068527},"labels":[],"label_agreement":null},{"id":"W2277162327","doi":"10.1007/978-3-662-45803-7_33","title":"Drawing Planar Graphs with Reduced Height","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Planar; Vertex (graph theory); Mathematics; Embedding; Upper and lower bounds; Graph drawing; Polygonal chain; Graph; Book embedding; Planar straight-line graph; Geometry; 1-planar graph; Line graph; Computer science; Computer graphics (images); Artificial intelligence; Mathematical analysis","score_opus":0.012375233529359493,"score_gpt":0.22471033680183644,"score_spread":0.21233510327247695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277162327","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.00031220674,0.00023847105,0.993006,0.0008535438,0.0012972323,0.00027903312,0.0000021395665,0.00016738947,0.0038439806],"genre_scores_gemma":[0.31490737,0.000023671639,0.68116516,0.0022098303,0.00076211884,0.0000120498225,0.000023613127,0.00004164289,0.00085454027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643713,0.000039479684,0.00041814754,0.0014652408,0.0011036404,0.00053638016],"domain_scores_gemma":[0.9978601,0.0003752326,0.00026218494,0.0010351688,0.000279448,0.00018786812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007016147,0.0004823038,0.0004403375,0.0010871625,0.00036544356,0.0005887242,0.0021003222,0.00021736234,0.000014149478],"category_scores_gemma":[0.00004079507,0.00040426775,0.00009989076,0.0009271182,0.00037526587,0.0004767922,0.0003793223,0.0005712935,0.000041385687],"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.000013215313,0.000023016355,0.000028798515,0.000036913265,0.000023120616,0.00009231569,0.00053012854,0.1305858,0.0005134015,0.2119964,0.00008820146,0.6560687],"study_design_scores_gemma":[0.0005896906,0.0005427918,0.00030913175,0.00056973123,0.000017644421,0.00030757207,1.2809352e-7,0.6178504,0.0044709663,0.36613995,0.007866413,0.0013355504],"about_ca_topic_score_codex":0.000008838534,"about_ca_topic_score_gemma":0.00004036313,"teacher_disagreement_score":0.6547331,"about_ca_system_score_codex":0.00015529663,"about_ca_system_score_gemma":0.0005501508,"threshold_uncertainty_score":0.9998409},"labels":[],"label_agreement":null},{"id":"W2281191978","doi":"10.1007/s00453-015-0086-7","title":"I/O-Efficient Path Traversal in Succinct Planar Graphs","year":2015,"lang":"en","type":"article","venue":"Algorithmica","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":"Dalhousie University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Path (computing); Traverse; Tree traversal; Mathematics; Block (permutation group theory); Bounded function; Graph traversal; Graph; Terrain; Binary logarithm; Discrete mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.018977108103582257,"score_gpt":0.23773516463062544,"score_spread":0.2187580565270432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281191978","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.24056712,0.00012297531,0.7565541,0.00064839417,0.0007040073,0.00014199245,0.0000042003976,0.00009561083,0.0011615502],"genre_scores_gemma":[0.9522056,0.0000016774975,0.047420915,0.00020424263,0.00007732161,0.0000081253875,0.000013760878,0.0000043439363,0.00006402484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990566,0.000055502016,0.00016710947,0.00022857571,0.0002948658,0.00019737196],"domain_scores_gemma":[0.9995235,0.00004774334,0.00003735521,0.00020134855,0.00006775512,0.00012228185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031934318,0.0000916605,0.00009970134,0.00020157894,0.000040165065,0.000054140895,0.00030778782,0.000040243074,0.0000054611046],"category_scores_gemma":[0.000017660577,0.000088891284,0.000035305904,0.0006547628,0.000015566118,0.00009728762,0.00005010917,0.000086251974,0.00007244985],"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.000071703595,0.0009021754,0.0026309225,0.000018070932,0.0000489606,0.00033346846,0.008625713,0.30537996,0.00055793836,0.3009609,0.01200904,0.36846116],"study_design_scores_gemma":[0.0006528361,0.0001285705,0.005292827,0.0000071013683,0.0000021575295,0.000029161522,0.00007859951,0.98267764,0.00035961333,0.00809049,0.0025228187,0.00015815998],"about_ca_topic_score_codex":0.0000842906,"about_ca_topic_score_gemma":0.000022892154,"teacher_disagreement_score":0.71163845,"about_ca_system_score_codex":0.000054934113,"about_ca_system_score_gemma":0.00012364703,"threshold_uncertainty_score":0.36248815},"labels":[],"label_agreement":null},{"id":"W2282988760","doi":"10.1007/s00454-016-9784-4","title":"Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings","year":2016,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"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; Computational geometry; Combinatorics; Deterministic algorithm; Algorithm; Regular polygon; Voronoi diagram; Convex geometry; Geometry; Convex optimization; Convex set","score_opus":0.019191564393856005,"score_gpt":0.27946708847346396,"score_spread":0.26027552407960797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282988760","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.0866626,0.00015349833,0.9102457,0.0020789944,0.00028549143,0.0002599715,0.00004544394,0.00012929273,0.00013902425],"genre_scores_gemma":[0.62965757,0.000007797455,0.36914843,0.00045657236,0.00019762282,0.000049675873,0.000049881186,0.000013833104,0.00041862426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982092,0.000043996177,0.00036186812,0.0006313466,0.00041134167,0.00034226556],"domain_scores_gemma":[0.9981745,0.0010097935,0.0001449963,0.00021370975,0.00028048945,0.00017649676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036396136,0.00021843449,0.00021077119,0.00033180052,0.0002807915,0.0002171218,0.00039936553,0.00007289747,0.000023655872],"category_scores_gemma":[0.00020109235,0.00017259452,0.00010547595,0.00048826454,0.00009077775,0.0006231417,0.00019517225,0.00006367979,0.000032939624],"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.00007740068,0.0001453351,0.0018650816,0.000095525385,0.00014513955,0.000022075019,0.00044548282,0.04548059,0.0015861745,0.33505142,0.0019578303,0.61312795],"study_design_scores_gemma":[0.0019355477,0.0004129836,0.03056624,0.00007160665,0.000026350493,0.00012676271,0.000021765947,0.879228,0.0004770694,0.07636782,0.010142404,0.000623431],"about_ca_topic_score_codex":0.000002379436,"about_ca_topic_score_gemma":7.166186e-7,"teacher_disagreement_score":0.83374745,"about_ca_system_score_codex":0.000047093392,"about_ca_system_score_gemma":0.000114299335,"threshold_uncertainty_score":0.70382005},"labels":[],"label_agreement":null},{"id":"W2288073247","doi":"10.1007/978-3-642-28076-4_16","title":"On the Hardness of Point-Set Embeddability","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba","funders":"","keywords":"Computer science; Set (abstract data type); Point (geometry); Algorithm; Programming language; Mathematics; Geometry","score_opus":0.02612102366593928,"score_gpt":0.2599388095595426,"score_spread":0.23381778589360336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288073247","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.0007449199,0.00027562832,0.9930614,0.0013887616,0.0019801622,0.00033645926,0.000008108325,0.000050733084,0.0021538197],"genre_scores_gemma":[0.9038414,0.000018014905,0.0933368,0.0019417426,0.0004988461,0.000011600879,0.000009217708,0.00001925758,0.00032311937],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972452,0.000072458766,0.00045789103,0.00082687323,0.001007783,0.00038978524],"domain_scores_gemma":[0.9967562,0.0012148115,0.00029574588,0.0013179692,0.00030972963,0.00010552731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001774083,0.00032941156,0.00034749426,0.0004453289,0.00020677612,0.00018446414,0.0023573393,0.00017180503,0.000075748736],"category_scores_gemma":[0.00023624607,0.00023262683,0.00013558792,0.0006322645,0.0005303309,0.00042641364,0.00076448184,0.00050974864,0.000049388647],"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.000009336968,0.000060899692,0.000034941913,0.000037008693,0.000012607236,0.0000054354696,0.0009386478,0.060811467,0.00016432254,0.41606292,0.00014822735,0.52171415],"study_design_scores_gemma":[0.00017652045,0.00019824524,0.00056149263,0.000198275,0.000008633688,0.000029650686,2.2516357e-7,0.32367787,0.005527099,0.66744965,0.0016893471,0.00048297923],"about_ca_topic_score_codex":0.000007777665,"about_ca_topic_score_gemma":0.000012411968,"teacher_disagreement_score":0.9030965,"about_ca_system_score_codex":0.00014699173,"about_ca_system_score_gemma":0.00037376623,"threshold_uncertainty_score":0.9486247},"labels":[],"label_agreement":null},{"id":"W2288450576","doi":"10.1007/978-3-0348-8438-9_9","title":"A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm","year":2000,"lang":"en","type":"book-chapter","venue":"Birkhäuser Basel eBooks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polyhedron; Enumeration; Convex hull; Vertex (graph theory); Combinatorics; Mathematics; Regular polygon; Lexicographical order; Degeneracy (biology); Integer points in convex polyhedra; Extreme point; Algorithm; Bounded function; Convex polytope; Convex set; Computer science; Integer programming; Convex optimization; Geometry","score_opus":0.020075537581356627,"score_gpt":0.2567447613605174,"score_spread":0.23666922377916075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288450576","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.0011452487,0.00075210223,0.5187917,0.0016394272,0.0026896964,0.004352214,0.00041049925,0.00040902258,0.46981013],"genre_scores_gemma":[0.042555075,0.00033549283,0.08035664,0.0039550397,0.0012698716,0.00015578707,0.0005524958,0.0002030272,0.87061656],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979063,0.000106752916,0.0005403658,0.00049353135,0.000743369,0.00020966386],"domain_scores_gemma":[0.9985485,0.00009012556,0.00027263997,0.0007505122,0.00026225415,0.00007593918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040297658,0.00027673828,0.00026783915,0.00024231402,0.00020858443,0.00010396799,0.0006534306,0.00016739304,0.0003963564],"category_scores_gemma":[0.0000078165185,0.00023682619,0.00022528847,0.00009223521,0.00006192837,0.00018051732,0.00018427777,0.00025592637,0.00009317062],"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.0000098366145,0.000015764688,0.0000046293026,0.00004902041,0.00006825058,0.00000566853,0.00053542666,0.00019434854,0.0005013563,0.1786169,0.0044739265,0.8155249],"study_design_scores_gemma":[0.0027651328,0.00044209312,0.0009438941,0.0007312544,0.00026908013,0.000076982134,0.00005358861,0.054711368,0.030598463,0.09061718,0.81714857,0.0016424265],"about_ca_topic_score_codex":0.00006953839,"about_ca_topic_score_gemma":0.00003329863,"teacher_disagreement_score":0.81388247,"about_ca_system_score_codex":0.00009577667,"about_ca_system_score_gemma":0.0005336365,"threshold_uncertainty_score":0.9657492},"labels":[],"label_agreement":null},{"id":"W2289358145","doi":"","title":"On Farthest-Point Information in Networks.","year":2012,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Voronoi diagram; Point (geometry); Computer science; Mathematics; Point-to-point; Algorithm; Theoretical computer science; Topology (electrical circuits); Combinatorics; Geometry","score_opus":0.00925096982978972,"score_gpt":0.21829558530512227,"score_spread":0.20904461547533254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289358145","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.026071532,0.00002181405,0.9608273,0.00043841032,0.00035380476,0.000063349646,1.0032892e-7,0.000047788177,0.012175917],"genre_scores_gemma":[0.9869864,0.0000024698675,0.011310925,0.0015327005,0.00006054854,0.000004459084,0.000005870518,8.9070835e-7,0.000095755175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995757,0.000021211035,0.000116739,0.000050567647,0.00010555429,0.00013028189],"domain_scores_gemma":[0.9997425,0.000060582206,0.00002502901,0.000109144654,0.000022063368,0.000040647425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024428495,0.000043229433,0.000037425838,0.00012201414,0.000024929954,0.00005245525,0.00010783628,0.00002127897,0.00002609106],"category_scores_gemma":[0.000026483209,0.000037274105,0.000014022623,0.00029640604,0.000003269568,0.0015398355,0.00003559625,0.000045438723,0.00024920696],"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.000002720079,0.00004128012,0.0004965627,0.0000013269927,0.0000011950004,1.5824408e-7,0.0003882168,0.19848615,0.00000527447,0.69023025,0.0020489392,0.1082979],"study_design_scores_gemma":[0.00020667362,0.00004159268,0.026609559,0.000004903124,4.4786918e-7,0.0000043957093,0.000012678739,0.9559594,0.00029776042,0.0052524516,0.011508126,0.000102031925],"about_ca_topic_score_codex":0.000005356093,"about_ca_topic_score_gemma":0.0000028880993,"teacher_disagreement_score":0.96091485,"about_ca_system_score_codex":0.000025327055,"about_ca_system_score_gemma":0.000010908038,"threshold_uncertainty_score":0.32031345},"labels":[],"label_agreement":null},{"id":"W2291025091","doi":"10.1142/s0218195915500156","title":"Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points","year":2015,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Intersection (aeronautics); Disjoint sets; Mathematics; Combinatorics; Unit (ring theory); Plane (geometry); Least-squares function approximation; Set (abstract data type); Space (punctuation); Geometry; Computer science; Statistics","score_opus":0.025765005357318727,"score_gpt":0.3270088259625079,"score_spread":0.30124382060518917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291025091","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.021234093,0.0001793345,0.9709634,0.005402134,0.00069009414,0.00037375806,0.00002761079,0.000033925255,0.0010956173],"genre_scores_gemma":[0.68530065,0.000008463045,0.31295994,0.00092765177,0.0005733308,0.000057550205,0.000028261826,0.000011920735,0.00013224134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645656,0.00013913008,0.0010566416,0.00029823292,0.0018374559,0.00021195743],"domain_scores_gemma":[0.9939507,0.00081483356,0.00082010403,0.00031721953,0.0038290683,0.0002680453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825943,0.00020184931,0.0002883793,0.0006753902,0.00013666309,0.00022536566,0.002059699,0.000054042135,0.00006836662],"category_scores_gemma":[0.00021600252,0.00016933847,0.00020882688,0.0014270693,0.00008220428,0.0006615485,0.0002579404,0.00024332227,0.00014593409],"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.00010345148,0.0003062821,0.0008689303,0.000008039778,0.00022787853,0.000009564283,0.00055798946,0.8028846,0.0001447982,0.1378362,0.0018951937,0.055157084],"study_design_scores_gemma":[0.006257109,0.000395621,0.015277389,0.00015659683,0.00010949167,0.0021100477,0.00057027495,0.15167746,0.0023048175,0.6921591,0.12807107,0.00091101194],"about_ca_topic_score_codex":0.000016849985,"about_ca_topic_score_gemma":0.0000024599135,"teacher_disagreement_score":0.66406655,"about_ca_system_score_codex":0.00018025927,"about_ca_system_score_gemma":0.000570517,"threshold_uncertainty_score":0.6905422},"labels":[],"label_agreement":null},{"id":"W2292299182","doi":"","title":"Grid-based Decorative Corners","year":2013,"lang":"en","type":"article","venue":"Proceedings of Bridges 2013: Mathematics, Music, Art, Architecture, Culture","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Constraint (computer-aided design); Grid; Square tiling; Square (algebra); Computer science; Software; Space (punctuation); Engineering drawing; Geometric shape; Computer graphics (images); Mathematics; Geometry; Engineering; Programming language","score_opus":0.014575796066660592,"score_gpt":0.22204876129517506,"score_spread":0.20747296522851447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292299182","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.22923385,0.0004234499,0.7429692,0.0046147155,0.00100413,0.002183821,0.000045579243,0.00064031256,0.01888495],"genre_scores_gemma":[0.45540133,0.000031741347,0.53866595,0.0019614,0.00074564654,0.0002247907,0.00007175833,0.000057562887,0.0028398037],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769485,0.00001668156,0.0005993491,0.0006007413,0.00065422663,0.00043416515],"domain_scores_gemma":[0.9977491,0.00013900275,0.0005629825,0.00027787432,0.001058643,0.00021241633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000312139,0.00040045453,0.0004679179,0.00030307152,0.0001958093,0.0003736553,0.000944071,0.00014473642,0.00014174248],"category_scores_gemma":[0.00024518347,0.00032270106,0.00020322685,0.000599141,0.00015760791,0.00083377585,0.00022039431,0.00030973012,0.0002532625],"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.000031593558,0.0009509398,0.0003551037,0.0013490197,0.00022532804,0.000004075966,0.015548316,0.0089092655,0.048757352,0.11926701,0.782903,0.021698957],"study_design_scores_gemma":[0.0031766638,0.0012405855,0.0053317756,0.0009368421,0.00018264158,0.00022613257,0.0019376097,0.46789122,0.171133,0.25863206,0.086490534,0.002820941],"about_ca_topic_score_codex":0.000014468562,"about_ca_topic_score_gemma":0.0000089266005,"teacher_disagreement_score":0.6964125,"about_ca_system_score_codex":0.000047703816,"about_ca_system_score_gemma":0.000082450904,"threshold_uncertainty_score":0.9999225},"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":"W2293226065","doi":"","title":"Window Queries On Planar Subdivisions Arising From Overlapping Polygons","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on 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 New Brunswick","funders":"","keywords":"Regular polygon; Combinatorics; Point in polygon; Planar; Subdivision; Space (punctuation); Simple (philosophy); Computational geometry; Polygon (computer graphics); Polygon mesh; Mathematics; Computer science; Algorithm; Geometry; Computer graphics (images)","score_opus":0.025237448898434094,"score_gpt":0.23910004481009484,"score_spread":0.21386259591166074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293226065","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.12379486,0.000056013603,0.85195756,0.006787775,0.0012295627,0.0002196207,0.00017258048,0.00018438991,0.0155976545],"genre_scores_gemma":[0.97130686,0.0000045945744,0.022418227,0.0053210664,0.00032398794,0.000012285416,0.00038470703,0.000017125007,0.00021114336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975687,0.00015818125,0.00036704855,0.0007421964,0.00065889227,0.0005049415],"domain_scores_gemma":[0.9974949,0.0009868379,0.00014381844,0.00046623743,0.00028950276,0.0006186997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030714393,0.00030114688,0.00027762126,0.0011294499,0.000659764,0.0005628116,0.00071266247,0.00013534163,0.00020090195],"category_scores_gemma":[0.0002959044,0.00032957143,0.0000985924,0.0010508881,0.00007555826,0.00040912087,0.00005757645,0.00033584094,0.0004702624],"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.000010200554,0.000048784183,0.000602365,0.000004873146,0.00003914705,0.000015752214,0.00021082247,0.10269368,0.00014143252,0.83506334,0.0025217314,0.058647852],"study_design_scores_gemma":[0.0007719044,0.0003535031,0.13394487,0.00017657381,0.000013868238,0.000017778157,0.00008171373,0.66675544,0.00026203884,0.17344505,0.02332647,0.00085079],"about_ca_topic_score_codex":0.0051384154,"about_ca_topic_score_gemma":0.004955342,"teacher_disagreement_score":0.847512,"about_ca_system_score_codex":0.00024822194,"about_ca_system_score_gemma":0.0010120546,"threshold_uncertainty_score":0.99991566},"labels":[],"label_agreement":null},{"id":"W2293635260","doi":"10.20382/jocg.v2i1a7","title":"Points with large quadrant depth","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quadrant (abdomen); Mathematics; Geodesy; Geography; Medicine; Surgery","score_opus":0.018319679801177376,"score_gpt":0.2011631225846567,"score_spread":0.18284344278347933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293635260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1432759,0.00006329374,0.8509786,0.00024590403,0.00028546428,0.00007089272,0.0000042785878,0.000036355446,0.005039279],"genre_scores_gemma":[0.81931365,0.000011214453,0.18001555,0.00023842919,0.00009127805,1.14149486e-7,0.000006047933,0.0000079052825,0.0003158358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983424,0.00012346913,0.00034609972,0.00023807179,0.00070155476,0.00024838836],"domain_scores_gemma":[0.9980073,0.00017659598,0.00048505937,0.0001771433,0.0009448233,0.00020908735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043893524,0.00016882537,0.00025319943,0.0014182002,0.00018046555,0.000067460955,0.0007547423,0.00006366974,0.00008584],"category_scores_gemma":[0.000037398255,0.0001541302,0.00014925732,0.0020467106,0.000048712784,0.0012823883,0.00012984678,0.0002292186,0.000026419584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086782087,0.001540089,0.017576799,0.00006112904,0.0007789835,0.0021877114,0.0025515957,0.13895667,0.0001718464,0.80336064,0.002978592,0.028968109],"study_design_scores_gemma":[0.022131136,0.0073755416,0.5347063,0.00047584064,0.00049385946,0.004375077,0.0025664375,0.15729229,0.005101239,0.103648864,0.15888205,0.0029513438],"about_ca_topic_score_codex":0.000006780687,"about_ca_topic_score_gemma":0.000009336026,"teacher_disagreement_score":0.6997118,"about_ca_system_score_codex":0.00011171599,"about_ca_system_score_gemma":0.00038020854,"threshold_uncertainty_score":0.6285247},"labels":[],"label_agreement":null},{"id":"W2293641507","doi":"10.5555/2876341.2876358","title":"The multi-craft problem: a distributed simulation approach using networked floating objects","year":2015,"lang":"en","type":"article","venue":"Memorial University Research Repository (Memorial University)","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Scalability; Modularity (biology); Distributed computing; Craft; Node (physics); Task (project management); Object (grammar); Point (geometry); Simple (philosophy); Artificial intelligence; Systems engineering; Operating system; Engineering","score_opus":0.08467293387218441,"score_gpt":0.29195716895376184,"score_spread":0.20728423508157742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293641507","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.042924907,0.00005462977,0.94332635,0.00016081058,0.0049426607,0.0009327559,0.000009669077,0.0002757269,0.00737247],"genre_scores_gemma":[0.9307591,0.00001630396,0.05495012,0.000008791009,0.004504973,5.6853594e-7,0.00007024588,0.000023847253,0.009666092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949485,0.0020602255,0.00026143427,0.0007555006,0.001265668,0.0007086873],"domain_scores_gemma":[0.9963146,0.00079723314,0.00021119436,0.00062663574,0.0015965631,0.00045380986],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024114354,0.00023612475,0.00024995953,0.00057292887,0.003253264,0.0005779332,0.0017322194,0.00020459258,0.0000012942331],"category_scores_gemma":[0.00043881178,0.00024042034,0.00014562953,0.0036041127,0.00028101707,0.0015470713,0.0011225059,0.0005770452,0.0000123077725],"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.000933976,0.00024558016,0.00018111868,0.000023446437,0.00010880744,0.00034225822,0.0013147158,0.9770258,0.0020480854,0.014132698,0.0015906591,0.0020528485],"study_design_scores_gemma":[0.002716146,0.00016604055,0.000049103106,0.000022577473,0.00003319525,0.000019196797,0.0016078604,0.9239506,0.000621262,0.0003203799,0.070200235,0.0002933907],"about_ca_topic_score_codex":0.000654289,"about_ca_topic_score_gemma":0.00006485324,"teacher_disagreement_score":0.88837624,"about_ca_system_score_codex":0.0013511273,"about_ca_system_score_gemma":0.0015021247,"threshold_uncertainty_score":0.9980444},"labels":[],"label_agreement":null},{"id":"W2293673697","doi":"10.1007/978-3-662-49192-8_10","title":"Orthogonal Layout with Optimal Face Complexity","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba","funders":"","keywords":"Rectangle; Embedding; Planar graph; Time complexity; Face (sociological concept); Combinatorics; Computational complexity theory; Computer science; Graph embedding; Graph; Mathematics; Discrete mathematics; Algorithm; Geometry; Artificial intelligence","score_opus":0.026426689458918098,"score_gpt":0.25105196737060714,"score_spread":0.22462527791168904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293673697","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.0003699852,0.00017910646,0.99090594,0.0012517007,0.0009430388,0.0003315874,0.000016297408,0.00016719708,0.0058351173],"genre_scores_gemma":[0.2073586,0.000013478027,0.78880805,0.0013153695,0.00078193896,0.000011271523,0.000018352248,0.00003553556,0.0016573784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609834,0.000037117523,0.00042952338,0.001537738,0.0012867451,0.0006105076],"domain_scores_gemma":[0.9977805,0.00036506675,0.0002721623,0.0009859169,0.00037934302,0.00021703022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006151236,0.0005227139,0.00045100925,0.000697349,0.00033245955,0.00047541494,0.0022625441,0.00021374295,0.000048599515],"category_scores_gemma":[0.000036637804,0.00038716238,0.00010541649,0.00061584817,0.0008393641,0.00077639456,0.00093270454,0.000517686,0.00010147251],"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.000021402755,0.000035327055,0.000055166096,0.000021200336,0.000020691572,0.000093132214,0.0003527277,0.19810265,0.000096610835,0.24919938,0.000029318118,0.5519724],"study_design_scores_gemma":[0.00092133175,0.00062532775,0.0008429814,0.00053000427,0.000015395417,0.00040073425,2.1290504e-7,0.7801403,0.0012264078,0.20687021,0.006868959,0.0015581829],"about_ca_topic_score_codex":0.0000040005316,"about_ca_topic_score_gemma":0.00005313856,"teacher_disagreement_score":0.58203757,"about_ca_system_score_codex":0.00023875381,"about_ca_system_score_gemma":0.00089457165,"threshold_uncertainty_score":0.999858},"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":"W2295098206","doi":"","title":"Approximation Algorithms for a Triangle Enclosure Problem","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Convex hull; Combinatorics; Approximation algorithm; Regular polygon; Mathematics; Triangle inequality; Enclosure; Set (abstract data type); Plane (geometry); Algorithm; Discrete mathematics; Computer science; Geometry","score_opus":0.08659723767557773,"score_gpt":0.26544009848704214,"score_spread":0.17884286081146442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295098206","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.0027851898,0.000035292785,0.97784466,0.0012776878,0.00045218205,0.0006991067,0.000072733346,0.00011809986,0.016715044],"genre_scores_gemma":[0.6054399,0.0000022436486,0.39248782,0.0010707943,0.0001256403,0.00014831458,0.00020406759,0.000014494816,0.0005067262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818385,0.00006725449,0.00037022738,0.0005764727,0.0003782283,0.00042395527],"domain_scores_gemma":[0.9984105,0.00019343042,0.00015130958,0.00028300585,0.0005412201,0.00042053196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045033623,0.00022580555,0.0002214115,0.00080394297,0.00032283948,0.00019255832,0.00060255465,0.00012554544,0.0003117699],"category_scores_gemma":[0.0001094247,0.00024340095,0.00011443576,0.0011040496,0.000045686258,0.00048239742,0.000050097588,0.00014240673,0.00020252005],"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.00002041719,0.000098458084,0.000118574884,0.000024203002,0.000040079856,0.000008834628,0.0005614968,0.0135832075,0.000023944893,0.83712023,0.0055851857,0.14281534],"study_design_scores_gemma":[0.0009621799,0.00040172058,0.005328871,0.000033007327,0.000012677938,0.000027456193,0.00003954092,0.64784455,0.0003304351,0.33613873,0.00839795,0.0004828881],"about_ca_topic_score_codex":0.0011749172,"about_ca_topic_score_gemma":0.0012387675,"teacher_disagreement_score":0.6342613,"about_ca_system_score_codex":0.00019679019,"about_ca_system_score_gemma":0.0011027649,"threshold_uncertainty_score":0.99256027},"labels":[],"label_agreement":null},{"id":"W2295197591","doi":"10.20382/jocg.v6i2a2","title":"Finding the largest disk containing a query point in logarithmic time with linear storage","year":2014,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israeli Centers for Research Excellence; Tel Aviv University","keywords":"Logarithm; Point (geometry); Computer science; Mathematics; Geometry; Mathematical analysis","score_opus":0.0075280229826029995,"score_gpt":0.19768910673146448,"score_spread":0.19016108374886148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295197591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3263841,0.00003774134,0.67138034,0.001117755,0.0001446178,0.00008115512,0.0000022229278,0.000018830144,0.00083325896],"genre_scores_gemma":[0.9685029,0.000006082841,0.03065642,0.00031918235,0.00017717129,2.5394033e-7,0.000008817276,0.000008178511,0.00032102547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983309,0.00026659184,0.0003556616,0.0002262646,0.0005955052,0.00022506207],"domain_scores_gemma":[0.99790996,0.00090497214,0.0004551334,0.0001637835,0.00045268761,0.00011347299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010605755,0.00015926895,0.00026841278,0.0012638309,0.00021803117,0.00011450762,0.0006776616,0.000061589155,0.000024946014],"category_scores_gemma":[0.00012566394,0.00012735528,0.000111024805,0.0019766788,0.00006480765,0.00090272824,0.00014049394,0.00037625586,0.0000135347855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010706896,0.00009676762,0.002295035,0.000008193245,0.000061677485,0.00014434388,0.0003223278,0.95842195,0.00009593993,0.033738244,0.00018627995,0.00452215],"study_design_scores_gemma":[0.0033579168,0.0010518789,0.048028193,0.00017257486,0.000047452668,0.0005517863,0.00029271704,0.9240963,0.00012356318,0.0067092683,0.015143799,0.00042453466],"about_ca_topic_score_codex":0.000013067119,"about_ca_topic_score_gemma":0.000009491423,"teacher_disagreement_score":0.64211875,"about_ca_system_score_codex":0.00020312058,"about_ca_system_score_gemma":0.0003016142,"threshold_uncertainty_score":0.51933974},"labels":[],"label_agreement":null},{"id":"W2295337288","doi":"","title":"Weighted Region Problem in Arrangement of Lines","year":2013,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Shortest path problem; Hull; Bounded function; Combinatorics; Boundary (topology); Path (computing); Line segment; Mathematics; Line (geometry); Computer science; Geometry; Graph; Mathematical analysis","score_opus":0.027374131823302613,"score_gpt":0.2344320232530039,"score_spread":0.2070578914297013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295337288","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.32095125,0.00016051087,0.6470078,0.01330805,0.00059431087,0.0010860948,0.00001997018,0.00009645128,0.016775552],"genre_scores_gemma":[0.9578236,0.0000075238245,0.040935494,0.000775101,0.00005457175,0.000051441606,0.000062348816,0.0000070958595,0.00028285285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984673,0.00007051243,0.00040807284,0.0003825734,0.00036863494,0.0003028702],"domain_scores_gemma":[0.99867463,0.00015281497,0.00013273294,0.00023350849,0.0005535467,0.00025276965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001769798,0.00016202191,0.00019587702,0.0013304391,0.000080462494,0.0001240125,0.00046867775,0.00007729895,0.00017605569],"category_scores_gemma":[0.000039132585,0.0001682795,0.000050205457,0.0014967408,0.000044644825,0.00039414264,0.00004535022,0.00013962804,0.00014795011],"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.000007729863,0.00015382783,0.0038875407,0.00004979654,0.000031191783,0.000024840107,0.00037084988,0.09410509,0.00018002682,0.74243176,0.0052686576,0.15348868],"study_design_scores_gemma":[0.0007471907,0.0002095023,0.09605246,0.00013300574,0.000003860603,0.000018649958,0.00005890866,0.7164518,0.0003288554,0.18313771,0.0024483267,0.0004096894],"about_ca_topic_score_codex":0.0062097255,"about_ca_topic_score_gemma":0.0030922992,"teacher_disagreement_score":0.6368723,"about_ca_system_score_codex":0.0001564902,"about_ca_system_score_gemma":0.0007958708,"threshold_uncertainty_score":0.9387289},"labels":[],"label_agreement":null},{"id":"W2295570425","doi":"10.19086/da990","title":"New bounds on curve tangencies and orthogonalities","year":2016,"lang":"en","type":"article","venue":"Discrete Analysis","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"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; National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete geometry; Incidence (geometry); Plane (geometry); Discrete mathematics; Geometry","score_opus":0.012326848934574397,"score_gpt":0.2466337477394108,"score_spread":0.2343068988048364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295570425","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.07649968,0.00024673954,0.9191919,0.0024415457,0.00006376874,0.000028406224,0.0000076578135,0.000046386576,0.0014738976],"genre_scores_gemma":[0.9844557,0.00005267086,0.009178972,0.00025985632,0.00009011874,0.0000034921288,0.000010874231,0.000002784147,0.005945534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99918777,0.000044335204,0.00013125199,0.00027191828,0.00023847446,0.00012624574],"domain_scores_gemma":[0.99940234,0.0001672717,0.000049525534,0.00023993621,0.00005310839,0.0000878158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015182298,0.00008852771,0.00013021636,0.00027043116,0.00010559868,0.00013977641,0.00018208406,0.000024011804,0.000087756925],"category_scores_gemma":[0.000049272603,0.000057425645,0.00010424745,0.00087190623,0.00002554971,0.00032630106,0.00007089856,0.000023970222,0.000027025017],"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.000016858821,0.000022662553,0.021138513,0.0000066017938,0.00095377804,0.00000857085,0.0009865557,0.0017976747,0.0014934357,0.7234993,0.0028869316,0.24718912],"study_design_scores_gemma":[0.001858957,0.00074116356,0.55023015,0.000090270885,0.0014655271,0.000015459269,0.00032085073,0.12992598,0.012561962,0.17686808,0.123972446,0.0019491373],"about_ca_topic_score_codex":0.000049262733,"about_ca_topic_score_gemma":0.000090343194,"teacher_disagreement_score":0.91001296,"about_ca_system_score_codex":0.000016901258,"about_ca_system_score_gemma":0.00004148422,"threshold_uncertainty_score":0.23417498},"labels":[],"label_agreement":null},{"id":"W2295628431","doi":"10.1093/comjnl/bxv048","title":"Planar and Quasi-Planar Simultaneous Geometric Embedding","year":2015,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"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":"","keywords":"Classics; Library science; Art history; Humanities; History; Art; Computer science","score_opus":0.029200113131055153,"score_gpt":0.26755952554373696,"score_spread":0.23835941241268183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295628431","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.03257878,0.00083190686,0.96282625,0.0022050438,0.0012339494,0.0000706024,9.962803e-7,0.000059047445,0.00019339233],"genre_scores_gemma":[0.8404087,0.000047954927,0.15664715,0.0012575706,0.0014507931,0.000001413843,0.000002946896,0.000008963813,0.00017454698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986803,0.00016667653,0.00025545454,0.00020951619,0.00043929523,0.00024874177],"domain_scores_gemma":[0.99872285,0.00046422583,0.00013739365,0.00022787196,0.00019823012,0.00024941494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010001833,0.00013451264,0.00014699844,0.00030493597,0.0003621376,0.0005911902,0.00066958275,0.000039664035,0.0000037027132],"category_scores_gemma":[0.00008619996,0.00009342402,0.000045515204,0.00065713376,0.00003376059,0.0004036893,0.000128803,0.00027963478,0.000041589756],"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.000034361306,0.00013398385,0.00033250195,0.000010236296,0.00010116745,0.00038849507,0.0031015004,0.20629637,0.00009459806,0.025766041,0.0351079,0.72863287],"study_design_scores_gemma":[0.0005330038,0.00030129662,0.0005038886,0.000013442512,0.000010047238,0.0041282196,0.000036071808,0.9602255,0.000040810013,0.021445658,0.012588598,0.0001734349],"about_ca_topic_score_codex":0.000004646352,"about_ca_topic_score_gemma":0.000001252781,"teacher_disagreement_score":0.80782986,"about_ca_system_score_codex":0.000053444717,"about_ca_system_score_gemma":0.00010560055,"threshold_uncertainty_score":0.57008606},"labels":[],"label_agreement":null},{"id":"W2295704388","doi":"","title":"The Possible Hull of Imprecise Points","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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 British Columbia","funders":"","keywords":"Convex hull; Hull; Polygon (computer graphics); Simple (philosophy); Simple polygon; Point (geometry); Mathematics; Regular polygon; Combinatorics; Set (abstract data type); Plane (geometry); Orthogonal convex hull; Mathematical optimization; Algorithm; Computer science; Geometry; Convex body; Engineering","score_opus":0.04666611281999775,"score_gpt":0.2427950566893644,"score_spread":0.19612894386936666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295704388","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.11251985,0.000379158,0.7906931,0.004575264,0.002189826,0.000625399,0.000100368336,0.00014920943,0.088767834],"genre_scores_gemma":[0.9750527,0.000012982571,0.023738403,0.00062275876,0.0000528529,0.00001340326,0.000025311962,0.000008155481,0.00047339997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842805,0.00008482686,0.00035536298,0.0003472738,0.00043299058,0.00035152596],"domain_scores_gemma":[0.9981715,0.00033482318,0.00015470569,0.00039261748,0.0006044267,0.00034190205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294607,0.00016132396,0.00015363877,0.0005517491,0.0003767841,0.00014301695,0.00094464736,0.000071325485,0.0001750082],"category_scores_gemma":[0.0001364659,0.00013705778,0.00008104709,0.0010783103,0.00011072713,0.0002724817,0.00007693057,0.00015732611,0.00016544544],"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.000013225876,0.000042852753,0.00044082626,0.0000061021938,0.000030091112,0.0000092963355,0.00030881717,0.003498823,0.000026293888,0.9223243,0.0017397231,0.07155966],"study_design_scores_gemma":[0.00085782626,0.00053851394,0.12397072,0.00007536953,0.000015752887,0.000057093657,0.0001610046,0.3288467,0.0021860742,0.5341711,0.008436342,0.00068351196],"about_ca_topic_score_codex":0.0020503676,"about_ca_topic_score_gemma":0.0027618075,"teacher_disagreement_score":0.86253285,"about_ca_system_score_codex":0.000095120864,"about_ca_system_score_gemma":0.0013277532,"threshold_uncertainty_score":0.5589054},"labels":[],"label_agreement":null},{"id":"W2295991175","doi":"10.5539/jmr.v8n2p25","title":"Optimal Geometric Disks Covering using Tessellable Regular Polygons","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polygon (computer graphics); Mathematics; Geometry; Perimeter; Combinatorics; Hexagonal tiling; Bounded function; Plane (geometry); Regular polygon; Computational geometry; Line segment; Surface (topology); Hexagonal crystal system; Mathematical analysis; Grid; Computer science","score_opus":0.14456084040136694,"score_gpt":0.3922312916943465,"score_spread":0.24767045129297957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295991175","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.3240435,0.000241636,0.6748447,0.00044071238,0.00013329391,0.000059857433,8.365246e-7,0.00000779298,0.00022768923],"genre_scores_gemma":[0.6385552,0.00008606819,0.36039767,0.000008768868,0.00020517662,0.0000011866568,1.2572151e-7,0.000009402018,0.0007363845],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976679,0.00012258552,0.00045381658,0.0001417634,0.0012910287,0.00032291954],"domain_scores_gemma":[0.99739105,0.0010193108,0.00023393198,0.00029498432,0.00090890395,0.00015183147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035185493,0.00008519404,0.00019079063,0.0011212052,0.00020652935,0.0002224135,0.00075432396,0.000049205115,0.000044269895],"category_scores_gemma":[0.0009923897,0.000055776312,0.000085939915,0.0016113606,0.000052208503,0.0006728345,0.0002720258,0.00020871067,0.000033963974],"study_design_candidate":"bench_or_experimental","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.00006222836,0.0016263186,0.00047381996,0.00042096598,0.00033348793,0.00034999367,0.0027591353,0.097508386,0.63646984,0.118273124,0.009357912,0.13236476],"study_design_scores_gemma":[0.0024491053,0.0011021041,0.00074406737,0.0011255273,0.000039195595,0.0022155833,0.00063942635,0.65915376,0.2574174,0.064772904,0.009722667,0.00061829324],"about_ca_topic_score_codex":0.0000041807357,"about_ca_topic_score_gemma":4.485635e-7,"teacher_disagreement_score":0.5616453,"about_ca_system_score_codex":0.00016728096,"about_ca_system_score_gemma":0.00026967685,"threshold_uncertainty_score":0.2274492},"labels":[],"label_agreement":null},{"id":"W2296012640","doi":"10.7155/jgaa.00355","title":"Point-Set Embedding in Three Dimensions","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","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 Lethbridge","funders":"","keywords":"Combinatorics; Bounded function; Mathematics; Embedding; Grid; Minimum bounding box; Integer (computer science); Point (geometry); Graph; Discrete mathematics; Bounding overwatch; Geometry; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.030256003817284462,"score_gpt":0.29376898507636107,"score_spread":0.26351298125907663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296012640","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.033884566,0.00079063297,0.96394575,0.0010104064,0.00011183627,0.00009818311,0.0000019934412,0.000010714666,0.00014592758],"genre_scores_gemma":[0.71100736,0.00014067751,0.28829885,0.00021525109,0.00026870117,0.000023260729,0.0000034526931,0.000005649348,0.000036822705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992944,0.000020949645,0.00027995434,0.00011546478,0.00019258357,0.00009664261],"domain_scores_gemma":[0.9993122,0.000067020046,0.00014759328,0.00012287255,0.00020999894,0.00014031942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044352494,0.000062876905,0.00011133441,0.00029542626,0.000077113924,0.00007074009,0.00019606634,0.000027937345,0.0000014104394],"category_scores_gemma":[0.000022546477,0.000054217315,0.000040959552,0.0006537362,0.000023334715,0.0003827362,0.00005731428,0.00011360174,0.0000029850764],"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.000017590057,0.00043277277,0.0038687808,0.00001538444,0.00006515967,0.000035360354,0.0013534547,0.038828626,0.0012277531,0.59377253,0.0033881243,0.35699448],"study_design_scores_gemma":[0.0015097427,0.00027202573,0.012855262,0.000045020155,0.00002182999,0.0005519129,0.00030798392,0.299625,0.00034919893,0.66041076,0.023770258,0.00028101765],"about_ca_topic_score_codex":0.0000072750254,"about_ca_topic_score_gemma":0.000009245802,"teacher_disagreement_score":0.6771228,"about_ca_system_score_codex":0.000019153864,"about_ca_system_score_gemma":0.000079404956,"threshold_uncertainty_score":0.22109179},"labels":[],"label_agreement":null},{"id":"W2296155209","doi":"10.1016/j.cad.2016.03.004","title":"A new approach to automatic and a priori mesh adaptation around circular holes for finite element analysis","year":2016,"lang":"en","type":"article","venue":"Computer-Aided Design","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":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite element method; A priori and a posteriori; Adaptation (eye); Computer science; Physics; Structural engineering; Engineering; Optics","score_opus":0.05723848717640566,"score_gpt":0.2640442816125867,"score_spread":0.20680579443618102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296155209","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.00181204,0.00008637433,0.9963179,0.0005625508,0.00018527555,0.0008556448,0.00000394334,0.00015661721,0.000019647556],"genre_scores_gemma":[0.2076586,0.0000059445765,0.7915895,0.0002962704,0.00017684436,0.00008875355,0.000013020991,0.000009016108,0.00016206944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981454,0.00016311169,0.0003864872,0.0006855068,0.00033579854,0.00028366968],"domain_scores_gemma":[0.99830645,0.0007087365,0.00014389573,0.00044419017,0.00016967146,0.00022707132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070390454,0.00020627808,0.00029977807,0.00054870034,0.00016599549,0.00033989572,0.000422536,0.000056560217,0.000005009497],"category_scores_gemma":[0.00008105558,0.0001681394,0.0001259225,0.0011687457,0.000018992345,0.00045270685,0.0001408622,0.000037303296,0.000022691482],"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.000019089466,0.00008398039,0.00003292375,0.000033363278,0.00030609104,0.0000019931927,0.0010208795,0.36497623,0.0007559284,0.02533886,0.0020630183,0.60536766],"study_design_scores_gemma":[0.0007402757,0.00021624983,0.0010517593,0.000026318732,0.00011535118,0.000006586232,0.0000128929605,0.9873791,0.00047397084,0.008646857,0.0010812386,0.00024945004],"about_ca_topic_score_codex":0.000007052065,"about_ca_topic_score_gemma":0.0000016416475,"teacher_disagreement_score":0.62240285,"about_ca_system_score_codex":0.00008296672,"about_ca_system_score_gemma":0.00017918105,"threshold_uncertainty_score":0.6856526},"labels":[],"label_agreement":null},{"id":"W2296189763","doi":"","title":"Duality for Geometric Set Cover and Geometric Hitting Set Problems on Pseudodisks","year":2015,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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 Manitoba","funders":"","keywords":"Cover (algebra); Mathematics; Duality (order theory); Set cover problem; Set (abstract data type); Dual (grammatical number); Combinatorics; Covering problems; Object (grammar); Point (geometry); Discrete mathematics; Set function; Computer science; Geometry; Artificial intelligence","score_opus":0.10498015817063718,"score_gpt":0.31542709364409477,"score_spread":0.2104469354734576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296189763","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.13229567,0.0001713358,0.86358255,0.0008192859,0.00040500402,0.00041999912,0.00002027792,0.00012549642,0.0021603766],"genre_scores_gemma":[0.9568242,0.000009399889,0.040008593,0.000820479,0.00016468346,0.000043375712,0.000052900126,0.000008706439,0.0020676542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844027,0.00006586408,0.00028760455,0.0004849307,0.00044011668,0.00028122496],"domain_scores_gemma":[0.99856955,0.0005400302,0.00011774377,0.00028028683,0.00028901023,0.00020339746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013841224,0.00015365396,0.00017668703,0.0008393472,0.00015224308,0.0002692462,0.0002800502,0.0000697858,0.000014769209],"category_scores_gemma":[0.0006439369,0.00013430655,0.000050929095,0.0027886594,0.000020623278,0.0004808597,0.00017701201,0.00009124528,0.00007356388],"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.00012610795,0.0006845404,0.013260491,0.0003569057,0.00018084611,0.000013126408,0.0027272557,0.18214615,0.00032910425,0.15084545,0.21428958,0.43504044],"study_design_scores_gemma":[0.004513796,0.0018711165,0.025722066,0.00003974798,0.000036778445,0.00008896724,0.0001426657,0.81844306,0.004952079,0.030118749,0.1129637,0.0011072933],"about_ca_topic_score_codex":0.000026232387,"about_ca_topic_score_gemma":0.000002267206,"teacher_disagreement_score":0.8245285,"about_ca_system_score_codex":0.00006946682,"about_ca_system_score_gemma":0.00010435923,"threshold_uncertainty_score":0.5476862},"labels":[],"label_agreement":null},{"id":"W2296549964","doi":"10.4230/lipics.socg.2015.719","title":"Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"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":"Deterministic algorithm; Computational geometry; Algorithm; Voronoi diagram; Combinatorics; Mathematics; Time complexity; Regular polygon; Dynamic programming; Randomized algorithm; Linear programming; Approximation algorithm; Mathematical optimization; Computer science; Geometry","score_opus":0.042338327910993775,"score_gpt":0.2922397059483311,"score_spread":0.2499013780373373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296549964","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.076582134,0.000058675294,0.92045957,0.00048064862,0.00076912,0.0008403888,0.00011763638,0.00014080807,0.00055105035],"genre_scores_gemma":[0.3077899,0.000010459097,0.6892532,0.0014284977,0.0003607586,0.00022620919,0.0003741936,0.000029044348,0.00052772823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981561,0.000020375,0.00067257136,0.00029064235,0.00037480448,0.00048555364],"domain_scores_gemma":[0.99840325,0.00020903186,0.0002641533,0.00035379198,0.0004682312,0.00030153367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070364476,0.00026768184,0.00028878415,0.00021615523,0.00028569796,0.00056247786,0.0005863475,0.00012813229,0.0000027352717],"category_scores_gemma":[0.0002049535,0.00025466052,0.000121423436,0.00024280143,0.000065980705,0.0014520639,0.00028212523,0.00014104745,0.000028032213],"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.00069583365,0.0013134623,0.0039747264,0.0022578442,0.00063150167,0.000030918618,0.062150076,0.025555557,0.00032814543,0.20304216,0.050647717,0.64937204],"study_design_scores_gemma":[0.0026304624,0.00053021964,0.00023217779,0.00003886743,0.000023599097,0.00010787526,0.00028046416,0.9046012,0.0003886062,0.0031971969,0.087597646,0.0003716686],"about_ca_topic_score_codex":0.0000036559027,"about_ca_topic_score_gemma":0.000003132231,"teacher_disagreement_score":0.87904567,"about_ca_system_score_codex":0.000071441886,"about_ca_system_score_gemma":0.00014719368,"threshold_uncertainty_score":0.9999906},"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":"W2314050188","doi":"10.2514/6.2005-128","title":"Boundary Search and Simplex Decomposition Method for MDO Problems with a Convex or Convex-like State Parameter Region","year":2005,"lang":"en","type":"article","venue":"43rd AIAA Aerospace Sciences Meeting and Exhibit","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; National Aeronautics and Space Administration","keywords":"Simplex; Regular polygon; Boundary (topology); Decomposition; Convex optimization; State (computer science); Mathematical optimization; Convex combination; Convex analysis; Convex polytope; Mathematics; Computer science; Combinatorics; Algorithm; Mathematical analysis; Geometry","score_opus":0.034743199981391595,"score_gpt":0.31727603359967604,"score_spread":0.28253283361828446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314050188","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.38164517,0.0003203388,0.61336094,0.003962434,0.00008601663,0.0004044162,0.0000031265047,0.00008109006,0.00013644126],"genre_scores_gemma":[0.55962825,0.00007105715,0.438833,0.0007375101,0.00008560679,0.000039199575,0.0000059415424,0.000008937473,0.00059049716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795383,0.00015416443,0.00025578952,0.0007626232,0.0004215262,0.00045203467],"domain_scores_gemma":[0.99870867,0.00062451017,0.00012561184,0.0001813678,0.00018573241,0.00017408661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016443954,0.00020091674,0.0002449703,0.00016645622,0.0009476914,0.0008838353,0.0002582922,0.000055298544,0.0000033360684],"category_scores_gemma":[0.00006346986,0.00014776077,0.000035718054,0.00062901975,0.0003163296,0.0008881516,0.00014268374,0.00011925173,0.0000028699553],"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.00065939495,0.00031208075,0.0063310484,0.000594379,0.0001243718,0.000026594467,0.0191867,0.18971989,0.032126285,0.01330965,0.0037641267,0.7338455],"study_design_scores_gemma":[0.0012969984,0.001337026,0.0013451165,0.00018349465,0.000020301712,0.00024942422,0.00032902518,0.9690968,0.011164988,0.0022993502,0.012208657,0.00046885406],"about_ca_topic_score_codex":0.000076526325,"about_ca_topic_score_gemma":0.00015563387,"teacher_disagreement_score":0.77937686,"about_ca_system_score_codex":0.000035280456,"about_ca_system_score_gemma":0.00022410206,"threshold_uncertainty_score":0.85228443},"labels":[],"label_agreement":null},{"id":"W2316112687","doi":"10.2514/6.2016-1672","title":"The impact of unstructured mesh generation approach on truncation error","year":2016,"lang":"en","type":"article","venue":"54th AIAA Aerospace Sciences Meeting","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 British Columbia","funders":"","keywords":"Computer science; Mesh generation; Truncation (statistics); Truncation error; Algorithm; Mathematics; Finite element method; Applied mathematics; Structural engineering; Engineering","score_opus":0.037176626526447154,"score_gpt":0.30177239080632506,"score_spread":0.2645957642798779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2316112687","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.60699075,0.0001094501,0.38744673,0.0015735554,0.00054875156,0.00024646215,0.0000029229077,0.00006822159,0.0030131335],"genre_scores_gemma":[0.96837556,0.0000176975,0.03106625,0.000042870724,0.00022260462,0.0000139125095,0.0000029643838,0.00000472751,0.00025343435],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981425,0.00017546643,0.00028792507,0.00045471758,0.0006328387,0.00030659148],"domain_scores_gemma":[0.9987417,0.00032589908,0.00031448546,0.00034702636,0.00019626982,0.000074631855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015800218,0.00015013338,0.0001309352,0.000129572,0.00079456036,0.00024184519,0.00074644684,0.000048369668,0.000004726974],"category_scores_gemma":[0.00038871076,0.00007469495,0.000103132945,0.0010487398,0.00021405387,0.00059437455,0.000093718365,0.00006233208,0.000008817341],"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.00003358986,0.000109068125,0.002843429,0.000011067924,0.00004211199,5.5644404e-7,0.0017856603,0.2356312,0.39212802,0.18369173,0.0034116239,0.18031198],"study_design_scores_gemma":[0.000646295,0.0006775628,0.014774961,0.000062051346,0.000008001184,0.000013004368,0.00015427508,0.8864629,0.09136188,0.005216265,0.00026222988,0.00036055772],"about_ca_topic_score_codex":0.000034827182,"about_ca_topic_score_gemma":0.000014169835,"teacher_disagreement_score":0.6508317,"about_ca_system_score_codex":0.00009340984,"about_ca_system_score_gemma":0.00024164007,"threshold_uncertainty_score":0.6111196},"labels":[],"label_agreement":null},{"id":"W2331493134","doi":"10.2514/6.2009-375","title":"Eikonal Equation Based Front Propagation Technique and its Applications","year":2009,"lang":"en","type":"article","venue":"47th AIAA Aerospace Sciences Meeting including The New Horizons Forum and Aerospace Exposition","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Polytechnique Montréal","keywords":"Eikonal equation; Fast marching method; Offset (computer science); Front (military); Point (geometry); Finite difference method; Mathematical analysis; Normal; Boundary (topology); Computer science; Geometry; Boundary value problem; Mathematics; Algorithm; Surface (topology); Physics","score_opus":0.024437814918998105,"score_gpt":0.2713438126230033,"score_spread":0.24690599770400518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331493134","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.026198462,0.0007622247,0.9393925,0.031486947,0.000178647,0.0010444487,0.0000034648206,0.00023916742,0.00069412333],"genre_scores_gemma":[0.8992297,0.000060360842,0.09958169,0.0006133618,0.00020866001,0.00012542965,0.000016702603,0.000008375413,0.00015572393],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977949,0.00014568357,0.00031609857,0.00069817057,0.00061319943,0.00043193702],"domain_scores_gemma":[0.99881244,0.0002881441,0.00030171228,0.0002625146,0.00015815382,0.00017703888],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013377643,0.00025470488,0.00018415638,0.00021453558,0.0023743387,0.0006846747,0.00048505518,0.00010696525,0.000003069894],"category_scores_gemma":[0.00016150715,0.0002070307,0.000055427172,0.0010004663,0.00013969887,0.0011708125,0.00012060544,0.00020070246,0.000008522646],"study_design_candidate":"bench_or_experimental","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.0000558865,0.00016992098,0.00076800666,0.000043412776,0.000018015078,0.0000018885363,0.0012482639,0.026786467,0.5142894,0.38419953,0.002534288,0.069884926],"study_design_scores_gemma":[0.0010746778,0.0020614695,0.0023442432,0.0003729852,0.000054383174,0.000081578815,0.00065046083,0.7107823,0.24009508,0.038648732,0.002914724,0.0009193535],"about_ca_topic_score_codex":0.00003277634,"about_ca_topic_score_gemma":0.000027042915,"teacher_disagreement_score":0.87303126,"about_ca_system_score_codex":0.00009311771,"about_ca_system_score_gemma":0.00024236085,"threshold_uncertainty_score":0.99892443},"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":"W2342776777","doi":"10.4230/lipics.isaac.2016.17","title":"On $r$-Guarding Thin Orthogonal Polygons","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"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":"Polygon (computer graphics); Combinatorics; Polygon covering; Simple polygon; Point in polygon; Mathematics; Star-shaped polygon; Guard (computer science); Visibility polygon; Rectangle; Rectilinear polygon; Polygon mesh; Time complexity; Regular polygon; Discrete mathematics; Geometry; Computer science; Convex set","score_opus":0.019561566869496214,"score_gpt":0.27233527313246036,"score_spread":0.25277370626296414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342776777","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.041096274,0.000076151984,0.93819535,0.0015610711,0.005326547,0.0013287662,0.0010521514,0.000442861,0.010920824],"genre_scores_gemma":[0.9146788,0.000059357582,0.07604205,0.0037387346,0.0013126635,0.00040301468,0.001907253,0.00009304514,0.0017650957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591434,0.00008578684,0.0014163955,0.00068276207,0.0010461848,0.00085451896],"domain_scores_gemma":[0.99647766,0.00047672514,0.0008533055,0.0013916198,0.00049411826,0.00030654305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009581354,0.0007135323,0.00065848464,0.0007448412,0.0005257667,0.0009803752,0.0021020935,0.0005548556,0.000049482136],"category_scores_gemma":[0.00021916204,0.00059727253,0.0005891725,0.0003573105,0.00008628973,0.0012639336,0.0019481657,0.0009499824,0.00037793544],"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.000220188,0.0006639111,0.00060218817,0.0012335778,0.0007161489,0.000021091057,0.007273569,0.029276742,0.00013008021,0.8353877,0.045043204,0.079431586],"study_design_scores_gemma":[0.005341121,0.00073390204,0.0013633635,0.0018633254,0.00012341174,0.00016014851,0.00020888644,0.66048974,0.0027578461,0.2141936,0.10974244,0.0030222218],"about_ca_topic_score_codex":0.000004343142,"about_ca_topic_score_gemma":0.0000054127668,"teacher_disagreement_score":0.87358254,"about_ca_system_score_codex":0.00028843043,"about_ca_system_score_gemma":0.00044037853,"threshold_uncertainty_score":0.99964786},"labels":[],"label_agreement":null},{"id":"W2343027471","doi":"10.1016/j.jcta.2017.02.006","title":"Cutting algebraic curves into pseudo-segments and applications","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","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":"University of British Columbia","funders":"","keywords":"Mathematics; Bounded function; Constant (computer programming); Upper and lower bounds; Degree (music); Plane (geometry); Algebraic number; Plane curve; Combinatorics; Algebraic curve; Family of curves; Space (punctuation); Current (fluid); Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.008612297358442805,"score_gpt":0.26262579572424116,"score_spread":0.25401349836579834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343027471","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.12808675,0.004696222,0.8475009,0.0060835793,0.0090998765,0.0004891638,0.0000025555669,0.00006717822,0.0039737863],"genre_scores_gemma":[0.9819571,0.000541092,0.015932316,0.00023679312,0.0010646288,0.000010312907,0.0000012244456,0.000007658795,0.00024887908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991021,0.00009816598,0.00030367533,0.00012552737,0.00026471866,0.000105774714],"domain_scores_gemma":[0.9986205,0.00014135208,0.00056291255,0.00030643828,0.00027707085,0.000091737944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001025812,0.00009074197,0.00016810442,0.000084285,0.00060852326,0.00035665333,0.0006850665,0.000035724253,0.000008196794],"category_scores_gemma":[0.00029315683,0.00008099884,0.000055922003,0.00009353109,0.00008741328,0.0014986556,0.00022999223,0.00012585211,0.0000028811482],"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.000034870638,0.00004530894,0.00015386897,0.000034954446,0.000032762062,0.000004922643,0.00020307678,0.000018621291,0.0006786815,0.9601972,0.00032066708,0.03827507],"study_design_scores_gemma":[0.0005908087,0.00020536323,0.001236852,0.00010191661,0.000016975651,0.000111254776,0.000036385984,0.00017204501,0.002352731,0.98003924,0.015027291,0.000109126704],"about_ca_topic_score_codex":0.0000016323594,"about_ca_topic_score_gemma":3.044035e-7,"teacher_disagreement_score":0.85387033,"about_ca_system_score_codex":0.000023141023,"about_ca_system_score_gemma":0.00009402777,"threshold_uncertainty_score":0.46803302},"labels":[],"label_agreement":null},{"id":"W2346515765","doi":"10.1017/s0963548316000043","title":"On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves","year":2016,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; École Polytechnique Fédérale de Lausanne; Fondation Sciences Mathématiques de Paris; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Agence Nationale de la Recherche; National Science Foundation","keywords":"Mathematics; Conjecture; Combinatorics; Family of curves; Intersection (aeronautics); Plane curve; Regular polygon; Function (biology); Mathematical analysis; Geometry","score_opus":0.021856556728958237,"score_gpt":0.23857896007353546,"score_spread":0.21672240334457724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346515765","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.41896242,0.00045778017,0.5680351,0.009198429,0.0015109719,0.0005771294,0.0000020699053,0.00036955098,0.00088650815],"genre_scores_gemma":[0.994866,0.0000128271995,0.0036255065,0.0012532691,0.00012344692,0.000015674752,0.000002773608,0.000013754646,0.00008673875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971462,0.0006532553,0.00054307503,0.00073232304,0.00047194917,0.00045323395],"domain_scores_gemma":[0.9938521,0.0044973725,0.00030248932,0.00090579607,0.00031869704,0.00012357991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026771235,0.00026217787,0.00028071454,0.000113061804,0.0005338709,0.00014493943,0.0011398463,0.00008886583,0.000014903229],"category_scores_gemma":[0.0021952924,0.00016386928,0.00015875149,0.0009222782,0.000095645875,0.00030367504,0.0005587096,0.00030404865,0.000039777344],"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.000007574195,0.00018535739,0.0018230352,0.00008191661,0.000028122106,0.0000046774207,0.0004087785,0.00058622565,0.00028491425,0.911218,0.0014640548,0.08390738],"study_design_scores_gemma":[0.0008249567,0.00030606193,0.012268932,0.0007566427,0.000012900969,0.000024591573,0.000017007978,0.049882814,0.0027968849,0.93153685,0.0010940202,0.0004783545],"about_ca_topic_score_codex":0.0000047004264,"about_ca_topic_score_gemma":0.0000023177388,"teacher_disagreement_score":0.5759036,"about_ca_system_score_codex":0.00025319072,"about_ca_system_score_gemma":0.00013643375,"threshold_uncertainty_score":0.66823953},"labels":[],"label_agreement":null},{"id":"W2349466073","doi":"","title":"An Efficient Algorithm for Clipping Polygon in GIS","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Clipping (morphology); Polygon (computer graphics); Bottleneck; Algorithm; Regular polygon; Point in polygon; Process (computing); Set (abstract data type); Convex polygon; Rectilinear polygon; Computer graphics (images); Polygon mesh; Simple polygon; Mathematics; Telecommunications","score_opus":0.009527051960174369,"score_gpt":0.2770180783353687,"score_spread":0.2674910263751943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2349466073","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.005455181,0.00009867513,0.99254155,0.000825249,0.000037049915,0.000786598,0.000007028765,0.00014897592,0.00009971386],"genre_scores_gemma":[0.10604597,0.0000027994672,0.8924673,0.0009273669,0.00023489806,0.0002223731,0.00006209336,0.0000054759903,0.000031697018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888,0.000027499385,0.00026819165,0.0004710107,0.00011465805,0.00023859393],"domain_scores_gemma":[0.99936146,0.000057829584,0.000064099695,0.00033622287,0.0000982925,0.00008212599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021362014,0.000120774996,0.00011982787,0.00025226083,0.00017006577,0.00016334397,0.00056361774,0.00005068542,0.0000018214254],"category_scores_gemma":[4.765236e-7,0.0001335368,0.000056318095,0.00068446464,0.000011488825,0.0002077379,0.000043542354,0.00007321169,0.000019497551],"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":[9.564764e-7,0.00024041225,0.0000070322026,0.0000026017694,0.0000023654627,3.921304e-7,0.00018978973,0.03384158,0.0052604023,0.018693352,0.00015723947,0.9416039],"study_design_scores_gemma":[0.0003625577,0.0000815054,0.0038461774,0.000006642913,0.0000024424216,0.000010021539,0.0000053603953,0.94311404,0.0030969924,0.0055243564,0.043777946,0.00017195752],"about_ca_topic_score_codex":0.00000508799,"about_ca_topic_score_gemma":0.0000023906682,"teacher_disagreement_score":0.94143194,"about_ca_system_score_codex":0.00005865144,"about_ca_system_score_gemma":0.000052681844,"threshold_uncertainty_score":0.54454726},"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":"W2394703894","doi":"","title":"The Crossing Number of K 2, 4, n .","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Crossing number (knot theory); Combinatorics; Geography; Cartography; Intersection (aeronautics)","score_opus":0.02219473891717427,"score_gpt":0.2610429872999888,"score_spread":0.23884824838281454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394703894","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.94510466,0.00012694774,0.033173237,0.00012419593,0.0027543944,0.000078550554,3.6028322e-7,0.000060277303,0.018577384],"genre_scores_gemma":[0.9919375,0.00000279768,0.007804232,0.00004867429,0.0000046796877,0.0000031523136,3.6008453e-7,0.0000024160815,0.00019614151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999481,0.00003446657,0.00013425296,0.00010506889,0.0001445645,0.00010062843],"domain_scores_gemma":[0.9994712,0.00008937831,0.00006656021,0.0002403687,0.0001049825,0.00002755021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023669747,0.00004620121,0.000051936633,0.000017417253,0.00024912867,0.00008300296,0.00037173514,0.000020125515,0.000011238934],"category_scores_gemma":[0.00003512552,0.000034709585,0.00003125968,0.00026300474,0.00005793209,0.00019312867,0.000093479146,0.000043625103,0.000036926132],"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.0000022844185,0.000027788117,0.0014696491,0.0000014488093,0.0000054005695,8.253213e-7,0.00048411443,0.0000060761076,0.00011677349,0.9873558,0.00037392182,0.010155918],"study_design_scores_gemma":[0.00019114405,0.000025459009,0.015157624,0.000004837306,0.0000020935443,0.000008086643,0.000012317918,0.0033310961,0.0098593915,0.9675315,0.0038111678,0.000065251515],"about_ca_topic_score_codex":0.000014181911,"about_ca_topic_score_gemma":0.0000010787329,"teacher_disagreement_score":0.046832893,"about_ca_system_score_codex":0.000009134843,"about_ca_system_score_gemma":0.000058245438,"threshold_uncertainty_score":0.19161215},"labels":[],"label_agreement":null},{"id":"W2395072164","doi":"","title":"Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on 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":"Simon Fraser University","funders":"","keywords":"Computer science; Set (abstract data type); Space (punctuation); Point (geometry); Algorithm; Mathematics; Geometry; Programming language","score_opus":0.023490783606116762,"score_gpt":0.26017690045934166,"score_spread":0.2366861168532249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395072164","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.032821577,0.000025175303,0.9631357,0.0017900756,0.0004414387,0.00038911862,0.000078188365,0.00003751947,0.001281182],"genre_scores_gemma":[0.8331645,9.443439e-7,0.16588925,0.00068921054,0.000081339706,0.00001577191,0.0001086853,0.000010072346,0.000040233317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980198,0.000109246954,0.00049291516,0.0005329197,0.00040022042,0.00044485775],"domain_scores_gemma":[0.99814266,0.000577523,0.00019026146,0.00027009574,0.0005028822,0.0003165574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076136284,0.00020947303,0.00030193443,0.0013856898,0.00014176306,0.00012235878,0.0005140271,0.00008559099,0.000027402508],"category_scores_gemma":[0.00018859151,0.00023329325,0.000102884645,0.0011591304,0.00005477856,0.00012842202,0.00007344828,0.00015703116,0.000024006973],"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.0000065748486,0.0000750214,0.00013970748,0.00002485869,0.000014309071,0.000003904864,0.0003280392,0.4489967,0.000028707409,0.40987885,0.00040028396,0.14010304],"study_design_scores_gemma":[0.0007528967,0.00019483124,0.005470729,0.000085150976,0.0000030529643,0.000011277058,0.00004773737,0.9718207,0.00015006859,0.020217687,0.0010159954,0.00022985134],"about_ca_topic_score_codex":0.0013514158,"about_ca_topic_score_gemma":0.0013426838,"teacher_disagreement_score":0.8003429,"about_ca_system_score_codex":0.0002366812,"about_ca_system_score_gemma":0.00084354123,"threshold_uncertainty_score":0.9513422},"labels":[],"label_agreement":null},{"id":"W2395408968","doi":"","title":"Establishing strong connectivity using optimal radius half-disk antennas","year":2011,"lang":"en","type":"article","venue":"NPARC","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Queen's University","funders":"","keywords":"RADIUS; Combinatorics; Minimum spanning tree; Directional antenna; Wireless network; Wireless; Euclidean geometry; Unit disk graph; Mathematics; Graph; Spanning tree; Euclidean distance; Point (geometry); Antenna (radio); Computer science; Topology (electrical circuits); Geometry; Telecommunications; Computer network","score_opus":0.0595259118425745,"score_gpt":0.26138926730345535,"score_spread":0.20186335546088086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395408968","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.3121328,0.000024086927,0.6813029,0.00007205765,0.00037931738,0.0000638812,0.0000011746458,0.000083418236,0.0059403414],"genre_scores_gemma":[0.7267219,0.0000013128468,0.27303642,0.00005782564,0.00010625487,0.0000026104076,0.0000022279878,0.0000045801007,0.000066895605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990077,0.000068796624,0.00015261088,0.00031739558,0.00021735273,0.00023614212],"domain_scores_gemma":[0.99938774,0.00008869538,0.00007428652,0.0002589007,0.00010119787,0.00008919292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034665113,0.000105778716,0.00011364451,0.00012012287,0.00019224716,0.00017787983,0.00037317054,0.00004159503,0.00009909592],"category_scores_gemma":[0.000085401996,0.00010851391,0.00004936128,0.00037618543,0.000028708519,0.001208226,0.00016362772,0.00011389464,0.000012473984],"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.00007020666,0.00053624174,0.0040166,0.00003674489,0.000110314446,0.00015169269,0.007080498,0.04717344,0.15042982,0.59659684,0.0014954713,0.19230214],"study_design_scores_gemma":[0.00026490193,0.00006525699,0.0033856907,0.000013037391,0.000007950119,0.000053688356,0.00004850341,0.97325736,0.013056083,0.009169148,0.0004831214,0.00019524599],"about_ca_topic_score_codex":0.000059866077,"about_ca_topic_score_gemma":0.000007828224,"teacher_disagreement_score":0.9260839,"about_ca_system_score_codex":0.000047208592,"about_ca_system_score_gemma":0.000094930736,"threshold_uncertainty_score":0.44250688},"labels":[],"label_agreement":null},{"id":"W2396005365","doi":"","title":"Staircase Visibility And Krasnosel'skii-Type Results For Planar Compact Sets.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Visibility; Type (biology); Combinatorics; Computer science; Computer graphics (images); Geography","score_opus":0.04092875928217528,"score_gpt":0.2799510891183039,"score_spread":0.23902232983612864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396005365","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.98914176,0.00013349632,0.0061499965,0.0003344924,0.0018823303,0.00041599275,0.00003041148,0.00014738546,0.001764121],"genre_scores_gemma":[0.98919076,0.000008129095,0.010499563,0.0001491521,0.000008614202,0.000005822041,0.000039900413,0.000006625969,0.00009142256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882704,0.000072270595,0.000263722,0.00043471882,0.00018147046,0.0002207773],"domain_scores_gemma":[0.99889296,0.00025098657,0.000096523196,0.0004094692,0.00021148937,0.0001385411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005708524,0.00013553882,0.00015971571,0.00009274655,0.00018424474,0.0000802473,0.00030537913,0.000061285864,0.000004314125],"category_scores_gemma":[0.00018673843,0.00013298086,0.000041535608,0.00034082294,0.0000383244,0.000393926,0.000064299355,0.00008402948,0.000015165099],"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.00023239647,0.00027080983,0.0013029627,0.000030457742,0.000035289133,0.000013851274,0.0017471028,0.000049209764,0.00033269016,0.9782431,0.011192502,0.006549626],"study_design_scores_gemma":[0.0023671736,0.0008303469,0.038592424,0.000015210058,0.000015090854,0.000022978275,0.00004536553,0.019944984,0.0051322337,0.9288699,0.0038405883,0.00032370546],"about_ca_topic_score_codex":0.000044584984,"about_ca_topic_score_gemma":0.00000820632,"teacher_disagreement_score":0.049373202,"about_ca_system_score_codex":0.000036453173,"about_ca_system_score_gemma":0.000088605295,"threshold_uncertainty_score":0.5422802},"labels":[],"label_agreement":null},{"id":"W2396143503","doi":"","title":"On the Spanning Ratio of Constrained Yao-Graphs.","year":2014,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Line segment; Upper and lower bounds; Plane (geometry); Graph; Discrete mathematics; Geometry","score_opus":0.014702873913991606,"score_gpt":0.22654619991321148,"score_spread":0.21184332599921987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396143503","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.074626,0.000004602794,0.9044462,0.0023440605,0.00012561934,0.000054795415,2.2098817e-7,0.00003212975,0.01836639],"genre_scores_gemma":[0.9821319,4.8582274e-7,0.01652064,0.0009529171,0.000023879842,0.000002761912,0.0000012077355,0.000001238636,0.00036499134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995269,0.000050863353,0.00010629841,0.00010594811,0.00014605538,0.000063926615],"domain_scores_gemma":[0.9993372,0.0003613244,0.000044036296,0.0001773502,0.000060645893,0.000019424937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030507336,0.000043430515,0.000051181076,0.000056219327,0.000070206865,0.000036636906,0.00021128877,0.000013716644,0.000046317084],"category_scores_gemma":[0.000094661125,0.000027625158,0.000029689189,0.00025137953,0.000028080332,0.000081954604,0.000030979412,0.000035384997,0.000018311537],"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":[9.0094363e-7,0.000010080481,0.000018557952,0.0000010326185,0.0000039656243,7.660872e-8,0.0000736989,0.004856218,0.0030536754,0.9823498,0.00123805,0.008393922],"study_design_scores_gemma":[0.0002049249,0.00013812278,0.0022582132,0.000009763313,0.0000027886927,0.0000033739946,0.000018058983,0.84828925,0.03500751,0.1121954,0.0017828442,0.000089729954],"about_ca_topic_score_codex":0.0000033229778,"about_ca_topic_score_gemma":0.0000011833522,"teacher_disagreement_score":0.90750587,"about_ca_system_score_codex":0.000002912025,"about_ca_system_score_gemma":0.000023011069,"threshold_uncertainty_score":0.11265212},"labels":[],"label_agreement":null},{"id":"W2396340122","doi":"","title":"A Census of all 5-regular planar graphs with diameter 3.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Planar; Planar graph; Census; Combinatorics; Graph; Demography; Computer science; Sociology; Computer graphics (images); Population","score_opus":0.014944318178495206,"score_gpt":0.23064858164499977,"score_spread":0.21570426346650456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396340122","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.9745639,0.00040039574,0.022479894,0.00023789375,0.0013028329,0.00014130438,0.000004034452,0.000070861264,0.0007988597],"genre_scores_gemma":[0.9806512,0.0000054556317,0.01911379,0.00014350172,0.000010090087,0.000007914766,0.000013068268,0.0000061126957,0.00004888753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991591,0.00005067776,0.00014682711,0.00015805599,0.00026926675,0.00021610386],"domain_scores_gemma":[0.999349,0.0000810759,0.00008318696,0.00029554503,0.00009106452,0.00010011515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002140319,0.00009725153,0.00012374778,0.00008953707,0.000044552336,0.000025367786,0.00027260484,0.000036892216,0.0000047920303],"category_scores_gemma":[0.000015790969,0.00008184516,0.000040889987,0.00042828952,0.000030143581,0.00036097458,0.000048296966,0.00006007159,0.000011743606],"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.000009177403,0.00014315612,0.003794003,0.000009231074,0.000036793142,0.0000025644838,0.00032075643,0.000071693335,0.0009505854,0.9912124,0.0012791405,0.0021704512],"study_design_scores_gemma":[0.0027715454,0.00084666285,0.081324235,0.000060253435,0.00006757418,0.00009550616,0.00005593779,0.0059545925,0.041863374,0.8431746,0.023010977,0.0007747671],"about_ca_topic_score_codex":0.000009255607,"about_ca_topic_score_gemma":9.222315e-7,"teacher_disagreement_score":0.14803788,"about_ca_system_score_codex":0.000015737303,"about_ca_system_score_gemma":0.000025909343,"threshold_uncertainty_score":0.3337549},"labels":[],"label_agreement":null},{"id":"W2396896060","doi":"","title":"Algorithms for Bivariate Majority Depth.","year":2011,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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":"Bivariate analysis; Binary logarithm; Point (geometry); Log-log plot; Algorithm; Set (abstract data type); Mathematics; Combinatorics; Word (group theory); Data structure; Computer science; Statistics; Geometry","score_opus":0.09727936096972775,"score_gpt":0.2848916914814706,"score_spread":0.18761233051174284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396896060","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.0010400662,0.000019327033,0.9847183,0.00016581877,0.0005014958,0.00011903164,0.0000016113923,0.00011366889,0.013320663],"genre_scores_gemma":[0.21322004,0.0000016914248,0.7851583,0.00031592196,0.00010109524,0.0000207921,0.000004827763,0.0000026368948,0.0011747321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994907,0.000013538702,0.000101859565,0.00018689586,0.000088579895,0.00011845494],"domain_scores_gemma":[0.9996337,0.00004019684,0.00002634972,0.00016287203,0.00008918888,0.00004768262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017857041,0.000054545864,0.00005348464,0.000059662572,0.000078346035,0.000040794286,0.0002552893,0.00002539652,0.00003195744],"category_scores_gemma":[0.000018264274,0.00004818789,0.00003884676,0.000198866,0.0000069387424,0.0002760192,0.000060678747,0.00002442978,0.000036581507],"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.000004858694,0.000065749744,0.00010504313,0.000004850447,0.000010970586,0.000001299277,0.00025564324,0.00007619358,0.00027639075,0.82395566,0.0019462754,0.17329709],"study_design_scores_gemma":[0.0006717887,0.00020630233,0.01736341,0.0000033928345,0.000008148529,0.000016131919,0.000013364003,0.6591443,0.030649247,0.2684816,0.02314852,0.00029377916],"about_ca_topic_score_codex":0.000028922263,"about_ca_topic_score_gemma":0.000008994469,"teacher_disagreement_score":0.6590681,"about_ca_system_score_codex":0.000008946245,"about_ca_system_score_gemma":0.000033044267,"threshold_uncertainty_score":0.1965045},"labels":[],"label_agreement":null},{"id":"W2397038961","doi":"","title":"Rotationally Monotone Polygons.","year":2006,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":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); Vertex (graph theory); Polygon covering; Monotonic function; Simple polygon; Boundary (topology); Rectilinear polygon; Plane (geometry); Geometry; Equiangular polygon; Point (geometry); Mathematical analysis; Computer science","score_opus":0.0037594820544594584,"score_gpt":0.19257203181489976,"score_spread":0.18881254976044032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397038961","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.016994555,0.000054138534,0.94940305,0.0016188637,0.00013591061,0.00005346228,4.792835e-7,0.00012443049,0.031615086],"genre_scores_gemma":[0.83048564,8.601772e-7,0.16324602,0.0004610049,0.000122307,0.000008176053,0.000013967063,0.0000019943816,0.005660049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947965,0.000013421728,0.00010881711,0.00014687185,0.00016335408,0.00008789738],"domain_scores_gemma":[0.9997245,0.000038786064,0.000023818064,0.00012193495,0.000067213885,0.00002375777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076181146,0.000047451907,0.00003943009,0.00007777242,0.00006988498,0.00008275415,0.00017437329,0.000016286798,0.00005061321],"category_scores_gemma":[0.0000066121897,0.00004452967,0.000024424473,0.00029471956,0.0000072728208,0.0002888385,0.000038828643,0.000024259018,0.00014978588],"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":[7.122316e-7,0.000031318687,0.00017167088,7.1225827e-7,0.0000019139381,0.0000014709602,0.0000102548875,0.01117909,0.0020439953,0.9690456,0.006122016,0.011391293],"study_design_scores_gemma":[0.00050267286,0.00005485031,0.117393844,0.0000033904364,0.0000031147827,0.00003253091,0.0000046906403,0.5324811,0.02219933,0.27976653,0.047245268,0.0003127395],"about_ca_topic_score_codex":0.00004291151,"about_ca_topic_score_gemma":0.000013520756,"teacher_disagreement_score":0.81349105,"about_ca_system_score_codex":0.000012606067,"about_ca_system_score_gemma":0.000043354066,"threshold_uncertainty_score":0.19252443},"labels":[],"label_agreement":null},{"id":"W2398078061","doi":"","title":"Enumeration of Unicursal Planar Near-Triangulation.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Triangulation; Mathematics; Planar; Point set triangulation; Combinatorics; Geometry; Delaunay triangulation; Computer graphics (images); Computer science","score_opus":0.008333458813947,"score_gpt":0.23410433777493694,"score_spread":0.22577087896098993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398078061","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.9382176,0.000039718092,0.056275595,0.0005876494,0.0036363343,0.00013408049,0.0000023209775,0.00008243999,0.001024285],"genre_scores_gemma":[0.9750289,0.0000013726419,0.024750605,0.000058911104,0.000021341217,0.000004817859,0.00002226815,0.0000043399164,0.00010746313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992194,0.00003953612,0.00020581033,0.0001827006,0.00024397866,0.00010852853],"domain_scores_gemma":[0.9992639,0.00009850685,0.00010535887,0.00030520518,0.00017273457,0.000054317054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025083558,0.000076154196,0.00009670819,0.00007953892,0.00011808387,0.00008336564,0.00030609543,0.000063268555,0.000022610233],"category_scores_gemma":[0.00008461325,0.000079414946,0.00003938283,0.00043538338,0.000031296087,0.00039736117,0.000042652806,0.00011927868,0.000029429246],"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.0000034211043,0.000050743292,0.0006951697,0.000003322021,0.0000072903254,0.0000010474071,0.00018518745,0.00044084404,0.01453657,0.97723037,0.000722381,0.0061236764],"study_design_scores_gemma":[0.0010750911,0.00014796769,0.0362127,0.000008551865,0.000010310308,0.0000158743,0.000007879433,0.14615026,0.036321834,0.77157605,0.008220957,0.00025254756],"about_ca_topic_score_codex":0.00001688655,"about_ca_topic_score_gemma":0.000008384244,"teacher_disagreement_score":0.20565432,"about_ca_system_score_codex":0.000010703564,"about_ca_system_score_gemma":0.000115632174,"threshold_uncertainty_score":0.32384476},"labels":[],"label_agreement":null},{"id":"W2398130560","doi":"","title":"Circular choosability of planar graphs with large girth.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics; Planar graph; Planar; Discrete mathematics; Graph; Computer science","score_opus":0.01550334629249169,"score_gpt":0.2148081304328552,"score_spread":0.1993047841403635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398130560","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.9369946,0.00010024169,0.05951004,0.000058043137,0.0006566002,0.00015667928,0.0000039065512,0.00008044811,0.0024394451],"genre_scores_gemma":[0.9892405,0.0000033270846,0.010648307,0.00006308574,0.0000031741145,0.000008460938,0.000006853418,0.000004804638,0.000021481272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906063,0.00006113232,0.00018185657,0.00026357078,0.00026240398,0.00017039086],"domain_scores_gemma":[0.99920595,0.000043678683,0.00009180161,0.0004310808,0.00015587742,0.00007160038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030613277,0.000097859585,0.00013740221,0.0000967139,0.000076683005,0.000018024351,0.00039381467,0.000041285333,0.00002331435],"category_scores_gemma":[0.000024349389,0.00008700554,0.00004855557,0.0005689313,0.00003789365,0.0002874379,0.000056990422,0.00007631248,0.000013640895],"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.000010977042,0.00023267066,0.015993595,0.000014893526,0.000022600332,0.000005739809,0.00052581466,0.000013467283,0.00021056416,0.9821704,0.00015149689,0.00064778596],"study_design_scores_gemma":[0.00085578504,0.0002876171,0.12361214,0.000013072909,0.0000100244015,0.000011364648,0.000023506556,0.0015367139,0.008454913,0.86440015,0.00061748637,0.00017723415],"about_ca_topic_score_codex":0.00002650856,"about_ca_topic_score_gemma":0.0000045542947,"teacher_disagreement_score":0.117770255,"about_ca_system_score_codex":0.00001619788,"about_ca_system_score_gemma":0.000070136375,"threshold_uncertainty_score":0.35479826},"labels":[],"label_agreement":null},{"id":"W2398302544","doi":"10.1007/978-3-319-29221-2_2","title":"Algorithms for Problems on Maximum Density Segment","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Windsor","funders":"","keywords":"Combinatorics; Subsequence; Simple (philosophy); Longest common subsequence problem; Mathematics; Space (punctuation); Physics; Computer science; Mathematical analysis","score_opus":0.026441973091158925,"score_gpt":0.2559641440294962,"score_spread":0.22952217093833727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398302544","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.000032140902,0.00013183881,0.9929975,0.0017260555,0.0026300885,0.0008272739,0.0000127499,0.0001254752,0.0015168533],"genre_scores_gemma":[0.026890498,0.000039456434,0.9653522,0.0033294137,0.0017483297,0.000072039875,0.000021251224,0.000046745863,0.0025000805],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966009,0.000023637152,0.00042644478,0.0014901792,0.00091619586,0.00054260227],"domain_scores_gemma":[0.9977667,0.00057122606,0.00024068763,0.00087946357,0.00038400228,0.00015797369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086045795,0.0004357819,0.00037504284,0.0007013015,0.0003178479,0.0003641263,0.0016643684,0.0002262398,0.000011162659],"category_scores_gemma":[0.00006580598,0.0003496662,0.00014788401,0.00035907168,0.0002264256,0.0003872431,0.0005825571,0.0003057479,0.000061795676],"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.0000072139287,0.000030680403,0.0000036006236,0.00002713785,0.000009536811,0.000010706389,0.00013299553,0.046214495,0.00020538912,0.053279035,0.00006376928,0.9000154],"study_design_scores_gemma":[0.00044112618,0.00044364526,0.00004567236,0.0003191677,0.0000058810215,0.000033917375,2.7172476e-8,0.3925713,0.004297241,0.5941083,0.0071598208,0.00057393237],"about_ca_topic_score_codex":0.0000024068056,"about_ca_topic_score_gemma":0.000015184556,"teacher_disagreement_score":0.8994415,"about_ca_system_score_codex":0.00036615744,"about_ca_system_score_gemma":0.00045176462,"threshold_uncertainty_score":0.9998955},"labels":[],"label_agreement":null},{"id":"W2398980986","doi":"","title":"Involution fixed sets of the M 24 maximal 2-local geometry chamber graph.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Involution (esoterism); Graph; Combinatorics; Geometry; Discrete mathematics; Pure mathematics","score_opus":0.011398755610013052,"score_gpt":0.2173701253467736,"score_spread":0.20597136973676056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398980986","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.96544784,0.00013215306,0.029187683,0.0008635162,0.0034326448,0.00025118783,0.0000018649449,0.000061269486,0.000621812],"genre_scores_gemma":[0.9974481,0.000004944302,0.0020703133,0.00021613308,0.000011188889,0.000022648728,0.000005983471,0.000006008792,0.00021470913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988125,0.000098609424,0.00024486915,0.0002465433,0.0003954718,0.00020202338],"domain_scores_gemma":[0.99906397,0.00008631089,0.00012592596,0.00043668767,0.00021998677,0.000067145724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021957236,0.00011655345,0.00012843842,0.00013443406,0.00014657059,0.00006179945,0.00044774366,0.00007355585,0.00004068516],"category_scores_gemma":[0.00004530918,0.000092122995,0.00009472679,0.0011083386,0.000078532714,0.0004580518,0.0002675983,0.00013312473,0.00008035595],"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.000004162001,0.00017717054,0.0038645708,0.000016645034,0.000023222865,0.00000137433,0.00023436238,0.0014088422,0.0020132866,0.9670741,0.010616317,0.014565966],"study_design_scores_gemma":[0.0007225554,0.00011494817,0.22741103,0.00002441667,0.000009598114,0.000021444526,0.000029685,0.07310209,0.011724005,0.6854893,0.0011155558,0.00023536875],"about_ca_topic_score_codex":0.000079005855,"about_ca_topic_score_gemma":0.0000037197788,"teacher_disagreement_score":0.28158477,"about_ca_system_score_codex":0.000042753767,"about_ca_system_score_gemma":0.00007431187,"threshold_uncertainty_score":0.37566668},"labels":[],"label_agreement":null},{"id":"W2399318434","doi":"","title":"Staying Close to a Curve","year":2011,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"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":"Combinatorics; Mathematics; Polygonal chain; Graph; Set (abstract data type); Matching (statistics); Product (mathematics); Point (geometry); Algorithm; Computer science; Geometry; Statistics","score_opus":0.050351351129685626,"score_gpt":0.2588006752541489,"score_spread":0.20844932412446326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399318434","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.042943604,0.0000098169885,0.9249693,0.0002348809,0.000196008,0.000056164234,2.0552226e-7,0.000087995555,0.031502005],"genre_scores_gemma":[0.69742924,4.5563567e-7,0.30067024,0.0008673599,0.00003228775,0.0000048116044,5.417438e-7,0.0000014072222,0.0009936411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995781,0.000014633293,0.000072053095,0.00014790212,0.00009790408,0.0000893661],"domain_scores_gemma":[0.9997046,0.00001636997,0.000011973777,0.00015351806,0.000049811802,0.00006373015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011885322,0.0000383888,0.000034697394,0.00007665089,0.000044622666,0.000036812948,0.00021425572,0.000011041526,0.00008847762],"category_scores_gemma":[0.000017223281,0.000034376037,0.000016315062,0.00031031814,0.00000280912,0.00022048021,0.0000981496,0.000021580476,0.00029659783],"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.0000037794048,0.000051497474,0.0004266802,0.000002079459,0.0000055550204,0.0000055199694,0.0023537504,0.00025388692,0.0010577145,0.85851026,0.0037706946,0.13355859],"study_design_scores_gemma":[0.001204911,0.0010704577,0.12683073,0.00003320619,0.0000123319605,0.000078506455,0.00026130097,0.2577509,0.17897677,0.28254685,0.14973845,0.0014955733],"about_ca_topic_score_codex":0.00002079033,"about_ca_topic_score_gemma":0.0000077136165,"teacher_disagreement_score":0.65448564,"about_ca_system_score_codex":0.000008430006,"about_ca_system_score_gemma":0.000022426246,"threshold_uncertainty_score":0.3812264},"labels":[],"label_agreement":null},{"id":"W2399618162","doi":"","title":"Isoperimetric Triangular Enclosure with a Fixed Angle.","year":2011,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Enclosure; Isoperimetric inequality; Mathematics; Computer science; Mathematical analysis; Telecommunications","score_opus":0.03215518082543889,"score_gpt":0.20407451580865557,"score_spread":0.17191933498321668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399618162","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.03667097,0.00014584763,0.9364078,0.00010262788,0.000129859,0.0001096164,4.0166105e-7,0.00013466975,0.026298223],"genre_scores_gemma":[0.7462382,0.0000022754261,0.25133297,0.0002778623,0.000044760338,0.000008150686,0.0000023680584,0.0000036353265,0.0020898185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99932337,0.000032494205,0.00010543377,0.00022242847,0.00018863786,0.00012762714],"domain_scores_gemma":[0.99953246,0.000027964223,0.00003486407,0.00024618866,0.00009418106,0.00006431732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119963275,0.00007864145,0.000079295125,0.00019996494,0.000066771005,0.00005264699,0.0003016408,0.000028192675,0.00019026564],"category_scores_gemma":[0.000020400357,0.000056731893,0.000029575973,0.0012341301,0.000013367695,0.00034863022,0.000056945482,0.000043927008,0.00009046028],"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.00012321646,0.0007498278,0.008747471,0.000024893301,0.00014676369,0.00013757843,0.0037510777,0.00081586966,0.0044873147,0.7028024,0.010957005,0.2672566],"study_design_scores_gemma":[0.009069825,0.006082292,0.28199205,0.00006816481,0.00010434804,0.00064340496,0.00038219377,0.16838808,0.39771107,0.036148313,0.096411064,0.0029991865],"about_ca_topic_score_codex":0.000025193745,"about_ca_topic_score_gemma":0.0000065609256,"teacher_disagreement_score":0.7095672,"about_ca_system_score_codex":0.0000109427365,"about_ca_system_score_gemma":0.000059627397,"threshold_uncertainty_score":0.23134594},"labels":[],"label_agreement":null},{"id":"W2399715766","doi":"","title":"A Note on the Density of M-sets in Geometric Sequence.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics","score_opus":0.0439986820017958,"score_gpt":0.28020174880527793,"score_spread":0.23620306680348213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399715766","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.99004614,0.00003090924,0.007223119,0.000860713,0.0009619964,0.00011769,5.129725e-7,0.000023869252,0.00073504815],"genre_scores_gemma":[0.9981227,0.0000026000378,0.0016100261,0.00022704384,0.0000042056577,0.0000059025547,0.0000019327606,0.000002628373,0.000022989247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907374,0.00010088722,0.00016767938,0.00017725147,0.00035430366,0.00012611195],"domain_scores_gemma":[0.9991225,0.0002785119,0.00007527763,0.000308715,0.00015921377,0.00005575374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007257766,0.0000719403,0.00010365451,0.00024345287,0.00004020637,0.000041562234,0.00042861886,0.000036412905,0.000002639855],"category_scores_gemma":[0.00036503718,0.000055677323,0.00002950051,0.0017312018,0.00002542562,0.00020793983,0.000111325,0.000104705876,0.000029630224],"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.0000115897965,0.0001490575,0.0050311075,0.0000040633377,0.000005414406,0.0000119761735,0.00079762354,0.002698657,0.00043169293,0.9792685,0.0010442857,0.010546011],"study_design_scores_gemma":[0.0011635043,0.00041341395,0.07625018,0.00003106833,0.0000043401105,0.0000142142635,0.00005357976,0.078239985,0.020091018,0.8229874,0.0005209109,0.00023041217],"about_ca_topic_score_codex":0.00005904096,"about_ca_topic_score_gemma":0.000009913811,"teacher_disagreement_score":0.15628114,"about_ca_system_score_codex":0.00007233506,"about_ca_system_score_gemma":0.00013402989,"threshold_uncertainty_score":0.22704554},"labels":[],"label_agreement":null},{"id":"W2399863493","doi":"10.1016/j.cag.2012.03.030","title":"Consensus meshing","year":2012,"lang":"en","type":"article","venue":"Computers & Graphics","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":"Autodesk (Canada)","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.02659270066868311,"score_gpt":0.25539312844667583,"score_spread":0.22880042777799273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399863493","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.055600528,0.00070308335,0.9389708,0.0010972292,0.0024553547,0.0000919325,0.0000010099301,0.0002449849,0.0008350758],"genre_scores_gemma":[0.8722144,0.00001398904,0.12585229,0.0014943221,0.00036180232,0.000004155313,0.0000073432147,0.000006851033,0.000044857035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988645,0.000082680424,0.00019985862,0.0002316911,0.00027765232,0.0003436361],"domain_scores_gemma":[0.99906635,0.0002359663,0.00007656629,0.00034163657,0.000097462806,0.00018199383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043719247,0.00013172027,0.00012161928,0.00022564625,0.00020090828,0.00014182329,0.0004694153,0.000057675035,0.000004548198],"category_scores_gemma":[0.000031436815,0.0001341088,0.000085293264,0.0007737893,0.000042507338,0.00040407898,0.00020296828,0.0001410538,0.00005008883],"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.0000029037142,0.00010165796,0.0030481333,0.000011975567,0.000034809636,0.0000068372556,0.00083909027,0.0017703234,0.00030733625,0.92998123,0.013800425,0.05009526],"study_design_scores_gemma":[0.0010313763,0.00014846002,0.05504782,0.000054723136,0.00003031202,0.00033430115,0.000038513055,0.716975,0.0026859096,0.034921523,0.18767156,0.0010605142],"about_ca_topic_score_codex":0.0000052359574,"about_ca_topic_score_gemma":0.0000010604824,"teacher_disagreement_score":0.8950597,"about_ca_system_score_codex":0.000021604295,"about_ca_system_score_gemma":0.00004176121,"threshold_uncertainty_score":0.5468798},"labels":[],"label_agreement":null},{"id":"W2400285273","doi":"","title":"Point Location in Well-Shaped Meshes Using Jump-and-Walk","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Jump; Polygon mesh; Constant (computer programming); Point (geometry); Computer science; Nearest neighbour; Random walk; Algorithm; Statistical physics; Mathematics; Geometry; Physics; Artificial intelligence; Computer graphics (images); Statistics","score_opus":0.0670509323113462,"score_gpt":0.2543895345018169,"score_spread":0.1873386021904707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400285273","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.2902104,0.00018741761,0.69858485,0.0012292578,0.0005576595,0.00036635954,0.000013997022,0.00008702876,0.008763021],"genre_scores_gemma":[0.95506394,0.000008551696,0.043653704,0.0010285657,0.000058174635,0.000012747606,0.000046508332,0.000011241552,0.000116571115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825746,0.000097062424,0.00036783196,0.00055577664,0.00034000864,0.00038189138],"domain_scores_gemma":[0.9987621,0.00014078066,0.000110588415,0.00024215812,0.00036478188,0.0003796263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036853246,0.00021546519,0.0002024028,0.0014507963,0.00019600725,0.00017096158,0.0004095136,0.00010739489,0.00021181461],"category_scores_gemma":[0.00008829308,0.0002444494,0.000040067865,0.0015640937,0.00006862556,0.0005528053,0.000072022594,0.00019968596,0.00011929703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.000020845688,0.00011263178,0.0035064255,0.00003428975,0.0000333201,0.00007002508,0.0011004183,0.06270716,0.00011522165,0.8953838,0.00028547793,0.03663038],"study_design_scores_gemma":[0.00042665555,0.00011671193,0.07238744,0.000064041764,0.000005787767,0.000050217022,0.00009174801,0.8667737,0.00009443138,0.059265062,0.0003727841,0.0003513766],"about_ca_topic_score_codex":0.008669162,"about_ca_topic_score_gemma":0.0071904124,"teacher_disagreement_score":0.83611876,"about_ca_system_score_codex":0.0002583535,"about_ca_system_score_gemma":0.0011109608,"threshold_uncertainty_score":0.9979322},"labels":[],"label_agreement":null},{"id":"W2400464969","doi":"","title":"On the Crossing Number of the Cartesian Product of a 6-Vertex Graph with S n .","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Crossing number (knot theory); Vertex (graph theory); Combinatorics; Graph; Product (mathematics); Discrete mathematics; Geometry; Geography","score_opus":0.008078821611680484,"score_gpt":0.21956705919452438,"score_spread":0.2114882375828439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400464969","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.99528366,0.000020150406,0.0013862564,0.001201456,0.0005462215,0.00023328306,4.9366565e-7,0.000014145462,0.0013143069],"genre_scores_gemma":[0.9988954,3.6535076e-7,0.00081546296,0.00016057891,0.0000040851096,0.0000136631925,3.8786052e-7,0.00000376885,0.00010626928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923956,0.00007584816,0.00014052569,0.0001547777,0.0002881641,0.00010113603],"domain_scores_gemma":[0.99905616,0.0001486095,0.00012141187,0.0004559791,0.00019654894,0.000021283548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017054522,0.00007284757,0.0000880565,0.000027799777,0.00017174473,0.000080366415,0.00044541925,0.000016465654,0.000017128847],"category_scores_gemma":[0.00005339679,0.000037771624,0.000042960703,0.0006287381,0.00011192222,0.00017076233,0.00007256821,0.00007481906,0.000011326337],"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.0000029921566,0.00007147537,0.0030928599,0.0000072822977,0.000014872301,2.027736e-7,0.00050305435,0.00032443873,0.0010708133,0.9916654,0.0013431166,0.0019034705],"study_design_scores_gemma":[0.00037807657,0.00010560469,0.07532387,0.00006163041,0.00000825498,0.000010749509,0.000029820749,0.005414359,0.03420613,0.8841714,0.00017787486,0.00011222696],"about_ca_topic_score_codex":0.000060399558,"about_ca_topic_score_gemma":0.0000029364626,"teacher_disagreement_score":0.10749403,"about_ca_system_score_codex":0.0000102137765,"about_ca_system_score_gemma":0.0000923232,"threshold_uncertainty_score":0.1540282},"labels":[],"label_agreement":null},{"id":"W2400709422","doi":"","title":"On the Inverse Beacon Attraction Region of a Point.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Attraction; Polygon (computer graphics); Monotone polygon; Simple polygon; Inverse; Trajectory; Boundary (topology); Obstacle; Mathematics; Regular polygon; Simple (philosophy); Point (geometry); Set (abstract data type); Combinatorics; Computer science; Topology (electrical circuits); Mathematical analysis; Physics; Geometry; Geography; Telecommunications","score_opus":0.0822544231741283,"score_gpt":0.26077276814147504,"score_spread":0.17851834496734675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400709422","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.28585413,0.000046418718,0.6579062,0.025398625,0.0015310305,0.0005718446,0.000033908364,0.00011310766,0.028544743],"genre_scores_gemma":[0.99248457,0.000002342252,0.0036256413,0.0033221007,0.000092620416,0.000015323725,0.00005511295,0.000008391578,0.00039392716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835885,0.00014351614,0.00029982737,0.00036730894,0.0005757867,0.00025471183],"domain_scores_gemma":[0.9978727,0.0005170832,0.00018090465,0.00035470398,0.0006781228,0.0003964661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049892534,0.00017128082,0.00016067055,0.00075437414,0.00018009877,0.00009885368,0.00053182367,0.00008673,0.000064902386],"category_scores_gemma":[0.0003959999,0.0001469286,0.000074239244,0.001146816,0.000079902806,0.00032718116,0.000042182335,0.00022546355,0.00020051587],"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.00002012304,0.000050987255,0.000101225225,0.0000053344547,0.000021113417,0.00001926782,0.00024809106,0.14715838,0.00001685784,0.817206,0.025975462,0.009177138],"study_design_scores_gemma":[0.0008447626,0.00065058586,0.007836151,0.000094577954,0.00001183163,0.00009289053,0.00023796537,0.65907377,0.00038853058,0.32361627,0.0067150765,0.00043758837],"about_ca_topic_score_codex":0.0015320956,"about_ca_topic_score_gemma":0.0024966858,"teacher_disagreement_score":0.7066304,"about_ca_system_score_codex":0.00026085525,"about_ca_system_score_gemma":0.001577522,"threshold_uncertainty_score":0.5991575},"labels":[],"label_agreement":null},{"id":"W2400716377","doi":"","title":"The Cover Contact Graph of Discs Touching a Line.","year":2012,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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; University of Manitoba","funders":"","keywords":"Disjoint sets; Cover (algebra); Combinatorics; Graph; Time complexity; Pairwise comparison; Line segment; Plane (geometry); Computer science; Mathematics; Set (abstract data type); Geometry; Artificial intelligence","score_opus":0.017349729984345575,"score_gpt":0.25627561659927456,"score_spread":0.23892588661492897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400716377","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.061402712,0.00025107784,0.9319898,0.0004934926,0.00042021583,0.000051152212,4.3228994e-7,0.000023521035,0.005367593],"genre_scores_gemma":[0.99054444,0.000011087689,0.008465074,0.00017714761,0.00009495438,0.0000023851094,0.0000011202914,0.0000013250962,0.000702472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955595,0.00002846203,0.00010790008,0.00006267363,0.00013718766,0.00010785526],"domain_scores_gemma":[0.99954456,0.0001879381,0.000041829866,0.00014851129,0.00004199292,0.000035168778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026108406,0.000039016046,0.000044206547,0.000029628765,0.0001012663,0.00004615215,0.00019709671,0.000012479111,0.000011391975],"category_scores_gemma":[0.00003202385,0.00002321284,0.000035527562,0.00020142275,0.0000094023935,0.00034887608,0.00006575454,0.0000330015,0.00001795669],"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.0000038681537,0.000047074915,0.0013651232,0.0000031948805,0.000014089977,1.528575e-7,0.0004031832,0.0013562995,0.0027334655,0.95294696,0.0019188413,0.03920775],"study_design_scores_gemma":[0.0013987613,0.00044041366,0.14729767,0.00004175127,0.000031686024,0.000048781432,0.00021996064,0.46985823,0.11969207,0.064321354,0.19591458,0.0007347454],"about_ca_topic_score_codex":0.000010098961,"about_ca_topic_score_gemma":0.0000032650457,"teacher_disagreement_score":0.9291417,"about_ca_system_score_codex":0.000005576531,"about_ca_system_score_gemma":0.000018771805,"threshold_uncertainty_score":0.09465922},"labels":[],"label_agreement":null},{"id":"W2401552927","doi":"10.1016/j.tcs.2019.03.015","title":"Weighted minimum backward Fréchet distance","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"Backtracking; Mathematics; Tree traversal; Combinatorics; Euclidean space; Simple (philosophy); Euclidean distance; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Geometry; Computer science; Artificial intelligence","score_opus":0.006085964691183508,"score_gpt":0.23055598571832414,"score_spread":0.22447002102714064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401552927","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.11456374,0.00003742515,0.87598675,0.001071276,0.0013864059,0.00018377411,0.0000015021188,0.0001848687,0.006584284],"genre_scores_gemma":[0.81710553,0.0000025611957,0.18187404,0.00074437616,0.00014571701,0.0000043530154,0.0000025893335,0.000005605861,0.00011521122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973901,0.00008581608,0.00027951176,0.00085442176,0.0008735425,0.0005166103],"domain_scores_gemma":[0.9983239,0.00024496805,0.00007234968,0.0008461319,0.00025912898,0.00025347545],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009647092,0.0001851263,0.00019763976,0.00021234079,0.00026918543,0.0004742809,0.0020912406,0.000050320967,0.0001678648],"category_scores_gemma":[0.000035747576,0.00015803053,0.000072167444,0.001836226,0.00076031813,0.0009535858,0.0007517485,0.00016550545,0.0009007711],"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.000006423907,0.00004306288,0.00011225754,0.0000058728215,0.000002873683,0.000004250845,0.0001463871,0.00056038797,0.0012475939,0.97193384,0.00015321857,0.02578382],"study_design_scores_gemma":[0.0002541636,0.00016019601,0.0014544439,0.000017598746,0.0000020814991,0.000023525654,0.0000024016956,0.8379269,0.005460034,0.15203707,0.0024128659,0.00024866057],"about_ca_topic_score_codex":8.721105e-7,"about_ca_topic_score_gemma":2.3949184e-7,"teacher_disagreement_score":0.8373666,"about_ca_system_score_codex":0.00006603234,"about_ca_system_score_gemma":0.00017400034,"threshold_uncertainty_score":0.99987715},"labels":[],"label_agreement":null},{"id":"W2401646285","doi":"","title":"On the Oriented Line Graph.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Line graph; Line (geometry); Graph; Combinatorics; Geometry","score_opus":0.010490928917822172,"score_gpt":0.22721731498090034,"score_spread":0.21672638606307817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401646285","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.6550208,0.000053455242,0.32331726,0.009410276,0.004192896,0.00019107158,7.052146e-7,0.00021137706,0.0076021804],"genre_scores_gemma":[0.9973375,0.00000194317,0.0009868083,0.0013540833,0.000017292943,0.000010671121,0.00000337844,0.0000038287762,0.00028444463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925685,0.000094338124,0.00011006971,0.00018982597,0.00022791517,0.000120984325],"domain_scores_gemma":[0.9990596,0.00039334077,0.00004502115,0.00036958346,0.00008750709,0.000044937235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003518302,0.00007632489,0.00006472941,0.00006382569,0.00018645414,0.00006445918,0.00038973102,0.000025313828,0.00001676627],"category_scores_gemma":[0.0001832266,0.00005334315,0.000039210026,0.00050622696,0.000020009571,0.00010871512,0.000076376586,0.00009141006,0.00013410414],"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.0000021483959,0.00004282872,0.00003393189,8.293448e-7,0.0000047808335,4.584816e-7,0.000059205235,0.00054517586,0.000092364346,0.98929274,0.0055117086,0.0044138287],"study_design_scores_gemma":[0.00027425025,0.00016942181,0.0008570384,0.000005658444,0.0000020764273,0.0000020075527,0.0000024975466,0.056842033,0.0022003467,0.9215893,0.017968055,0.00008731699],"about_ca_topic_score_codex":0.00001636698,"about_ca_topic_score_gemma":0.0000047221633,"teacher_disagreement_score":0.34231678,"about_ca_system_score_codex":0.000016315049,"about_ca_system_score_gemma":0.000032981046,"threshold_uncertainty_score":0.21752705},"labels":[],"label_agreement":null},{"id":"W2402215766","doi":"","title":"Constrained Empty-Rectangle Delaunay Graphs.","year":2015,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Rectangle; Delaunay triangulation; Combinatorics; Mathematics; Regular polygon; Boundary (topology); Convex set; Discrete mathematics; Geometry; Convex optimization; Mathematical analysis","score_opus":0.03199316285417675,"score_gpt":0.25435446988830696,"score_spread":0.2223613070341302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402215766","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.023906218,0.00010361166,0.9334466,0.0010007392,0.00050356047,0.000073350515,7.4896707e-7,0.00020817775,0.040757015],"genre_scores_gemma":[0.88743067,0.0000015172636,0.11035877,0.0006956072,0.000052479158,0.000005494687,0.000006739038,0.0000025715563,0.0014461275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993312,0.00003311022,0.00011943918,0.00018486328,0.0002070209,0.00012437026],"domain_scores_gemma":[0.99947673,0.000045680543,0.00002782654,0.00017663244,0.00014121374,0.00013190162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023701887,0.000065727756,0.0000674328,0.000099547586,0.000050573693,0.00008803337,0.0002471944,0.00002724436,0.00003200909],"category_scores_gemma":[0.00005146678,0.000057792462,0.000032810996,0.00046899862,0.000020744568,0.00030583498,0.000065889726,0.000040364703,0.00014299824],"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.000004303183,0.000056401706,0.00027109517,0.0000016069722,0.000012877623,0.0000098693745,0.00035175603,0.0016466537,0.00093025813,0.90977395,0.025482055,0.061459195],"study_design_scores_gemma":[0.0021756855,0.00046909862,0.0019750274,0.000011414917,0.000011811468,0.00022590555,0.00016861764,0.49194583,0.02599509,0.36810464,0.10817483,0.00074203813],"about_ca_topic_score_codex":0.000011645657,"about_ca_topic_score_gemma":0.000009688074,"teacher_disagreement_score":0.8635245,"about_ca_system_score_codex":0.000017430628,"about_ca_system_score_gemma":0.00012414683,"threshold_uncertainty_score":0.23567082},"labels":[],"label_agreement":null},{"id":"W2402614570","doi":"","title":"Open Problems from CCCG 2014.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on 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":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Vertex (graph theory); Upper and lower bounds; Conjecture; Discrete geometry; Mathematics; Partition (number theory); Computer science; Discrete mathematics; Graph","score_opus":0.0928333167172997,"score_gpt":0.28590306801585375,"score_spread":0.19306975129855403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402614570","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.024503142,0.00029726216,0.8936345,0.013706149,0.0019968536,0.0008068418,0.00023160467,0.00019963409,0.06462402],"genre_scores_gemma":[0.9388223,0.0000052243317,0.05520684,0.0040401095,0.00022517542,0.00004487338,0.0005217999,0.000015729343,0.0011179181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977297,0.00012287193,0.0003478447,0.000734536,0.00063807087,0.0004269704],"domain_scores_gemma":[0.9973299,0.00021828475,0.00013315225,0.0004760727,0.00075193145,0.0010906897],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049515447,0.00024243313,0.00024584561,0.00070002925,0.0002466797,0.0011763658,0.0020510424,0.0001130651,0.00034960482],"category_scores_gemma":[0.00015310163,0.00025960093,0.00005516252,0.0010526734,0.000052901083,0.00091795943,0.0003242716,0.00022192823,0.0016990709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.000013278138,0.00009472049,0.0007466427,0.000005233506,0.000053078824,0.000040214552,0.00042674755,0.22169961,0.000023380491,0.6367389,0.09118531,0.048972867],"study_design_scores_gemma":[0.0012857916,0.00024588974,0.0094121,0.00005162103,0.000008316155,0.000022850163,0.000075097356,0.52186763,0.0000730062,0.3852757,0.081047274,0.0006347412],"about_ca_topic_score_codex":0.021460867,"about_ca_topic_score_gemma":0.011696311,"teacher_disagreement_score":0.9143192,"about_ca_system_score_codex":0.00035188688,"about_ca_system_score_gemma":0.0038744754,"threshold_uncertainty_score":0.99998564},"labels":[],"label_agreement":null},{"id":"W2402925056","doi":"","title":"Finite 2-Geodesic Transitive Graphs Of Valency 3p.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Valency; Mathematics; Transitive relation; Geodesic; Combinatorics; Pure mathematics; Geometry; Linguistics","score_opus":0.02335203755501963,"score_gpt":0.24542960700807456,"score_spread":0.22207756945305493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402925056","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.68463075,0.00059131446,0.30326632,0.00063817116,0.0038757543,0.0002671306,0.0000075101334,0.00016305408,0.0065599796],"genre_scores_gemma":[0.99458146,0.00000977344,0.0051635117,0.00009568257,0.000006698239,0.000007235331,0.000008143618,0.0000048864126,0.00012258612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990103,0.00008685851,0.00020800301,0.00022130703,0.00032669323,0.00014679317],"domain_scores_gemma":[0.99911445,0.00013923923,0.000082167724,0.00025812158,0.0002972584,0.00010878752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034166203,0.00009719728,0.00013812144,0.00014667315,0.000049116625,0.00003123446,0.00035087348,0.000044109158,0.0000056072163],"category_scores_gemma":[0.000077730365,0.000099616846,0.00006408478,0.0007311886,0.000034177145,0.00036415507,0.00005542853,0.00007421422,0.000029298943],"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.000008206608,0.00010552185,0.00032940364,0.00000847158,0.000015943702,0.0000050909825,0.0010280812,0.0018299405,0.0003651637,0.9901116,0.0009318901,0.005260688],"study_design_scores_gemma":[0.0008543759,0.0002424722,0.0026923192,0.00001550397,0.000008954499,0.000005270688,0.000032325384,0.032543316,0.006861364,0.95589197,0.0006991949,0.00015294086],"about_ca_topic_score_codex":0.0000138110245,"about_ca_topic_score_gemma":0.0000013167747,"teacher_disagreement_score":0.3099507,"about_ca_system_score_codex":0.000023331679,"about_ca_system_score_gemma":0.00014108184,"threshold_uncertainty_score":0.40622568},"labels":[],"label_agreement":null},{"id":"W2403170014","doi":"","title":"Weighted Straight Skeletons In The Plane.","year":2013,"lang":"en","type":"article","venue":"","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":"Polygon (computer graphics); Skeleton (computer programming); Regular polygon; Combinatorics; Mathematics; Convex polygon; Point (geometry); Ambiguity; Medial axis; Computer science; Planar; Topology (electrical circuits); Geometry; Computer graphics (images)","score_opus":0.010273488460953217,"score_gpt":0.21753595388604113,"score_spread":0.20726246542508792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403170014","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.12698218,0.000052640033,0.7773774,0.013118931,0.00024084892,0.0002994907,6.588984e-7,0.00008894228,0.08183885],"genre_scores_gemma":[0.97197276,0.0000022183285,0.0252011,0.0014238941,0.000054185024,0.000022420305,0.000006676802,0.0000011960068,0.0013155411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995105,0.000043465563,0.000091377646,0.0001158222,0.00013860274,0.00010020353],"domain_scores_gemma":[0.9996696,0.00010063469,0.000014410915,0.00016772716,0.000026501986,0.000021097636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118570555,0.000043687487,0.000035893605,0.00006587068,0.000050163188,0.00013010149,0.00037204442,0.000017677798,0.00031935095],"category_scores_gemma":[0.0000060870525,0.000026381622,0.000015034072,0.00037611427,0.000007756501,0.00028672465,0.00003134726,0.000054132208,0.00032272894],"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":[4.7343352e-7,0.00008354517,0.00028173366,0.0000023642458,0.000004249786,0.0000054282973,0.00068363704,0.0005629958,0.0008475351,0.8670937,0.04005692,0.09037746],"study_design_scores_gemma":[0.0006289459,0.00012794015,0.21992804,0.0000087727185,0.0000028535167,0.000068166344,0.00014375971,0.55716693,0.0028493463,0.12688139,0.091828145,0.00036570855],"about_ca_topic_score_codex":0.000052165644,"about_ca_topic_score_gemma":0.000036906236,"teacher_disagreement_score":0.8449906,"about_ca_system_score_codex":0.0000064867704,"about_ca_system_score_gemma":0.000022804761,"threshold_uncertainty_score":0.41481352},"labels":[],"label_agreement":null},{"id":"W2404027393","doi":"10.48550/arxiv.1205.2425","title":"Flip Distance Between Two Triangulations of a Point-Set is NP-complete","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","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":"Combinatorics; Polygon (computer graphics); Regular polygon; Convex polygon; Set (abstract data type); Mathematics; Point (geometry); Plane (geometry); Computational geometry; Discrete mathematics; Computer science; Algorithm; Geometry","score_opus":0.11761111349358691,"score_gpt":0.21838336373211625,"score_spread":0.10077225023852934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404027393","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.26613247,0.000033152588,0.73216957,0.000140274,0.00013024514,0.00007920809,0.000026964688,0.000041922875,0.0012462065],"genre_scores_gemma":[0.994511,0.000004146933,0.0042869896,0.00010608843,0.00012517333,2.9917686e-7,0.00002124248,0.0000044298163,0.0009406413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992139,0.00007354662,0.00015668699,0.00025878235,0.000086081825,0.00021101152],"domain_scores_gemma":[0.9991329,0.00015343438,0.0001262175,0.00036055627,0.00010672664,0.000120178964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022122612,0.00009945359,0.00014278622,0.0001661383,0.00012659302,0.00002373472,0.00040105433,0.00003463066,0.00006729525],"category_scores_gemma":[0.000023716131,0.0001137423,0.00008968631,0.0010066037,0.00004475037,0.0008091862,0.00012372744,0.00006766713,0.00006957724],"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.00002031539,0.00010487012,0.05414538,0.0000152052935,0.00007086678,0.0000061464343,0.0011038492,0.030216971,0.0004704879,0.90777767,0.0011436407,0.004924591],"study_design_scores_gemma":[0.0039390204,0.00021297675,0.20482965,0.000050406205,0.00016960206,0.000012779489,0.00017399795,0.65467626,0.0041352175,0.075737774,0.055001747,0.0010605941],"about_ca_topic_score_codex":0.00002717758,"about_ca_topic_score_gemma":0.0000065005574,"teacher_disagreement_score":0.8320399,"about_ca_system_score_codex":0.0000466235,"about_ca_system_score_gemma":0.000039306637,"threshold_uncertainty_score":0.46382764},"labels":[],"label_agreement":null},{"id":"W2404157195","doi":"","title":"Abstract Ovals Of Order 9.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Business","score_opus":0.012627319077684721,"score_gpt":0.25523535897619487,"score_spread":0.24260803989851015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404157195","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.95418644,0.00022416015,0.031825665,0.0012255968,0.001559181,0.0001273245,9.802551e-7,0.00011078247,0.0107398555],"genre_scores_gemma":[0.99060714,0.0000057141538,0.009072169,0.00020244805,0.000007591728,0.0000012316307,0.0000030200117,0.000001925052,0.00009878696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993433,0.000016558122,0.00017270767,0.00015287905,0.00020703042,0.00010753756],"domain_scores_gemma":[0.999432,0.000054970067,0.00007431578,0.0002340532,0.00016293583,0.000041673433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001785037,0.000064644446,0.000095753385,0.00007921515,0.000043866825,0.00003362581,0.00029827317,0.000032503187,0.000019568895],"category_scores_gemma":[0.000047484875,0.00006415461,0.000034210363,0.00050220796,0.000010140135,0.00025836893,0.000031178522,0.000052178133,0.00002990854],"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.00000219758,0.00009712122,0.00007215087,0.0000030481335,0.0000048051584,0.0000023882637,0.00007854713,0.0005017253,0.004015578,0.96512437,0.0013145959,0.02878349],"study_design_scores_gemma":[0.00042733588,0.000134028,0.066258475,0.000011203129,0.0000026889636,0.0000044240664,0.000003522691,0.004701221,0.018169953,0.90835726,0.0018049004,0.00012499311],"about_ca_topic_score_codex":0.000003480212,"about_ca_topic_score_gemma":2.4021708e-7,"teacher_disagreement_score":0.066186324,"about_ca_system_score_codex":0.000011943256,"about_ca_system_score_gemma":0.000056911864,"threshold_uncertainty_score":0.2616149},"labels":[],"label_agreement":null},{"id":"W2404357874","doi":"","title":"A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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 British Columbia; Carleton University","funders":"","keywords":"Approximation algorithm; Set cover problem; Cover (algebra); Plane (geometry); Simple (philosophy); Set (abstract data type); Unit (ring theory); Unit disk; Unit disk graph; Algorithm; Computer science; Computational geometry; Running time; Mathematics; Combinatorics; Mathematical optimization; Geometry","score_opus":0.0630496311394427,"score_gpt":0.27244246840386455,"score_spread":0.20939283726442184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404357874","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.0007137588,0.00006347144,0.98638916,0.006389597,0.00056730723,0.0006434972,0.00008821809,0.000065450404,0.0050795227],"genre_scores_gemma":[0.67809886,0.0000042601855,0.3138973,0.0045630154,0.00035995903,0.00022984172,0.00039450545,0.000024053197,0.0024282213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826664,0.00007578091,0.00029287665,0.00044480708,0.00054422556,0.00037570155],"domain_scores_gemma":[0.99785405,0.00045754865,0.00012303234,0.0003090583,0.00079635176,0.0004599362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055272866,0.00020723509,0.00015842378,0.00042854922,0.00035984832,0.00047121904,0.00067448127,0.000087625056,0.00010017817],"category_scores_gemma":[0.000114657465,0.00017471817,0.00007602723,0.001073011,0.000063923464,0.00046730417,0.000077111086,0.00016296428,0.0003498598],"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.000008881554,0.00004224957,0.000084690284,0.000008012109,0.000042768374,0.0000041120365,0.00030016687,0.30386975,0.0000034469533,0.30366984,0.020835895,0.37113017],"study_design_scores_gemma":[0.0005540722,0.0001306639,0.0012711888,0.000012899656,0.000009142154,0.000016288786,0.00004045095,0.8858624,0.00002195077,0.074736044,0.03712663,0.00021825168],"about_ca_topic_score_codex":0.0009097823,"about_ca_topic_score_gemma":0.00092060416,"teacher_disagreement_score":0.6773851,"about_ca_system_score_codex":0.00021632382,"about_ca_system_score_gemma":0.0016222985,"threshold_uncertainty_score":0.71248},"labels":[],"label_agreement":null},{"id":"W2404508046","doi":"","title":"xy-Monotone Path Existence Queries in a Rectilinear Environment.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Tree traversal; Monotone polygon; Disjoint sets; Path (computing); Tree (set theory); Combinatorics; Computer science; Time complexity; Range tree; Binary logarithm; Data structure; Preprocessor; Computational geometry; Binary tree; Mathematics; Discrete mathematics; Interval tree; Algorithm; Tree structure; Artificial intelligence","score_opus":0.03309736335871667,"score_gpt":0.24524503912596776,"score_spread":0.21214767576725108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404508046","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.33810678,0.0006902926,0.6362005,0.004572496,0.0015361448,0.00067636947,0.00008293177,0.0001724688,0.01796205],"genre_scores_gemma":[0.96255535,0.000024528812,0.03541685,0.0012984346,0.00016640392,0.000041998628,0.000091611946,0.000012272363,0.00039255657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979327,0.000121381425,0.0003624403,0.00047699094,0.0004796553,0.0006268775],"domain_scores_gemma":[0.99862564,0.00023865445,0.0001036604,0.00033004343,0.00012079783,0.0005811926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048317597,0.00023646287,0.00021764121,0.0009587655,0.00020606481,0.00017240927,0.0005035554,0.00011023475,0.0002635272],"category_scores_gemma":[0.00011537695,0.00026526072,0.00006100718,0.0010730366,0.00007680284,0.0007497531,0.000080008525,0.00026361932,0.00047949498],"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.00001845621,0.00022376253,0.010731056,0.000020841006,0.000026637597,0.000040516352,0.0009474214,0.071546495,0.000097261945,0.8614641,0.0012279447,0.05365552],"study_design_scores_gemma":[0.0013240728,0.0003581201,0.32328084,0.00013303802,0.000011905736,0.00012594296,0.00029472198,0.56544137,0.0005104554,0.059784085,0.04728391,0.0014515329],"about_ca_topic_score_codex":0.0020890867,"about_ca_topic_score_gemma":0.0013972522,"teacher_disagreement_score":0.80168,"about_ca_system_score_codex":0.00039579847,"about_ca_system_score_gemma":0.00075396127,"threshold_uncertainty_score":0.99998},"labels":[],"label_agreement":null},{"id":"W2404596072","doi":"","title":"Shortest Descending Paths through Given Faces.","year":2006,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Shortest path problem; K shortest path routing; Yen's algorithm; Path (computing); Face (sociological concept); Combinatorics; Constrained Shortest Path First; Mathematics; Sequence (biology); Euclidean shortest path; Terrain; Regular polygon; Shortest Path Faster Algorithm; Point (geometry); Algorithm; Computer science; Dijkstra's algorithm; Geometry; Geography","score_opus":0.017773715715701837,"score_gpt":0.24171768332664895,"score_spread":0.22394396761094712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404596072","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.014165856,0.00009429208,0.9536117,0.0007298724,0.00026151992,0.00006477975,7.6491546e-7,0.00016316595,0.030908063],"genre_scores_gemma":[0.86899126,0.0000032244884,0.12889597,0.00023583298,0.00013919485,0.000004324327,0.000010441098,0.0000028827442,0.0017169069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931854,0.000018384777,0.00013004114,0.00021500503,0.0001747363,0.00014329262],"domain_scores_gemma":[0.9996951,0.0000453288,0.000030234383,0.00015716412,0.00004832976,0.000023843393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090878835,0.00007129861,0.000065061,0.0000475596,0.00011383049,0.00013831236,0.0002483272,0.000025558835,0.00004436877],"category_scores_gemma":[0.000008093378,0.000064735774,0.00003245948,0.0003435978,0.000011134401,0.00054848846,0.00007905113,0.00004154875,0.00009200419],"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.0000013583544,0.00011025449,0.002354092,0.00000529259,0.000008281229,0.000016030779,0.00022440251,0.032181747,0.0056970674,0.8905785,0.024893334,0.04392966],"study_design_scores_gemma":[0.0006585382,0.00013227854,0.04376583,0.000022733897,0.000010299122,0.0000739024,0.00005247769,0.57143027,0.060373824,0.15145639,0.17128746,0.00073600136],"about_ca_topic_score_codex":0.0000700283,"about_ca_topic_score_gemma":0.000022154396,"teacher_disagreement_score":0.8548254,"about_ca_system_score_codex":0.00002425659,"about_ca_system_score_gemma":0.000029827528,"threshold_uncertainty_score":0.26398483},"labels":[],"label_agreement":null},{"id":"W2404674776","doi":"","title":"(3, 2)*-choosability of triangle-free toroidal graphs.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Toroid; Combinatorics; Physics","score_opus":0.011540723738946965,"score_gpt":0.23906462689504385,"score_spread":0.22752390315609688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404674776","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.97616917,0.00036685105,0.015006013,0.0016710949,0.0023560245,0.00023505643,0.0000051257075,0.00016046103,0.0040302207],"genre_scores_gemma":[0.9921441,0.0000069234966,0.0075838077,0.00016526654,0.0000117706795,0.0000036398048,0.0000061026453,0.0000028803463,0.0000754809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998839,0.00008285505,0.00029897003,0.0002790227,0.00033169042,0.00016843314],"domain_scores_gemma":[0.99881375,0.00012573089,0.00011155535,0.0006913385,0.00017485717,0.00008275448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294516,0.00010773284,0.00018902644,0.00011585701,0.000075513904,0.000045236837,0.0007712795,0.000055985503,0.0000146021075],"category_scores_gemma":[0.00021821448,0.00010855414,0.00010639906,0.0006825852,0.000028314309,0.00037924384,0.00010362922,0.0000856357,0.000014045047],"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.000011182488,0.00020352386,0.00042619024,0.0000048173747,0.0000077075965,0.0000019356203,0.00012044626,0.000095209776,0.0013686613,0.9750856,0.0028333224,0.019841405],"study_design_scores_gemma":[0.0009573029,0.00027074275,0.028032776,0.0000060828984,0.000004605556,0.000004126879,0.0000042245138,0.0020589274,0.0073846127,0.9601762,0.0009783176,0.00012206077],"about_ca_topic_score_codex":0.000010561498,"about_ca_topic_score_gemma":0.0000016930808,"teacher_disagreement_score":0.027606586,"about_ca_system_score_codex":0.000034175046,"about_ca_system_score_gemma":0.000081816186,"threshold_uncertainty_score":0.4426709},"labels":[],"label_agreement":null},{"id":"W2405869798","doi":"","title":"Pebbling number of Bi-wheel: A diameter three class 0 graph.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Graph; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0289685387406294,"score_gpt":0.2502724503530625,"score_spread":0.2213039116124331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405869798","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.8475816,0.000083881234,0.14187782,0.00009141987,0.0023747839,0.00013648372,0.0000016352549,0.00011070988,0.0077416534],"genre_scores_gemma":[0.9690305,0.000005876677,0.030763008,0.00009684528,0.000011443882,0.000011037932,0.0000030320111,0.000008377033,0.00006986113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989542,0.00004897621,0.00025519592,0.00027533752,0.00027655772,0.0001897839],"domain_scores_gemma":[0.9991299,0.000094278,0.00012090745,0.00039731397,0.00018319886,0.00007438308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000266632,0.000117139934,0.00015567333,0.00014068728,0.00007571139,0.00003880497,0.00049522,0.000060016813,0.000057889447],"category_scores_gemma":[0.000041161853,0.00011470273,0.00009263442,0.0007334762,0.00004026358,0.00039729202,0.00015681772,0.0000978712,0.00007298171],"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.0000065672116,0.00013078956,0.010622997,0.0000101277265,0.000025459884,0.0000044886633,0.0005252577,0.000031992884,0.00040461274,0.98236054,0.00043739547,0.0054397695],"study_design_scores_gemma":[0.00050952396,0.000091390146,0.024728917,0.000017113178,0.0000102793665,0.000012016235,0.000010657118,0.0078933295,0.008040577,0.95797265,0.00052782433,0.00018570547],"about_ca_topic_score_codex":0.000041923726,"about_ca_topic_score_gemma":0.0000074278414,"teacher_disagreement_score":0.12144889,"about_ca_system_score_codex":0.000016835242,"about_ca_system_score_gemma":0.00005547913,"threshold_uncertainty_score":0.46774414},"labels":[],"label_agreement":null},{"id":"W2405968532","doi":"","title":"Realizing Site Permutations.","year":2011,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Permutation (music); Combinatorics; Realization (probability); Partial permutation; Mathematics; Random permutation; Point (geometry); Bit-reversal permutation; Derangement; Unit (ring theory); Base (topology); Line (geometry); Unit circle; Function (biology); Plane (geometry); Cyclic permutation; Discrete mathematics; Computer science; Symmetric group; Physics; Geometry","score_opus":0.049550246429708907,"score_gpt":0.23525983929913566,"score_spread":0.18570959286942676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405968532","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.011534143,0.000021728727,0.8902706,0.00014677578,0.000103320934,0.00003265916,2.669145e-7,0.00012275517,0.09776775],"genre_scores_gemma":[0.7893332,0.0000023118473,0.20915006,0.00037843708,0.000029024517,0.000003776094,0.000003877335,0.0000016196417,0.0010976446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959856,0.000016598258,0.00008342374,0.00013214983,0.00009274067,0.00007654981],"domain_scores_gemma":[0.99972534,0.000019292665,0.00002041437,0.00014075651,0.000058154434,0.00003603446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092358205,0.000038865433,0.000032952383,0.00007370329,0.00007417516,0.00003912941,0.00015148235,0.0000140145,0.000109026005],"category_scores_gemma":[0.00001239965,0.000035648096,0.000020292748,0.0002672872,0.0000066111347,0.0003694268,0.000048255166,0.000024130068,0.00021804741],"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":[8.578025e-7,0.000022974773,0.00032060398,0.0000014602649,0.0000033870692,0.0000033953127,0.001142913,0.00020729263,0.00068965467,0.9693276,0.0013048284,0.026974985],"study_design_scores_gemma":[0.00066890084,0.0002047718,0.119230576,0.0000141199525,0.000012488533,0.000117143885,0.00018653744,0.6223633,0.04049415,0.18088341,0.03514907,0.0006755071],"about_ca_topic_score_codex":0.00003139369,"about_ca_topic_score_gemma":0.000008579271,"teacher_disagreement_score":0.7884442,"about_ca_system_score_codex":0.000007886742,"about_ca_system_score_gemma":0.000023703953,"threshold_uncertainty_score":0.2802631},"labels":[],"label_agreement":null},{"id":"W2405970943","doi":"","title":"Guarding Orthogonal Terrains.","year":2015,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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 Manitoba","funders":"","keywords":"Combinatorics; Guard (computer science); Vertex (graph theory); Terrain; Visibility; Mathematics; Line segment; Computer science; Graph; Geometry; Geography; Cartography","score_opus":0.05570454956006546,"score_gpt":0.26532997428677646,"score_spread":0.209625424726711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405970943","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.020837985,0.000024077743,0.9244171,0.0010322485,0.00037934622,0.00002958493,1.7185529e-7,0.000113740374,0.053165767],"genre_scores_gemma":[0.87891674,4.796504e-7,0.11850294,0.0006912944,0.00012787266,0.0000026259577,0.0000033588958,0.0000016411619,0.0017530577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949425,0.000018961318,0.00007811084,0.00013357539,0.00018781019,0.00008730833],"domain_scores_gemma":[0.99968076,0.000018597306,0.000016684302,0.00012429817,0.00007830294,0.00008138591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021768073,0.00004155036,0.000040406165,0.00006170148,0.000038625185,0.00007775906,0.00019114616,0.000015030669,0.000016887583],"category_scores_gemma":[0.000033660206,0.000036166486,0.00002078325,0.00024191095,0.000006682384,0.00032842462,0.00008596707,0.000028760025,0.00012926705],"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.0000025363393,0.000034479788,0.0005212977,0.0000017479467,0.000008752341,0.000008393025,0.00077693426,0.008905797,0.00050249556,0.8253782,0.031236155,0.13262321],"study_design_scores_gemma":[0.0007474275,0.00013683064,0.0043787127,0.0000058180917,0.0000032016749,0.00009718766,0.00010707451,0.7146677,0.0037814528,0.097836986,0.17789403,0.00034357022],"about_ca_topic_score_codex":0.0000023491873,"about_ca_topic_score_gemma":0.000002159677,"teacher_disagreement_score":0.8580788,"about_ca_system_score_codex":0.000016831467,"about_ca_system_score_gemma":0.000079191675,"threshold_uncertainty_score":0.16615094},"labels":[],"label_agreement":null},{"id":"W2405979143","doi":"","title":"The Convex Hull of Points on a Sphere is a Spanner.","year":2014,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Delaunay triangulation; Spanner; Convex hull; Combinatorics; Pitteway triangulation; Minimum-weight triangulation; Mathematics; Constrained Delaunay triangulation; Euclidean geometry; Regular polygon; Convex body; Constant (computer programming); Ruppert's algorithm; Bowyer–Watson algorithm; Convex set; Computer science; Geometry; Convex optimization","score_opus":0.008930298922910352,"score_gpt":0.22564409826540144,"score_spread":0.21671379934249108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405979143","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.046098113,0.00003702308,0.90766037,0.007127794,0.00034515242,0.00008950044,6.4993543e-7,0.00004569869,0.0385957],"genre_scores_gemma":[0.9794053,0.000004193452,0.014744036,0.002035774,0.000066187466,0.0000030356907,7.8554933e-7,0.0000021829208,0.0037385253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944484,0.000042368418,0.00011288298,0.00013139547,0.00018320055,0.00008530146],"domain_scores_gemma":[0.999387,0.00020748972,0.000046507175,0.0002519887,0.00007756754,0.000029407402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024725831,0.00004834513,0.000058018988,0.000021787144,0.000085171014,0.00004916103,0.00028939455,0.000017886414,0.000055943347],"category_scores_gemma":[0.000049245104,0.000030541945,0.000033348348,0.0001826699,0.000019672481,0.000075733595,0.00005719645,0.000035161,0.000115865696],"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.0000061977057,0.00003156186,0.000059809794,0.0000036845336,0.000008198831,2.4196916e-7,0.00018166045,0.000535887,0.00032540385,0.8616383,0.01561394,0.12159514],"study_design_scores_gemma":[0.0005294765,0.0004107764,0.0046468684,0.000018116654,0.0000039713636,0.00000659186,0.00003539459,0.63796496,0.048419748,0.0864889,0.2212956,0.00017957712],"about_ca_topic_score_codex":0.000008841649,"about_ca_topic_score_gemma":0.00000818034,"teacher_disagreement_score":0.9333072,"about_ca_system_score_codex":0.000005496836,"about_ca_system_score_gemma":0.00002516256,"threshold_uncertainty_score":0.14892578},"labels":[],"label_agreement":null},{"id":"W2406062735","doi":"","title":"Edge Guards for Polyhedra in 3-Space.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on 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 Calgary","funders":"","keywords":"Polyhedron; Enhanced Data Rates for GSM Evolution; Computer science; Space (punctuation); Combinatorics; Mathematics; Artificial intelligence; Operating system","score_opus":0.040380205080123924,"score_gpt":0.27861341975674936,"score_spread":0.23823321467662545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406062735","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.035975788,0.00026318725,0.9431136,0.0061164806,0.0015396748,0.00052173866,0.00010414049,0.00008653343,0.01227884],"genre_scores_gemma":[0.9579061,0.0000042042325,0.039324857,0.0017719055,0.00031738315,0.00006721346,0.0001743251,0.000013109446,0.00042088178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981723,0.00008325228,0.00030647227,0.0004037936,0.0003542916,0.0006799203],"domain_scores_gemma":[0.99832684,0.00045356445,0.00008440738,0.00026156177,0.00029689012,0.0005767666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006537775,0.00020811563,0.00020411347,0.0013243046,0.00020265077,0.0002375593,0.00051442644,0.000114892435,0.00013086693],"category_scores_gemma":[0.00021118553,0.00023444915,0.00008135151,0.0012795607,0.000038808725,0.00078148243,0.000048745456,0.00017262147,0.00016910651],"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.000006063865,0.000070417555,0.0015584506,0.000012298072,0.000012942284,0.0000036476747,0.00023286116,0.0243308,0.000030264433,0.9108747,0.0033949118,0.05947261],"study_design_scores_gemma":[0.0018576598,0.00031575732,0.20568737,0.00008797778,0.000011742638,0.000053113497,0.00013528719,0.60843146,0.0004173971,0.110064246,0.071788505,0.0011494618],"about_ca_topic_score_codex":0.0009806758,"about_ca_topic_score_gemma":0.00197949,"teacher_disagreement_score":0.9219303,"about_ca_system_score_codex":0.00034241448,"about_ca_system_score_gemma":0.0012188694,"threshold_uncertainty_score":0.95605594},"labels":[],"label_agreement":null},{"id":"W2406237833","doi":"","title":"Cuttings in 2D Revisited.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on 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":"Subdivision; Cutting; Computer science; Construct (python library); Simple (philosophy); Plane (geometry); Combinatorics; Deterministic algorithm; Algorithm; Mathematics; Theoretical computer science; Programming language; Engineering; Geometry; Botany","score_opus":0.019307233064556575,"score_gpt":0.2428241013642129,"score_spread":0.22351686829965633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406237833","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.05809594,0.000085673004,0.8915812,0.010007054,0.000553369,0.00030451137,0.00002349806,0.00015008965,0.039198663],"genre_scores_gemma":[0.9700655,0.0000046457462,0.0239242,0.005435926,0.00014074534,0.00001411858,0.00009766662,0.000010093566,0.00030710286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812204,0.00012659557,0.00034630825,0.00055466656,0.00042369083,0.0004266824],"domain_scores_gemma":[0.99856794,0.000326212,0.00009310922,0.0003136092,0.00029214605,0.00040699146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057377235,0.00019544605,0.00020732901,0.0014443906,0.00017703408,0.00028064134,0.0006398066,0.00009531062,0.000107258136],"category_scores_gemma":[0.00024461863,0.00022007643,0.000057340596,0.001751549,0.000038786995,0.00035395275,0.000054008615,0.00024142499,0.0004178804],"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.0000031413965,0.00003024188,0.0011599016,0.000010803119,0.0000067839032,0.0000134892625,0.00009324906,0.07004137,0.000019448791,0.84634054,0.002832122,0.07944892],"study_design_scores_gemma":[0.00047468414,0.00011130283,0.044166014,0.00007382193,0.0000024766844,0.000022078224,0.000015242298,0.81756437,0.000046582543,0.10429593,0.032842875,0.00038463724],"about_ca_topic_score_codex":0.0014647328,"about_ca_topic_score_gemma":0.0023915803,"teacher_disagreement_score":0.91196954,"about_ca_system_score_codex":0.00022078968,"about_ca_system_score_gemma":0.0007233679,"threshold_uncertainty_score":0.8974456},"labels":[],"label_agreement":null},{"id":"W2406472532","doi":"10.13140/2.1.2615.7123","title":"Decontaminating planar regions by sweeping with barrier curves","year":2014,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Planar; Path (computing); Human decontamination; Line segment; Line (geometry); Computer science; Simple (philosophy); Mathematics; Geometry; Algorithm; Computer graphics (images); Artificial intelligence; Physics","score_opus":0.007440987648833603,"score_gpt":0.21238275371758256,"score_spread":0.20494176606874895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406472532","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.005000237,0.00013346405,0.9832069,0.0018899991,0.000068958885,0.000058078887,5.808634e-7,0.000099060184,0.009542684],"genre_scores_gemma":[0.87244844,0.000015331661,0.120376796,0.0040996177,0.00007741061,0.000012338336,0.000018347771,0.0000058031465,0.0029459014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993695,0.000043639622,0.00010373599,0.00020186589,0.0001581659,0.0001230698],"domain_scores_gemma":[0.9995217,0.00013983739,0.00004339751,0.00017194195,0.000060161616,0.000062975276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022206115,0.000066548186,0.0000698218,0.000050997834,0.00014200534,0.00006959691,0.0002110048,0.00001725278,0.000015493657],"category_scores_gemma":[0.000051503604,0.00005413095,0.00001673999,0.00022524198,0.000012758062,0.00033829646,0.000028888038,0.000047247257,0.000017466356],"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.0000054611573,0.00007110697,0.0015131452,0.00007024077,0.000040918905,0.000004832388,0.0005217238,0.0027049177,0.0042089066,0.7272746,0.11241175,0.15117241],"study_design_scores_gemma":[0.0009996642,0.00046198608,0.004907846,0.0003081457,0.000018142417,0.00010275201,0.00007377077,0.81876665,0.016856631,0.010345578,0.1463836,0.00077520305],"about_ca_topic_score_codex":0.000014127336,"about_ca_topic_score_gemma":0.000024833416,"teacher_disagreement_score":0.8674482,"about_ca_system_score_codex":0.000010851401,"about_ca_system_score_gemma":0.000025971585,"threshold_uncertainty_score":0.2207396},"labels":[],"label_agreement":null},{"id":"W2406491841","doi":"","title":"Nowhere-zero 3-flows in Tensor Products of Graphs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Zero (linguistics); Tensor (intrinsic definition); Tensor product; Pure mathematics; Linguistics","score_opus":0.010336862100538177,"score_gpt":0.22285045510788196,"score_spread":0.2125135930073438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406491841","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.981227,0.00009916252,0.014635934,0.00063047826,0.0017265896,0.000166457,6.0292183e-7,0.00005603478,0.0014577326],"genre_scores_gemma":[0.98810875,0.0000051250495,0.011655133,0.00008772554,0.000008306595,0.000009317326,0.0000036882727,0.000005075369,0.00011684967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899924,0.00008794126,0.00023964017,0.00028009532,0.00023463028,0.00015842775],"domain_scores_gemma":[0.9992346,0.00009813102,0.00008665485,0.00036574606,0.00017170105,0.000043155807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004145797,0.00009213202,0.00015154434,0.00019499686,0.000039006925,0.000029993947,0.00038499397,0.000042056225,0.0000042299303],"category_scores_gemma":[0.00016570881,0.000091725226,0.0000335593,0.00095023017,0.000020048084,0.00024574477,0.00009098449,0.00008191239,0.000022520437],"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.0000044274375,0.0001298856,0.0024903533,0.00001996781,0.000005304534,0.0000015833083,0.0001708681,0.0009278011,0.0029043013,0.9802035,0.0008328563,0.012309168],"study_design_scores_gemma":[0.0008239674,0.00017041819,0.030292692,0.000024927747,0.0000032897112,0.000005044725,0.0000034804189,0.0518544,0.012413956,0.9007638,0.0034629272,0.00018107679],"about_ca_topic_score_codex":0.000018583594,"about_ca_topic_score_gemma":0.00000652195,"teacher_disagreement_score":0.07943966,"about_ca_system_score_codex":0.000018140743,"about_ca_system_score_gemma":0.000052681113,"threshold_uncertainty_score":0.37404463},"labels":[],"label_agreement":null},{"id":"W2406672111","doi":"","title":"A Ballot Number Formulary.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Formulary; Ballot; Mathematics; Medicine; Law; Political science; Pharmacology","score_opus":0.02255550886581559,"score_gpt":0.2381163041885609,"score_spread":0.2155607953227453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406672111","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.58945197,0.000117190575,0.28792474,0.00032714015,0.005474765,0.0002790597,0.0000013261623,0.00047987708,0.11594393],"genre_scores_gemma":[0.97515637,0.000003914882,0.024055839,0.00026237825,0.00000904956,0.00001164273,0.0000032867213,0.000005443821,0.0004920652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924576,0.000032002317,0.00014009702,0.00021884586,0.00019211083,0.00017115363],"domain_scores_gemma":[0.9994812,0.000031906508,0.0000447755,0.00027118705,0.00009268292,0.000078241945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016486063,0.000087478096,0.00008252957,0.00005083788,0.00009751956,0.00005067142,0.000427002,0.00004022399,0.00012292892],"category_scores_gemma":[0.000022280963,0.00008733796,0.00004673939,0.00036622363,0.000013376655,0.0004801368,0.00013854884,0.00006869795,0.0004723135],"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.0000026643827,0.00007525507,0.0010352321,0.0000023264088,0.000008551618,0.0000078005105,0.00034549105,0.0000052126015,0.00009263528,0.99171907,0.0016587597,0.0050469814],"study_design_scores_gemma":[0.0004058899,0.00006602508,0.011182054,0.000004868632,0.0000037610148,0.000023964021,0.00000559802,0.0072650774,0.003993693,0.9711501,0.0057375315,0.00016144823],"about_ca_topic_score_codex":0.000016531661,"about_ca_topic_score_gemma":0.0000013067969,"teacher_disagreement_score":0.3857044,"about_ca_system_score_codex":0.000022217653,"about_ca_system_score_gemma":0.00004790343,"threshold_uncertainty_score":0.60707915},"labels":[],"label_agreement":null},{"id":"W2408389204","doi":"","title":"Super-Mixed-Connected Line Digraphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Line (geometry); Combinatorics; Geometry","score_opus":0.023519981849236565,"score_gpt":0.2252027664394718,"score_spread":0.20168278459023523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408389204","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.93438697,0.00019286828,0.05348302,0.0002583961,0.004350237,0.0001582044,0.00000183066,0.00036251027,0.0068059475],"genre_scores_gemma":[0.98996,0.000010270695,0.0095603615,0.00019763125,0.000016324584,0.000013513102,0.000012269842,0.000007677333,0.0002219582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989761,0.00006354555,0.00020430065,0.00031526506,0.00022519327,0.00021558278],"domain_scores_gemma":[0.9991755,0.00009222096,0.000057666137,0.00039943922,0.00016898278,0.000106196465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020518588,0.00012536747,0.00012454228,0.00015508283,0.00013295125,0.00006838693,0.0005345073,0.000059462775,0.000057481127],"category_scores_gemma":[0.00007838195,0.00012455936,0.000064476364,0.000769859,0.000026244204,0.0004768621,0.00014538202,0.00010557066,0.00014499588],"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.0000050042036,0.00014105855,0.0007973122,0.0000034746895,0.0000153538,0.000010520933,0.0005016072,0.000024745385,0.00041870566,0.987875,0.0013071364,0.008900098],"study_design_scores_gemma":[0.0007704902,0.00026903834,0.031780604,0.000010771731,0.0000093493245,0.000020899182,0.00002291655,0.010415411,0.025721677,0.9274332,0.0032291003,0.00031657197],"about_ca_topic_score_codex":0.00002631938,"about_ca_topic_score_gemma":0.000006238767,"teacher_disagreement_score":0.060441814,"about_ca_system_score_codex":0.000019302472,"about_ca_system_score_gemma":0.000057414847,"threshold_uncertainty_score":0.5079383},"labels":[],"label_agreement":null},{"id":"W2442922754","doi":"10.1007/978-3-319-50106-2_13","title":"Drawing Planar Graphs with Many Collinear Vertices","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Ottawa","funders":"","keywords":"Combinatorics; Planar graph; Treewidth; Book embedding; Outerplanar graph; 1-planar graph; Mathematics; Clique-sum; Planarity testing; Planar; Wheel graph; Pathwidth; Vertex (graph theory); Discrete mathematics; Polyhedral graph; Planar straight-line graph; Graph; Chordal graph; Line graph; Computer science; Graph power","score_opus":0.012792202388363642,"score_gpt":0.2292935949276749,"score_spread":0.21650139253931125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2442922754","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.00031399124,0.00033553748,0.9932985,0.0009792395,0.0010723678,0.00028203957,0.00000566989,0.00014249905,0.0035701746],"genre_scores_gemma":[0.23796657,0.00007547115,0.756843,0.0023895656,0.0009576533,0.000017997741,0.000012605719,0.000052907806,0.0016842356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967352,0.000029136318,0.00038370152,0.0012717868,0.0010643112,0.0005158417],"domain_scores_gemma":[0.9980463,0.00045156223,0.00022930333,0.00082763267,0.00027703322,0.00016816928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054364436,0.0004269914,0.00037025023,0.0009216078,0.000342229,0.0005421048,0.0019228541,0.00018515573,0.000019222878],"category_scores_gemma":[0.000037138376,0.00031391394,0.00008504491,0.0007675423,0.0004137938,0.00081996236,0.0003770798,0.00036939755,0.000060868686],"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.000026487876,0.000035105484,0.00010905023,0.00004408472,0.00003436359,0.00018680854,0.0005264436,0.059200577,0.00048670493,0.26158345,0.000050175524,0.67771673],"study_design_scores_gemma":[0.00090595084,0.0006391777,0.00041472548,0.0009759194,0.00002344707,0.00023339606,2.4572373e-7,0.56468314,0.004122909,0.4178155,0.008739501,0.0014460976],"about_ca_topic_score_codex":0.000005701618,"about_ca_topic_score_gemma":0.000039092658,"teacher_disagreement_score":0.67627066,"about_ca_system_score_codex":0.00016618244,"about_ca_system_score_gemma":0.0005748367,"threshold_uncertainty_score":0.9999313},"labels":[],"label_agreement":null},{"id":"W2462105638","doi":"10.1007/978-3-642","title":"Homotopic -Oriented Routing","year":2013,"lang":"en","type":"article","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":27,"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":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Computer science; Process (computing); Context (archaeology); Service (business); Process management; Service design; Business process; Business process modeling; Knowledge management; Service delivery framework; Work in process; Business; Marketing","score_opus":0.008032525424219467,"score_gpt":0.19451812844154506,"score_spread":0.18648560301732559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2462105638","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.20794116,0.00004339782,0.78223747,0.00066661433,0.00046403066,0.00024577114,0.0000026504251,0.00023529492,0.008163617],"genre_scores_gemma":[0.91342705,0.000018395873,0.08528459,0.00028056023,0.000115446004,0.000007257858,0.000026694825,0.000010585488,0.00082943164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984292,0.000105071595,0.00022203152,0.00052603934,0.00031196233,0.0004057285],"domain_scores_gemma":[0.9989526,0.00015284547,0.000110405716,0.0004494537,0.00015533832,0.00017931922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015799573,0.00019826097,0.00017248635,0.00051594205,0.0005065406,0.00018750528,0.000709977,0.000048077232,0.00007228596],"category_scores_gemma":[0.000044583852,0.00021226953,0.00015902294,0.0006610885,0.00007512049,0.001588932,0.0005622181,0.0002200419,0.00024698433],"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.00001166601,0.00014207422,0.0030917805,0.000029655836,0.0001395342,0.00008257322,0.004876654,0.007213039,0.011265087,0.89014316,0.0014222196,0.08158253],"study_design_scores_gemma":[0.0031858939,0.00045673322,0.2033851,0.00025868384,0.00009003865,0.00009210369,0.0014915236,0.44394198,0.009177203,0.26586828,0.07001259,0.0020398705],"about_ca_topic_score_codex":0.00015938225,"about_ca_topic_score_gemma":0.000018551807,"teacher_disagreement_score":0.7054859,"about_ca_system_score_codex":0.00006274481,"about_ca_system_score_gemma":0.00007589488,"threshold_uncertainty_score":0.86561006},"labels":[],"label_agreement":null},{"id":"W2465996091","doi":"10.7155/jgaa.00422","title":"Essential Constraints of Edge-Constrained Proximity Graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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 Ottawa; Carleton University","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.013927623660651572,"score_gpt":0.27158858750897885,"score_spread":0.25766096384832726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465996091","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.029363973,0.00020443012,0.96886736,0.00068640726,0.00016976097,0.00015709152,0.0000114075265,0.000008650388,0.00053092715],"genre_scores_gemma":[0.90250033,0.0001155062,0.097170435,0.000028715805,0.00014880468,0.000009447966,0.0000018696671,0.0000028076572,0.000022054057],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991695,0.000020636402,0.00036255675,0.00013711801,0.00021248564,0.00009769607],"domain_scores_gemma":[0.99851763,0.00005542518,0.00065778615,0.0002782436,0.00038882272,0.00010210691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034581393,0.00007999701,0.00016930957,0.00018349578,0.0003576855,0.00014563683,0.00048244192,0.00004017424,0.0000064115493],"category_scores_gemma":[0.000034137607,0.000069978916,0.00010573432,0.0001765715,0.00032890608,0.0005205611,0.00007272723,0.000106517844,7.24102e-7],"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.000007225144,0.00021334388,0.0008491873,0.000024851613,0.00008291045,0.0000047725457,0.00012547619,0.00011002211,0.0055611515,0.4139529,0.00018624039,0.5788819],"study_design_scores_gemma":[0.0041459533,0.0006453803,0.12288769,0.00015389123,0.00018622002,0.0011891265,0.00020280416,0.02992963,0.029879812,0.8010637,0.009003391,0.0007123605],"about_ca_topic_score_codex":0.0000041018143,"about_ca_topic_score_gemma":0.0000014143767,"teacher_disagreement_score":0.8731364,"about_ca_system_score_codex":0.000004925637,"about_ca_system_score_gemma":0.00011017921,"threshold_uncertainty_score":0.28536573},"labels":[],"label_agreement":null},{"id":"W2466150543","doi":"10.1007/978-3-319-48532-4_10","title":"Minimum Rectilinear Polygons for Given Angle Sequences","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 British Columbia","funders":"","keywords":"Rectilinear polygon; Monotone polygon; Polygon covering; Polygon (computer graphics); Star-shaped polygon; Point in polygon; Equiangular polygon; Simple polygon; Sequence (biology); Bounding overwatch; Minimum bounding box; Combinatorics; Mathematics; Boundary (topology); Computer science; Perimeter; Regular polygon; Geometry; Computer vision; Artificial intelligence; Mathematical analysis; Convex set","score_opus":0.02373237838531204,"score_gpt":0.2672468927582432,"score_spread":0.24351451437293117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466150543","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.000068972404,0.00046193512,0.99031264,0.0029132443,0.0027462156,0.0005254486,0.000025753696,0.00013771975,0.0028080482],"genre_scores_gemma":[0.07587242,0.00005932737,0.9147031,0.002003368,0.002357509,0.00005029553,0.00002109411,0.000046442332,0.004886466],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996903,0.000030012638,0.00045339778,0.0013707532,0.000691811,0.0005510029],"domain_scores_gemma":[0.99743444,0.0009375494,0.00025650088,0.0008051187,0.00040675513,0.00015965862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078117533,0.0004014317,0.00038784143,0.0007959096,0.0003380465,0.0003904573,0.0020512242,0.0002489788,0.000023058183],"category_scores_gemma":[0.00016767652,0.0003308179,0.0001656701,0.0005398124,0.00039377398,0.00064551947,0.0005443245,0.0002753149,0.00004507244],"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.000011913936,0.00002464921,0.000009998429,0.000030231386,0.000015057171,0.000018124263,0.000312641,0.013537396,0.0010641685,0.053602695,0.00020207082,0.93117106],"study_design_scores_gemma":[0.00048291424,0.00044669068,0.000042119384,0.0003201341,0.000011210034,0.00007782438,1.6164583e-7,0.4629263,0.007566163,0.503276,0.02402507,0.00082540594],"about_ca_topic_score_codex":0.000005449803,"about_ca_topic_score_gemma":0.00003571473,"teacher_disagreement_score":0.93034565,"about_ca_system_score_codex":0.000232039,"about_ca_system_score_gemma":0.000816432,"threshold_uncertainty_score":0.9999144},"labels":[],"label_agreement":null},{"id":"W2472646614","doi":"10.1016/j.dam.2016.05.031","title":"Rectilinear path problems in restricted memory setup","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Path (computing); Algorithm; Mathematical optimization; Combinatorics; Arithmetic; Computer science; Programming language","score_opus":0.015692835533974978,"score_gpt":0.23396249652365553,"score_spread":0.21826966098968054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472646614","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.042243052,0.000032152948,0.9473625,0.0004192774,0.00011906613,0.0003866086,0.0000045852707,0.00015844278,0.009274332],"genre_scores_gemma":[0.74667054,0.00003068845,0.2523812,0.000117888616,0.00008577262,0.0001061922,0.000011182508,0.000017793194,0.0005786994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882126,0.000020434956,0.00034237816,0.00030525046,0.00028604173,0.000224624],"domain_scores_gemma":[0.9991458,0.00020721526,0.00011770766,0.00041749966,0.00004718144,0.00006456596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002687004,0.0001364808,0.00016738061,0.00015655244,0.000055536762,0.00006130608,0.00037827372,0.00006172286,0.000017994409],"category_scores_gemma":[0.0000693595,0.00009453569,0.000036189558,0.0006185571,0.000025211548,0.00019835457,0.0001363148,0.00007615563,0.000102185695],"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.000015484016,0.00041541818,0.000078428086,0.000236056,0.000038496808,0.0000168987,0.0042885444,0.0038292562,0.11721509,0.72800994,0.0023411273,0.14351526],"study_design_scores_gemma":[0.004312374,0.00024192309,0.0032785663,0.00051063043,0.00003047515,0.000056841644,0.00037766816,0.26203072,0.05369951,0.66652626,0.0074187187,0.0015163166],"about_ca_topic_score_codex":0.0000028130432,"about_ca_topic_score_gemma":0.000004851458,"teacher_disagreement_score":0.70442754,"about_ca_system_score_codex":0.00004796994,"about_ca_system_score_gemma":0.000060075497,"threshold_uncertainty_score":0.38550535},"labels":[],"label_agreement":null},{"id":"W2477396234","doi":"10.22215/etd/2016-11514","title":"On Proximity Problems In Euclidean Spaces","year":2016,"lang":"en","type":"dissertation","venue":"","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":"Polygon (computer graphics); Intersection (aeronautics); Voronoi diagram; Polytope; Facility location problem; Geodesic; Mathematics; Regular polygon; Metric space; Euclidean space; Computational geometry; Metric (unit); Logarithm; Polyhedron; Dimension (graph theory); Computer science; Combinatorics; Discrete mathematics; Algorithm; Geometry; Frame (networking); Geography","score_opus":0.013644807548220205,"score_gpt":0.25813370649248,"score_spread":0.24448889894425982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2477396234","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.234816,0.00036483255,0.38444006,0.0023859653,0.0048477077,0.0018784367,0.000009239503,0.000570627,0.37068713],"genre_scores_gemma":[0.8853173,0.000051369505,0.008938472,0.00036425097,0.00023827399,0.00013710317,0.00026427305,0.00002494861,0.104664005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865687,0.00005561505,0.00025913175,0.00048647408,0.00035032214,0.00019160312],"domain_scores_gemma":[0.9993001,0.00012610762,0.000131739,0.00029046464,0.00009978931,0.000051790998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025403165,0.00018589261,0.0001729605,0.00039505595,0.00006358526,0.00015138366,0.0004334473,0.00014131653,0.000068862864],"category_scores_gemma":[0.00006528168,0.00013910055,0.00005591778,0.00040900614,0.000006275988,0.00038379084,0.000032016054,0.00015294821,0.00019661643],"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.000030778363,0.00028555252,0.00022790636,0.00017153862,0.000025467249,0.0000116806295,0.0012137386,0.0024431823,0.001403901,0.7746994,0.004396767,0.2150901],"study_design_scores_gemma":[0.0026042094,0.0009724689,0.04260539,0.0018990929,0.000020774867,0.000013469793,0.00013459008,0.037427526,0.03079636,0.8585008,0.022473441,0.0025519156],"about_ca_topic_score_codex":0.000025453675,"about_ca_topic_score_gemma":0.00041909062,"teacher_disagreement_score":0.6505013,"about_ca_system_score_codex":0.000061927974,"about_ca_system_score_gemma":0.00015395257,"threshold_uncertainty_score":0.5672356},"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":"W2480249651","doi":"10.1142/s0129054119500060","title":"Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees","year":2019,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Graph; Combinatorics; Running time; Vertex (graph theory); Binary logarithm; Time complexity; Graph algorithms; Mathematics; Algorithm; Path (computing); Computer science; Discrete mathematics","score_opus":0.030500637376295502,"score_gpt":0.3227517377298996,"score_spread":0.29225110035360413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480249651","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.03936523,0.00018090183,0.9518365,0.0012288755,0.007006009,0.00024995374,0.000027636288,0.000017511493,0.000087359695],"genre_scores_gemma":[0.41112158,0.000048422327,0.58818656,0.000095187956,0.0004908114,0.000005790179,0.000012839581,0.0000060812595,0.00003272892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970923,0.00004908579,0.00092999206,0.00047909608,0.0012396278,0.00020987517],"domain_scores_gemma":[0.9940036,0.0004375729,0.0014198639,0.00036843066,0.0036587596,0.00011178049],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015330923,0.00020666773,0.00034945065,0.001205033,0.00015003285,0.0010435433,0.0028580222,0.000076044525,0.0000046681694],"category_scores_gemma":[0.00021032184,0.00019942809,0.00021488844,0.00039116954,0.00023802911,0.0015700505,0.0015321751,0.00024168481,0.000002175489],"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.000027837785,0.00023475307,0.00048813573,0.00006129091,0.00023700895,0.000007708595,0.0010366722,0.35806367,0.002495421,0.025588932,0.00032056044,0.61143804],"study_design_scores_gemma":[0.0006755376,0.00031137164,0.005893986,0.00027872444,0.000027769458,0.00012523396,0.000014870089,0.97454894,0.0021229219,0.014703928,0.0010552708,0.00024144736],"about_ca_topic_score_codex":0.0000073357037,"about_ca_topic_score_gemma":0.000002393248,"teacher_disagreement_score":0.6164853,"about_ca_system_score_codex":0.00014133946,"about_ca_system_score_gemma":0.0011940734,"threshold_uncertainty_score":0.99999344},"labels":[],"label_agreement":null},{"id":"W2486128631","doi":"10.1007/978-3-319-25388-6_2","title":"The nearest neighbor distance","year":2015,"lang":"en","type":"book-chapter","venue":"Springer series in the data sciences","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":"McGill University","funders":"","keywords":"Equidistant; k-nearest neighbors algorithm; Combinatorics; Physics; Mathematics; Condensed matter physics; Geometry; Computer science; Artificial intelligence","score_opus":0.10875444591649007,"score_gpt":0.30749797614937235,"score_spread":0.19874353023288227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486128631","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008339887,0.021351552,0.10410892,0.026249567,0.0072707688,0.0009897611,0.00040784525,0.0001956698,0.83934253],"genre_scores_gemma":[0.074884705,0.0082713645,0.106662914,0.004569303,0.0061276564,0.00016755892,0.0012249075,0.0001219905,0.7979696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786496,0.00006219675,0.00027779903,0.000627508,0.00090707495,0.00026043778],"domain_scores_gemma":[0.99755144,0.0003465863,0.00017607395,0.0017919219,0.00009011578,0.000043854205],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0027931407,0.00018926863,0.0001410673,0.000084671636,0.00072784605,0.0011584653,0.008502606,0.000061009323,0.000012705344],"category_scores_gemma":[0.00018354585,0.00010552274,0.000029875153,0.00031143537,0.0007267539,0.0013973231,0.0017670972,0.0002527347,0.00006462055],"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.0000036020804,0.00000435655,0.000008435041,0.0000038491085,0.0000041785693,0.0000074021127,0.00019208476,0.00030702873,0.0000010503417,0.96800053,0.011789671,0.019677788],"study_design_scores_gemma":[0.00003649711,0.000043160988,0.00010194135,0.000027228822,0.0000034573368,0.000016883925,0.000043227188,0.0059701926,0.000003532629,0.13807918,0.855523,0.00015171425],"about_ca_topic_score_codex":0.000017187658,"about_ca_topic_score_gemma":0.0005029725,"teacher_disagreement_score":0.8437333,"about_ca_system_score_codex":0.00003490205,"about_ca_system_score_gemma":0.00035884933,"threshold_uncertainty_score":0.9998784},"labels":[],"label_agreement":null},{"id":"W2488588792","doi":"10.48550/arxiv.1607.05739","title":"Recognition of Triangulation Duals of Simple Polygons With and Without Holes","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Dual polyhedron; Triangulation; Pitteway triangulation; Simple polygon; Minimum-weight triangulation; Dual graph; Combinatorics; Polygon (computer graphics); Simple (philosophy); Graph; Mathematics; Planar graph; Computer science; Constrained Delaunay triangulation; Monotone polygon; Delaunay triangulation; Geometry","score_opus":0.07519836854382739,"score_gpt":0.20190927404622636,"score_spread":0.12671090550239897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488588792","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.51880693,0.000021576614,0.48075953,0.000028971306,0.000050172912,0.00010643315,0.000018607994,0.000018136743,0.00018966835],"genre_scores_gemma":[0.99594504,0.000038939077,0.0037780022,0.00000992477,0.000030381094,4.8959566e-7,0.000035523975,0.0000050154126,0.00015670327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992088,0.000083348736,0.00016424376,0.00037565143,0.00007770019,0.00009023084],"domain_scores_gemma":[0.9989843,0.00008738116,0.00034178834,0.000288921,0.00024860408,0.000049026978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001649942,0.00011835616,0.00020523592,0.00026128863,0.000044035136,0.000018852217,0.00021194061,0.00009369901,0.000007849209],"category_scores_gemma":[0.000024862153,0.000107797685,0.000050065268,0.00030488547,0.000095431096,0.00026034573,0.00023997006,0.00007350125,0.0000020264492],"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.0007667931,0.00048046166,0.05774729,0.0007322346,0.00061415625,0.000030576146,0.0014648442,0.26122934,0.008483849,0.59141743,0.00024234195,0.0767907],"study_design_scores_gemma":[0.0036456666,0.0005524703,0.057028566,0.0006574875,0.00026762372,0.000017187822,0.00011355098,0.32708934,0.031499755,0.5781613,0.00013496866,0.00083207176],"about_ca_topic_score_codex":0.000026012316,"about_ca_topic_score_gemma":0.000013889235,"teacher_disagreement_score":0.4771381,"about_ca_system_score_codex":0.000024524843,"about_ca_system_score_gemma":0.00011490171,"threshold_uncertainty_score":0.4395862},"labels":[],"label_agreement":null},{"id":"W2490727251","doi":"10.20382/jocg.v9i1a5","title":"On the Geodesic Centers of Polygonal Domains","year":2016,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Geodesic; Combinatorics; Mathematics; Shortest path problem; Bounded function; Center (category theory); Euclidean geometry; Equivalence (formal languages); Path (computing); Domain (mathematical analysis); Discrete mathematics; Geometry; Computer science; Mathematical analysis; Crystallography","score_opus":0.014365061261561854,"score_gpt":0.2163739961313764,"score_spread":0.20200893486981453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490727251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20592548,0.00013299685,0.78647053,0.003721163,0.0013825612,0.00017464171,0.000059210495,0.000023354733,0.0021100661],"genre_scores_gemma":[0.9843145,0.000051974534,0.014320622,0.00044059847,0.00031885886,4.007984e-7,0.00001806511,0.000014380373,0.0005205831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969421,0.0003514769,0.0007032557,0.00037402887,0.0013683286,0.00026080295],"domain_scores_gemma":[0.99479824,0.0017447544,0.0016286336,0.00041200357,0.0012437899,0.00017255146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077846297,0.00030823832,0.0004888197,0.0020751478,0.00018988003,0.00011221349,0.0019858188,0.00018397102,0.00007209775],"category_scores_gemma":[0.00017318108,0.00023093722,0.00056700205,0.0012401044,0.0001603774,0.00041548457,0.0007290581,0.000636499,0.000013825659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017563411,0.00023119601,0.00019495595,0.0000504691,0.00045031827,0.00009665996,0.00015313536,0.4731354,0.00023905803,0.5156744,0.004531918,0.0050668176],"study_design_scores_gemma":[0.005711794,0.0018195877,0.025011586,0.0018774823,0.0003760353,0.00044967997,0.00025169572,0.08008636,0.0029531827,0.8540021,0.025843209,0.001617297],"about_ca_topic_score_codex":0.000005213463,"about_ca_topic_score_gemma":8.16862e-7,"teacher_disagreement_score":0.77838904,"about_ca_system_score_codex":0.00032407633,"about_ca_system_score_gemma":0.0009796593,"threshold_uncertainty_score":0.9417347},"labels":[],"label_agreement":null},{"id":"W24923158","doi":"","title":"Fano Quads in Projective Planes.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fano plane; Mathematics; Projective plane; Combinatorics; Projective test; Geometry; Pure mathematics; Correlation","score_opus":0.00976827051311515,"score_gpt":0.23745950386733644,"score_spread":0.22769123335422128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24923158","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.9818617,0.000095304014,0.0018763022,0.00037225024,0.00085932,0.00019054636,0.0000010379757,0.00010510577,0.01463845],"genre_scores_gemma":[0.9973165,0.000009933622,0.0016778266,0.00017049452,0.000010226731,0.000019933139,0.0000077273035,0.000004062366,0.0007833294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991684,0.00006268762,0.00015164874,0.000257674,0.00019175024,0.00016782942],"domain_scores_gemma":[0.9996164,0.000068218535,0.000026834132,0.00020662889,0.00003882834,0.000043112104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018194983,0.000085875574,0.00009671707,0.000120618395,0.00006102268,0.000066351924,0.00030677984,0.00004404406,0.00007167401],"category_scores_gemma":[0.00001664541,0.0000883291,0.000025422109,0.0006682253,0.000013688333,0.00034513028,0.000038264126,0.000096281954,0.00018131359],"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.00001759338,0.00017563388,0.0018279295,0.00000513297,0.0000074936215,0.000025425803,0.0010076965,0.0014513916,0.00010969181,0.91673714,0.0014349326,0.07719994],"study_design_scores_gemma":[0.0016911046,0.00031036648,0.06168868,0.000026874775,0.0000035560745,0.00003571146,0.000029373256,0.06301341,0.0022415498,0.85157466,0.01895504,0.00042964765],"about_ca_topic_score_codex":0.000048417132,"about_ca_topic_score_gemma":0.000011609646,"teacher_disagreement_score":0.0767703,"about_ca_system_score_codex":0.00005061335,"about_ca_system_score_gemma":0.00007734791,"threshold_uncertainty_score":0.3601956},"labels":[],"label_agreement":null},{"id":"W2506792106","doi":"10.4230/lipics.socg.2016.28","title":"Two Approaches to Building Time-Windowed Geometric Data Structures","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ackermann function; Mathematics; Combinatorics; Intersection (aeronautics); Algorithm; Convex hull; Time complexity; Sequence (biology); Computational geometry; Binary logarithm; Data structure; Discrete mathematics; Computer science; Inverse; Regular polygon; Geometry","score_opus":0.10465413543093907,"score_gpt":0.28717925870178046,"score_spread":0.1825251232708414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506792106","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.074722655,0.000043592387,0.920981,0.0008831079,0.00065835816,0.000841681,0.00036935823,0.00021256931,0.0012876994],"genre_scores_gemma":[0.6774864,0.0000070536526,0.32007346,0.0009903387,0.00038927986,0.00006269259,0.0004619161,0.000029263232,0.0004996043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972425,0.000047192374,0.0008453709,0.0005337889,0.0006631923,0.0006679509],"domain_scores_gemma":[0.99728626,0.00036262342,0.0003044791,0.001553288,0.00019986824,0.00029346973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089397834,0.00034911692,0.00035456716,0.0008754652,0.00036764875,0.0005724386,0.0027126693,0.000116648225,0.00003934642],"category_scores_gemma":[0.00035522637,0.0002569153,0.000119924036,0.0013089305,0.000053618824,0.0030408755,0.0016025066,0.00015984698,0.00029718512],"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.00016212427,0.00037232062,0.0026598757,0.00029542012,0.000395787,0.000007174871,0.003082167,0.008179816,0.0020373086,0.15309162,0.030274497,0.7994419],"study_design_scores_gemma":[0.009811664,0.0007610759,0.007737921,0.00028717975,0.00010248694,0.0002256638,0.00022948152,0.6127625,0.020585515,0.019969145,0.32503086,0.0024965191],"about_ca_topic_score_codex":0.0000050559433,"about_ca_topic_score_gemma":0.0000033336448,"teacher_disagreement_score":0.79694533,"about_ca_system_score_codex":0.00012001284,"about_ca_system_score_gemma":0.000117071846,"threshold_uncertainty_score":0.9999883},"labels":[],"label_agreement":null},{"id":"W2507315201","doi":"10.1016/j.aam.2015.10.003","title":"Characterizing 2-crossing-critical graphs","year":2015,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Mathematics; Subdivision; Combinatorics; Crossing number (knot theory); Chordal graph; Indifference graph; Pathwidth; 1-planar graph; Clique-sum; Planar graph; Discrete mathematics; Graph; Line graph","score_opus":0.02771898456671913,"score_gpt":0.3079163636321328,"score_spread":0.2801973790654137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507315201","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.008134116,0.00041360923,0.9760109,0.0002532459,0.00037663578,0.000113134585,7.752427e-7,0.00010304542,0.0145945465],"genre_scores_gemma":[0.49770004,0.0000118217495,0.50203884,0.00016476373,0.000038388287,0.000020207755,0.0000025133102,0.000004911546,0.000018520706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990593,0.000009955403,0.0002556576,0.00021612264,0.0002645583,0.00019440115],"domain_scores_gemma":[0.9993244,0.00024449153,0.00006249416,0.00023717586,0.00004704129,0.00008439522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033869364,0.00010240189,0.00014169193,0.00011839484,0.000075728654,0.00018032914,0.0003145963,0.000035637982,0.0000022842016],"category_scores_gemma":[0.00015554692,0.00009948188,0.00002189589,0.00047314956,0.00006843721,0.00049806345,0.00010735531,0.000093024704,0.000048335733],"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.0000021530313,0.000081890015,0.000026543445,0.000039424547,0.0000010392954,0.000003800441,0.0010979582,0.0007600993,0.0007557267,0.9633163,0.00003133835,0.033883724],"study_design_scores_gemma":[0.00031976867,0.000027238744,0.00007110572,0.000033699667,0.0000023984226,0.000020325882,0.00014161675,0.06130704,0.0033249625,0.92271566,0.011838514,0.00019766121],"about_ca_topic_score_codex":3.2083898e-7,"about_ca_topic_score_gemma":0.000001660921,"teacher_disagreement_score":0.4895659,"about_ca_system_score_codex":0.000034173794,"about_ca_system_score_gemma":0.000062548825,"threshold_uncertainty_score":0.40567532},"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":"W2514202683","doi":"10.1002/rsa.20246","title":"Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Rectangle; Vertex (graph theory); Upper and lower bounds; Binary logarithm; Delaunay triangulation; Graph; Discrete mathematics; General position; Geometry","score_opus":0.0134014026243379,"score_gpt":0.2381435086761491,"score_spread":0.22474210605181122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514202683","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.8033941,0.00073774706,0.19396842,0.0011329692,0.00011806835,0.00036490752,0.000009592407,0.000024226425,0.00024999428],"genre_scores_gemma":[0.929836,0.00007205169,0.06976404,0.00024950766,0.000038230482,0.000010685239,0.000007130064,0.000003411123,0.000018939438],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991209,0.00008943044,0.00017361631,0.0002211309,0.00026017026,0.00013476271],"domain_scores_gemma":[0.99948275,0.00019359637,0.000055135966,0.0001790357,0.000044058834,0.000045419743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023326805,0.000105170635,0.00017239734,0.0001446761,0.00011877565,0.00003831528,0.00022157599,0.000028672048,0.00000390916],"category_scores_gemma":[0.000024360694,0.00006078851,0.00003097231,0.00046279468,0.00004372784,0.00010987521,0.00004008383,0.00008172893,5.108711e-7],"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.004887224,0.00039506037,0.0068903696,0.0001546827,0.00033642037,0.0010066908,0.056935005,0.15973113,0.005255861,0.32490307,0.008433258,0.43107122],"study_design_scores_gemma":[0.029999359,0.003200731,0.53482395,0.00018250737,0.000053942564,0.0052249064,0.0008162324,0.10599192,0.009389781,0.3033954,0.005414012,0.0015072256],"about_ca_topic_score_codex":0.000067224835,"about_ca_topic_score_gemma":0.000054983,"teacher_disagreement_score":0.5279336,"about_ca_system_score_codex":0.000006258085,"about_ca_system_score_gemma":0.000032105138,"threshold_uncertainty_score":0.24788834},"labels":[],"label_agreement":null},{"id":"W2518021572","doi":"10.1007/978-3-319-48749-6_28","title":"Algorithms for Colourful Simplicial Depth and Medians in the Plane","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Computer science; Plane (geometry); Artificial intelligence; Algorithm; Mathematics; Geometry","score_opus":0.0235490393444052,"score_gpt":0.2688589088595855,"score_spread":0.24530986951518033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518021572","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.00019949413,0.00024546497,0.9935677,0.0034068206,0.0010471344,0.00057490275,0.000014375609,0.00003496184,0.0009091689],"genre_scores_gemma":[0.32509622,0.00012188927,0.6622265,0.008650926,0.0031973405,0.00010259831,0.000035379242,0.000045102588,0.00052405207],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977955,0.0000360056,0.00032969107,0.0008617387,0.00057497574,0.00040205513],"domain_scores_gemma":[0.99770087,0.001493973,0.0001397544,0.00045981602,0.00012717003,0.00007842264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010633935,0.00027798745,0.00027579642,0.0005120435,0.00021105299,0.0003281836,0.0015316793,0.0001830512,0.0000035907037],"category_scores_gemma":[0.00010249422,0.00018881977,0.000055125503,0.00038093684,0.0003004736,0.0003084488,0.00034103479,0.00028599674,0.000006395488],"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.000006967289,0.00001570517,0.000031035772,0.000014622515,0.000004132813,0.00002266634,0.00087211584,0.0053439415,0.00005724461,0.052232303,0.000054470005,0.9413448],"study_design_scores_gemma":[0.0007266205,0.00037839828,0.0010239922,0.00016927555,0.0000075814164,0.0001523488,5.350537e-7,0.48389307,0.00040567585,0.5035559,0.009113798,0.000572831],"about_ca_topic_score_codex":0.000008657304,"about_ca_topic_score_gemma":0.00035560393,"teacher_disagreement_score":0.94077194,"about_ca_system_score_codex":0.00010024615,"about_ca_system_score_gemma":0.00033968603,"threshold_uncertainty_score":0.76998466},"labels":[],"label_agreement":null},{"id":"W2519341008","doi":"10.1016/j.advengsoft.2016.09.003","title":"Parallel meshing of surfaces represented by collections of connected regions","year":2016,"lang":"en","type":"article","venue":"Advances in Engineering Software","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":"Polytechnique Montréal","funders":"Polytechnique Montréal","keywords":"Computer science; CAD; Parametric statistics; Process (computing); Surface (topology); Computer Aided Design; Geometric shape; Scaling; Geometric primitive; Parallel computing; Theoretical computer science; Computational science; Engineering drawing; Computer graphics (images); Mathematics; Operating system; Geometry; Engineering","score_opus":0.006487470396559283,"score_gpt":0.2287943342317139,"score_spread":0.2223068638351546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519341008","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.019612862,0.0015733597,0.97827286,0.00012112706,0.0001960081,0.00007527385,0.000011452658,0.00009471998,0.000042315158],"genre_scores_gemma":[0.85491496,0.00031151605,0.14450361,0.000005996828,0.000011255357,0.000014032237,0.000004823994,0.0000056763197,0.00022812985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932486,0.00002035754,0.00023423198,0.00017271505,0.00013538999,0.0001124518],"domain_scores_gemma":[0.9990546,0.0005359533,0.00008719047,0.00019628268,0.000099429395,0.00002651587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009608746,0.000072077106,0.00013266536,0.00016992111,0.000030979336,0.00000841957,0.00021527061,0.000029755935,0.0000041510248],"category_scores_gemma":[0.0005068681,0.00006161688,0.000030712054,0.00091395876,0.000022039063,0.0004992623,0.000048587,0.000040935043,4.966759e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008466198,0.00006036192,0.0022391859,0.00006213837,0.000017903787,0.0000016657623,0.00019673197,0.95818985,0.01631451,0.014459326,0.00064028456,0.00780956],"study_design_scores_gemma":[0.0056726295,0.00064875704,0.015926342,0.002243262,0.000035830515,0.00005884991,0.00015719497,0.6217241,0.25697255,0.033220567,0.061701737,0.0016381661],"about_ca_topic_score_codex":0.000009526186,"about_ca_topic_score_gemma":0.000013013819,"teacher_disagreement_score":0.8353021,"about_ca_system_score_codex":0.000024738512,"about_ca_system_score_gemma":0.000026806125,"threshold_uncertainty_score":0.25126633},"labels":[],"label_agreement":null},{"id":"W2526563325","doi":"10.1007/978-3-319-51963-0_22","title":"Order-Preserving 1-String Representations of Planar Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Planar; Planar graph; String (physics); Embedding; Order (exchange); Planar straight-line graph; Vertex (graph theory); Book embedding; Combinatorics; Representation (politics); Computer science; Mathematics; 1-planar graph; Graph; Discrete mathematics; Chordal graph; Artificial intelligence; Computer graphics (images)","score_opus":0.027727110953595892,"score_gpt":0.28101395773025223,"score_spread":0.25328684677665636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526563325","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.0001775588,0.0003499892,0.99076873,0.000554281,0.0012994163,0.00025409673,0.000007835872,0.0000706185,0.0065174703],"genre_scores_gemma":[0.21126623,0.00008552865,0.786789,0.00030658525,0.0003968253,0.0000099976205,0.000025287958,0.000026607382,0.0010939584],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971116,0.000030665673,0.00051614887,0.0010502408,0.000924274,0.00036707538],"domain_scores_gemma":[0.9967456,0.00048376987,0.0005093976,0.0016461014,0.0004999046,0.00011523392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070699456,0.00031277174,0.0003930973,0.0010823528,0.0004398789,0.00043668287,0.0033580572,0.0001829739,0.000018346873],"category_scores_gemma":[0.0002925138,0.00031634813,0.0001177266,0.0005019071,0.00040052764,0.00086951413,0.001005003,0.0004288872,0.0000119827755],"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.0000064919773,0.000036683276,0.0002335904,0.00007500838,0.000029077839,0.00005608892,0.000808531,0.2135431,0.00070732855,0.2506227,0.000084591666,0.53379685],"study_design_scores_gemma":[0.00026022596,0.00009575631,0.00079109997,0.0003514673,0.000010113353,0.00004409446,2.1630605e-7,0.382925,0.003169987,0.6108836,0.0010054508,0.0004629745],"about_ca_topic_score_codex":0.000064797925,"about_ca_topic_score_gemma":0.00012513346,"teacher_disagreement_score":0.53333384,"about_ca_system_score_codex":0.000085756015,"about_ca_system_score_gemma":0.00057665515,"threshold_uncertainty_score":0.99992883},"labels":[],"label_agreement":null},{"id":"W2527059408","doi":"10.48550/arxiv.1512.01485","title":"Flips in Edge-Labelled Pseudo-Triangulations","year":2015,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Convex hull; Combinatorics; Enhanced Data Rates for GSM Evolution; Triangulation; Regular polygon; Point set triangulation; Mathematics; Minimum-weight triangulation; Plane (geometry); Set (abstract data type); Pitteway triangulation; Convex set; Delaunay triangulation; Geometry; Computer science; Constrained Delaunay triangulation; Artificial intelligence; Convex optimization","score_opus":0.10625454707519066,"score_gpt":0.1937744936716794,"score_spread":0.08751994659648873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527059408","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.41784298,0.00002090824,0.577901,0.00019538174,0.00025407242,0.00008558227,8.348093e-7,0.000071359944,0.0036278544],"genre_scores_gemma":[0.9930188,0.000005466501,0.004534989,0.00007355906,0.000056567373,4.003127e-7,0.0000069778134,0.000003539417,0.0022997227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992527,0.000081841994,0.00011117221,0.00032506383,0.000070056645,0.0001592122],"domain_scores_gemma":[0.9993506,0.00006887103,0.000048350255,0.0002805862,0.00012534119,0.00012624782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022995519,0.00008388565,0.00009272011,0.00027387045,0.0000745876,0.000043608932,0.0003771552,0.00004843401,0.000013988587],"category_scores_gemma":[0.0000467379,0.00009904449,0.000037776037,0.0015113729,0.00002248732,0.0005683332,0.00013441718,0.00008120763,0.00016577907],"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.000014148462,0.00008621671,0.0023681365,0.0000021947735,0.000007851164,0.00006177359,0.00033117904,0.47801524,0.000081379876,0.5166186,0.0008095725,0.0016036958],"study_design_scores_gemma":[0.0010442188,0.000038841346,0.0034599612,0.0000054135353,0.000005237782,0.0000075005555,0.000060082508,0.9452439,0.00014566182,0.048372447,0.0014687271,0.00014803334],"about_ca_topic_score_codex":0.000032294665,"about_ca_topic_score_gemma":0.00006024553,"teacher_disagreement_score":0.57517576,"about_ca_system_score_codex":0.00010378984,"about_ca_system_score_gemma":0.00014457104,"threshold_uncertainty_score":0.4038917},"labels":[],"label_agreement":null},{"id":"W2528943235","doi":"10.1007/978-3-319-62127-2_13","title":"A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Outerplanar graph; Embedding; Planar graph; Planar; Pathwidth; Book embedding; Graph drawing; Combinatorics; Graph; 1-planar graph; Mathematics; Computer science; Discrete mathematics; Chordal graph; Algorithm; Line graph; Computer graphics (images); Artificial intelligence","score_opus":0.020402876010075607,"score_gpt":0.25669733454168014,"score_spread":0.23629445853160452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528943235","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.00004536732,0.00048409775,0.99472296,0.0015940194,0.0016378625,0.00062900997,0.000012347819,0.000045289067,0.0008290564],"genre_scores_gemma":[0.21365717,0.00006865051,0.78338975,0.000992002,0.0009507368,0.00005158284,0.000030240897,0.000031984328,0.0008279065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976263,0.000018653847,0.0004498538,0.0008344455,0.0007326443,0.00033811308],"domain_scores_gemma":[0.9971052,0.00072916533,0.00052818103,0.0011630638,0.0004061122,0.00006828302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010541251,0.00031097082,0.00035355712,0.000557673,0.0005545114,0.00049416546,0.0029332275,0.00017612244,0.0000056793137],"category_scores_gemma":[0.00013133213,0.00023293776,0.00018256374,0.00023116967,0.00049283175,0.00061682303,0.0005328725,0.00029150702,0.0000053394624],"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.000014486365,0.000024348157,0.000014541388,0.00006625907,0.00002481635,0.0000057705224,0.00072606653,0.0566255,0.00020414079,0.119082205,0.000083918785,0.8231279],"study_design_scores_gemma":[0.00024465827,0.00013966995,0.00017974491,0.00014236842,0.000013465424,0.000027490069,1.04447786e-7,0.65151566,0.0020671366,0.3421282,0.0032613154,0.00028018633],"about_ca_topic_score_codex":0.000013309776,"about_ca_topic_score_gemma":0.00003260675,"teacher_disagreement_score":0.8228478,"about_ca_system_score_codex":0.000078124816,"about_ca_system_score_gemma":0.00039760777,"threshold_uncertainty_score":0.94989264},"labels":[],"label_agreement":null},{"id":"W2529424610","doi":"10.1007/s10474-017-0777-4","title":"Improved bounds on the diameter of lattice polytopes","year":2017,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","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":"McMaster University","funders":"","keywords":"Polytope; Conjecture; Minkowski addition; Lattice (music); Integer (computer science); Ranging","score_opus":0.031123627567095146,"score_gpt":0.28409984229580226,"score_spread":0.2529762147287071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529424610","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.1393985,0.00012388399,0.76407963,0.060326617,0.0018043182,0.00096746435,0.000016810962,0.000200413,0.03308238],"genre_scores_gemma":[0.95863116,0.0000097582315,0.03811962,0.0008258388,0.000099963814,0.00002592842,0.0000017824907,0.0000109351695,0.0022750243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802476,0.00009949384,0.00041531204,0.00046012193,0.00064544025,0.00035485503],"domain_scores_gemma":[0.99691784,0.0006952145,0.0005380442,0.0015970124,0.00014199661,0.00010989046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016810634,0.0001857648,0.00024095064,0.00016113567,0.0010674143,0.00069605064,0.0031060108,0.00012400237,0.000065883105],"category_scores_gemma":[0.0014260863,0.00012302793,0.00013816789,0.00035259014,0.00030357405,0.00087756326,0.00055382506,0.00035854045,0.00007213053],"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.000017522867,0.00036086302,0.00014529137,0.000092402704,0.00012195732,0.0000027260053,0.001994358,0.00007574383,0.09764918,0.86758816,0.015659079,0.016292697],"study_design_scores_gemma":[0.0011070024,0.0004367875,0.015111492,0.00027672466,0.00012760866,0.00004224886,0.00015977431,0.46422657,0.30781433,0.18701379,0.02266788,0.001015765],"about_ca_topic_score_codex":0.0000056468825,"about_ca_topic_score_gemma":0.0000018832262,"teacher_disagreement_score":0.81923264,"about_ca_system_score_codex":0.000027685406,"about_ca_system_score_gemma":0.000093670926,"threshold_uncertainty_score":0.82097954},"labels":[],"label_agreement":null},{"id":"W2543706324","doi":"10.19086/da.3118","title":"Rank bounds for design matrices with block entries and geometric applications","year":2018,"lang":"en","type":"preprint","venue":"Discrete Analysis","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Collinearity; Combinatorics; Linear subspace; Rank (graph theory); Upper and lower bounds; Matrix (chemical analysis); Scalar (mathematics); Scaling; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.017316600514636328,"score_gpt":0.26982399291258624,"score_spread":0.2525073923979499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543706324","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.0032317366,0.001904662,0.9934852,0.00040483894,0.000057499918,0.0006805191,0.000056125835,0.00008619323,0.000093210736],"genre_scores_gemma":[0.55460656,0.00033855232,0.44310683,0.000098961464,0.00028304112,0.0007112085,0.00041081107,0.000014483814,0.00042955045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982408,0.00007163652,0.00031345387,0.00079604826,0.00035370735,0.00022433819],"domain_scores_gemma":[0.9980805,0.00045073684,0.00030663615,0.0006307251,0.00042742566,0.0001039997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047567615,0.00024443373,0.00040860992,0.001582386,0.00034455286,0.0007602458,0.0005964204,0.00011915813,0.000009990924],"category_scores_gemma":[0.000050277657,0.00020528688,0.00021195333,0.0040226285,0.00007957464,0.00021292787,0.00037886386,0.00011157575,0.00000614836],"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.00018224193,0.00024209725,0.005369647,0.000600842,0.012033636,0.000006771534,0.0013675657,0.88919014,0.000087297056,0.023764629,0.0036559554,0.06349918],"study_design_scores_gemma":[0.00050711527,0.00022266217,0.0029389255,0.000026747002,0.0038875204,0.000005350925,0.000035370238,0.9613285,0.0007277469,0.01939954,0.010190432,0.00073009543],"about_ca_topic_score_codex":0.00003156256,"about_ca_topic_score_gemma":0.000019107438,"teacher_disagreement_score":0.55137485,"about_ca_system_score_codex":0.000037255264,"about_ca_system_score_gemma":0.00015163595,"threshold_uncertainty_score":0.8371356},"labels":[],"label_agreement":null},{"id":"W2546323316","doi":"10.1007/978-3-319-48749-6_26","title":"Constrained Light Deployment for Reducing Energy Consumption in Buildings","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Computer science; Heuristics; Software deployment; Energy consumption; Set (abstract data type); Point (geometry); Radiosity (computer graphics); Mathematical optimization; Illuminance; Binary number; Algorithm; Computer graphics (images); Mathematics; Optics; Geometry","score_opus":0.018805740040696635,"score_gpt":0.25366861615622266,"score_spread":0.23486287611552603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546323316","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.00019100076,0.00043343156,0.9946286,0.0016970475,0.0016795461,0.00038796206,0.0000068366844,0.000098789926,0.00087678916],"genre_scores_gemma":[0.30674142,0.00012459973,0.6893295,0.0017911299,0.0009908513,0.00007441195,0.00001716443,0.00004514852,0.0008857534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969223,0.000030403944,0.00057883176,0.0013409948,0.00059902447,0.00052841933],"domain_scores_gemma":[0.99817467,0.00063069473,0.00027498693,0.0005767879,0.00021509765,0.00012775173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085152744,0.00038522546,0.00039121296,0.0011989094,0.00018725269,0.0003046639,0.0012400545,0.00023721252,0.000015865524],"category_scores_gemma":[0.00009290646,0.00034351044,0.00010995531,0.00041409716,0.0002465082,0.0005452725,0.00043158134,0.00023289707,0.000010392225],"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.000010396318,0.000023102222,0.000019079442,0.000028637618,0.000007212637,0.000015692216,0.00020238584,0.026887441,0.00210938,0.17704055,0.00003323603,0.7936229],"study_design_scores_gemma":[0.0012200365,0.00029924614,0.00009863609,0.0011175043,0.000009998839,0.00009928834,1.15656675e-7,0.622686,0.022263316,0.34065935,0.010532908,0.0010135625],"about_ca_topic_score_codex":0.000009251296,"about_ca_topic_score_gemma":0.00005147903,"teacher_disagreement_score":0.79260933,"about_ca_system_score_codex":0.00043595684,"about_ca_system_score_gemma":0.00047865717,"threshold_uncertainty_score":0.9999017},"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":"W2560740612","doi":"10.1007/978-3-319-62127-2_26","title":"Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut","year":2017,"lang":"en","type":"article","venue":"Lecture notes in computer science","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":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Tree (set theory); Intersection (aeronautics); Point (geometry); Line (geometry); Line segment; Plane (geometry); Euclidean distance; Euclidean geometry; Segment tree; Geometry; Tree structure; Interval tree; Binary tree","score_opus":0.017658719862367632,"score_gpt":0.252401500185542,"score_spread":0.2347427803231744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560740612","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.07312826,0.00006822516,0.9218404,0.003943818,0.00064690615,0.00020740899,4.3449162e-7,0.000056316287,0.000108233464],"genre_scores_gemma":[0.6128812,0.0000011292484,0.38620672,0.0007306979,0.00016069457,0.000010308068,4.6452993e-7,0.000003974786,0.00000481728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980018,0.000059968403,0.00022023357,0.0006863637,0.00058820174,0.00044341126],"domain_scores_gemma":[0.99805564,0.00037145446,0.00019271651,0.0011513601,0.00014994411,0.00007888965],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010063547,0.00017863052,0.00017482306,0.00019930537,0.0011881965,0.0020710663,0.0027768943,0.000040034614,0.0000030530446],"category_scores_gemma":[0.0002146284,0.000114197326,0.000046640722,0.00052863365,0.0004089785,0.001167587,0.0008262883,0.00021167233,0.0000063035795],"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.0000070934384,0.000035835303,0.007824129,0.0000052331366,0.000008265786,0.000029876526,0.002215244,0.038087964,0.0012838548,0.00074244814,0.000018393148,0.94974166],"study_design_scores_gemma":[0.00039534847,0.00013901107,0.022128204,0.00006143817,0.0000052287687,0.000077898,0.0000017195415,0.953784,0.012634312,0.010271203,0.00024128004,0.0002603842],"about_ca_topic_score_codex":0.000042010717,"about_ca_topic_score_gemma":0.00018598253,"teacher_disagreement_score":0.94948125,"about_ca_system_score_codex":0.000056232126,"about_ca_system_score_gemma":0.00019582905,"threshold_uncertainty_score":0.9989649},"labels":[],"label_agreement":null},{"id":"W2561495450","doi":"10.4230/lipics.socg.2015.141","title":"1-String B_2-VPG Representation of Planar Graphs","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Planar; Planar graph; String (physics); Combinatorics; Representation (politics); Graph; Enhanced Data Rates for GSM Evolution; Mathematics; Grid; Computer science; Topology (electrical circuits); Geometry; Artificial intelligence; Computer graphics (images)","score_opus":0.04353341120342063,"score_gpt":0.28724107464332505,"score_spread":0.2437076634399044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561495450","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.19915068,0.000053228887,0.7962811,0.0002953907,0.0010082589,0.0005469227,0.00009088284,0.00013191791,0.0024416354],"genre_scores_gemma":[0.88807654,0.000015450798,0.110661775,0.00040638444,0.00012218206,0.000046239675,0.00045182966,0.000015524589,0.00020408002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979429,0.00004016804,0.0008629545,0.0002187806,0.00059424253,0.00034090024],"domain_scores_gemma":[0.9982102,0.00013087723,0.0004373259,0.000518225,0.00051212794,0.00019127582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055116107,0.000203015,0.00028822164,0.00039475402,0.00014047135,0.00019029477,0.0006823054,0.000108300585,0.0000050373465],"category_scores_gemma":[0.00015938898,0.00019700233,0.00015643709,0.0007548511,0.000051245497,0.0018026266,0.00017864039,0.00015286396,0.000041119376],"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.00033951056,0.0008148044,0.019993145,0.00072752865,0.0004298875,0.000012951855,0.03286175,0.027670767,0.0009831664,0.774812,0.03970365,0.10165088],"study_design_scores_gemma":[0.011556359,0.0013806777,0.007373625,0.00029776787,0.00010296928,0.00023156707,0.00331607,0.75579476,0.03816139,0.09228188,0.08788257,0.0016203667],"about_ca_topic_score_codex":0.000020556094,"about_ca_topic_score_gemma":0.0000073035403,"teacher_disagreement_score":0.728124,"about_ca_system_score_codex":0.0000675624,"about_ca_system_score_gemma":0.00012428945,"threshold_uncertainty_score":0.8033522},"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":"W2564857307","doi":"10.1007/978-3-319-62127-2_14","title":"Splitting $$B_2$$-VPG Graphs into Outer-String and Co-Comparability Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Combinatorics; Split graph; Clique; Block graph; String (physics); Mathematics; Chordal graph; Clique problem; Discrete mathematics; Graph; Computer science; 1-planar graph","score_opus":0.0228393778805869,"score_gpt":0.2803910063874737,"score_spread":0.25755162850688684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564857307","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.006691054,0.0007009549,0.988095,0.00062086154,0.0016998535,0.00042820215,0.0000054930942,0.00016632164,0.0015922451],"genre_scores_gemma":[0.6975502,0.000064622356,0.3012011,0.00060097524,0.00033961513,0.00001087374,0.00001784774,0.000025427064,0.00018932627],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955593,0.00006208664,0.0006817849,0.0020382681,0.0010214518,0.00063714624],"domain_scores_gemma":[0.9966196,0.00061836053,0.00050788966,0.0016642906,0.00031830365,0.00027157646],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016947979,0.0006071711,0.0006446746,0.0011173029,0.001045427,0.001481477,0.0027598047,0.00030053873,0.0000080350355],"category_scores_gemma":[0.0001890171,0.0005961719,0.00017418299,0.00039480187,0.0009720625,0.0011841711,0.0013738897,0.0008072972,0.000023120474],"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.0000092465225,0.00003817164,0.0011125876,0.00010464946,0.000022894912,0.000069483205,0.0012645666,0.0147260465,0.00029793172,0.100799166,0.000026247557,0.88152903],"study_design_scores_gemma":[0.00037211872,0.00014652529,0.0024971021,0.00031626428,0.0000118310545,0.00011207172,2.9381437e-7,0.26200187,0.0014047085,0.73059547,0.0017176351,0.00082410907],"about_ca_topic_score_codex":0.000049613092,"about_ca_topic_score_gemma":0.00009786643,"teacher_disagreement_score":0.8807049,"about_ca_system_score_codex":0.00018851638,"about_ca_system_score_gemma":0.00042278453,"threshold_uncertainty_score":0.999649},"labels":[],"label_agreement":null},{"id":"W2566564112","doi":"10.1007/s00453-016-0263-3","title":"Geometric Path Problems with Violations","year":2016,"lang":"en","type":"article","venue":"Algorithmica","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":"Combinatorics; Path (computing); Simple polygon; Mathematics; Polygon (computer graphics); Shortest path problem; Longest path problem; Vertex (graph theory); Intersection (aeronautics); Discrete mathematics; Geometry; Monotone polygon; Computer science; Graph","score_opus":0.009575151748726621,"score_gpt":0.2029150373385475,"score_spread":0.19333988558982088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566564112","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.0066264635,0.00006857611,0.9902621,0.0015149812,0.00014514218,0.0001230033,0.000003957136,0.00013527187,0.0011204939],"genre_scores_gemma":[0.8433029,0.0000116402825,0.15550739,0.00014011649,0.00012534922,0.000028300354,0.0000048484094,0.000006403457,0.00087306014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999152,0.00002604803,0.0001295333,0.00027302065,0.0002432917,0.00017610485],"domain_scores_gemma":[0.99933857,0.00013036924,0.0000555831,0.00026557536,0.00013564766,0.00007428649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012411988,0.00008751807,0.00007678601,0.0002359627,0.00011368669,0.000066828885,0.00028449408,0.00002872657,0.000037031943],"category_scores_gemma":[0.000029335004,0.000052619587,0.000026476442,0.0011868007,0.000021826823,0.0004620179,0.00006633334,0.00003914288,0.00013900897],"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.0000023825926,0.00006412258,0.0004267962,0.0000037490593,0.000020109997,0.0000055678547,0.00006286065,0.00056987145,0.0013766644,0.031443115,0.0010341413,0.9649906],"study_design_scores_gemma":[0.007017518,0.0025776841,0.15211397,0.00037150033,0.00007607592,0.00057113933,0.000031948122,0.3868539,0.042959105,0.09931145,0.30535597,0.0027597202],"about_ca_topic_score_codex":0.0000056005083,"about_ca_topic_score_gemma":0.0000019669856,"teacher_disagreement_score":0.9622309,"about_ca_system_score_codex":0.000032570588,"about_ca_system_score_gemma":0.00007018574,"threshold_uncertainty_score":0.21457645},"labels":[],"label_agreement":null},{"id":"W2566851301","doi":"10.1007/s00454-018-0001-5","title":"On Planar Greedy Drawings of 3-Connected Planar Graphs","year":2018,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"H2020 Marie Skłodowska-Curie Actions; Ministero dell’Istruzione, dell’Università e della Ricerca; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Planar straight-line graph; Greedy algorithm; Embedding; Conjecture; Discrete mathematics; Graph; Pathwidth; Computer science; Line graph; Algorithm","score_opus":0.012167746225320412,"score_gpt":0.2531643707748612,"score_spread":0.2409966245495408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566851301","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.35228318,0.00007398011,0.6429672,0.00055340416,0.0006232118,0.00019185306,0.00005260311,0.00016065917,0.0030938806],"genre_scores_gemma":[0.9504847,0.0000027524434,0.047937285,0.00094191695,0.00020234231,0.0000103777975,0.00025813,0.000017101387,0.00014542793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974353,0.00010686596,0.0005466191,0.0006339664,0.0009235764,0.00035368413],"domain_scores_gemma":[0.99793124,0.0006565021,0.00028777224,0.0004152754,0.0005436895,0.0001655372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037396248,0.00027350476,0.00030817193,0.0009973727,0.00030073014,0.00011913014,0.0007655464,0.00010454372,0.00011524708],"category_scores_gemma":[0.00017598062,0.00026912594,0.00016134341,0.0023170037,0.00018729553,0.0004646705,0.000095255644,0.000178404,0.00018804119],"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.00009829587,0.00018210166,0.001008771,0.00003256095,0.00012790888,0.000014837902,0.00056021183,0.02921388,0.0010638705,0.9531603,0.0049803024,0.0095569845],"study_design_scores_gemma":[0.0018889381,0.0016484229,0.11115588,0.00013033536,0.000035617206,0.00007657907,0.00007313177,0.30324826,0.0042844643,0.5739875,0.0025810215,0.00088984787],"about_ca_topic_score_codex":0.00003047026,"about_ca_topic_score_gemma":0.000006065543,"teacher_disagreement_score":0.5982015,"about_ca_system_score_codex":0.00004745646,"about_ca_system_score_gemma":0.00015383323,"threshold_uncertainty_score":0.9999761},"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":"W2569250480","doi":"10.4230/lipics.stacs.2011.637","title":"Bounds on the maximum multiplicity of some common geometric graphs","year":2011,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"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; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Combinatorics; General position; Mathematics; Omega; Upper and lower bounds; Spanning tree; Multiplicity (mathematics); Regular polygon; Discrete mathematics; Geometry; Physics","score_opus":0.03768576974394765,"score_gpt":0.2456183393488825,"score_spread":0.20793256960493484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569250480","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.696433,0.000055669505,0.2956238,0.0003050222,0.0011073181,0.0010102588,0.00016024023,0.00014385434,0.0051607913],"genre_scores_gemma":[0.98478264,0.000020881105,0.013575757,0.0012909378,0.000064563275,0.000070531554,0.00009339008,0.000015498184,0.00008581751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977914,0.000056557405,0.00088756287,0.00023042534,0.0005832327,0.00045080425],"domain_scores_gemma":[0.99793106,0.00035667297,0.00049159554,0.00082858355,0.00026681882,0.00012525046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008042128,0.00027869488,0.0003272084,0.0006448831,0.0003820338,0.00017514001,0.001349046,0.00013116487,0.00002803477],"category_scores_gemma":[0.00011794932,0.0002055245,0.00025593973,0.00118095,0.000120199744,0.0012418722,0.00034990278,0.00028813217,0.00008135087],"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.00024211635,0.0016315384,0.009684219,0.00041649674,0.00034615144,0.000004712167,0.014898476,0.0012201165,0.00023520585,0.87217665,0.006748535,0.09239577],"study_design_scores_gemma":[0.009097673,0.0038166917,0.07798162,0.00037529544,0.00014974618,0.00013127667,0.0017097398,0.50564927,0.08427462,0.2593086,0.054990448,0.0025150098],"about_ca_topic_score_codex":0.000033863627,"about_ca_topic_score_gemma":0.000008575521,"teacher_disagreement_score":0.6128681,"about_ca_system_score_codex":0.000058004316,"about_ca_system_score_gemma":0.000060962928,"threshold_uncertainty_score":0.8381046},"labels":[],"label_agreement":null},{"id":"W2569916680","doi":"","title":"The Tight Span of a Diversity: Hyperconvexity and injective envelopes for a natural class of multi-way metrics","year":2010,"lang":"en","type":"article","venue":"arXiv (Cornell University)","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":"Simon Fraser University","funders":"","keywords":"Injective function; Metric (unit); Span (engineering); Envelope (radar); Mathematics; Class (philosophy); Diversity (politics); Pure mathematics; Discrete mathematics; Computer science; Artificial intelligence; Engineering; Structural engineering; Sociology","score_opus":0.062464276095002144,"score_gpt":0.19764962130736546,"score_spread":0.1351853452123633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569916680","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.6723749,0.00003564805,0.32712457,0.000054764423,0.00020958346,0.00011799427,0.0000053823096,0.000011919112,0.00006526013],"genre_scores_gemma":[0.99205065,0.000024237761,0.007593317,0.000022527964,0.000016195028,2.647843e-7,0.000001726134,0.0000021135588,0.0002889625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994592,0.000039281065,0.000092074726,0.00023510636,0.000065681015,0.00010863822],"domain_scores_gemma":[0.9989101,0.00044458357,0.00011432676,0.00019338247,0.00029218209,0.0000454059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025940582,0.00007412051,0.00011017883,0.00016015088,0.00028808138,0.000020104653,0.0004000623,0.000048278234,0.0000013143076],"category_scores_gemma":[0.00014516733,0.00006329518,0.000058864953,0.00070958125,0.0001414729,0.00030165652,0.00040862322,0.00010787383,8.0132537e-7],"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.00014293051,0.00019966495,0.030232228,0.000064278436,0.00016400208,0.00000814277,0.001905107,0.0036591622,0.008562552,0.9338159,0.00013165071,0.021114375],"study_design_scores_gemma":[0.0011999998,0.00015344977,0.061837174,0.000007806689,0.000044474957,0.0000048746456,0.00020958716,0.9047611,0.0128590185,0.01766168,0.0010722813,0.00018858485],"about_ca_topic_score_codex":0.00004856837,"about_ca_topic_score_gemma":0.00016444961,"teacher_disagreement_score":0.9161542,"about_ca_system_score_codex":0.000017400014,"about_ca_system_score_gemma":0.000052693435,"threshold_uncertainty_score":0.25811026},"labels":[],"label_agreement":null},{"id":"W2569985645","doi":"10.5555/2627817.2627876","title":"The traveling salesman problem for lines, balls and planes","year":2013,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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 Calgary","funders":"","keywords":"Travelling salesman problem; Combinatorics; Plane (geometry); Approximation algorithm; Mathematics; Space (punctuation); Unit sphere; Set (abstract data type); Unit (ring theory); Mathematical optimization; Computer science; Geometry","score_opus":0.010092521598962808,"score_gpt":0.23692265881607769,"score_spread":0.22683013721711487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569985645","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.014720459,0.0005992151,0.95055485,0.029752493,0.0009035452,0.0015653642,0.000020709982,0.00019133011,0.0016920079],"genre_scores_gemma":[0.7271419,0.00048726823,0.26349747,0.0014342527,0.0013460394,0.00080235756,0.00013058822,0.00004436971,0.0051157395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898326,0.000038457612,0.00020934742,0.00032843952,0.00019770826,0.00024275863],"domain_scores_gemma":[0.99918044,0.00032709684,0.00007010253,0.00022869384,0.000108261294,0.00008541505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002587191,0.0001369896,0.0001037726,0.000044326825,0.00041456136,0.00045712106,0.00030383468,0.00004620096,0.0000021142637],"category_scores_gemma":[0.000016710692,0.000091956135,0.000045779758,0.00014917296,0.00003930018,0.00029645063,0.00007357028,0.00007285326,0.000024660267],"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.000042582014,0.00011150665,0.0001313875,0.000103656945,0.00012708052,0.000004501484,0.0015265222,0.015033221,0.016530868,0.41679764,0.01018079,0.53941023],"study_design_scores_gemma":[0.00066109444,0.0003999628,0.001644064,0.00003622319,0.000012145092,0.00002569154,0.00004472766,0.9145833,0.0040969467,0.049927175,0.02822927,0.00033939135],"about_ca_topic_score_codex":0.000023829289,"about_ca_topic_score_gemma":0.0000078006915,"teacher_disagreement_score":0.8995501,"about_ca_system_score_codex":0.000014241609,"about_ca_system_score_gemma":0.000036211426,"threshold_uncertainty_score":0.44080287},"labels":[],"label_agreement":null},{"id":"W2570381751","doi":"10.20382/jocg.v7i1a15","title":"Consistent labeling of rotating maps","year":2014,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.010345783404801747,"score_gpt":0.20170838760784748,"score_spread":0.19136260420304574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570381751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18375276,0.000081624705,0.81366503,0.00039386266,0.00039290474,0.00005220427,0.0000036422657,0.000019205707,0.001638757],"genre_scores_gemma":[0.74347496,0.000008930979,0.2560714,0.00013222807,0.00011939402,6.30131e-8,0.0000066130447,0.0000052331848,0.00018118277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982968,0.0001784094,0.00052034756,0.0001836657,0.00066060905,0.00016014228],"domain_scores_gemma":[0.99694836,0.0007049683,0.00079671305,0.00014598461,0.0012729666,0.00013099513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007259866,0.00012754298,0.00029527053,0.0012605783,0.00012961471,0.00005698608,0.0005834705,0.000056903984,0.000016929089],"category_scores_gemma":[0.00022228263,0.00013619389,0.00019241664,0.0015826962,0.00005392717,0.00063338876,0.00013740965,0.00018031076,0.0000063147063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042411746,0.00012005455,0.0014126272,0.000039540286,0.00011483271,0.000027706581,0.00020197296,0.7655404,0.0010106309,0.19327912,0.0004671215,0.037743535],"study_design_scores_gemma":[0.0075253756,0.0020396765,0.021619,0.00044411715,0.00021084661,0.00074625347,0.0005467769,0.80912673,0.005582871,0.08487305,0.066257656,0.0010276255],"about_ca_topic_score_codex":0.000004178057,"about_ca_topic_score_gemma":9.318351e-7,"teacher_disagreement_score":0.5597222,"about_ca_system_score_codex":0.00006949439,"about_ca_system_score_gemma":0.00024254029,"threshold_uncertainty_score":0.55538255},"labels":[],"label_agreement":null},{"id":"W2570731303","doi":"10.1007/s00454-015-9734-6","title":"On Triple Intersections of Three Families of Unit Circles","year":2015,"lang":"en","type":"article","venue":"Discrete & 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":"University of British Columbia","funders":"National Science Foundation","keywords":"Combinatorics; Conjecture; Mathematics; Unit (ring theory); Plane (geometry); Crossing number (knot theory); Unit circle; Geometry; Intersection (aeronautics)","score_opus":0.04075130836591756,"score_gpt":0.2811433365238591,"score_spread":0.24039202815794153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570731303","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.35700157,0.00009866878,0.6401569,0.00016103697,0.0004274159,0.00011317969,0.00003063901,0.00004617797,0.001964377],"genre_scores_gemma":[0.9711017,0.0000031540767,0.028515503,0.00010793598,0.000058895177,0.0000090084595,0.0001002571,0.000008882723,0.0000946604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825084,0.000076302305,0.00048462325,0.00031173776,0.0007091901,0.00016727974],"domain_scores_gemma":[0.9982876,0.0004246419,0.00025932363,0.00029182778,0.0006173119,0.000119266195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037310194,0.00015461125,0.00025412752,0.0008236253,0.00007850297,0.000039810428,0.0004793279,0.000058633144,0.000023186869],"category_scores_gemma":[0.00024307735,0.0001548839,0.00012888975,0.0017766173,0.00010541731,0.00034964434,0.0001608553,0.00011811734,0.000026915404],"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.000055951783,0.00019689946,0.0024562443,0.00003283681,0.00008147076,0.0000022566926,0.00058447424,0.6493493,0.00022184139,0.32962668,0.00091702206,0.016475031],"study_design_scores_gemma":[0.0018739313,0.001017807,0.1104713,0.00010003084,0.000030090861,0.000025660062,0.0005027228,0.56586766,0.0028449195,0.3159436,0.00088529626,0.000436993],"about_ca_topic_score_codex":0.000057166,"about_ca_topic_score_gemma":0.000017483897,"teacher_disagreement_score":0.6141001,"about_ca_system_score_codex":0.000038777198,"about_ca_system_score_gemma":0.00022801444,"threshold_uncertainty_score":0.6315983},"labels":[],"label_agreement":null},{"id":"W2570771845","doi":"10.5555/1496770.1496840","title":"Succinct geometric indexes supporting point location queries","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"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; Carleton University","funders":"","keywords":"Point location; Point (geometry); Bounded function; Entropy (arrow of time); Combinatorics; Computational geometry; Mathematics; Set (abstract data type); Planar; Computer science; Line segment; Geometric primitive; Discrete mathematics; Algorithm; Geometry; Computer graphics (images)","score_opus":0.009640366075033085,"score_gpt":0.26272147228019915,"score_spread":0.25308110620516605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570771845","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.01992196,0.00024006561,0.9630325,0.011069145,0.00073995395,0.00032593068,0.0000060077423,0.00035113853,0.004313316],"genre_scores_gemma":[0.9745679,0.00003460939,0.023276279,0.001113456,0.00032414123,0.00001673632,0.00006072432,0.0000109105695,0.0005952547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793327,0.00008345846,0.00043723473,0.0005759632,0.0005671168,0.00040295607],"domain_scores_gemma":[0.9988286,0.000114409195,0.00021002555,0.0004834142,0.00021521396,0.0001483277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052892667,0.00023542951,0.00020862532,0.0005877189,0.0002770107,0.00032336664,0.00046646592,0.00008519179,0.000022420234],"category_scores_gemma":[0.000103896506,0.00021737309,0.00009443346,0.0020405285,0.000028960701,0.0009330664,0.00008878075,0.00016785813,0.000097622666],"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.00007571555,0.00054468546,0.000860095,0.00006276811,0.00008864069,0.00008176501,0.001918088,0.08830842,0.013394966,0.2791069,0.0052342564,0.6103237],"study_design_scores_gemma":[0.0026204456,0.0042360956,0.103803426,0.00019377262,0.00006334597,0.00021564885,0.00021495011,0.6841287,0.11911086,0.07077801,0.012210732,0.0024240003],"about_ca_topic_score_codex":0.000023640283,"about_ca_topic_score_gemma":0.000002890546,"teacher_disagreement_score":0.95464593,"about_ca_system_score_codex":0.000098076336,"about_ca_system_score_gemma":0.00011919408,"threshold_uncertainty_score":0.88642174},"labels":[],"label_agreement":null},{"id":"W2571441785","doi":"10.20382/jocg.v7i1a2","title":"Strict Confluent Drawing","year":2013,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Multidisciplinary University Research Initiative; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Graph; Path (computing); Enhanced Data Rates for GSM Evolution; Graph drawing; Boundary (topology); Order (exchange); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.0162556366757558,"score_gpt":0.2238675157719984,"score_spread":0.2076118790962426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571441785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18188329,0.00048661037,0.81260765,0.000956862,0.0020711147,0.00021967768,0.000016528178,0.00006557177,0.0016927116],"genre_scores_gemma":[0.8499822,0.00012668401,0.14743035,0.00041567566,0.00069853663,7.222331e-7,0.00006156662,0.000023203867,0.0012610587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966788,0.0003396474,0.0008400062,0.000500468,0.001312944,0.00032810468],"domain_scores_gemma":[0.99476475,0.0006985491,0.0015412425,0.00038198518,0.0022824074,0.00033107828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073706615,0.0003797921,0.0006214806,0.00319365,0.00022347276,0.00049306365,0.0019003849,0.00029010238,0.000099971236],"category_scores_gemma":[0.00015995408,0.0004138334,0.0005240051,0.0018166393,0.000073846044,0.001169627,0.001172073,0.0009892575,0.00005024626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035077806,0.00015100265,0.00022442207,0.00006617354,0.00031321673,0.00019691366,0.00018964936,0.93485624,0.00006971208,0.047000043,0.004170649,0.012726933],"study_design_scores_gemma":[0.005125733,0.0010469862,0.037039433,0.0008443021,0.00046612765,0.0008975149,0.00037197018,0.6225416,0.00081357587,0.14913586,0.17928497,0.0024319],"about_ca_topic_score_codex":0.00002198821,"about_ca_topic_score_gemma":8.035906e-7,"teacher_disagreement_score":0.6680989,"about_ca_system_score_codex":0.00047662927,"about_ca_system_score_gemma":0.0013405168,"threshold_uncertainty_score":0.9998314},"labels":[],"label_agreement":null},{"id":"W2571641900","doi":"","title":"An upper bound for the crossing number of locally twisted cubes","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Crossing number (knot theory); Upper and lower bounds; Combinatorics; Mathematical analysis; Geography; Intersection (aeronautics)","score_opus":0.02201934155732436,"score_gpt":0.3160696542149621,"score_spread":0.2940503126576377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571641900","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.8398425,0.00006829435,0.15637928,0.0005664814,0.002330408,0.00018818093,0.0000026346647,0.000035205,0.00058698555],"genre_scores_gemma":[0.9920477,0.0000016619288,0.0076064365,0.0001306075,0.00002827624,0.000014088169,0.0000032491712,0.0000057009383,0.00016222708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992877,0.000029076204,0.00016221925,0.00019598118,0.0001862828,0.00013871165],"domain_scores_gemma":[0.99868655,0.0001804406,0.00014554353,0.0006987619,0.00024563426,0.00004307737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035748235,0.0000783078,0.000099065255,0.000023333807,0.0010548326,0.0008720093,0.0009048612,0.000038687365,0.000006959585],"category_scores_gemma":[0.00010905861,0.00006134896,0.00005662398,0.00008327571,0.0001341413,0.0006127617,0.00010923402,0.000052170068,0.0000085522315],"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.00001135234,0.00008002591,0.0038562582,0.000009611008,0.000019017014,7.569764e-7,0.00038792743,0.0004868425,0.0009582535,0.9744137,0.00050841173,0.019267851],"study_design_scores_gemma":[0.0009703117,0.00011419396,0.06484051,0.000021683114,0.000014466731,0.000009885794,0.000022965818,0.2679553,0.007973377,0.65065074,0.0072522974,0.00017428746],"about_ca_topic_score_codex":0.00003974921,"about_ca_topic_score_gemma":0.000006637617,"teacher_disagreement_score":0.32376295,"about_ca_system_score_codex":0.000016418966,"about_ca_system_score_gemma":0.00012560323,"threshold_uncertainty_score":0.8408806},"labels":[],"label_agreement":null},{"id":"W2571737124","doi":"10.4230/lipics.isaac.2016.24","title":"All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic Time","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Binary logarithm; Shortest path problem; Logarithm; Mathematics; Vertex (graph theory); Time complexity; Running time; Unit disk; Graph; Discrete mathematics; Log-log plot; Algorithm","score_opus":0.015584024005765048,"score_gpt":0.24810136650653028,"score_spread":0.23251734250076522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571737124","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.7516265,0.000075946205,0.24136813,0.0015980159,0.0008461737,0.0013432127,0.00015490084,0.00023377902,0.0027533534],"genre_scores_gemma":[0.98632276,0.000043405027,0.011903629,0.0009509464,0.00006837254,0.0001324342,0.00021125392,0.000025015683,0.00034220528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970363,0.00008644893,0.0012471122,0.00037454735,0.0005229997,0.00073262875],"domain_scores_gemma":[0.9983069,0.00037031362,0.00028591836,0.00064476294,0.00019926084,0.0001928617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009165292,0.00036377914,0.00041159516,0.0008826211,0.00013060789,0.0002676288,0.0010252796,0.00018336071,0.00004270657],"category_scores_gemma":[0.00012740507,0.0002855238,0.0001612894,0.0010766252,0.00007369925,0.002476874,0.00029405818,0.00023852814,0.00030193536],"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.0005601986,0.00430571,0.24461502,0.001060493,0.0005200303,0.00020695345,0.04342811,0.011406847,0.005763405,0.33978936,0.017888643,0.3304552],"study_design_scores_gemma":[0.013658992,0.0010226859,0.073013596,0.0009623014,0.000048264763,0.00015703298,0.00061422924,0.8039148,0.004936729,0.040141933,0.059029423,0.0025000474],"about_ca_topic_score_codex":0.000019259518,"about_ca_topic_score_gemma":0.00013546532,"teacher_disagreement_score":0.7925079,"about_ca_system_score_codex":0.00016534422,"about_ca_system_score_gemma":0.00015358452,"threshold_uncertainty_score":0.9999597},"labels":[],"label_agreement":null},{"id":"W2579368783","doi":"","title":"Rooted HIST property on planar triangulations.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Property (philosophy); Planar; Mathematics; Combinatorics; Computer science; Computer graphics (images); Epistemology; Philosophy","score_opus":0.017959132266211007,"score_gpt":0.23434312803629878,"score_spread":0.21638399577008777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579368783","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.581622,0.00022300749,0.338109,0.03358014,0.012723063,0.0011428616,0.000018125615,0.0011840218,0.03139781],"genre_scores_gemma":[0.99326426,0.0000030743342,0.002501372,0.0003063123,0.00002450625,0.00001752756,0.000006504595,0.000006568046,0.003869868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990489,0.00007067726,0.00017294301,0.00028530543,0.0002640316,0.0001581397],"domain_scores_gemma":[0.99925166,0.00015152502,0.00006396654,0.00035597765,0.000101966165,0.00007490125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019302049,0.00010138307,0.00009897605,0.000119929486,0.00014120451,0.00006220854,0.00033975023,0.000045939632,0.000027452774],"category_scores_gemma":[0.00011301627,0.00005803682,0.000043130167,0.00037062433,0.000019765988,0.00031381575,0.000041009374,0.000049375023,0.0002848222],"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.000009485144,0.000079462974,0.00016115703,0.000001719803,0.000008403196,0.0000036525012,0.000044710847,0.00005346221,0.0016647507,0.9308249,0.009936179,0.057212118],"study_design_scores_gemma":[0.0033923665,0.00050363597,0.027247794,0.00007060795,0.000009034187,0.0000127636795,0.0000036531162,0.009910253,0.010010217,0.8178344,0.13052072,0.0004846098],"about_ca_topic_score_codex":0.000006139687,"about_ca_topic_score_gemma":0.0000021083363,"teacher_disagreement_score":0.41164228,"about_ca_system_score_codex":0.00008341034,"about_ca_system_score_gemma":0.000076499804,"threshold_uncertainty_score":0.3660908},"labels":[],"label_agreement":null},{"id":"W2584563734","doi":"10.1007/978-3-319-53007-9","title":"Algorithms and Discrete Applied Mathematics","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","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":"Computer science; Mathematics education; Theoretical computer science; Algorithm; Mathematics","score_opus":0.01622007180832667,"score_gpt":0.2604398636924852,"score_spread":0.24421979188415852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584563734","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.0000400161,0.0003232281,0.99307287,0.00042043434,0.0010943447,0.0003151116,0.0000039343986,0.00009063928,0.004639427],"genre_scores_gemma":[0.011788372,0.000041041367,0.9857159,0.0004908238,0.0006898055,0.000015348343,0.00001444894,0.000019632887,0.0012245992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973085,0.000015583462,0.000349912,0.0011226224,0.0007792468,0.0004241565],"domain_scores_gemma":[0.9978892,0.00035379463,0.000303787,0.001165969,0.0001383778,0.00014887],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007558154,0.0003621785,0.00040231066,0.0005331085,0.00047566244,0.0012140503,0.0023486947,0.00020328621,0.0000037157447],"category_scores_gemma":[0.00008802644,0.0003263571,0.000057930956,0.00040072872,0.0005038926,0.00053674955,0.0013907271,0.0004371448,0.000021952377],"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.0000013346372,0.000023165525,0.00000395945,0.000064479085,0.000008413609,0.000023472108,0.00074802985,0.01709158,0.00014052866,0.020710872,0.00012648776,0.96105766],"study_design_scores_gemma":[0.00019121612,0.000054091757,0.00011211724,0.00013216662,0.000005931769,0.00005937574,9.81291e-8,0.75403893,0.0006161756,0.2424613,0.0019179981,0.00041062385],"about_ca_topic_score_codex":0.0000037869374,"about_ca_topic_score_gemma":0.0000127028625,"teacher_disagreement_score":0.96064705,"about_ca_system_score_codex":0.00016024472,"about_ca_system_score_gemma":0.0007748413,"threshold_uncertainty_score":0.9999189},"labels":[],"label_agreement":null},{"id":"W2584609412","doi":"10.1007/s00453-017-0389-y","title":"Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams","year":2017,"lang":"en","type":"article","venue":"Algorithmica","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":"Division of Computing and Communication Foundations; Office of International Science and Engineering; Natural Sciences and Engineering Research Council of Canada; United States - Israel Binational Science Foundation; National Science Foundation","keywords":"Voronoi diagram; Pointer (user interface); Data structure; Time complexity; Combinatorics; Computer science; Line segment; Computational geometry; Algorithm; Mathematics; Discrete mathematics; Geometry","score_opus":0.05323177217562933,"score_gpt":0.3107300142054936,"score_spread":0.25749824202986427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584609412","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.0730399,0.00016720615,0.9236843,0.0018342596,0.00055138225,0.00032151313,0.00017369077,0.0000560359,0.00017170276],"genre_scores_gemma":[0.7411894,0.000011569234,0.25801083,0.00012063775,0.0002998103,0.00001713089,0.00024213841,0.000004528902,0.00010388879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992779,0.000016389704,0.0001071023,0.00033957468,0.00012584832,0.00013317876],"domain_scores_gemma":[0.9990078,0.000063634354,0.00008729868,0.00074133347,0.000044766748,0.000055140095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019703459,0.000084815954,0.00009082301,0.00002805412,0.0005267761,0.00044865345,0.00088274706,0.00003238638,0.0000037798136],"category_scores_gemma":[0.00010993412,0.00007683586,0.000014379849,0.0000266746,0.000065837005,0.0010471855,0.0006483971,0.00004531937,0.0000020797718],"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.0000150165115,0.000039090446,0.0009443521,0.0000287165,0.00004118954,0.0000040565033,0.00014670838,0.0000334576,0.0007361672,0.09795718,0.0036660898,0.896388],"study_design_scores_gemma":[0.0015464562,0.00028561527,0.12631355,0.000018134158,0.000034711265,0.00007709166,0.00003501524,0.6928489,0.013214092,0.09357097,0.07146726,0.0005881978],"about_ca_topic_score_codex":0.00005948764,"about_ca_topic_score_gemma":0.00007030137,"teacher_disagreement_score":0.89579976,"about_ca_system_score_codex":0.000009812091,"about_ca_system_score_gemma":0.000039470517,"threshold_uncertainty_score":0.43263754},"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":"W2592215285","doi":"10.1007/s00454-016-9842-y","title":"Upper and Lower Bounds for Online Routing on Delaunay Triangulations","year":2016,"lang":"en","type":"article","venue":"Discrete & 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 Ottawa; Carleton University","funders":"Agence Nationale de la Recherche","keywords":"Delaunay triangulation; Computer science; Upper and lower bounds; Routing (electronic design automation); Constrained Delaunay triangulation; Combinatorics; Computer network; Algorithm; Mathematics","score_opus":0.01888128039390763,"score_gpt":0.28410217519620534,"score_spread":0.2652208948022977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592215285","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.1622979,0.00008980699,0.83285314,0.0035227984,0.00046714477,0.0002656532,0.000115707866,0.00011158266,0.00027628816],"genre_scores_gemma":[0.8720882,0.0000057345596,0.12584263,0.00086367124,0.00031510484,0.000031175827,0.00017947968,0.000016490798,0.0006575024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823296,0.000059785893,0.0003901982,0.00057741895,0.000432922,0.0003067408],"domain_scores_gemma":[0.9978354,0.0013318165,0.0001486787,0.00024772968,0.00029025078,0.00014615027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035796146,0.00021191397,0.0001993469,0.00043802173,0.00036603358,0.00019901793,0.00029796653,0.00007880088,0.00003601408],"category_scores_gemma":[0.00031321685,0.0001631226,0.00013052912,0.0006678053,0.000063860345,0.0005552877,0.00017454437,0.00008095875,0.000029743507],"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.000101841026,0.0002304553,0.0012531445,0.000018977344,0.00009556877,0.0000044371814,0.00016012604,0.052292477,0.0006856018,0.6353212,0.0015142213,0.30832195],"study_design_scores_gemma":[0.0038946602,0.00072344247,0.111138746,0.0001421385,0.000037018748,0.000046339195,0.00003271929,0.65927535,0.00041375385,0.20622002,0.017246654,0.0008291687],"about_ca_topic_score_codex":0.0000031055383,"about_ca_topic_score_gemma":0.0000025717613,"teacher_disagreement_score":0.7097903,"about_ca_system_score_codex":0.000071971364,"about_ca_system_score_gemma":0.00011607689,"threshold_uncertainty_score":0.6651947},"labels":[],"label_agreement":null},{"id":"W2592372025","doi":"10.1007/s00454-017-9877-8","title":"On the Bounds of Conway’s Thrackles","year":2017,"lang":"en","type":"article","venue":"Discrete & 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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Graph; Order (exchange); Crossing number (knot theory); Knot (papermaking); Mathematical analysis","score_opus":0.023006922480881938,"score_gpt":0.28466544712215036,"score_spread":0.26165852464126843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592372025","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.24485256,0.00012932488,0.7378635,0.0057866336,0.0006725338,0.00021252481,0.000031613312,0.00006457948,0.010386765],"genre_scores_gemma":[0.9875314,0.0000058819983,0.011232567,0.00070029474,0.00011923341,0.000014134359,0.000038811242,0.000009078002,0.0003485671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998279,0.00008010995,0.00033587372,0.00036772928,0.0007228655,0.00021447397],"domain_scores_gemma":[0.9975136,0.0009001488,0.00039730442,0.00081452826,0.00029946794,0.00007497206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000534088,0.00017281258,0.00019402997,0.00021121722,0.00093418127,0.00048612736,0.0014972365,0.0000551359,0.000089665285],"category_scores_gemma":[0.0004515869,0.0001277358,0.00014149287,0.00033564196,0.00022438234,0.0005353264,0.0003433252,0.00015922618,0.00008888561],"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.000012558305,0.00005678705,0.0006242901,0.000009542466,0.000045063596,0.0000032049336,0.0001274518,0.06924696,0.000095563715,0.9188907,0.0019550745,0.008932791],"study_design_scores_gemma":[0.00064500456,0.00022163283,0.16997872,0.000060645576,0.00001499999,0.000018109418,0.000043489184,0.35724396,0.0014806121,0.46696734,0.0029716454,0.0003538311],"about_ca_topic_score_codex":0.000017204697,"about_ca_topic_score_gemma":0.0000027310498,"teacher_disagreement_score":0.7426789,"about_ca_system_score_codex":0.000028336643,"about_ca_system_score_gemma":0.00013768967,"threshold_uncertainty_score":0.71850616},"labels":[],"label_agreement":null},{"id":"W2592468459","doi":"10.1007/11841036_5","title":"Dynamic Connectivity for Axis-Parallel Rectangles","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Computer science; Intersection (aeronautics); Amortized analysis; Matrix multiplication; Graph; Data structure; Combinatorics; Time complexity; Range (aeronautics); Multiplication (music); Algorithm; Theoretical computer science; Mathematics","score_opus":0.014827848868001444,"score_gpt":0.25219077753308417,"score_spread":0.2373629286650827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592468459","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.00018964386,0.0005768572,0.99363667,0.0007294075,0.001968171,0.00065660774,0.000016979744,0.00017778535,0.0020478743],"genre_scores_gemma":[0.13298987,0.000021137177,0.8641972,0.0007619102,0.00047210194,0.000039406386,0.000053372885,0.0000342873,0.0014307348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676675,0.000031583124,0.0004649409,0.0014838723,0.0007059585,0.00054691016],"domain_scores_gemma":[0.9975241,0.0009190864,0.00027709274,0.000828283,0.00033907048,0.000112361406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008274246,0.00045833542,0.0004583834,0.0008224877,0.00034908456,0.00046861873,0.001767252,0.00027953726,0.000007965831],"category_scores_gemma":[0.0001183692,0.00045395165,0.00018271855,0.00059762143,0.0002981985,0.0005684576,0.0005224491,0.00039295983,0.000019480702],"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.0000100503285,0.00003859764,0.000010536981,0.000037878166,0.000010266938,0.000015826716,0.00012865549,0.38084412,0.00021270399,0.04523563,0.00015479572,0.57330096],"study_design_scores_gemma":[0.00026206518,0.00018391214,0.00012263698,0.00008088975,0.000005628926,0.0000331815,3.451567e-8,0.70930547,0.0003417713,0.28644118,0.0027849039,0.00043833206],"about_ca_topic_score_codex":0.000017984497,"about_ca_topic_score_gemma":0.00017783356,"teacher_disagreement_score":0.5728626,"about_ca_system_score_codex":0.00036727925,"about_ca_system_score_gemma":0.00056568644,"threshold_uncertainty_score":0.9997912},"labels":[],"label_agreement":null},{"id":"W2594531834","doi":"","title":"On the Crossing Numbers of the Joint Graphs of a Path or a Cycle.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Joint (building); Combinatorics; Computer science; Structural engineering; Computer network","score_opus":0.024364662796007457,"score_gpt":0.2615145343248359,"score_spread":0.23714987152882844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594531834","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.99438256,0.00001630477,0.001513801,0.0011054464,0.0014496796,0.00013133469,0.0000016898807,0.000012032901,0.0013871443],"genre_scores_gemma":[0.99923,0.0000019955594,0.0005256127,0.000121156794,0.0000044400103,0.0000050029257,2.7157208e-7,0.0000032954063,0.0001081907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921846,0.00007032056,0.00017875861,0.00014268601,0.00028964604,0.000100133744],"domain_scores_gemma":[0.9986034,0.00017643314,0.00029578788,0.0007926223,0.00010826428,0.000023499997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003631209,0.00007088707,0.00010518013,0.00003103421,0.0006011919,0.00017356951,0.0008686088,0.000027362013,0.000007326175],"category_scores_gemma":[0.0003067232,0.00003799905,0.000085068554,0.0001988411,0.0001739416,0.0001617609,0.00023223643,0.00008308511,0.0000031571212],"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.000007852281,0.000059189922,0.00042537847,0.0000068085305,0.000011396856,8.962079e-7,0.0005286782,0.00023006521,0.00094784016,0.9951376,0.0005388191,0.0021055127],"study_design_scores_gemma":[0.00040123676,0.0000928569,0.04499082,0.00007892014,0.000005745772,0.000003779549,0.000021054577,0.010766322,0.016808974,0.92659414,0.00016144878,0.00007468336],"about_ca_topic_score_codex":0.000047752223,"about_ca_topic_score_gemma":0.000006315192,"teacher_disagreement_score":0.068543404,"about_ca_system_score_codex":0.000013329345,"about_ca_system_score_gemma":0.00012270265,"threshold_uncertainty_score":0.46239427},"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":"W2594888016","doi":"10.1016/j.camwa.2014.07.017","title":"Parallel stochastic methods for PDE based grid generation","year":2014,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","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":"Memorial University of Newfoundland","funders":"Austrian Science Fund; Österreichischen Akademie der Wissenschaften","keywords":"Mathematics; Grid; Applied mathematics; Mathematical optimization; Geometry","score_opus":0.032392803748645387,"score_gpt":0.318614324260973,"score_spread":0.28622152051232763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594888016","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.000089417736,0.000033148775,0.9971481,0.00095476065,0.00020622773,0.00116652,0.0000046687883,0.00022464817,0.00017252228],"genre_scores_gemma":[0.013361339,8.6373973e-7,0.9841297,0.0005477999,0.0004138183,0.0013596213,0.00010354146,0.000019671354,0.00006360124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869186,0.00007306303,0.00034154224,0.00045745846,0.00020281442,0.00023325678],"domain_scores_gemma":[0.99790066,0.00078891,0.00021118729,0.0006929391,0.0002819614,0.00012434607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005905939,0.00019651072,0.00022169363,0.0001739133,0.0003340456,0.00021742971,0.00058821065,0.000055248984,0.0000033165188],"category_scores_gemma":[0.000052025032,0.0001759027,0.00007607002,0.0005134417,0.000040964085,0.00019157752,0.00006879792,0.00007682114,0.000023559882],"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.0000038015314,0.00016414566,0.000001543659,0.00006456734,0.0000259643,7.5170746e-8,0.00020437058,0.40249485,0.0006430065,0.48007092,0.0013909186,0.11493584],"study_design_scores_gemma":[0.000517207,0.00010368456,0.000023695658,0.00001652533,0.000025408826,0.000008917807,0.000004292239,0.9597365,0.0005450793,0.02780699,0.010994762,0.00021689992],"about_ca_topic_score_codex":7.636271e-7,"about_ca_topic_score_gemma":0.0000015062404,"teacher_disagreement_score":0.5572417,"about_ca_system_score_codex":0.00004149217,"about_ca_system_score_gemma":0.000101597245,"threshold_uncertainty_score":0.7173104},"labels":[],"label_agreement":null},{"id":"W2599322209","doi":"","title":"Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM","year":2014,"lang":"en","type":"article","venue":"","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":"Rectangle; Enclosure; Computer science; Time complexity; Computational complexity theory; Algorithm; Running time; Computational geometry; Combinatorics; Discrete mathematics; Theoretical computer science; Mathematics; Geometry","score_opus":0.023330770478758152,"score_gpt":0.25581856052679824,"score_spread":0.2324877900480401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599322209","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.31710428,0.000028485241,0.6697576,0.002656293,0.00022397142,0.00009348663,1.9262363e-7,0.000058837497,0.010076849],"genre_scores_gemma":[0.975754,0.0000027005485,0.02211433,0.0009913206,0.00010867659,0.000006884402,8.357899e-7,0.0000022682261,0.0010189711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992754,0.00005448742,0.0002466942,0.00020101752,0.0001317085,0.00009070896],"domain_scores_gemma":[0.99909395,0.0003994162,0.00019741237,0.00023385652,0.00004693137,0.00002845801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008035641,0.000059718383,0.00007260576,0.000029957619,0.0001521025,0.00008996256,0.00015249869,0.000019537903,0.000008051133],"category_scores_gemma":[0.0009186629,0.00003791458,0.000019519272,0.00017008556,0.000018578916,0.00008450623,0.00006372498,0.00005459105,0.000013234882],"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.000008787242,0.000043648502,0.00040864883,0.00001156482,0.0000069651187,0.00000959355,0.00027832497,0.002231483,0.0031376348,0.54546607,0.0025490448,0.44584826],"study_design_scores_gemma":[0.0002224462,0.00025202613,0.01187783,0.000027337092,0.0000045364004,0.000086317545,0.000011071986,0.9312392,0.010079157,0.025602788,0.020421254,0.00017602196],"about_ca_topic_score_codex":0.0000028990441,"about_ca_topic_score_gemma":0.0000044606954,"teacher_disagreement_score":0.9290077,"about_ca_system_score_codex":0.000006943414,"about_ca_system_score_gemma":0.000019661853,"threshold_uncertainty_score":0.15461117},"labels":[],"label_agreement":null},{"id":"W2601059909","doi":"10.46298/dmtcs.2797","title":"The distribution of the number of small cuts in a random planar triangulation","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Triangulation; Mathematics; Planar; Distribution (mathematics); Variance (accounting); Point set triangulation; Geometry; Mathematical analysis; Delaunay triangulation; Computer science","score_opus":0.009718011929313474,"score_gpt":0.2556642338228638,"score_spread":0.2459462218935503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601059909","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.26614118,0.0000057813113,0.7321897,0.00054384273,0.00034845024,0.00021507553,0.000003877407,0.000012685683,0.00053937867],"genre_scores_gemma":[0.9179173,0.000001687876,0.08199263,0.000025859728,0.00003994163,0.0000075800062,0.0000027670055,0.000003314983,0.000008933383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825937,0.00011307199,0.0005132708,0.00026113397,0.0006164286,0.00023673894],"domain_scores_gemma":[0.9979083,0.0008864509,0.00024271099,0.0006653584,0.00023677743,0.000060395083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002363573,0.000115796596,0.00018716854,0.00005790144,0.00026856692,0.00014387834,0.0015766321,0.000048030983,0.000006233322],"category_scores_gemma":[0.00047842573,0.00006482095,0.00009669195,0.0012515464,0.0012818282,0.000205856,0.00034446045,0.00018824355,0.0000036434974],"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.00001043971,0.000050090843,0.00020030812,0.000012887916,0.0000030861063,3.0570513e-7,0.0005323129,0.0007129137,0.0016357993,0.9929841,0.000008673694,0.0038490763],"study_design_scores_gemma":[0.00033354052,0.000019448184,0.0041610138,0.000030948144,0.0000046575024,0.000012723017,0.000011737304,0.6599062,0.0046086395,0.33080947,0.00003207802,0.00006950214],"about_ca_topic_score_codex":0.000004027605,"about_ca_topic_score_gemma":0.0000074020654,"teacher_disagreement_score":0.66217464,"about_ca_system_score_codex":0.000017165683,"about_ca_system_score_gemma":0.00015543035,"threshold_uncertainty_score":0.47229493},"labels":[],"label_agreement":null},{"id":"W2603442307","doi":"10.1145/3046673","title":"Instance-Optimal Geometric Algorithms","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"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":"Center for Massive Data Algorithmics; Danmarks Grundforskningsfond","keywords":"Computer science; Algorithm","score_opus":0.03309770124052353,"score_gpt":0.28907929181376957,"score_spread":0.25598159057324604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603442307","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.36017033,0.00042615735,0.618719,0.015671127,0.0038845588,0.000058421123,9.0789376e-7,0.000010348729,0.0010591771],"genre_scores_gemma":[0.86365527,0.000030044674,0.13493149,0.00023509414,0.0004978344,3.8513213e-7,6.8905365e-8,0.0000025536222,0.00064724137],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992464,0.000030041223,0.00019521722,0.00007586263,0.00035643834,0.0000959966],"domain_scores_gemma":[0.9980302,0.0000697301,0.00050298194,0.0011460512,0.00020304298,0.000047979185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048621182,0.000052915344,0.00009209201,0.00013518454,0.0003707811,0.00029558418,0.004554467,0.00002320867,0.000006836852],"category_scores_gemma":[0.0014346105,0.000033206463,0.00010572616,0.00025048357,0.000026631109,0.00073015393,0.000891745,0.00014070788,0.000010742596],"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.000033125474,0.00019685597,0.005196697,0.000012782044,0.00012990319,0.000068741494,0.00053185434,0.03156241,0.0025239568,0.016380314,0.039762884,0.90360045],"study_design_scores_gemma":[0.002602162,0.00054593297,0.6320558,0.00013372501,0.000058385787,0.0013887079,0.00003923371,0.063833185,0.028627913,0.12107483,0.14914969,0.0004904429],"about_ca_topic_score_codex":0.0000019115967,"about_ca_topic_score_gemma":6.72211e-7,"teacher_disagreement_score":0.90311,"about_ca_system_score_codex":0.00003288925,"about_ca_system_score_gemma":0.000096503165,"threshold_uncertainty_score":0.8463408},"labels":[],"label_agreement":null},{"id":"W2604739239","doi":"","title":"Rectangle-of-influence triangulations.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on 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 Manitoba; Carleton University; University of Waterloo","funders":"","keywords":"Rectangle; Computer science; Combinatorics; Parallel computing; Mathematics; Geometry","score_opus":0.025373454355276704,"score_gpt":0.24724990706608185,"score_spread":0.22187645271080514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604739239","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.14118649,0.00006889435,0.8424314,0.00780782,0.00052134093,0.00025356706,0.00008664648,0.000105040395,0.00753875],"genre_scores_gemma":[0.9753626,0.000007119755,0.02327607,0.0006946088,0.000070007656,0.000014836697,0.000024745026,0.000008719037,0.00054127077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982933,0.000084830775,0.00038643437,0.00044354697,0.0004718899,0.0003200247],"domain_scores_gemma":[0.9978746,0.0005411959,0.00015890042,0.00036266804,0.0006962512,0.00036634807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030214965,0.00017325411,0.00019520069,0.00105777,0.00016717498,0.00009219385,0.00062894606,0.00008833569,0.00024425302],"category_scores_gemma":[0.00033607456,0.00014481184,0.00008135487,0.0013225212,0.000084696076,0.0004923807,0.00004857601,0.000086331595,0.00024690139],"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.0000096499725,0.000032536016,0.00077144755,0.0000071508507,0.000023778664,0.000010145195,0.0000667812,0.024825573,0.00063607853,0.8377141,0.0011762884,0.1347265],"study_design_scores_gemma":[0.0032265112,0.00077883207,0.24272294,0.00045321858,0.000026083699,0.00010847976,0.000047364236,0.20832247,0.004750227,0.51400524,0.023990149,0.0015684762],"about_ca_topic_score_codex":0.000678711,"about_ca_topic_score_gemma":0.00089036376,"teacher_disagreement_score":0.8341761,"about_ca_system_score_codex":0.00019299402,"about_ca_system_score_gemma":0.0014540222,"threshold_uncertainty_score":0.5905255},"labels":[],"label_agreement":null},{"id":"W26048122","doi":"10.1007/978-3-642-36763-2_16","title":"Planar Graphs as VPG-Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Bipartite graph; Chordal graph; Planar; Indifference graph; Outerplanar graph; 1-planar graph; Conjecture; Discrete mathematics; Graph; Pathwidth; Line graph; Computer science","score_opus":0.01420898461931548,"score_gpt":0.2364423834741364,"score_spread":0.22223339885482093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26048122","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.00030602448,0.0006229558,0.98280215,0.0011722818,0.0025439872,0.00044808438,0.000004673768,0.00021271131,0.011887117],"genre_scores_gemma":[0.18432339,0.00017853483,0.80176175,0.008529913,0.0009109293,0.0000448447,0.000054955468,0.000074212396,0.004121496],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957644,0.00004178019,0.000565071,0.0016587246,0.0013035324,0.00066651485],"domain_scores_gemma":[0.997387,0.00043790357,0.0002928947,0.0012297229,0.00038154837,0.00027091408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006351625,0.00057604344,0.00047886596,0.0016394717,0.00036630905,0.00083374017,0.0029684377,0.00033958151,0.00012381944],"category_scores_gemma":[0.00007837856,0.0005406034,0.00019487516,0.0012449945,0.00046067042,0.000944875,0.0006637397,0.0007117769,0.000527473],"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.0000033682318,0.00002804783,0.000017568007,0.000020166406,0.000015881447,0.000059709942,0.00029797823,0.02415062,0.00019178049,0.44056606,0.000403405,0.5342454],"study_design_scores_gemma":[0.00020315389,0.0001841607,0.00015793057,0.00012955848,0.0000065928634,0.0001189018,8.7410136e-8,0.17349692,0.00074652623,0.81879425,0.005529631,0.00063229253],"about_ca_topic_score_codex":0.000046993897,"about_ca_topic_score_gemma":0.000039025774,"teacher_disagreement_score":0.5336131,"about_ca_system_score_codex":0.00016333497,"about_ca_system_score_gemma":0.0006320435,"threshold_uncertainty_score":0.99970454},"labels":[],"label_agreement":null},{"id":"W2604976727","doi":"","title":"Realizing Farthest-Point Voronoi Diagrams.","year":2016,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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; University of Waterloo","funders":"","keywords":"Voronoi diagram; Computer science; Point (geometry); Centroidal Voronoi tessellation; Computational geometry; Algorithm; Mathematics; Geometry","score_opus":0.01400703525191361,"score_gpt":0.20833768475715428,"score_spread":0.19433064950524068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604976727","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.070228375,0.0003079362,0.88262695,0.013154615,0.00044769119,0.00033641802,0.00049454963,0.0012781783,0.03112527],"genre_scores_gemma":[0.9849933,0.00002380239,0.011549182,0.0010232258,0.00026603008,0.000017436923,0.00011308343,0.000032876138,0.0019810689],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981459,0.000085667874,0.0003885605,0.00056823494,0.00038866856,0.00042301434],"domain_scores_gemma":[0.9986777,0.0003025611,0.000121414094,0.0005496422,0.0000549767,0.00029373833],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002195963,0.00024191076,0.00018518207,0.00019303468,0.00015027006,0.0015956855,0.00085474004,0.00009190172,0.00016042302],"category_scores_gemma":[0.00026516878,0.00017339471,0.00014527152,0.000598788,0.000053637345,0.00848124,0.00044849675,0.0001453349,0.0037623555],"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.00003602509,0.00020747718,0.019320352,0.000023358189,0.000042866206,0.000053013402,0.00004519316,0.00006949468,0.0015952119,0.21332882,0.012026048,0.75325215],"study_design_scores_gemma":[0.00087742147,0.00016604636,0.009147271,0.00012819782,0.000007777419,0.000052728083,0.000008716181,0.0018830835,0.01796401,0.14320692,0.8257759,0.00078191137],"about_ca_topic_score_codex":8.6586545e-7,"about_ca_topic_score_gemma":7.5455125e-7,"teacher_disagreement_score":0.91476494,"about_ca_system_score_codex":0.00004371933,"about_ca_system_score_gemma":0.00011007765,"threshold_uncertainty_score":0.9994407},"labels":[],"label_agreement":null},{"id":"W2605132714","doi":"","title":"Geometric Unique Set Cover on Unit Disks and Unit Squares.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on 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 Manitoba","funders":"","keywords":"Unit (ring theory); Cover (algebra); Set cover problem; Set (abstract data type); Computer science; Mathematics; Engineering; Programming language","score_opus":0.0533389688352964,"score_gpt":0.273573053030554,"score_spread":0.2202340841952576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605132714","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.23663244,0.00011932015,0.73656595,0.0120872585,0.0007890305,0.00047590616,0.00037547376,0.00019461,0.012760002],"genre_scores_gemma":[0.99154574,0.00003326597,0.0033695216,0.0028929983,0.00012619945,0.00002298323,0.00012324704,0.000019627932,0.0018664243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99753404,0.00015738107,0.00035619581,0.0007627724,0.00064786634,0.0005417615],"domain_scores_gemma":[0.9970563,0.0010536836,0.00013669243,0.00043456547,0.00052996824,0.0007887806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039729537,0.00032786405,0.00025990774,0.0024937473,0.000376182,0.0003453092,0.0006540475,0.00015457219,0.0004320887],"category_scores_gemma":[0.00030496137,0.0002776334,0.00006771616,0.0024789132,0.00012722836,0.00048749568,0.00010733858,0.00023661985,0.0006159574],"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.000025225312,0.000063863066,0.0031588036,0.000017266413,0.000051519695,0.000056240424,0.00012890514,0.01847089,0.00005578716,0.8309563,0.004207767,0.14280745],"study_design_scores_gemma":[0.004290019,0.0018725751,0.4275443,0.00050788355,0.000038572114,0.00019328856,0.0000897734,0.21988024,0.001093723,0.20274778,0.13914551,0.002596332],"about_ca_topic_score_codex":0.0010638387,"about_ca_topic_score_gemma":0.00118686,"teacher_disagreement_score":0.7549133,"about_ca_system_score_codex":0.00022338887,"about_ca_system_score_gemma":0.001326506,"threshold_uncertainty_score":0.9999676},"labels":[],"label_agreement":null},{"id":"W2605171502","doi":"","title":"On the Biplanar Crossing Number of K n .","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on 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 Manitoba","funders":"","keywords":"Crossing number (knot theory); Computer science; Physics; Materials science; Composite material","score_opus":0.03215945695421688,"score_gpt":0.26548581645001285,"score_spread":0.23332635949579597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605171502","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.30181727,0.000021659218,0.65870136,0.020942831,0.00066988997,0.00023135223,0.00010112171,0.00006595681,0.017448558],"genre_scores_gemma":[0.99187857,0.0000017428397,0.0045657447,0.0029482779,0.00007062188,0.000009714173,0.000011651578,0.000007770443,0.0005058846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851656,0.00009027173,0.0002705706,0.00035144654,0.00048176348,0.00028940948],"domain_scores_gemma":[0.99780583,0.0011275202,0.00012564861,0.0003385937,0.00037019842,0.00023218185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003295613,0.00015692426,0.00014380085,0.00040670138,0.00035139997,0.00021442825,0.00063773466,0.000064677966,0.0005979719],"category_scores_gemma":[0.00024625292,0.00010065787,0.00006935134,0.00085257785,0.00015169539,0.00020991545,0.000043048254,0.00010961129,0.0005030838],"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.0000061937267,0.00002216095,0.00042232132,0.000003244375,0.000016674356,0.000005997563,0.00006171193,0.0057930914,0.000083622595,0.9595612,0.0038181348,0.0302056],"study_design_scores_gemma":[0.0011319771,0.00031144446,0.044859316,0.0003408576,0.000010831249,0.00007596701,0.000046864683,0.123899944,0.0018934351,0.80708456,0.019578839,0.0007659932],"about_ca_topic_score_codex":0.00058288145,"about_ca_topic_score_gemma":0.00056292675,"teacher_disagreement_score":0.69006133,"about_ca_system_score_codex":0.00013522732,"about_ca_system_score_gemma":0.0012476065,"threshold_uncertainty_score":0.6547373},"labels":[],"label_agreement":null},{"id":"W2605328145","doi":"","title":"A Faster Algorithm for the Minimum Red-Blue-Purple Spanning Graph Problem for Points on a Circle.","year":2016,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Graph; Combinatorics; Computer science; Reverse-delete algorithm; Algorithm; Mathematics; Connected dominating set","score_opus":0.02327179636583314,"score_gpt":0.25819670414007806,"score_spread":0.2349249077742449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605328145","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.0007111169,0.000026243895,0.98214704,0.015516521,0.00039885537,0.0008146363,0.000012021908,0.00008079043,0.00029275566],"genre_scores_gemma":[0.09714155,0.000006049249,0.8897586,0.0026009118,0.0004996665,0.000674293,0.000010515367,0.000019448104,0.009288967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989821,0.000025020085,0.0001936131,0.00036009133,0.00019044206,0.00024877788],"domain_scores_gemma":[0.99884784,0.00057556055,0.00007283626,0.00028358446,0.00016660143,0.00005357942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041368153,0.00010775997,0.00009832252,0.00010723814,0.00024910248,0.00011892341,0.00038653138,0.000038648293,0.00001240167],"category_scores_gemma":[0.00005044624,0.0000624434,0.00011307731,0.00023369088,0.000020471562,0.00027697714,0.00007132143,0.000031352745,0.000020813879],"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.000015550742,0.000040740895,0.0000046368177,0.0000072850326,0.000024677938,3.4534932e-7,0.00018860715,0.00035776175,0.0007264557,0.018471144,0.016000561,0.96416223],"study_design_scores_gemma":[0.002563969,0.000839639,0.000724415,0.00008772566,0.00002131765,0.000016449838,0.00005921581,0.79650855,0.011276785,0.07665103,0.110851154,0.0003997581],"about_ca_topic_score_codex":0.000002198272,"about_ca_topic_score_gemma":0.000003622379,"teacher_disagreement_score":0.96376246,"about_ca_system_score_codex":0.000021271977,"about_ca_system_score_gemma":0.00004720151,"threshold_uncertainty_score":0.25463682},"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":"W2609364824","doi":"10.19086/da.4438","title":"On the number of points in general position in the plane","year":2018,"lang":"en","type":"article","venue":"Discrete Analysis","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Illinois at Urbana-Champaign; National Science Foundation","keywords":"General position; Clique; Collinearity; Type (biology); Plane (geometry); Upper and lower bounds; Position (finance); Discrete geometry","score_opus":0.010892326693498868,"score_gpt":0.2775875377245725,"score_spread":0.26669521103107363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609364824","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.910063,0.0000068932245,0.08562255,0.0023448565,0.000029067001,0.000051613853,0.000002786021,0.0000041761677,0.0018750244],"genre_scores_gemma":[0.9974885,0.0000020432421,0.0015865314,0.00079377403,0.000043174194,0.0000058486567,0.000025515266,0.0000011512564,0.000053484015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922836,0.0001719301,0.00015614537,0.0001408266,0.00021883468,0.00008390848],"domain_scores_gemma":[0.99947065,0.00017763191,0.000053513108,0.00025053901,0.000037444566,0.00001021415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047526014,0.000050636074,0.00008672444,0.00017757177,0.00004800737,0.000040379007,0.00031629027,0.000018550812,0.00006407879],"category_scores_gemma":[0.000034498345,0.000028881312,0.00006578207,0.0018953836,0.000026917995,0.00009839238,0.000032044554,0.000052951655,0.000026596632],"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.000047445246,0.0001899293,0.041367594,0.0000049818036,0.000250738,0.0000143472635,0.006197429,0.03272137,0.0010694172,0.9116546,0.0008748245,0.0056073614],"study_design_scores_gemma":[0.00021813727,0.00006603128,0.3065342,0.000010346149,0.000060047372,0.0000030963936,0.00009880067,0.6525902,0.0020272504,0.038167994,0.00011287944,0.00011100672],"about_ca_topic_score_codex":0.00015686186,"about_ca_topic_score_gemma":0.0002902448,"teacher_disagreement_score":0.8734866,"about_ca_system_score_codex":0.00001351965,"about_ca_system_score_gemma":0.000012119296,"threshold_uncertainty_score":0.117774576},"labels":[],"label_agreement":null},{"id":"W2613310142","doi":"","title":"The number of boundary H-points of H-triangles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Boundary (topology); Combinatorics; Geometry; Mathematical analysis","score_opus":0.014422553944203838,"score_gpt":0.2768681387994706,"score_spread":0.26244558485526676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613310142","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.9765929,0.00021684036,0.0065230373,0.001492368,0.0042136135,0.00013962548,0.0000027908318,0.000026814543,0.010792034],"genre_scores_gemma":[0.99721193,0.000018122904,0.0024366453,0.000023126293,0.000009837892,0.0000033054482,0.0000011848123,0.0000030542544,0.00029279036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999276,0.000043604257,0.00020337146,0.00012770301,0.00024534453,0.00010400973],"domain_scores_gemma":[0.99864393,0.00016365125,0.0002695202,0.0006995507,0.00019132164,0.000032019878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042254204,0.000059516642,0.000105747604,0.000023965431,0.00040184183,0.00012681828,0.00094562536,0.00003024303,0.0000072334255],"category_scores_gemma":[0.0001993793,0.00004661297,0.000055583063,0.00010502677,0.00012315663,0.00029304376,0.00024414223,0.000054846754,0.000020765212],"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.0000053268077,0.000040305873,0.0030762872,0.000006065733,0.000014636205,0.0000010426014,0.00009162234,0.000009388777,0.00026094416,0.9802366,0.0011491061,0.015108713],"study_design_scores_gemma":[0.00053595984,0.00003653461,0.050463103,0.000016288855,0.0000048771813,0.000005311633,0.000007314395,0.00252273,0.011389881,0.9284705,0.006469065,0.000078450714],"about_ca_topic_score_codex":0.000019156609,"about_ca_topic_score_gemma":0.0000026375549,"teacher_disagreement_score":0.05176608,"about_ca_system_score_codex":0.000012066726,"about_ca_system_score_gemma":0.000100447134,"threshold_uncertainty_score":0.3090683},"labels":[],"label_agreement":null},{"id":"W2614087704","doi":"10.1007/978-3-540-77537-9_4","title":"A Bipartite Strengthening of the Crossing Lemma","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Calgary","funders":"Hungarian Scientific Research Fund; City University of New York; National Science Foundation","keywords":"Combinatorics; Mathematics; Bipartite graph; Lemma (botany); Disjoint sets; Crossing number (knot theory); Complete bipartite graph; Monotone polygon; Graph; Discrete mathematics; Geometry","score_opus":0.02258841218043543,"score_gpt":0.24777728249271813,"score_spread":0.2251888703122827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614087704","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.0022887432,0.00050942134,0.99396396,0.00040835355,0.001436847,0.00018687267,0.0000029719804,0.000050120252,0.0011527122],"genre_scores_gemma":[0.71964324,0.000029549059,0.2787977,0.00059359835,0.0004194002,0.0000036287454,0.0000026176751,0.000018178403,0.0004921466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974801,0.000034473665,0.00047677592,0.00075984176,0.000912666,0.0003361731],"domain_scores_gemma":[0.99808055,0.00033963358,0.0003591689,0.000897453,0.00025262326,0.000070587324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047806447,0.00027935402,0.00029690049,0.00046764163,0.0005211863,0.0003552985,0.0021373592,0.00014524288,0.000008040582],"category_scores_gemma":[0.000100343495,0.00021400405,0.00014520135,0.00089775654,0.0008315766,0.00041220244,0.0010046046,0.0004362887,0.0000076030583],"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.0000027420176,0.00001913152,0.0000880821,0.000020265581,0.0000082401,0.000013997769,0.0015214595,0.33909118,0.00061856606,0.010021908,0.000037155343,0.6485573],"study_design_scores_gemma":[0.0002606795,0.000094137686,0.0009906325,0.00046238687,0.0000072418684,0.00014205427,1.1397809e-7,0.9299129,0.01400388,0.047786206,0.0058439164,0.0004958314],"about_ca_topic_score_codex":0.000011851857,"about_ca_topic_score_gemma":0.000028533721,"teacher_disagreement_score":0.7173545,"about_ca_system_score_codex":0.00011600338,"about_ca_system_score_gemma":0.0008774875,"threshold_uncertainty_score":0.87268317},"labels":[],"label_agreement":null},{"id":"W2618053861","doi":"10.1016/j.jda.2017.04.005","title":"Guarding monotone art galleries with sliding cameras in linear time","year":2017,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","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 Waterloo; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Monotone polygon; Polygon (computer graphics); Combinatorics; Simple polygon; Mathematics; Time complexity; Line segment; Guard (computer science); Regular polygon; Point in polygon; Algorithm; Point (geometry); Polygon covering; Computer science; Geometry","score_opus":0.01341665127511504,"score_gpt":0.2715726209023183,"score_spread":0.2581559696272033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618053861","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.12609161,0.00022083284,0.8683244,0.0028980763,0.0005898138,0.00010412037,0.0000017211972,0.000018811,0.0017506003],"genre_scores_gemma":[0.795106,0.000059614944,0.20322421,0.000084205356,0.0005033981,0.0000024586711,0.0000021604426,0.00001054644,0.0010073906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989031,0.000042786505,0.00033653452,0.00015715888,0.00038418823,0.00017624916],"domain_scores_gemma":[0.99893045,0.000058320707,0.00046925037,0.00027553545,0.00018035165,0.00008611501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000542151,0.000113975315,0.00023061926,0.00020082538,0.00023892801,0.0003370212,0.00053832063,0.000035698096,0.00001255521],"category_scores_gemma":[0.00009127442,0.00008805716,0.000070945505,0.00015478522,0.00003382122,0.0015094983,0.00011837533,0.00019123153,0.000021683081],"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.0009150884,0.0009004136,0.026646938,0.00016494597,0.0012474711,0.004142784,0.011081022,0.33301318,0.050668642,0.027517559,0.018401785,0.52530015],"study_design_scores_gemma":[0.0029309436,0.0010853608,0.044981733,0.0004485527,0.000039021732,0.0008182717,0.00014692567,0.9224056,0.010884037,0.0044721738,0.011160302,0.00062706595],"about_ca_topic_score_codex":0.000010512406,"about_ca_topic_score_gemma":0.0000053924136,"teacher_disagreement_score":0.6690144,"about_ca_system_score_codex":0.00004407063,"about_ca_system_score_gemma":0.000113211405,"threshold_uncertainty_score":0.35908666},"labels":[],"label_agreement":null},{"id":"W2621124976","doi":"","title":"Finding one tight cycle","year":2008,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Contractible space; Combinatorics; Homotopy; Mathematics; Simple (philosophy); Boundary (topology); Surface (topology); Genus; Class (philosophy); Binary logarithm; Running time; Discrete mathematics; Computer science; Algorithm; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.04089089503521978,"score_gpt":0.24345502666603389,"score_spread":0.2025641316308141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621124976","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.11204914,0.000030420637,0.86342293,0.00064158055,0.00015761952,0.000030567113,1.3174486e-7,0.00010344923,0.023564184],"genre_scores_gemma":[0.8895947,0.0000065652007,0.106331535,0.0003638227,0.00007834687,0.000002131639,0.0000020058449,0.000001486331,0.0036194096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995604,0.000011657308,0.00007293699,0.00012928533,0.00013977804,0.00008593106],"domain_scores_gemma":[0.9997592,0.00003175589,0.000016251328,0.00012413091,0.000031697415,0.000036948604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060560375,0.000036382342,0.000040536248,0.000062663596,0.00013788171,0.000026282354,0.00016860952,0.000015048289,0.000082674036],"category_scores_gemma":[0.000010406161,0.000034602108,0.000019539666,0.0002748267,0.000008596882,0.00026457998,0.000055720742,0.00002938317,0.00023176611],"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.0000031477632,0.00019262699,0.0010059574,0.0000062904996,0.000021173788,0.000033136723,0.0009500033,0.014691696,0.006487733,0.87680185,0.015634106,0.08417229],"study_design_scores_gemma":[0.0007082685,0.0001302141,0.07349032,0.00001124731,0.000003894993,0.00019612025,0.000008940947,0.7780811,0.06757349,0.031046243,0.048272617,0.0004775218],"about_ca_topic_score_codex":0.0000044670155,"about_ca_topic_score_gemma":0.0000013363625,"teacher_disagreement_score":0.8457556,"about_ca_system_score_codex":0.000010827925,"about_ca_system_score_gemma":0.00003074672,"threshold_uncertainty_score":0.29789618},"labels":[],"label_agreement":null},{"id":"W2621152549","doi":"10.2514/6.2017-3453","title":"A Mixed-Element 3D Advancing Layer Mesh Generator For Complex Geometries","year":2017,"lang":"en","type":"article","venue":"23rd AIAA Computational Fluid Dynamics Conference","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 British Columbia","funders":"","keywords":"Generator (circuit theory); Layer (electronics); Finite element method; Computer science; Mesh generation; Element (criminal law); Materials science; Mechanical engineering; Structural engineering; Composite material; Engineering; Physics; Power (physics)","score_opus":0.055053843229842206,"score_gpt":0.29706120199342917,"score_spread":0.24200735876358698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621152549","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.030934706,0.000063488325,0.9632826,0.0028201486,0.0012125922,0.0005760416,0.00018493552,0.00016714085,0.0007583576],"genre_scores_gemma":[0.6040198,0.000012659806,0.3944132,0.0004674076,0.00020238156,0.00008379488,0.00046316467,0.00001685536,0.0003206823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713063,0.00007158411,0.0006314943,0.00085585215,0.0007430005,0.00056741165],"domain_scores_gemma":[0.9966756,0.00049468415,0.00042555612,0.0007950707,0.0013761692,0.00023292241],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006723763,0.00036923293,0.0003948702,0.00034308943,0.0016063798,0.0014255414,0.0015957723,0.00010404113,0.000058367677],"category_scores_gemma":[0.0004036127,0.00039823126,0.00016371696,0.00031409974,0.00013825795,0.0011777182,0.0005946097,0.00015608926,0.00004958744],"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.000024999268,0.00010202759,0.00041873724,0.000039939157,0.000069434725,0.0000060479947,0.00011447248,0.16578518,0.0016141402,0.7550975,0.0023137727,0.07441375],"study_design_scores_gemma":[0.0009164805,0.0001463163,0.0074886316,0.000028220307,0.000017063048,0.000018049877,0.000022339907,0.9436408,0.00045853603,0.041694403,0.005119202,0.0004499433],"about_ca_topic_score_codex":0.00003623238,"about_ca_topic_score_gemma":0.000168761,"teacher_disagreement_score":0.77785563,"about_ca_system_score_codex":0.00023586466,"about_ca_system_score_gemma":0.00058078533,"threshold_uncertainty_score":0.99984694},"labels":[],"label_agreement":null},{"id":"W2621213288","doi":"10.2514/6.2017-3105","title":"The Impact of Unstructured Mesh Generation Approach on Errors","year":2017,"lang":"en","type":"article","venue":"23rd AIAA Computational Fluid Dynamics Conference","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 British Columbia","funders":"","keywords":"Computer science; Mesh generation; Engineering; Finite element method; Structural engineering","score_opus":0.0330714362325339,"score_gpt":0.2960220197880657,"score_spread":0.2629505835555318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621213288","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.17680247,0.000026035295,0.81950927,0.0006652734,0.000498884,0.00024001946,0.000034902867,0.000048776274,0.0021743495],"genre_scores_gemma":[0.958169,0.000014844983,0.041144762,0.000052932668,0.0001389561,0.000018430106,0.00024181782,0.000010740824,0.0002085428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980176,0.00012873087,0.00044522053,0.00048734483,0.00064966374,0.00027143775],"domain_scores_gemma":[0.99759036,0.00025771256,0.00044688795,0.0008410213,0.0007556175,0.00010840034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043764294,0.00025262227,0.00023388927,0.00014740945,0.0012639919,0.000791143,0.001530159,0.00009093952,0.000009351534],"category_scores_gemma":[0.00020720056,0.00018805468,0.0001819612,0.00022159074,0.00020740167,0.0005628323,0.00024566014,0.00018419592,0.0000136402],"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.000015479454,0.00004593222,0.0002100856,0.0000034569684,0.000040960105,9.427872e-7,0.00009014827,0.4516458,0.0004295552,0.52954066,0.00040724603,0.017569756],"study_design_scores_gemma":[0.00036385568,0.00014891132,0.03783717,0.0000100284,0.0000057915545,0.000015001528,0.000009636572,0.92132246,0.00017787817,0.03989738,0.000024012132,0.00018789712],"about_ca_topic_score_codex":0.00006972288,"about_ca_topic_score_gemma":0.000030441368,"teacher_disagreement_score":0.7813665,"about_ca_system_score_codex":0.0001603904,"about_ca_system_score_gemma":0.0005156669,"threshold_uncertainty_score":0.97217315},"labels":[],"label_agreement":null},{"id":"W2621816424","doi":"","title":"Proceedings of the sixteenth annual symposium on Computational geometry","year":2000,"lang":"en","type":"article","venue":"","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":"Bell (Canada)","funders":"","keywords":"Computational geometry; Computer science; Geometry; Mathematics; Artificial intelligence","score_opus":0.005947030754166838,"score_gpt":0.2114617068796426,"score_spread":0.20551467612547578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621816424","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.88754827,0.000020319321,0.03926053,0.0045378446,0.0003213242,0.00025764568,0.000012508958,0.00011782091,0.06792375],"genre_scores_gemma":[0.98264676,0.0000027141118,0.01155765,0.00088764756,0.000074993804,0.000004598915,0.0000030918145,0.0000035823819,0.0048189373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904656,0.000010994038,0.00018224855,0.00021802094,0.0004244556,0.00011772755],"domain_scores_gemma":[0.99953955,0.000070434624,0.000058180918,0.0001097743,0.00018266366,0.000039405684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014697829,0.000082755156,0.00007923548,0.0000959937,0.00011428017,0.000054276403,0.00046188763,0.000030582116,0.00016590372],"category_scores_gemma":[0.000011287206,0.000057837326,0.000060800314,0.0007869807,0.000033138527,0.00030860366,0.000064865366,0.00006990563,0.00005716625],"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.000022974269,0.00030741267,0.0010907633,0.000019108431,0.000027970424,5.588129e-7,0.00061353296,0.27182418,0.0010605203,0.65371007,0.019935042,0.05138785],"study_design_scores_gemma":[0.0016589622,0.00078171614,0.20507842,0.00009104551,0.000022359683,0.00008055586,0.00011666779,0.65092623,0.037537176,0.05144239,0.05153552,0.000728969],"about_ca_topic_score_codex":0.0000038070204,"about_ca_topic_score_gemma":3.5177743e-7,"teacher_disagreement_score":0.6022677,"about_ca_system_score_codex":0.000019307034,"about_ca_system_score_gemma":0.00004670636,"threshold_uncertainty_score":0.23585376},"labels":[],"label_agreement":null},{"id":"W2622492622","doi":"10.1016/j.tcs.2017.05.035","title":"Computing conforming partitions of orthogonal polygons with minimum stabbing number","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","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; University of Manitoba","funders":"","keywords":"Combinatorics; Partition (number theory); Mathematics; Disjoint sets; Rectangle; Polygon (computer graphics); Polygon covering; Line segment; Rounding; Polygonal chain; Partition problem; Discrete mathematics; Regular polygon; Computer science; Geometry","score_opus":0.014265505653925382,"score_gpt":0.28223805436392385,"score_spread":0.2679725487099985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622492622","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.29327616,0.0000045976667,0.70112604,0.00047701574,0.000290603,0.0000898282,0.0000022884105,0.000055947756,0.0046774987],"genre_scores_gemma":[0.8003773,8.537953e-7,0.19936669,0.00012957669,0.000107361615,0.0000020900327,0.0000015701107,0.00000464676,0.00000990125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979484,0.000048528193,0.0003240133,0.0005056057,0.0007305438,0.00044289656],"domain_scores_gemma":[0.9980097,0.00024291131,0.00025488838,0.0008712974,0.00041050886,0.00021073714],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001046681,0.00015892107,0.00021120065,0.00013339584,0.0015840679,0.0006867064,0.0019194523,0.000035694564,0.00003630566],"category_scores_gemma":[0.00011016034,0.00013026642,0.000057908877,0.00048842886,0.0023805068,0.0012396645,0.00093458075,0.00014806456,0.000025572695],"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.000007937434,0.000048105387,0.0010027852,0.000007717363,0.000007084379,0.0000072492885,0.0003316906,0.0022675316,0.0006748452,0.9722517,0.000014110696,0.02337923],"study_design_scores_gemma":[0.00046839958,0.0001989632,0.016536972,0.0001026321,0.000010383598,0.00012512859,0.000017203696,0.9104283,0.011123414,0.06059158,0.000092846814,0.00030418168],"about_ca_topic_score_codex":0.000005832764,"about_ca_topic_score_gemma":0.000002448333,"teacher_disagreement_score":0.91166013,"about_ca_system_score_codex":0.000029354285,"about_ca_system_score_gemma":0.00030784504,"threshold_uncertainty_score":0.99971575},"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":"W2624045917","doi":"10.48550/arxiv.1706.02028","title":"On Guarding Orthogonal Polygons with Bounded Treewidth","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Bounded function; Combinatorics; Polygon (computer graphics); Mathematics; Guard (computer science); Rectangle; Partial k-tree; Discrete mathematics; 1-planar graph; Computer science; Graph; Chordal graph; Pathwidth; Geometry","score_opus":0.0755831907290783,"score_gpt":0.19604920176223667,"score_spread":0.12046601103315836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624045917","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.30105793,0.00002579906,0.6896196,0.00019114283,0.0005064357,0.00016186245,0.000011647071,0.00013997601,0.00828558],"genre_scores_gemma":[0.99247205,0.000026475804,0.0037542826,0.00012832595,0.00013559227,0.0000010696235,0.000040855623,0.000012709608,0.0034286277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834055,0.000086653185,0.00013029554,0.0009940098,0.00016629466,0.00028219706],"domain_scores_gemma":[0.99811244,0.00011906909,0.00027798183,0.0011778304,0.00016319999,0.00014945795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019955187,0.00028277768,0.00025261202,0.00033022734,0.00052985974,0.00038685123,0.0014015286,0.00016591324,0.00002204587],"category_scores_gemma":[0.000035632955,0.00028957432,0.00014991609,0.0003045248,0.00008796942,0.00041243352,0.0008374992,0.0004349839,0.00007084707],"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.000052663498,0.00006963042,0.000505855,0.000015850675,0.00008378013,0.00021910832,0.000068060726,0.40081108,0.0000135979135,0.5955633,0.00034472792,0.0022523869],"study_design_scores_gemma":[0.0011170042,0.00027776405,0.0065336213,0.00024609032,0.00008892361,0.000026369618,0.000018173343,0.72707665,0.00023679044,0.26210362,0.0014262343,0.0008487686],"about_ca_topic_score_codex":0.000040190112,"about_ca_topic_score_gemma":0.00007128923,"teacher_disagreement_score":0.6914141,"about_ca_system_score_codex":0.00015697525,"about_ca_system_score_gemma":0.00044809288,"threshold_uncertainty_score":0.99995565},"labels":[],"label_agreement":null},{"id":"W2624146531","doi":"10.1145/2500118","title":"Morphing orthogonal planar graph drawings","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"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":"Planarity testing; Morphing; Orthogonality; Planar graph; Graph drawing; Mathematics; Graph; Planar; Book embedding; Combinatorics; Computer science; Geometry; Computer graphics (images); Line graph; 1-planar graph","score_opus":0.016831756462513593,"score_gpt":0.2365934897930276,"score_spread":0.21976173333051402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624146531","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.01296637,0.00003700859,0.98156905,0.0040763584,0.0006297291,0.00017306852,0.0000057246834,0.00021989812,0.0003227905],"genre_scores_gemma":[0.62570196,0.000019474664,0.37228113,0.0011084096,0.00011837702,0.00008256411,0.000011305763,0.000012069771,0.0006647156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880487,0.000040965784,0.00020932421,0.00036140755,0.0003459318,0.00023752714],"domain_scores_gemma":[0.99908465,0.00014902226,0.000048796242,0.00048021795,0.00011206717,0.00012524014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013305707,0.00014580393,0.00011280161,0.00028712678,0.00035021576,0.00022114259,0.000543287,0.000062181396,0.00020112307],"category_scores_gemma":[0.000015453857,0.0001422904,0.000102364036,0.0006772534,0.000028406377,0.00086036394,0.000009521951,0.00020166411,0.00044512466],"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.0000040946056,0.000193577,0.000023746656,0.000007342329,0.000056898658,0.000010169632,0.00040331998,0.022916278,0.0019501619,0.009271122,0.001028114,0.96413517],"study_design_scores_gemma":[0.001986996,0.0006536533,0.024155678,0.000076144606,0.000052262705,0.00030357562,0.00016781765,0.6233022,0.019164706,0.31762344,0.011050056,0.0014634578],"about_ca_topic_score_codex":0.00006416868,"about_ca_topic_score_gemma":0.0000059266276,"teacher_disagreement_score":0.9626717,"about_ca_system_score_codex":0.00003116499,"about_ca_system_score_gemma":0.000050324077,"threshold_uncertainty_score":0.5802434},"labels":[],"label_agreement":null},{"id":"W2624483937","doi":"10.1145/1706591.1706596","title":"A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries","year":2010,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":66,"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":"Combinatorics; Convex hull; Amortized analysis; Mathematics; Regular polygon; Euclidean geometry; Set (abstract data type); Data structure; Point (geometry); k-nearest neighbors algorithm; Computational geometry; Plane (geometry); Extreme point; Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.018289579272460672,"score_gpt":0.28568177336151285,"score_spread":0.2673921940890522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624483937","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.8325286,0.00017144287,0.14760603,0.01726277,0.0022639746,0.00011729767,0.000027156038,0.0000074973414,0.000015218957],"genre_scores_gemma":[0.83741266,0.000007431706,0.16195224,0.0003507477,0.00018585418,3.7252715e-7,0.0000031047566,0.0000028574161,0.00008474027],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995185,0.00002068532,0.00015029786,0.000096429634,0.00014390984,0.000070153794],"domain_scores_gemma":[0.99867266,0.00016574559,0.00018025166,0.00080982293,0.00013214482,0.000039353814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025519272,0.00005115158,0.00008396037,0.000040005474,0.00011485945,0.0001468141,0.002035632,0.000030514886,0.0000078687135],"category_scores_gemma":[0.0008625677,0.000031570104,0.000029530638,0.00010694484,0.00003350797,0.0004696629,0.00074239017,0.00015461215,5.529747e-7],"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.00021434388,0.00016523819,0.005571071,0.00013403413,0.0003087397,0.000020419036,0.0024604306,0.0049640853,0.44133055,0.12519456,0.049622495,0.370014],"study_design_scores_gemma":[0.001730828,0.00032598292,0.111799434,0.00005455023,0.000073688636,0.0013379372,0.00006734934,0.36664942,0.0093735885,0.39449584,0.113768905,0.00032246328],"about_ca_topic_score_codex":0.0000014351098,"about_ca_topic_score_gemma":0.00003391606,"teacher_disagreement_score":0.43195698,"about_ca_system_score_codex":0.0000057066623,"about_ca_system_score_gemma":0.00010397978,"threshold_uncertainty_score":0.37827447},"labels":[],"label_agreement":null},{"id":"W2624658792","doi":"10.1016/j.tcs.2017.05.039","title":"On RAC drawings of 1-planar graphs","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"University of Waterloo","funders":"","keywords":"Planar graph; Combinatorics; Planar straight-line graph; Outerplanar graph; Book embedding; Planar; Graph drawing; Mathematics; Line graph; 1-planar graph; Graph; Discrete mathematics; Pathwidth; Computer science; Computer graphics (images)","score_opus":0.010909321731467709,"score_gpt":0.26626685491266744,"score_spread":0.25535753318119975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624658792","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.11342958,0.000007976605,0.87868655,0.0010618308,0.00071093976,0.00008382762,0.0000011661211,0.000055193323,0.0059629334],"genre_scores_gemma":[0.89125943,0.0000018415003,0.1082907,0.0003673467,0.00006118225,0.0000020189125,5.738804e-7,0.0000030417239,0.000013881768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982445,0.000045810128,0.00021583166,0.0004956791,0.00070679106,0.00029136226],"domain_scores_gemma":[0.9981107,0.00023013385,0.00015336052,0.0011312173,0.00021749159,0.00015709273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001092215,0.00012143562,0.00015919958,0.0002259624,0.00088454934,0.0005103007,0.003004872,0.000034074255,0.000018604953],"category_scores_gemma":[0.00021552942,0.00010095308,0.00006514874,0.00040982934,0.001897324,0.0007517712,0.0004989745,0.000112789196,0.00004570816],"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.0000067929345,0.000044121836,0.00004279862,0.0000035161968,0.0000024754045,0.0000044456056,0.00011297853,0.00034330264,0.001049081,0.9623057,0.00008525167,0.035999514],"study_design_scores_gemma":[0.00019382658,0.00024663482,0.0065830695,0.000025012503,0.000002216316,0.000011371108,7.985838e-7,0.2340968,0.013653813,0.7449796,0.0000742487,0.00013260182],"about_ca_topic_score_codex":0.0000035651285,"about_ca_topic_score_gemma":2.888859e-7,"teacher_disagreement_score":0.7778298,"about_ca_system_score_codex":0.000019383708,"about_ca_system_score_gemma":0.000101489124,"threshold_uncertainty_score":0.69907695},"labels":[],"label_agreement":null},{"id":"W2625384342","doi":"","title":"Algorithms for l 1 -Embeddability and Related Problems","year":2003,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Heuristics; Constructive; Combinatorics; Tabu search; Variable (mathematics); Quadratic equation; Column generation; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Process (computing); Geometry","score_opus":0.01363005821147332,"score_gpt":0.23065202503526375,"score_spread":0.21702196682379044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625384342","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.101681076,0.0003195969,0.8953711,0.00075282244,0.0003784493,0.00028760498,0.0000025635004,0.00008777428,0.0011190325],"genre_scores_gemma":[0.65023804,0.000023898652,0.34813526,0.00023649236,0.000051745366,0.0000546098,0.000012778711,0.000007668644,0.0012395252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992159,0.000065102635,0.00016110047,0.00029751792,0.00010996425,0.00015044308],"domain_scores_gemma":[0.99948275,0.00014773477,0.000048136353,0.00016945392,0.000084696236,0.00006725065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041887732,0.000087707915,0.000094178,0.00006280576,0.000233199,0.00008484234,0.0001212827,0.00007673359,0.000007917224],"category_scores_gemma":[0.0001359787,0.00008365232,0.000041048337,0.00025497674,0.00006058141,0.0002221828,0.000018665038,0.000086259206,0.0000043267887],"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.0000030301915,0.00005526546,0.00033408205,0.00003088891,0.00002169711,0.0000018285634,0.0014822374,0.0015337698,0.00047617298,0.92346835,0.000602029,0.071990654],"study_design_scores_gemma":[0.0013105487,0.00022197574,0.0051920465,0.000011095298,0.000015661819,0.00012735887,0.000058895905,0.21505897,0.0029351143,0.7002746,0.074375525,0.00041825933],"about_ca_topic_score_codex":0.0000035307432,"about_ca_topic_score_gemma":0.0000015767347,"teacher_disagreement_score":0.5485569,"about_ca_system_score_codex":0.000037960584,"about_ca_system_score_gemma":0.000040491603,"threshold_uncertainty_score":0.34112424},"labels":[],"label_agreement":null},{"id":"W2625997110","doi":"10.1093/imrn/rnx336","title":"Breaking the 3/2 Barrier for Unit Distances in Three Dimensions","year":2018,"lang":"en","type":"preprint","venue":"International Mathematics Research Notices","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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 British Columbia","funders":"","keywords":"Unit (ring theory); Combinatorics; Set (abstract data type); Mathematics; Key (lock); Computer science","score_opus":0.19446110819307436,"score_gpt":0.44373987397778997,"score_spread":0.2492787657847156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625997110","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.09658971,0.0003903389,0.88654834,0.0074617905,0.0023952893,0.0012739503,0.00008946949,0.00007021804,0.0051808706],"genre_scores_gemma":[0.87262213,0.00004258898,0.12526841,0.00010261134,0.0007322015,0.00043195058,0.000054495988,0.000020047368,0.00072557153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710953,0.00014984197,0.000489559,0.0005152408,0.0013856973,0.00035012752],"domain_scores_gemma":[0.9943682,0.0034030976,0.00022743706,0.00064198667,0.0012899989,0.00006927414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032575717,0.00018404049,0.0002022952,0.00055135187,0.0003355953,0.0009696702,0.002819038,0.00012376823,0.00004646217],"category_scores_gemma":[0.0015720787,0.00013526023,0.00011007734,0.00042550673,0.0001917408,0.00033092013,0.0019611057,0.00056397606,0.00004595047],"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.00002771403,0.0003343697,0.00036733993,0.00031732302,0.00017056928,0.000011069613,0.0032304164,0.0333865,0.00020160855,0.9534988,0.0017890122,0.0066653206],"study_design_scores_gemma":[0.00011387571,0.0000256259,0.0005046131,0.00022354868,0.000004045444,0.0000021780606,0.00007260478,0.5399887,0.00020446663,0.4541044,0.004649287,0.000106667336],"about_ca_topic_score_codex":0.00005935083,"about_ca_topic_score_gemma":0.00073250686,"teacher_disagreement_score":0.7760324,"about_ca_system_score_codex":0.0001308432,"about_ca_system_score_gemma":0.00034148231,"threshold_uncertainty_score":0.9350552},"labels":[],"label_agreement":null},{"id":"W2626485963","doi":"","title":"A dynamic data structure for efficient bounded line range search","year":2010,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Bounded function; Line (geometry); Rectangle; Intersection (aeronautics); Combinatorics; Data structure; Line segment; Mathematics; Set (abstract data type); Range (aeronautics); Plane (geometry); Algorithm; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.0316292291660358,"score_gpt":0.3200860811314963,"score_spread":0.2884568519654605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626485963","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.18372197,0.000016595135,0.8139719,0.0012070644,0.0006382782,0.00021640344,0.000044701643,0.000065344924,0.00011778537],"genre_scores_gemma":[0.6863168,5.466917e-7,0.31276238,0.0001793535,0.00010594967,0.0000039994065,0.00016804699,0.000003391363,0.00045958094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914837,0.000015205587,0.00011480097,0.00035367234,0.00020931172,0.00015866394],"domain_scores_gemma":[0.99899566,0.00010589178,0.0000227046,0.00068696623,0.0001288945,0.000059906073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030391535,0.000071209775,0.00006896996,0.00008557557,0.00013863803,0.00017306898,0.00088023697,0.0000440157,0.000050770024],"category_scores_gemma":[0.000059324288,0.000058959526,0.000022216209,0.00028005656,0.000019163515,0.00018307481,0.00032044842,0.00011272671,0.00001272049],"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.000052347346,0.0002847441,0.00008082784,0.0000734999,0.000051272076,0.000003831736,0.00061252725,0.06534297,0.12620553,0.47710806,0.006215694,0.32396868],"study_design_scores_gemma":[0.00032255522,0.000033525277,0.0004720825,0.000001210555,0.0000025012312,0.0000064702062,0.000003293558,0.9875687,0.0021720123,0.0032656367,0.006070892,0.00008113203],"about_ca_topic_score_codex":0.000008197489,"about_ca_topic_score_gemma":0.00017726696,"teacher_disagreement_score":0.9222257,"about_ca_system_score_codex":0.000010290745,"about_ca_system_score_gemma":0.00010990179,"threshold_uncertainty_score":0.24042997},"labels":[],"label_agreement":null},{"id":"W2627019463","doi":"","title":"Maximal Perimeter, Diameter and Area of Equilateral Unit-Width Convex Polygons","year":2010,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Equilateral triangle; Perimeter; Regular polygon; Combinatorics; Mathematics; Maximization; Unit (ring theory); Geometry; Mathematical optimization","score_opus":0.013791248401872555,"score_gpt":0.233387571523368,"score_spread":0.21959632312149546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2627019463","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.44939506,0.00016442449,0.54869765,0.0009337073,0.00023530894,0.00018796865,0.000015025592,0.0001571983,0.00021366483],"genre_scores_gemma":[0.7518368,0.000022202743,0.24702802,0.0006743361,0.00007604009,0.000049512226,0.000011862256,0.00001604347,0.00028518413],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836093,0.000080379716,0.00039444692,0.00043322772,0.0003063278,0.0004246635],"domain_scores_gemma":[0.99858755,0.00015632315,0.00017913437,0.000663501,0.00016034456,0.00025312323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046203446,0.00024541537,0.00029185077,0.00047105187,0.00015899597,0.00021639362,0.0005919045,0.00018400565,0.000038954022],"category_scores_gemma":[0.00009613299,0.00024025851,0.00010701652,0.0005558198,0.0001308773,0.0006039212,0.00029829505,0.00035630353,0.000005643164],"study_design_candidate":"bench_or_experimental","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.00008199752,0.00038919802,0.037877783,0.000054104872,0.00008656271,0.00004550649,0.0008038584,0.001212547,0.6759112,0.17320001,0.0009965939,0.10934066],"study_design_scores_gemma":[0.0008972609,0.0004276984,0.12003203,0.000032264972,0.000031904186,0.0003826872,0.000022017457,0.6251331,0.2331039,0.016829506,0.0024455432,0.00066207966],"about_ca_topic_score_codex":0.0007617192,"about_ca_topic_score_gemma":0.0003589866,"teacher_disagreement_score":0.62392056,"about_ca_system_score_codex":0.000033474946,"about_ca_system_score_gemma":0.0001701678,"threshold_uncertainty_score":0.97974575},"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":"W27060824","doi":"10.1007/978-3-642-45043-3_10","title":"The θ 5-Graph is a Spanner","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Spanner; Combinatorics; Upper and lower bounds; Euclidean geometry; Graph; Constructive; Mathematics; Discrete mathematics; Computer science; Geometry","score_opus":0.014224075468779294,"score_gpt":0.23316569446582788,"score_spread":0.2189416189970486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27060824","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.000045508652,0.0010474047,0.9859425,0.00411389,0.002377389,0.0003504455,0.0000023443224,0.00010166708,0.0060188808],"genre_scores_gemma":[0.10830166,0.00054715335,0.85367316,0.015867064,0.0028887338,0.000079732716,0.000017430637,0.000089474175,0.01853556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679387,0.000031676747,0.00043597422,0.0011346296,0.0010502475,0.00055360177],"domain_scores_gemma":[0.99736565,0.0006260827,0.0002311357,0.0012414205,0.00038708566,0.0001486392],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007592127,0.00039535886,0.0002805883,0.0005507205,0.00065250375,0.0012666009,0.0030901094,0.00020418009,0.000055404762],"category_scores_gemma":[0.000066586115,0.00028078628,0.00014604956,0.0008255432,0.0005224694,0.00059799524,0.0009865502,0.00056736945,0.00029609146],"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.0000016606463,0.00001056515,0.000004884121,0.0000071642203,0.000010380288,0.000010774265,0.00031907868,0.020575492,0.00004533908,0.08737425,0.00087362435,0.8907668],"study_design_scores_gemma":[0.00012808907,0.000084157444,0.00010414814,0.0000760224,0.0000043160726,0.000043140404,8.239447e-8,0.46334913,0.0007534151,0.49761504,0.03741058,0.00043187992],"about_ca_topic_score_codex":0.000016089089,"about_ca_topic_score_gemma":0.00003245794,"teacher_disagreement_score":0.8903349,"about_ca_system_score_codex":0.00013419481,"about_ca_system_score_gemma":0.0004667131,"threshold_uncertainty_score":0.9999644},"labels":[],"label_agreement":null},{"id":"W27126087","doi":"","title":"A Decomposition Theorem for Simply Connected Orthogonal Polygons.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Decomposition theorem; Combinatorics; Decomposition; Pure mathematics","score_opus":0.011417905056272713,"score_gpt":0.2628185534848519,"score_spread":0.2514006484285792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27126087","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.4477337,0.00011075788,0.5461953,0.00069332495,0.0024188939,0.00039995587,0.0000069161742,0.00018968525,0.0022514565],"genre_scores_gemma":[0.9742283,0.0000036282986,0.0250567,0.0004986871,0.0000137780735,0.000050524388,0.000038339644,0.000009053799,0.00010097713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989349,0.000112300906,0.00020849868,0.0003145257,0.00019634227,0.00023338494],"domain_scores_gemma":[0.99900657,0.00034294077,0.00008131654,0.0002558106,0.00022103194,0.00009234875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036623445,0.00012600055,0.00012789502,0.00011464679,0.00023705645,0.00012342427,0.00027043233,0.0000591205,0.000021076812],"category_scores_gemma":[0.00015947531,0.00012968143,0.0000809913,0.0004665399,0.000021967275,0.00031497655,0.000038032074,0.0000702583,0.000026875685],"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.000010457141,0.00008765858,0.00012232747,0.0000050233166,0.000015956954,0.0000017928926,0.00007699888,0.00027099022,0.0014911555,0.99342036,0.0014484266,0.0030488258],"study_design_scores_gemma":[0.0010909243,0.0001743245,0.0013771524,0.0000072632733,0.000008536373,0.000028313563,0.000009511838,0.019977126,0.011593976,0.9579122,0.007620498,0.00020019167],"about_ca_topic_score_codex":0.000001924973,"about_ca_topic_score_gemma":0.0000019296035,"teacher_disagreement_score":0.5264946,"about_ca_system_score_codex":0.000042575626,"about_ca_system_score_gemma":0.00013118096,"threshold_uncertainty_score":0.5288255},"labels":[],"label_agreement":null},{"id":"W2724706363","doi":"10.4230/lipics.socg.2017.27","title":"Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Combinatorics; Mathematics; Sublinear function; Dimension (graph theory); Discrete mathematics; Binary logarithm; Randomized algorithm; Data structure; Constant (computer programming); Computer science","score_opus":0.0315930621693897,"score_gpt":0.2854385854838485,"score_spread":0.25384552331445875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724706363","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.78791744,0.00017576815,0.20773754,0.000711402,0.00053892995,0.0008559784,0.00015843101,0.000076451484,0.0018280542],"genre_scores_gemma":[0.964083,0.00010522797,0.034712467,0.00043541554,0.0001239008,0.000058342113,0.0001256598,0.000018022443,0.00033796654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791366,0.00006211005,0.00070997037,0.00032941785,0.00045534354,0.0005295041],"domain_scores_gemma":[0.9983884,0.00020911699,0.00034021112,0.00069233874,0.00018116822,0.0001887586],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008092189,0.00029423842,0.00036474149,0.0003556456,0.0008270829,0.0012067872,0.00085477275,0.00012829834,0.000012905339],"category_scores_gemma":[0.000146959,0.00026757934,0.00012052049,0.00018194626,0.000111747555,0.0031454705,0.00059931044,0.00030548728,0.000047185946],"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.0014810851,0.0015081079,0.19947991,0.0015024431,0.0006090903,0.00010896326,0.048000187,0.051163074,0.0009699575,0.20085049,0.006559317,0.48776737],"study_design_scores_gemma":[0.004865614,0.00018854794,0.05955894,0.00019094418,0.000014959062,0.00004986098,0.0002105205,0.92276096,0.00028408863,0.0036049217,0.007752001,0.00051860913],"about_ca_topic_score_codex":0.000037996153,"about_ca_topic_score_gemma":0.00031991513,"teacher_disagreement_score":0.87159795,"about_ca_system_score_codex":0.00007237952,"about_ca_system_score_gemma":0.000113351125,"threshold_uncertainty_score":0.99997765},"labels":[],"label_agreement":null},{"id":"W2726946110","doi":"10.5539/jmr.v9n4p49","title":"Calculation of the Maximum Number of Cutting Finite Fields in the Multi-dimensions","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Context (archaeology); Euler's formula; Plane (geometry); CONTEST; Basis (linear algebra); Dimension (graph theory); Mathematical analysis; Combinatorics; Pure mathematics; Geometry","score_opus":0.17683444868659032,"score_gpt":0.4463265929498603,"score_spread":0.26949214426327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726946110","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.7237492,0.000049981376,0.2726549,0.002504251,0.00014971667,0.00013397893,6.480207e-7,0.0000011762081,0.00075609883],"genre_scores_gemma":[0.9399632,0.00001526831,0.059881642,0.000013344877,0.000035486522,0.0000010982325,8.341581e-8,0.0000019911795,0.00008788296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842674,0.00020678024,0.00040457273,0.000055263416,0.00080462254,0.00010201449],"domain_scores_gemma":[0.99750006,0.0010431855,0.00046282736,0.00042566343,0.0005478832,0.000020367183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003964811,0.000039591643,0.00011453373,0.00011820902,0.00021113275,0.00007695181,0.0010466243,0.00003666426,0.0000062249455],"category_scores_gemma":[0.001831931,0.000021759333,0.00007421324,0.0002517012,0.00006826893,0.00020091096,0.0002274205,0.00029003262,0.0000023886344],"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.000080015954,0.005121383,0.057956837,0.0013419478,0.00028487665,0.00010753128,0.09849376,0.21736412,0.026428506,0.48142165,0.0052165757,0.106182806],"study_design_scores_gemma":[0.0007331361,0.000098431985,0.043910477,0.00048342216,0.000010210571,0.00010989461,0.0006411882,0.8236005,0.008948326,0.12107282,0.00031459614,0.00007702539],"about_ca_topic_score_codex":0.000017612969,"about_ca_topic_score_gemma":0.0000143381485,"teacher_disagreement_score":0.60623634,"about_ca_system_score_codex":0.000015626028,"about_ca_system_score_gemma":0.00011650291,"threshold_uncertainty_score":0.21931249},"labels":[],"label_agreement":null},{"id":"W2727825080","doi":"10.4230/lipics.esa.2016.34","title":"On Interference Among Moving Sensors and Related Problems","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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 Ottawa","funders":"","keywords":"Voronoi diagram; Combinatorics; Interference (communication); Binary logarithm; Set (abstract data type); Log-log plot; Upper and lower bounds; Mathematics; Diagram; Discrete mathematics; Mathematical analysis; Computer science; Geometry; Statistics; Telecommunications","score_opus":0.010557863851427367,"score_gpt":0.22149315034837466,"score_spread":0.2109352864969473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727825080","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.5760439,0.000017043076,0.41992086,0.00048800203,0.00058834045,0.00050012534,0.000039220304,0.00016872167,0.0022337942],"genre_scores_gemma":[0.9908689,0.000022407177,0.0077940198,0.00027641474,0.000044313125,0.000045651537,0.000035471057,0.000015141601,0.0008976722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982854,0.000038166952,0.0006703484,0.00029181628,0.00031179152,0.00040249116],"domain_scores_gemma":[0.9986508,0.0002960316,0.0002840893,0.00041408255,0.00019585749,0.00015914509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044118744,0.00024922416,0.00022475612,0.00028671735,0.00024424246,0.0003026051,0.00049122615,0.00013060751,0.000020703326],"category_scores_gemma":[0.00015997485,0.00017852597,0.00008937779,0.0002954427,0.00009295334,0.0017288078,0.0002839387,0.00017564223,0.000094574745],"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.00018573762,0.0007113975,0.017032074,0.00092535804,0.00049433217,0.000019845837,0.03081991,0.010679241,0.0028480557,0.49890175,0.007859888,0.4295224],"study_design_scores_gemma":[0.007907654,0.0016001989,0.020322101,0.0015880327,0.000046617024,0.00024143144,0.00042502105,0.89366955,0.0069783237,0.050435126,0.015028292,0.0017576745],"about_ca_topic_score_codex":0.0000039969514,"about_ca_topic_score_gemma":0.0000048809898,"teacher_disagreement_score":0.8829903,"about_ca_system_score_codex":0.00007528377,"about_ca_system_score_gemma":0.000040614006,"threshold_uncertainty_score":0.72800773},"labels":[],"label_agreement":null},{"id":"W2732737200","doi":"10.1007/978-3-319-62395-5_34","title":"A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Windsor","funders":"","keywords":"Computer science; Chordal graph; Algorithm; Point (geometry); Distance matrix; Plane (geometry); Matrix (chemical analysis); Graph; Theoretical computer science; Mathematics; Geometry","score_opus":0.03860662644556757,"score_gpt":0.29401146796174155,"score_spread":0.255404841516174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732737200","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.00003944176,0.0002110795,0.993223,0.0018002656,0.0011032766,0.0014009484,0.000020042351,0.000043253956,0.0021586702],"genre_scores_gemma":[0.09169669,0.000014516885,0.9043731,0.002044774,0.000847388,0.0001536866,0.00009123991,0.000023608352,0.00075497635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967259,0.000047410886,0.0004703272,0.0012563532,0.000996701,0.00050329906],"domain_scores_gemma":[0.99772036,0.00053395366,0.0002717624,0.0011725611,0.00019990926,0.000101433885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018847244,0.00038338703,0.0003914261,0.0006063341,0.00049109984,0.001025453,0.0032158575,0.00014852473,0.00000316364],"category_scores_gemma":[0.00009835846,0.0003052517,0.00009831486,0.0003473359,0.00020398399,0.0004424474,0.00054459256,0.00039186672,0.000014094642],"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.000039476523,0.00013927564,0.0000137048,0.0000892938,0.000012128829,0.000022437263,0.0029303823,0.5472577,0.000058846643,0.1612153,0.00042724385,0.28779417],"study_design_scores_gemma":[0.00046937086,0.00025460662,0.00025802362,0.00016285497,0.0000057878447,0.00006440407,0.0000010077641,0.89260477,0.00008757859,0.09146021,0.014149784,0.00048159788],"about_ca_topic_score_codex":0.000025962763,"about_ca_topic_score_gemma":0.000113762224,"teacher_disagreement_score":0.34534705,"about_ca_system_score_codex":0.00031959623,"about_ca_system_score_gemma":0.0002963679,"threshold_uncertainty_score":0.99994},"labels":[],"label_agreement":null},{"id":"W2736497082","doi":"","title":"Extremal Problems for Convex Polygons","year":2005,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Regular polygon; Polygon (computer graphics); Mathematics; Combinatorics; Convex polygon; Series (stratigraphy); Linear programming; Point in polygon; Mathematical optimization; Discrete mathematics; Computer science; Geometry","score_opus":0.024639878460839457,"score_gpt":0.251696447566421,"score_spread":0.22705656910558156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736497082","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.005320644,0.02014526,0.891634,0.078310944,0.0012527484,0.0016872485,0.00013725918,0.00059369486,0.0009182097],"genre_scores_gemma":[0.31238234,0.00052802195,0.6329287,0.0073172385,0.0023551437,0.0010800017,0.00010545325,0.00008814389,0.043214917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996056,0.00021578207,0.00087161275,0.00096315774,0.000559359,0.0013340638],"domain_scores_gemma":[0.99714804,0.00040114185,0.0003757886,0.0009788177,0.00050925644,0.0005869633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012617162,0.0005529774,0.0005122417,0.00057939324,0.00061996846,0.0007768316,0.0010421766,0.000500126,0.00014823067],"category_scores_gemma":[0.00027807427,0.00064598763,0.0003971506,0.0011592081,0.00017337642,0.0016601915,0.0003608192,0.00047907062,0.00014413706],"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.000053067084,0.0006236336,0.00064214465,0.00013496123,0.000085664564,0.000016862146,0.00077033916,0.10069758,0.0049556247,0.4882548,0.031265445,0.3724999],"study_design_scores_gemma":[0.00072773034,0.0002737993,0.0021187516,0.00009454962,0.00004779631,0.00023818857,0.000020706344,0.6821395,0.006713569,0.009038127,0.29805458,0.00053267676],"about_ca_topic_score_codex":0.0019659447,"about_ca_topic_score_gemma":0.0029102815,"teacher_disagreement_score":0.58144194,"about_ca_system_score_codex":0.00068569666,"about_ca_system_score_gemma":0.00094242074,"threshold_uncertainty_score":0.99959916},"labels":[],"label_agreement":null},{"id":"W2737037492","doi":"","title":"The Small Octagons of Maximal Width","year":2012,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Interval (graph theory); Code (set theory); Affine transformation; Unit interval; Combinatorics; Discrete mathematics; Algorithm; Pure mathematics; Set (abstract data type); Computer science","score_opus":0.0146265119393559,"score_gpt":0.22820191503250709,"score_spread":0.21357540309315118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737037492","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.06383943,0.0018620918,0.9300391,0.0026808453,0.00031601437,0.0002612419,0.000005989665,0.00022452968,0.00077074725],"genre_scores_gemma":[0.7995401,0.000078237594,0.19893225,0.00060492055,0.00016918594,0.00009166985,0.00000622536,0.000012465789,0.000564961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984915,0.000122028185,0.00034501174,0.00021096949,0.00029802724,0.00053244474],"domain_scores_gemma":[0.99854314,0.00025736535,0.00018654442,0.0006812791,0.00013226506,0.00019938758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097534584,0.00016327562,0.00015864016,0.0001858581,0.00032268956,0.00014012947,0.0008377264,0.0000962527,0.0000052893706],"category_scores_gemma":[0.00014977576,0.00013010687,0.000117553886,0.00066252274,0.00006680577,0.00046659904,0.00029994195,0.00018021754,0.0000129956425],"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.000024860503,0.00021053682,0.011915488,0.000012617916,0.00003611838,0.000003230813,0.0003765751,0.003472642,0.006542727,0.813087,0.0020860264,0.16223216],"study_design_scores_gemma":[0.0007621075,0.00032154913,0.24776122,0.000041339197,0.00004226735,0.0002731414,0.000092479124,0.5537386,0.09427055,0.04438296,0.057514057,0.00079975853],"about_ca_topic_score_codex":0.00045567492,"about_ca_topic_score_gemma":0.00024667077,"teacher_disagreement_score":0.76870406,"about_ca_system_score_codex":0.00010072776,"about_ca_system_score_gemma":0.00015826739,"threshold_uncertainty_score":0.53056043},"labels":[],"label_agreement":null},{"id":"W2740363516","doi":"","title":"The convex hull of every optimal pseudolinear drawing of kn is a triangle","year":2007,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","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":"Mathematics; Combinatorics; Convex hull; Hull; Regular polygon; Geometry; Materials science; Composite material","score_opus":0.01522270383847111,"score_gpt":0.26651780474252373,"score_spread":0.2512951009040526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740363516","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.6807396,0.000640955,0.31413257,0.002353616,0.0014267599,0.00013171128,0.0000017704352,0.000009255072,0.00056377664],"genre_scores_gemma":[0.9956638,0.000046989175,0.0037509918,0.000052886695,0.00014031421,2.8143242e-7,2.9347314e-7,0.0000057739817,0.00033864556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998212,0.000114165814,0.00077662827,0.00009272032,0.0005942693,0.00021021656],"domain_scores_gemma":[0.9975565,0.00062474684,0.0008441328,0.00030253993,0.00058639835,0.00008568026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026447892,0.000107149695,0.00025684084,0.0001547647,0.00015001913,0.000059905506,0.0009802831,0.000054377488,0.0000071128507],"category_scores_gemma":[0.0001629729,0.000067454086,0.00019342093,0.0007803925,0.000108981105,0.00029461543,0.00008812629,0.00026335567,0.0000028147363],"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.00078264193,0.0011516364,0.003559792,0.00015467155,0.0007564876,0.00014316688,0.014750631,0.024302065,0.01510361,0.8544984,0.01610199,0.06869494],"study_design_scores_gemma":[0.010128975,0.0056061116,0.058478355,0.0005120986,0.00038151548,0.0021066659,0.0034620636,0.044410843,0.58742034,0.25268045,0.03380299,0.0010095815],"about_ca_topic_score_codex":0.0000023956854,"about_ca_topic_score_gemma":3.4880225e-7,"teacher_disagreement_score":0.6018179,"about_ca_system_score_codex":0.000037382433,"about_ca_system_score_gemma":0.00021824059,"threshold_uncertainty_score":0.27506977},"labels":[],"label_agreement":null},{"id":"W2741229744","doi":"10.1007/978-3-540-78773-0_15","title":"Spanners of Complete k-Partite Geometric Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Spanner; Combinatorics; Vertex (graph theory); Mathematics; Graph; Set (abstract data type); Time complexity; Discrete mathematics; Computer science","score_opus":0.026251154412180892,"score_gpt":0.24076446516687172,"score_spread":0.21451331075469082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741229744","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.00052971125,0.0013007002,0.99394757,0.0002958174,0.0015178465,0.00028665474,0.000011006152,0.000093322065,0.0020173728],"genre_scores_gemma":[0.51338315,0.0003575733,0.48453334,0.00080307154,0.00038049615,0.000008457372,0.000028692408,0.000034878216,0.00047035562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962268,0.000036804428,0.00069004955,0.0012093462,0.0013174058,0.00051960995],"domain_scores_gemma":[0.9973419,0.00052898016,0.00044190086,0.0010363152,0.0004772374,0.00017370278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006334595,0.00043769617,0.00057544274,0.0029999972,0.00023470253,0.00016593546,0.0023491245,0.0002201432,0.000022712065],"category_scores_gemma":[0.00011135654,0.00042927486,0.00025461413,0.002848821,0.0006669321,0.00054684107,0.0008124727,0.0004898227,0.000041700638],"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.000009243922,0.00006587418,0.00011579022,0.00006137693,0.000036359746,0.00008024557,0.00053424935,0.3500858,0.00043113256,0.036451768,0.00029165586,0.6118365],"study_design_scores_gemma":[0.00073428015,0.00056839356,0.002065094,0.0003743941,0.00002318346,0.00036613562,1.6314061e-7,0.82351804,0.004959579,0.15599188,0.009983901,0.0014149521],"about_ca_topic_score_codex":0.000018761875,"about_ca_topic_score_gemma":0.000018027957,"teacher_disagreement_score":0.61042154,"about_ca_system_score_codex":0.00015070592,"about_ca_system_score_gemma":0.0005544401,"threshold_uncertainty_score":0.9998159},"labels":[],"label_agreement":null},{"id":"W2743128558","doi":"10.1007/978-3-319-73915-1_7","title":"Grid-Obstacle Representations with Connections to Staircase Guarding","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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":"Obstacle; Grid; Vertex (graph theory); Bipartite graph; Monotone polygon; Representation (politics); Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Path (computing); Computer science; Topology (electrical circuits); Graph; Discrete mathematics; Geometry; Artificial intelligence; Geography","score_opus":0.023798389640919237,"score_gpt":0.3008396355333772,"score_spread":0.277041245892458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743128558","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.06784782,0.000053918713,0.9243248,0.0032960558,0.0035663275,0.0006109151,0.000012676958,0.00022884904,0.0000586223],"genre_scores_gemma":[0.5303828,0.0000019101024,0.4681138,0.0008108083,0.0006167465,0.00004941448,0.000011947362,0.000009390295,0.0000031680927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617624,0.00011897938,0.0004292929,0.0017716571,0.0009167008,0.0005871423],"domain_scores_gemma":[0.99688447,0.00047666446,0.0001887787,0.0014552794,0.0007309554,0.00026388207],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00090023375,0.00035148746,0.00032082677,0.001223684,0.00060701306,0.0012296364,0.0017254452,0.00013462578,0.0000128724405],"category_scores_gemma":[0.00032759595,0.00032459738,0.00007960428,0.004259661,0.00027928842,0.0007033512,0.0024764945,0.0005251819,0.00004001596],"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.0000074949057,0.000058703834,0.0004204687,0.00001803886,0.000010748733,0.000039529525,0.0015450766,0.9262308,0.00027044798,0.0009029642,0.00013224404,0.070363484],"study_design_scores_gemma":[0.00027733025,0.0002687701,0.0038791532,0.00018139681,0.000009219238,0.0001571095,0.0000027059357,0.95980066,0.010296151,0.024253689,0.00030417554,0.0005696457],"about_ca_topic_score_codex":0.00013504615,"about_ca_topic_score_gemma":0.00027343226,"teacher_disagreement_score":0.46253496,"about_ca_system_score_codex":0.00032180393,"about_ca_system_score_gemma":0.0010445786,"threshold_uncertainty_score":0.9999206},"labels":[],"label_agreement":null},{"id":"W2750689360","doi":"10.1007/978-3-319-73915-1_12","title":"Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Bobbin; Embedding; Computer science; Epigraph; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.0235473227802511,"score_gpt":0.26987445797799636,"score_spread":0.24632713519774527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750689360","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.0047547594,0.00046471923,0.99149096,0.00033094487,0.0018954653,0.0005940437,0.000022041913,0.00009482336,0.00035226598],"genre_scores_gemma":[0.40053236,0.00005096649,0.5974456,0.0008268284,0.0004405681,0.000029515426,0.000031252053,0.000038354392,0.0006045651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965665,0.000037908045,0.0006344286,0.0012980535,0.0009201044,0.0005430487],"domain_scores_gemma":[0.9975909,0.00063011056,0.00040531092,0.00079222344,0.00043367167,0.00014775651],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009066362,0.00046211024,0.0005329371,0.0012400692,0.00040025235,0.00045109077,0.0020298264,0.00024439502,0.000041762],"category_scores_gemma":[0.00010037426,0.0004089686,0.00024354667,0.0010178486,0.00084509584,0.0006144849,0.00069139135,0.00030980998,0.0000111540585],"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.00017129442,0.00021590642,0.00035842048,0.00040998936,0.00010690664,0.000058659876,0.0055464515,0.04889045,0.0035441883,0.17370413,0.0005512707,0.76644236],"study_design_scores_gemma":[0.000918148,0.0010964546,0.00041838753,0.0005620916,0.00002753122,0.00010738514,0.0000018625034,0.49166307,0.008546029,0.49119058,0.004461526,0.0010069103],"about_ca_topic_score_codex":0.000013724611,"about_ca_topic_score_gemma":0.00009485134,"teacher_disagreement_score":0.7654354,"about_ca_system_score_codex":0.00016725062,"about_ca_system_score_gemma":0.0007639329,"threshold_uncertainty_score":0.9998362},"labels":[],"label_agreement":null},{"id":"W2755780781","doi":"10.1007/s10878-012-9452-4","title":"Some variations on constrained minimum enclosing circle problem","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Theory of computation; Space (punctuation); Computational geometry; Set (abstract data type); Time complexity; Algorithm; Discrete mathematics; Computer science","score_opus":0.011808940651114049,"score_gpt":0.2434845912251584,"score_spread":0.23167565057404435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755780781","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.004098414,0.00013747039,0.98685783,0.00078259123,0.007110931,0.00013612547,0.0000011138346,0.000033230735,0.0008422736],"genre_scores_gemma":[0.7572695,0.000020541003,0.24071477,0.00016233211,0.0017933035,0.000002501257,0.0000060616135,0.0000073263163,0.000023675204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986264,0.00013293694,0.0004811879,0.000108035194,0.00046119277,0.00019025001],"domain_scores_gemma":[0.99858177,0.00019658722,0.00049686996,0.00013793312,0.00044605194,0.00014081705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007423242,0.00010222684,0.00016725887,0.00028951632,0.00016170998,0.0001448015,0.00026008254,0.00007257888,0.000017410168],"category_scores_gemma":[0.00018922143,0.00010404201,0.000082829014,0.00048319326,0.000018080009,0.0018925705,0.000038486385,0.00014521038,0.000008404339],"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.000025186055,0.0003624974,0.000048989183,0.000006310185,0.000029861707,0.0000018280238,0.0003896802,0.49497694,0.0006337451,0.4988051,0.0005752592,0.004144595],"study_design_scores_gemma":[0.0057709827,0.001527766,0.0016512156,0.00015939902,0.00010048022,0.00021421706,0.00005516461,0.8212391,0.008282286,0.15694895,0.0034002082,0.000650223],"about_ca_topic_score_codex":6.561642e-7,"about_ca_topic_score_gemma":1.187146e-8,"teacher_disagreement_score":0.7531711,"about_ca_system_score_codex":0.00010054832,"about_ca_system_score_gemma":0.00019055406,"threshold_uncertainty_score":0.42427102},"labels":[],"label_agreement":null},{"id":"W2757636421","doi":"10.1007/s00453-020-00673-y","title":"Shortest Paths in the Plane with Obstacle Violations","year":2020,"lang":"en","type":"article","venue":"Algorithmica","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":"National Science Foundation","keywords":"Obstacle; Shortest path problem; Combinatorics; Euclidean shortest path; Mathematics; Plane (geometry); K shortest path routing; Regular polygon; Path (computing); Point (geometry); Yen's algorithm; Distance; Computer science; Dijkstra's algorithm; Graph; Geometry","score_opus":0.018582563258740834,"score_gpt":0.2171970148391594,"score_spread":0.19861445158041857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757636421","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.03917294,0.000066544264,0.9480826,0.011257847,0.00007151786,0.0001716608,0.000005240112,0.00006703101,0.0011045844],"genre_scores_gemma":[0.96292377,0.000001945473,0.034911167,0.0019882917,0.00012142091,0.000013681216,0.000020577563,0.0000028762267,0.000016270258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937856,0.000042019372,0.00010281847,0.00018213879,0.0001871482,0.00010729052],"domain_scores_gemma":[0.999631,0.000121442514,0.000025384847,0.00014927465,0.000031673862,0.000041252508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009036336,0.00006139229,0.000057796136,0.00003455886,0.00007683117,0.00008429721,0.00034074116,0.000017744835,0.0000086674045],"category_scores_gemma":[0.00002028813,0.00004206085,0.000014825112,0.0006314756,0.000012987019,0.00019840943,0.0000368918,0.00009181101,0.00003451827],"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.00003719415,0.00042007302,0.004957771,0.000019058347,0.00005292605,0.00030768043,0.017543402,0.061807033,0.0017782407,0.17167832,0.009202328,0.732196],"study_design_scores_gemma":[0.0004759553,0.00028999127,0.03354503,0.000009369372,0.0000067377814,0.00006616448,0.00016964265,0.941046,0.00077915384,0.0024479972,0.020946426,0.00021755577],"about_ca_topic_score_codex":0.000009296307,"about_ca_topic_score_gemma":0.000011210684,"teacher_disagreement_score":0.9237508,"about_ca_system_score_codex":0.000008562993,"about_ca_system_score_gemma":0.00004578992,"threshold_uncertainty_score":0.17151916},"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":"W2760492384","doi":"10.1016/j.proeng.2017.09.781","title":"A simple formula for quad mesh singularities","year":2017,"lang":"en","type":"article","venue":"Procedia Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; Center of Excellence in Applied Computational Science and Engineering","keywords":"Quadrilateral; Gravitational singularity; Singularity; Euler's formula; Mathematics; Face (sociological concept); Simple (philosophy); Euler characteristic; Mesh generation; Surface (topology); Geometry; Mathematical analysis; Topology (electrical circuits); Combinatorics; Engineering; Structural engineering; Finite element method","score_opus":0.01754853450948002,"score_gpt":0.25738426942907766,"score_spread":0.23983573491959764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760492384","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.014441756,0.00009198078,0.9843724,0.00025413383,0.00038371395,0.00014268918,0.0000026150963,0.0001346587,0.00017610315],"genre_scores_gemma":[0.87002134,0.0000033374258,0.12949222,0.00004105702,0.00025885657,0.000056708544,0.000006602546,0.000007313284,0.000112537506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994625,0.0000015264627,0.00010026121,0.00016274258,0.00010449811,0.00016849014],"domain_scores_gemma":[0.9995296,0.000057175595,0.000045288907,0.0002396066,0.00008209873,0.000046252346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012904036,0.000078776335,0.00007926605,0.00006402897,0.0002489294,0.0003372828,0.00038737414,0.000029133183,0.0000014779046],"category_scores_gemma":[0.00023386553,0.000083932755,0.000041597934,0.000049294224,0.000006336464,0.000595824,0.000092510134,0.000040384868,0.0000036320782],"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.000011396841,0.00005822706,0.00070381,0.00047076232,0.00005685022,0.0000061182113,0.0014028995,0.070962675,0.0137727065,0.7993568,0.0022872784,0.11091045],"study_design_scores_gemma":[0.0002209606,0.00002923823,0.001622143,0.000012946691,0.0000034069792,0.000005905411,0.0000043346604,0.9653536,0.009819203,0.007995506,0.014789593,0.00014315602],"about_ca_topic_score_codex":0.000004165116,"about_ca_topic_score_gemma":0.0000027799947,"teacher_disagreement_score":0.89439094,"about_ca_system_score_codex":0.000017905175,"about_ca_system_score_gemma":0.00003541734,"threshold_uncertainty_score":0.34226784},"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":"W2764178326","doi":"10.4153/cmb-2017-065-7","title":"On a Property of Real Plane Curves of Even Degree","year":2017,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Degree (music); Property (philosophy); Plane (geometry); Line (geometry); Real line; Combinatorics; Geometry; Epistemology; Physics","score_opus":0.040604508358974875,"score_gpt":0.2547676577520632,"score_spread":0.21416314939308834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764178326","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.28868234,0.00029671265,0.16773273,0.064685576,0.00055634434,0.0014732013,0.00012492512,0.000096717755,0.47635144],"genre_scores_gemma":[0.98738074,0.000012518631,0.01003037,0.00030786748,0.000027444867,0.000008170283,0.0000049326786,0.0000047794456,0.0022232016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992964,0.000028844574,0.00020191462,0.0001417279,0.00019526112,0.00013584309],"domain_scores_gemma":[0.99901396,0.00013048039,0.00012186518,0.0004836133,0.000087749395,0.00016232257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026606844,0.00006905248,0.00015916304,0.000077936755,0.00009580848,0.000031334617,0.00056870776,0.00003617113,0.00057888805],"category_scores_gemma":[0.00053458876,0.0000494045,0.00003943465,0.000050776,0.00006498378,0.000040515864,0.0000494652,0.00005357183,0.00032761425],"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.000014499291,0.0001382991,0.000096729615,0.00060631894,0.00003351908,0.000031413692,0.00029556706,0.00011996532,0.00047073368,0.90612924,0.06564502,0.026418697],"study_design_scores_gemma":[0.003706285,0.0025428613,0.06849121,0.007746691,0.00012418386,0.00022033074,0.000079351994,0.08381785,0.030281737,0.67669666,0.12417166,0.002121168],"about_ca_topic_score_codex":0.0013473688,"about_ca_topic_score_gemma":0.00061573304,"teacher_disagreement_score":0.69869834,"about_ca_system_score_codex":0.000023982679,"about_ca_system_score_gemma":0.00019972566,"threshold_uncertainty_score":0.6338419},"labels":[],"label_agreement":null},{"id":"W2764287401","doi":"10.7155/jgaa.00446","title":"Column planarity and partially-simultaneous geometric embedding","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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 British Columbia","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Planarity testing; Combinatorics; Mathematics; Planar graph; Embedding; Book embedding; Planar; Column (typography); Vertex (graph theory); Graph drawing; Plane (geometry); Graph; Discrete mathematics; Geometry; 1-planar graph; Computer science; Chordal graph","score_opus":0.016296599930877145,"score_gpt":0.28550247132498674,"score_spread":0.2692058713941096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764287401","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.031514376,0.0008467336,0.9663243,0.00093612506,0.00012002713,0.00011033221,0.000005274002,0.0000114329105,0.00013139754],"genre_scores_gemma":[0.9143201,0.00055516366,0.08467938,0.000085536485,0.00027973863,0.000009863524,0.0000015517292,0.0000036230042,0.00006502982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992952,0.000016220987,0.00024231993,0.0001511828,0.0001871578,0.00010791673],"domain_scores_gemma":[0.99891186,0.00016128247,0.0003520327,0.000216737,0.00022271465,0.00013538587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032600889,0.00007396716,0.0001351965,0.00022920256,0.0007187314,0.00050092937,0.0003373411,0.000037664075,0.0000021154417],"category_scores_gemma":[0.00008602486,0.000067312125,0.000041864816,0.00024225916,0.000067300054,0.00046472825,0.00010127417,0.00011496724,0.0000011520095],"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.0000072985827,0.000120114884,0.0020171336,0.00001780759,0.000058483693,0.000023295406,0.00013520896,0.0031137692,0.0003440237,0.03156799,0.00047236597,0.9621225],"study_design_scores_gemma":[0.0021356645,0.00060076424,0.102980666,0.00006680109,0.00011859871,0.0016008453,0.00010669181,0.67738146,0.0011582028,0.101482846,0.111721694,0.00064579054],"about_ca_topic_score_codex":0.000011723153,"about_ca_topic_score_gemma":0.0000063478174,"teacher_disagreement_score":0.96147674,"about_ca_system_score_codex":0.000009203467,"about_ca_system_score_gemma":0.000041576066,"threshold_uncertainty_score":0.5527973},"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":"W2765275569","doi":"10.4230/lipics.esa.2018.22","title":"Improved Routing on the Delaunay Triangulation","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Delaunay triangulation; Factor (programming language); Constrained Delaunay triangulation; Mathematics; Geometry; Computer science","score_opus":0.10285770859953106,"score_gpt":0.20421790217993616,"score_spread":0.1013601935804051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765275569","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.14394031,0.000017183243,0.85154283,0.00062837044,0.000850307,0.00027567346,0.0000043222717,0.00010602677,0.0026349714],"genre_scores_gemma":[0.9965718,0.000015033755,0.0007488088,0.00016586554,0.00020738786,0.0000012453195,0.000020820038,0.0000075967782,0.002261451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987709,0.0001467313,0.00014361145,0.0006591523,0.00009222412,0.00018740032],"domain_scores_gemma":[0.99805397,0.00023302203,0.00034726167,0.001148208,0.00015328662,0.000064275766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004869528,0.0001876488,0.00015304402,0.0001422454,0.00055975013,0.00033072132,0.0014249011,0.00015509674,0.000014798462],"category_scores_gemma":[0.00015796497,0.00016628533,0.00015365737,0.00021969988,0.00004224287,0.00028060956,0.00085567194,0.00036984374,0.000050019888],"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.00001899452,0.000033139644,0.00009620463,0.000008121772,0.000040976593,0.000019705074,0.00013741408,0.47654483,0.00011135402,0.51706463,0.00025924234,0.0056653894],"study_design_scores_gemma":[0.00023557134,0.00003145968,0.0013547969,0.000033228713,0.000019600857,0.0000012850949,0.000009022828,0.9282925,0.0003837689,0.0690607,0.00038678723,0.0001912657],"about_ca_topic_score_codex":0.000047240508,"about_ca_topic_score_gemma":0.00001578923,"teacher_disagreement_score":0.85263145,"about_ca_system_score_codex":0.00012166701,"about_ca_system_score_gemma":0.00017176506,"threshold_uncertainty_score":0.67809194},"labels":[],"label_agreement":null},{"id":"W2766195555","doi":"10.5555/1283383.1283439","title":"Embedding into l 2 ∞ is easy embedding into l 2 ∞ is NP-complete","year":2007,"lang":"en","type":"article","venue":"","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":"Natural Sciences and Engineering Research Council","funders":"","keywords":"Embedding; Metric space; Metric (unit); Dimension (graph theory); Combinatorics; Mathematics; Space (punctuation); Point (geometry); Set (abstract data type); Constraint (computer-aided design); Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.021845794055129705,"score_gpt":0.31112316967054365,"score_spread":0.28927737561541395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766195555","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.047632493,0.0001371044,0.94201446,0.0019310332,0.00071995833,0.00013121829,0.0000011004779,0.000234778,0.0071978588],"genre_scores_gemma":[0.60050076,0.0000072224957,0.39017123,0.0060097924,0.00036456544,0.0000034937561,0.000009202573,0.00001235447,0.0029213591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980037,0.000038938753,0.0004218534,0.00059662585,0.0005324873,0.00040635848],"domain_scores_gemma":[0.99882203,0.00020123909,0.00011138535,0.00045736774,0.00021231365,0.00019564379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007900962,0.00020989582,0.00018956448,0.00036668964,0.0003990406,0.0003178059,0.00066691416,0.000086081905,0.00032668427],"category_scores_gemma":[0.000057788384,0.00020630306,0.000114518974,0.0009717098,0.00003288331,0.0008392059,0.0003480321,0.00015258773,0.00043581822],"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.00005174209,0.000307152,0.0013902413,0.00015116812,0.00019316272,0.00009651975,0.032751784,0.029468866,0.079389006,0.26946944,0.06807139,0.51865953],"study_design_scores_gemma":[0.00041245704,0.00009545426,0.0007189892,0.000026848995,0.000009012822,0.000043101016,0.00015913587,0.7859874,0.04522176,0.027911853,0.13890637,0.0005076329],"about_ca_topic_score_codex":0.00012538517,"about_ca_topic_score_gemma":0.000029050992,"teacher_disagreement_score":0.7565185,"about_ca_system_score_codex":0.000115619485,"about_ca_system_score_gemma":0.00007195349,"threshold_uncertainty_score":0.84127945},"labels":[],"label_agreement":null},{"id":"W2766533261","doi":"10.1007/s00170-017-1193-1","title":"Numerical implementation of drop and tilt method of five-axis tool positioning for tensor product surfaces","year":2017,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","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":"University of Waterloo","funders":"","keywords":"Tilt (camera); Tensor product; Drop (telecommunication); Industrial and production engineering; Mechanical engineering; Computer science; Engineering drawing; Engineering; Mathematics","score_opus":0.013387384302558541,"score_gpt":0.33501052082502814,"score_spread":0.3216231365224696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766533261","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.55584806,0.00007162185,0.43956426,0.0041450034,0.00025470724,0.0000945681,0.0000043942546,0.000008326543,0.000009033084],"genre_scores_gemma":[0.73655665,0.000036794674,0.26330888,0.000024464669,0.000048080325,0.000003878971,0.0000012186767,0.0000030439057,0.000016956032],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991389,0.000022340628,0.00037777718,0.00013320429,0.00024056887,0.00008719047],"domain_scores_gemma":[0.99819875,0.00017513568,0.00092197495,0.00021595036,0.00047380768,0.000014400481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043032973,0.000074077965,0.00016566776,0.0002238492,0.00012994537,0.000050418632,0.0009211358,0.000028927525,0.0000036243368],"category_scores_gemma":[0.00017349244,0.00005659889,0.000055209424,0.00004697427,0.00007063564,0.00044291324,0.00018414424,0.0000953242,1.8398534e-7],"study_design_candidate":"bench_or_experimental","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.00015553046,0.000057610683,0.0005230995,0.000029704626,0.00021971145,0.0000052080354,0.00040256185,0.046055466,0.167,0.023763739,0.00006318895,0.7617242],"study_design_scores_gemma":[0.0006380851,0.00020059083,0.013454437,0.00003606733,0.00001411769,0.00015841426,0.00011402209,0.0060713664,0.9371592,0.041722886,0.00036804102,0.000062783234],"about_ca_topic_score_codex":0.000018806915,"about_ca_topic_score_gemma":0.000003952647,"teacher_disagreement_score":0.7701592,"about_ca_system_score_codex":0.000029861008,"about_ca_system_score_gemma":0.00004917976,"threshold_uncertainty_score":0.23080358},"labels":[],"label_agreement":null},{"id":"W2769340683","doi":"10.20382/jocg.v9i1a14","title":"Canonical ordering for graphs on the cylinder, with applications to periodic straight-line drawings on the flat cyclinder and torus","year":2017,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Torus; Cylinder; Geometry; Mathematics; Line (geometry); Line drawings; Combinatorics; Engineering drawing; Engineering","score_opus":0.03362954508143733,"score_gpt":0.26345186032960455,"score_spread":0.2298223152481672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769340683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18507369,0.000077288925,0.7960427,0.0168199,0.00036986833,0.00079874863,0.00003770038,0.000025289519,0.00075484545],"genre_scores_gemma":[0.96948475,0.000037138758,0.028320247,0.001233185,0.00038591342,0.000011770782,0.00002216046,0.00001924321,0.00048559083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978657,0.00013110704,0.00040896452,0.00049937394,0.0008403046,0.00025456626],"domain_scores_gemma":[0.99583596,0.0016869847,0.000786487,0.0005091646,0.00097313686,0.00020826765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072330853,0.00031637814,0.00037473935,0.00095444155,0.0011040756,0.00060246116,0.001539423,0.00015456985,0.000014882302],"category_scores_gemma":[0.00014322766,0.00021260997,0.00023669816,0.00070050807,0.00015231909,0.00025894764,0.00045769245,0.00076518464,0.00000421244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023115128,0.00011178141,0.00007620267,0.000036513724,0.00028824777,0.000029146757,0.00034962143,0.6676158,0.000044657445,0.32114255,0.00081669574,0.00925767],"study_design_scores_gemma":[0.008600033,0.006875152,0.036311466,0.0019190055,0.0008791478,0.00079930044,0.0011933848,0.30804798,0.0013373939,0.39024782,0.24046083,0.003328468],"about_ca_topic_score_codex":0.000009433573,"about_ca_topic_score_gemma":0.000014481202,"teacher_disagreement_score":0.7844111,"about_ca_system_score_codex":0.00018192198,"about_ca_system_score_gemma":0.0008567804,"threshold_uncertainty_score":0.8669983},"labels":[],"label_agreement":null},{"id":"W2769373697","doi":"10.1007/978-3-319-71147-8_5","title":"Touring Convex Polygons in Polygonal Domain Fences","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Regular polygon; Polygon (computer graphics); Point in polygon; Path (computing); Plane (geometry); Rectilinear polygon; Disjoint sets; Sequence (biology); Domain (mathematical analysis); Star-shaped polygon; Time complexity; Mathematics; Simple polygon; Computer science; Geometry; Convex set; Convex optimization","score_opus":0.018512377368217803,"score_gpt":0.25754169371214486,"score_spread":0.23902931634392705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769373697","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.0009722569,0.0006690096,0.98734933,0.0017012032,0.0023768968,0.00029696967,0.0000053198814,0.000084458654,0.006544547],"genre_scores_gemma":[0.59474576,0.0000615655,0.40125763,0.0013110766,0.0011806582,0.000016078107,0.000013237628,0.00003076848,0.0013832132],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962422,0.000045165798,0.0005474618,0.0014509701,0.0010543754,0.00065980764],"domain_scores_gemma":[0.9977384,0.00040845174,0.00035260513,0.0011589515,0.00016357434,0.0001779674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011366605,0.0004643354,0.0005015685,0.0013356195,0.00047135714,0.0009388182,0.003502341,0.00027500105,0.000032153213],"category_scores_gemma":[0.00010699421,0.0004557795,0.0001239374,0.0004092541,0.0005757438,0.0009982102,0.0012190735,0.00073676,0.00004791406],"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.000011424217,0.000055464112,0.00036974857,0.000037143767,0.000013959425,0.00028698408,0.0012381612,0.07649254,0.00039926855,0.10075802,0.000042135784,0.82029516],"study_design_scores_gemma":[0.0005926246,0.0001771499,0.0028840606,0.00059669395,0.0000053631093,0.00016764557,4.7307157e-7,0.39227238,0.0015004026,0.5968789,0.0038295416,0.0010948138],"about_ca_topic_score_codex":0.00006253941,"about_ca_topic_score_gemma":0.00038748735,"teacher_disagreement_score":0.81920034,"about_ca_system_score_codex":0.00028041145,"about_ca_system_score_gemma":0.00096145703,"threshold_uncertainty_score":0.9997894},"labels":[],"label_agreement":null},{"id":"W2771704532","doi":"10.4230/lipics.socg.2016.15","title":"Incremental Voronoi diagrams","year":2016,"lang":"en","type":"article","venue":"Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Fonds De La Recherche Scientifique - FNRS; National Science Foundation","keywords":"Voronoi diagram; Power diagram; Centroidal Voronoi tessellation; Weighted Voronoi diagram; Combinatorics; Mathematics; Convex hull; Regular polygon; Discrete mathematics; Geometry","score_opus":0.008802864109179501,"score_gpt":0.18787419409289374,"score_spread":0.17907132998371425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771704532","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.31847012,0.00066002447,0.6690848,0.0044268253,0.00050376164,0.00034335317,0.00006600313,0.0006415013,0.0058036116],"genre_scores_gemma":[0.9664466,0.00083052163,0.026108094,0.0010577876,0.00043338566,0.000009050047,0.00008194321,0.00004617502,0.004986487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964332,0.0003252449,0.00040984768,0.0010453393,0.0006485283,0.0011378536],"domain_scores_gemma":[0.99755687,0.00030114467,0.00029631102,0.00086100906,0.00023575495,0.00074889633],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00049716333,0.00056430063,0.00042839957,0.0007411316,0.0013332687,0.000324271,0.0023024606,0.0004129456,0.00040688875],"category_scores_gemma":[0.00007690374,0.000574306,0.00038569642,0.0015694089,0.0003141536,0.0036269883,0.0012290446,0.00036869416,0.00042860198],"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.0010979256,0.00086126145,0.0113931475,0.00012485227,0.0005282477,0.001874538,0.008899039,0.013767219,0.03515202,0.58709717,0.06281826,0.27638632],"study_design_scores_gemma":[0.027956575,0.0010465779,0.12364208,0.00083388615,0.00045142745,0.002745009,0.006231831,0.13350217,0.036430664,0.01708058,0.6455058,0.0045734346],"about_ca_topic_score_codex":0.0003146563,"about_ca_topic_score_gemma":0.0001991751,"teacher_disagreement_score":0.64797646,"about_ca_system_score_codex":0.0014515843,"about_ca_system_score_gemma":0.0011338438,"threshold_uncertainty_score":0.99996686},"labels":[],"label_agreement":null},{"id":"W2773532448","doi":"10.1016/j.dam.2017.11.005","title":"Linear-time fitting of a <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml13\" display=\"inline\" overflow=\"scroll\" altimg=\"si13.gif\"><mml:mi>k</mml:mi></mml:math>-step function","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Constant (computer programming); Combinatorics; Function (biology); Center (category theory); Line (geometry); Histogram; Algorithm; Discrete mathematics; Image (mathematics); Computer science; Geometry; Artificial intelligence","score_opus":0.017573208455983765,"score_gpt":0.2479937533277372,"score_spread":0.23042054487175345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773532448","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.70838135,0.000045266646,0.28517112,0.00017539377,0.00040752912,0.00010978429,0.000034631048,0.00012715168,0.005547757],"genre_scores_gemma":[0.8835984,0.000028618826,0.115174875,0.0002082382,0.00046801154,0.00011826196,0.00015011636,0.00006206234,0.00019142826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750453,0.000027570231,0.0007079857,0.00053964707,0.0007863342,0.0004339064],"domain_scores_gemma":[0.99717855,0.00033932942,0.0009779971,0.001247667,0.00010100694,0.000155472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076182134,0.00030246982,0.00027620426,0.000113881244,0.0006964401,0.0004440115,0.0009176075,0.0002636206,0.000026604539],"category_scores_gemma":[0.0002524262,0.00033426515,0.00025921967,0.0002170371,0.00015940145,0.00056467287,0.0007083222,0.00028055304,0.00066512136],"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.000056727957,0.0001273029,0.0000018588257,0.0003102765,0.00011606879,0.000013293688,0.0007009865,0.0031142621,0.005560912,0.98530257,0.00030383552,0.0043919166],"study_design_scores_gemma":[0.0005868429,0.00017421722,0.000053072163,0.00016085479,0.00011528572,0.0000403406,0.00014402404,0.9823748,0.009099202,0.005931821,0.0010181455,0.00030141385],"about_ca_topic_score_codex":0.000025856927,"about_ca_topic_score_gemma":0.000011361427,"teacher_disagreement_score":0.9793707,"about_ca_system_score_codex":0.0000142676745,"about_ca_system_score_gemma":0.000173995,"threshold_uncertainty_score":0.99991095},"labels":[],"label_agreement":null},{"id":"W2773875520","doi":"10.20382/jocg.v9i1a8","title":"Array-based compact data structures for triangulations: Practical solutions with theoretical guarantees","year":2017,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Distributed computing; Mathematical optimization; Theoretical computer science; Algorithm; Computational science; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.07517421534455519,"score_gpt":0.32012790615535913,"score_spread":0.24495369081080393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773875520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006383232,0.00021405872,0.9839032,0.0072165057,0.00095295924,0.00047360652,0.0003581611,0.000053380703,0.00044488316],"genre_scores_gemma":[0.6073247,0.000016201893,0.39140916,0.00014717308,0.00049301103,6.922366e-7,0.00051545276,0.000017587798,0.00007598422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683034,0.00030472444,0.00066763646,0.0006703563,0.0011644317,0.00036250037],"domain_scores_gemma":[0.9926482,0.0020233677,0.0017941628,0.0010769496,0.002198689,0.00025862697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011647816,0.00038303656,0.0006718689,0.0017425896,0.0007434073,0.0007101864,0.0027831236,0.0002718547,0.00003894507],"category_scores_gemma":[0.00078744575,0.00035312067,0.0003452826,0.0006806855,0.00037046729,0.0013977726,0.00058447174,0.0007958824,0.0000029982589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003971031,0.00019782058,0.00011156258,0.00006895783,0.0003765476,0.00007431514,0.000051685816,0.68118346,0.000020951346,0.31286657,0.0029518486,0.0016991961],"study_design_scores_gemma":[0.0047620106,0.0008076054,0.0072525893,0.00036506078,0.0006139821,0.0003974043,0.000099209334,0.70590013,0.00014366055,0.25558627,0.02324439,0.0008277033],"about_ca_topic_score_codex":0.000008383801,"about_ca_topic_score_gemma":0.000005962849,"teacher_disagreement_score":0.60094154,"about_ca_system_score_codex":0.00024679862,"about_ca_system_score_gemma":0.0036636635,"threshold_uncertainty_score":0.99989206},"labels":[],"label_agreement":null},{"id":"W2775395268","doi":"","title":"A fully dynamic algorithm for planar width","year":2001,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Sublinear function; Planar; Amortized analysis; Combinatorics; Algorithm; Set (abstract data type); Mathematics; Computer science; Discrete mathematics; Data structure","score_opus":0.011987106369328936,"score_gpt":0.25628674194120793,"score_spread":0.244299635571879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775395268","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.0012194734,0.00004770914,0.99503696,0.001126109,0.00027168175,0.00012933681,0.0000024276685,0.000110432695,0.002055847],"genre_scores_gemma":[0.040960517,0.000010274287,0.95205736,0.00083542813,0.00009696636,0.000025032663,0.000026290825,0.000003897188,0.005984225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994548,0.000009960066,0.00009818828,0.0001917467,0.00011361432,0.00013168098],"domain_scores_gemma":[0.99966305,0.000059709662,0.000023788847,0.00014162426,0.00006658245,0.000045249664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011467344,0.000058332265,0.000056529134,0.000076672186,0.00008507711,0.000071696464,0.0002228801,0.000022818982,0.000019588319],"category_scores_gemma":[0.000009116023,0.000052921037,0.000036142792,0.0002623565,0.0000061996466,0.00022270725,0.00002456704,0.000024138193,0.000040983105],"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.000002084286,0.000028208387,0.0000116772,0.0000016344309,0.0000065074732,0.0000036296897,0.000037048143,0.0007152399,0.0002228198,0.0370761,0.0024336895,0.9594614],"study_design_scores_gemma":[0.00022988119,0.00007258384,0.00046331776,0.0000015963265,0.0000016596167,0.00003355783,0.00000392152,0.9377991,0.00017537216,0.0221353,0.03900114,0.00008259729],"about_ca_topic_score_codex":0.0000044827384,"about_ca_topic_score_gemma":0.000011547103,"teacher_disagreement_score":0.9593788,"about_ca_system_score_codex":0.000019274055,"about_ca_system_score_gemma":0.000039966595,"threshold_uncertainty_score":0.21580572},"labels":[],"label_agreement":null},{"id":"W2782677994","doi":"","title":"Minimum Enclosing Circle Problem with Base Point.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on 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":"Simon Fraser University","funders":"","keywords":"Base (topology); Point (geometry); Computer science; Mathematical optimization; Mathematics; Geometry; Mathematical analysis","score_opus":0.027865243042939393,"score_gpt":0.24974887250867842,"score_spread":0.22188362946573903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782677994","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.09519035,0.000053898886,0.8360949,0.015361138,0.0006988503,0.00053416373,0.00006876438,0.00016773549,0.05183019],"genre_scores_gemma":[0.93548894,0.000002670601,0.062130127,0.0015831171,0.00014803783,0.000023191214,0.000073249386,0.00001574319,0.0005349259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979016,0.000059498943,0.00027709606,0.0006869206,0.00057768286,0.0004971979],"domain_scores_gemma":[0.9976606,0.00016737627,0.00023398008,0.00074869004,0.00057303545,0.00061635085],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00033629307,0.00024325371,0.00021687675,0.0007094797,0.0013134917,0.0013489918,0.001210693,0.00009208693,0.00018672597],"category_scores_gemma":[0.000121735764,0.00025656345,0.0000635592,0.000458282,0.00013626531,0.0009894999,0.0001135064,0.00023571467,0.00024104139],"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.000033643308,0.00013315606,0.002049792,0.000042805357,0.00009024938,0.00024936133,0.00037010186,0.08992102,0.00016818965,0.7277209,0.0052682115,0.17395255],"study_design_scores_gemma":[0.0021548453,0.0007162629,0.12257214,0.0003141954,0.000026279768,0.00022869736,0.00010849676,0.7178617,0.000725578,0.14764833,0.0062056584,0.001437803],"about_ca_topic_score_codex":0.0025212746,"about_ca_topic_score_gemma":0.004542531,"teacher_disagreement_score":0.8402986,"about_ca_system_score_codex":0.00020417738,"about_ca_system_score_gemma":0.001989332,"threshold_uncertainty_score":0.9999887},"labels":[],"label_agreement":null},{"id":"W2783114890","doi":"","title":"On the Planar Spherical Depth and Lens Depth.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on 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 New Brunswick","funders":"","keywords":"Planar; Lens (geology); Optics; Depth of field; Computer science; Physics; Computer graphics (images)","score_opus":0.05594521687350084,"score_gpt":0.2681369403757105,"score_spread":0.21219172350220966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783114890","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.25114667,0.00013522983,0.58151597,0.06628684,0.0015564793,0.00066042045,0.000088397246,0.00015362374,0.09845636],"genre_scores_gemma":[0.9867525,0.000009654549,0.0073728235,0.0052895867,0.00013304473,0.0000156833,0.000030877203,0.000009786072,0.00038603408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840164,0.000079342324,0.00020418229,0.0005043012,0.0004525812,0.0003579618],"domain_scores_gemma":[0.99813926,0.0005729819,0.00013763775,0.00058059103,0.00021240335,0.00035714245],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00030116132,0.00020715779,0.00016495022,0.00027778605,0.001358183,0.00097262755,0.0009913583,0.00008668445,0.00010422848],"category_scores_gemma":[0.00035959051,0.0001713992,0.000053364456,0.00026333125,0.00016344235,0.00036793537,0.00008406965,0.00026724706,0.00022534085],"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.000007063607,0.000022540256,0.00093695865,0.000003774461,0.000022045035,0.000033106124,0.00006911867,0.007595807,0.000010422908,0.94946134,0.0053429524,0.03649489],"study_design_scores_gemma":[0.00066356204,0.00034291137,0.35942993,0.000072351846,0.000011070292,0.00008376634,0.000050752755,0.40506753,0.00010191198,0.21892323,0.014633054,0.0006199228],"about_ca_topic_score_codex":0.0019426988,"about_ca_topic_score_gemma":0.010347905,"teacher_disagreement_score":0.73560584,"about_ca_system_score_codex":0.00010989683,"about_ca_system_score_gemma":0.0007396516,"threshold_uncertainty_score":0.9999419},"labels":[],"label_agreement":null},{"id":"W2783565018","doi":"10.20382/jocg.v9i1a15","title":"Routing on the Visibility Graph","year":2017,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Exploratory Research for Advanced Technology; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Visibility graph; Equal-cost multi-path routing; Computer science; Combinatorics; Routing (electronic design automation); Static routing; Visibility; Graph; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Computer network; Routing protocol; Geography","score_opus":0.04137934408100575,"score_gpt":0.2961158290571426,"score_spread":0.2547364849761369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783565018","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.10252394,0.000063236526,0.87594944,0.0032282753,0.0049682194,0.0024091522,0.00048232486,0.00033654273,0.010038847],"genre_scores_gemma":[0.973402,0.00003459713,0.022535503,0.002085591,0.00056128146,0.00026703635,0.00065860775,0.000034328124,0.0004210215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660075,0.000107604596,0.0011868121,0.0005943717,0.00085961854,0.00065083336],"domain_scores_gemma":[0.9948198,0.00049671537,0.0012146186,0.002765628,0.0005331089,0.00017013866],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020579894,0.0005670968,0.0005192966,0.00030013383,0.001315513,0.0021881147,0.003604947,0.00039539646,0.00001777686],"category_scores_gemma":[0.000526572,0.0004230889,0.0005404454,0.0002180954,0.00013882405,0.0010122324,0.0024299219,0.001165166,0.00013750348],"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.000236903,0.0012775545,0.003093904,0.0021465896,0.0010562334,0.00001588425,0.024757788,0.05235258,0.000057289988,0.70020914,0.04069944,0.17409667],"study_design_scores_gemma":[0.0016903065,0.00031436663,0.004142673,0.00068399525,0.000070574555,0.00003341974,0.0002830709,0.8474855,0.0013044362,0.09579783,0.046825558,0.0013682762],"about_ca_topic_score_codex":0.000021466607,"about_ca_topic_score_gemma":0.000013543147,"teacher_disagreement_score":0.8708781,"about_ca_system_score_codex":0.00016978628,"about_ca_system_score_gemma":0.00027852075,"threshold_uncertainty_score":0.9999846},"labels":[],"label_agreement":null},{"id":"W2786889022","doi":"10.1007/s00453-005-1168-8","title":"Constructing Plane Spanners of Bounded Degree and Low Weight","year":2005,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":86,"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; Degree (music); Combinatorics; Mathematics; Plane (geometry); Theory of computation; Spanner; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Binary logarithm; Spanning tree; Point (geometry); Tree (set theory); Discrete mathematics; Geometry; Algorithm; Computer science; Physics; Mathematical analysis","score_opus":0.01287707065722272,"score_gpt":0.22516149939138386,"score_spread":0.21228442873416115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786889022","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.25390887,0.00030006096,0.7404502,0.0017152125,0.00034535598,0.00010278488,0.00000715969,0.000071875926,0.0030984355],"genre_scores_gemma":[0.6990108,0.000007544495,0.30059686,0.00010385422,0.00016062545,0.0000016454273,0.000007669005,0.0000027707354,0.00010821618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993854,0.00002050265,0.00015671093,0.00017879515,0.00014286098,0.00011571014],"domain_scores_gemma":[0.99960816,0.0000858317,0.00006886258,0.0001296262,0.000056609286,0.000050907154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011191111,0.000067666995,0.000096528034,0.000083456114,0.00006107245,0.000041709976,0.00015680898,0.000031069078,0.000011758892],"category_scores_gemma":[0.000020231295,0.00006637978,0.000020398158,0.00019087417,0.00004944436,0.0002350592,0.000071063005,0.0000535377,0.000008949119],"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.0000029917487,0.000023127563,0.000204413,0.000009372109,0.00001635296,0.0000030466272,0.00017073115,0.00018878208,0.0010039295,0.059526563,0.00033875628,0.9385119],"study_design_scores_gemma":[0.0012186031,0.00013582052,0.0033769768,0.00004520955,0.000016606484,0.00030786026,0.00008976031,0.8647024,0.107858464,0.010363539,0.011490545,0.0003941852],"about_ca_topic_score_codex":0.00000826963,"about_ca_topic_score_gemma":0.0000081330545,"teacher_disagreement_score":0.93811774,"about_ca_system_score_codex":0.000018562054,"about_ca_system_score_gemma":0.000046262845,"threshold_uncertainty_score":0.27068886},"labels":[],"label_agreement":null},{"id":"W2788294399","doi":"10.20382/jocg.v9i1a1","title":"Computing maxmin edge length triangulations","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cutting-plane method; Combinatorics; Minimax; Point (geometry); Integer programming; Integer (computer science); Triangulation; Set (abstract data type); Polynomial; Discrete mathematics; Algorithm; Computer science; Mathematical optimization; Geometry","score_opus":0.02080231691856677,"score_gpt":0.24996725564721475,"score_spread":0.229164938728648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788294399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16700818,0.00009082372,0.826097,0.001553663,0.0010464204,0.00009270582,0.0000061140818,0.000038390786,0.0040666633],"genre_scores_gemma":[0.8988393,0.00001507731,0.09958776,0.00013262505,0.00042582848,7.5493304e-8,0.000009200569,0.000008720469,0.0009814389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814165,0.00013195234,0.0004941697,0.0002768386,0.0007107818,0.00024463382],"domain_scores_gemma":[0.99670845,0.00043345187,0.0011890416,0.00040449388,0.0010513947,0.00021319317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006634695,0.00018360399,0.00031993535,0.0013614646,0.0010190725,0.0004804,0.0016329823,0.000090711685,0.000038143477],"category_scores_gemma":[0.00028666013,0.00020001267,0.0002683778,0.0008334113,0.00010042432,0.002004635,0.00035931685,0.00028828956,0.000025427897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092785085,0.00029620432,0.00325731,0.000027285783,0.00028528113,0.0003559076,0.00045379196,0.6130333,0.00032442503,0.25705788,0.0032505628,0.12156526],"study_design_scores_gemma":[0.007803072,0.00077661907,0.28401002,0.00020468487,0.00018074215,0.0009294637,0.00034279737,0.5211851,0.0010299508,0.043049257,0.13934787,0.0011404075],"about_ca_topic_score_codex":0.000008277709,"about_ca_topic_score_gemma":0.0000028055445,"teacher_disagreement_score":0.7318311,"about_ca_system_score_codex":0.00017171845,"about_ca_system_score_gemma":0.00044543168,"threshold_uncertainty_score":0.815628},"labels":[],"label_agreement":null},{"id":"W2788389566","doi":"10.1007/978-3-030-00256-5_26","title":"Convexity-Increasing Morphs of Planar Graphs","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Convexity; Regular polygon; Combinatorics; Planar graph; Planarity testing; Planar; Mathematics; Computer science; Line segment; Graph; Geometry; Computer graphics (images)","score_opus":0.02012392145713439,"score_gpt":0.26810497635087815,"score_spread":0.24798105489374378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788389566","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.12592086,0.00023772745,0.87004924,0.00046472234,0.0029029488,0.00027334402,0.0000068343543,0.00009951992,0.000044819455],"genre_scores_gemma":[0.5542218,0.000009246137,0.44520056,0.00033297975,0.00021525136,0.0000057425227,0.000008042255,0.0000059827485,3.8537993e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963832,0.00020481953,0.0005916777,0.0013240745,0.0010002069,0.0004960241],"domain_scores_gemma":[0.9971024,0.0006000766,0.0003964121,0.0012271468,0.00052827195,0.00014569047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001972291,0.00034959803,0.000461828,0.0011463203,0.00020827187,0.00040866315,0.0030844556,0.00022929584,0.000008234529],"category_scores_gemma":[0.00030895046,0.00034008114,0.00013246539,0.002477317,0.0006584433,0.00046072877,0.0019988504,0.00055434485,0.000010625236],"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.000032821034,0.000219195,0.005019468,0.00023052364,0.00003705362,0.00004732364,0.0022442078,0.57813644,0.0045110118,0.011472508,0.00006984025,0.39797962],"study_design_scores_gemma":[0.00017784155,0.0001049759,0.0066633685,0.00020635875,0.0000052347305,0.00004353263,2.0900745e-7,0.7459452,0.020616649,0.22588292,0.000026014271,0.0003276695],"about_ca_topic_score_codex":0.00015363097,"about_ca_topic_score_gemma":0.000032601398,"teacher_disagreement_score":0.42830095,"about_ca_system_score_codex":0.00013072508,"about_ca_system_score_gemma":0.0009084331,"threshold_uncertainty_score":0.9999051},"labels":[],"label_agreement":null},{"id":"W2788640963","doi":"10.7155/jgaa.00602","title":"The Complexity of Drawing a Graph in a Polygonal Region","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"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 Saskatchewan; University of Waterloo","funders":"","keywords":"Computer science; Graph; Graph drawing; Combinatorics; Mathematics; Theoretical computer science","score_opus":0.03062397399114286,"score_gpt":0.2644701421016975,"score_spread":0.23384616811055464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788640963","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.030609472,0.0015479982,0.9640176,0.003463601,0.00011377898,0.00015121122,0.0000044385683,0.0000062563104,0.000085611115],"genre_scores_gemma":[0.97673863,0.00018021741,0.022846054,0.000095073854,0.000076839264,0.00003726815,0.0000019457407,0.0000027140372,0.00002125064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916726,0.00006569354,0.0003300601,0.00009607867,0.0002543241,0.00008659373],"domain_scores_gemma":[0.99932706,0.00011611713,0.00028070397,0.00012364105,0.00011057538,0.000041883042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049849495,0.000050333503,0.00010031049,0.00023869306,0.00042453842,0.000042930893,0.00032655432,0.000011327677,0.0000016139547],"category_scores_gemma":[0.000008105781,0.00003981367,0.000070239155,0.000965064,0.00010639234,0.00013821918,0.00010297353,0.00015867768,9.9902635e-8],"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.000021857904,0.000244145,0.0009835538,0.000008753223,0.00003554663,0.000006549523,0.00055208814,0.0067331125,0.0007188199,0.7609088,0.00046006346,0.22932671],"study_design_scores_gemma":[0.0010395607,0.0003642103,0.05093658,0.000019265022,0.0000190167,0.0007452561,0.0006040598,0.062510796,0.0003368673,0.8531887,0.030043254,0.00019244938],"about_ca_topic_score_codex":0.000013290212,"about_ca_topic_score_gemma":0.0000059893428,"teacher_disagreement_score":0.94612914,"about_ca_system_score_codex":0.00001707494,"about_ca_system_score_gemma":0.000069892594,"threshold_uncertainty_score":0.3265249},"labels":[],"label_agreement":null},{"id":"W2788862636","doi":"10.20382/jocg.v11i1a16","title":"Faster Algorithms for some Optimization Problems on Collinear Points","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Disjoint sets; Interval (graph theory); Dimension (graph theory); Algorithm; Point (geometry); Running time; Range (aeronautics); Set (abstract data type); Server; Computer science; Combinatorics; Mathematics; Geometry; Computer network","score_opus":0.03458544815699344,"score_gpt":0.2824341130306675,"score_spread":0.24784866487367407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788862636","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.004755798,0.000043326614,0.9837262,0.00088225317,0.0044396026,0.004057385,0.0012660086,0.0002926156,0.00053680403],"genre_scores_gemma":[0.022214506,0.000088087385,0.95911855,0.00399011,0.002371731,0.0016939801,0.009092504,0.00012889018,0.0013016567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961398,0.00006036137,0.0015266177,0.0007250011,0.00079257536,0.0007555907],"domain_scores_gemma":[0.99632156,0.0002403538,0.0010036675,0.0011137177,0.001082935,0.00023776996],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009849828,0.0006796931,0.00064821827,0.0006336852,0.0004954534,0.0011889314,0.0015772743,0.0004979653,0.00002332833],"category_scores_gemma":[0.00015641215,0.0006526363,0.00043447546,0.00035321643,0.00009058456,0.0015931226,0.0010631651,0.0005212987,0.00013173718],"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.00017471537,0.00063474936,0.000046526347,0.0018817292,0.0003579699,0.0000019925087,0.004212403,0.9400624,0.000011106505,0.014633484,0.019053375,0.018929565],"study_design_scores_gemma":[0.0021776727,0.0006141237,0.000022194788,0.00034063632,0.00004262148,0.000015284564,0.000043904656,0.95105,0.00077424414,0.007452339,0.036762852,0.00070414814],"about_ca_topic_score_codex":0.0000039909787,"about_ca_topic_score_gemma":0.000002534531,"teacher_disagreement_score":0.024607671,"about_ca_system_score_codex":0.00025810456,"about_ca_system_score_gemma":0.00030531327,"threshold_uncertainty_score":0.99984795},"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":"W2789506679","doi":"10.82308/145","title":"Layered graph drawing","year":2005,"lang":"en","type":"article","venue":"Open MIND","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Parameterized complexity; Graph drawing; Planar graph; Computer science; Bounded function; Graph; Algorithm; Mathematics; Theoretical computer science","score_opus":0.04125980745292791,"score_gpt":0.3064328519165809,"score_spread":0.265173044463653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789506679","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.17199384,0.00008651355,0.77773553,0.0026013278,0.0002531299,0.00017445786,0.0000013905666,0.000006084744,0.047147743],"genre_scores_gemma":[0.7011673,0.0000013019942,0.29658395,0.00016997679,0.00009662588,0.000003142476,0.0000038145838,0.0000016098257,0.0019722905],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948066,0.00002099937,0.0000990692,0.00019146148,0.00011097217,0.00009680672],"domain_scores_gemma":[0.99969095,0.000026913947,0.000029952196,0.0001748978,0.000034223784,0.000043083222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019096934,0.00004749811,0.00005286308,0.00005829812,0.000099362784,0.00035599447,0.000567523,0.000018188888,0.0003259225],"category_scores_gemma":[0.000011430468,0.000046427467,0.000021311502,0.00027819278,0.00000661118,0.0007242718,0.00020752235,0.000036244703,0.0006523423],"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.0000016802138,0.000028041282,0.000034195546,3.5038158e-7,0.0000046284886,0.0000022274542,0.000371568,0.008354998,0.0016798618,0.0029804385,0.00091643736,0.98562557],"study_design_scores_gemma":[0.0005930166,0.000054606047,0.0021302074,0.000012493677,0.000004092225,0.000026956825,0.000024831073,0.15929139,0.047354538,0.0029182455,0.78732806,0.00026154905],"about_ca_topic_score_codex":0.0000038931717,"about_ca_topic_score_gemma":0.000016175054,"teacher_disagreement_score":0.985364,"about_ca_system_score_codex":0.000012335888,"about_ca_system_score_gemma":0.000048113845,"threshold_uncertainty_score":0.8384758},"labels":[],"label_agreement":null},{"id":"W2790350126","doi":"10.1007/978-3-319-77404-6_12","title":"Partitioning Orthogonal Histograms into Rectangular Boxes","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Saskatchewan; Carleton University; University of Waterloo","funders":"","keywords":"Histogram; Polyhedron; Computer science; Approximation algorithm; Combinatorics; Time complexity; Algorithm; Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.014746891132040734,"score_gpt":0.24536472515531546,"score_spread":0.23061783402327474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790350126","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.00043950838,0.000794129,0.9932405,0.0006172676,0.0025612225,0.00023642935,0.000002324467,0.00018891184,0.0019197479],"genre_scores_gemma":[0.09872966,0.000030055326,0.89684016,0.0016399907,0.0017376101,0.000016489546,0.00003825219,0.00003386337,0.0009339039],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645996,0.00004325704,0.00051055686,0.0014105453,0.0010682138,0.00050748134],"domain_scores_gemma":[0.9979417,0.00027843827,0.0002688428,0.00089278346,0.00043710365,0.00018114097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093072193,0.00042469794,0.0003701998,0.000847407,0.00049520377,0.0006078082,0.0018187752,0.0002532469,0.000116087576],"category_scores_gemma":[0.000114338494,0.00042263226,0.00014112674,0.00087370904,0.00061567716,0.0007062016,0.00076837733,0.00048409402,0.0001406941],"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.0000072462517,0.000036412057,0.000042652326,0.000032175532,0.000017080129,0.00006695274,0.0013511385,0.05305686,0.00034601908,0.053720623,0.00026901523,0.89105386],"study_design_scores_gemma":[0.00019428701,0.00025311598,0.0001001836,0.00025505605,0.000009086098,0.00009049973,1.6180519e-7,0.43801287,0.0017162953,0.541547,0.017132448,0.0006889976],"about_ca_topic_score_codex":0.00001617395,"about_ca_topic_score_gemma":0.00014028781,"teacher_disagreement_score":0.8903648,"about_ca_system_score_codex":0.00034750334,"about_ca_system_score_gemma":0.00063417986,"threshold_uncertainty_score":0.99982256},"labels":[],"label_agreement":null},{"id":"W2790623224","doi":"10.1007/s00453-018-0425-6","title":"Fast Approximation Algorithms for p-Centers in Large $$\\delta $$ δ -Hyperbolic Graphs","year":2018,"lang":"en","type":"article","venue":"Algorithmica","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":"Nokia (Canada); Bell (Canada)","funders":"European Research Council","keywords":"Theory of computation; Approximation algorithm; Combinatorics; Mathematics; Algorithm; Discrete mathematics; Computer science","score_opus":0.018727273076901897,"score_gpt":0.27243292434191463,"score_spread":0.2537056512650127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790623224","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.018451275,0.00006125418,0.97910196,0.00070251,0.0007842008,0.00039740858,0.000025268806,0.00010677458,0.00036936955],"genre_scores_gemma":[0.6253047,0.000010056392,0.3729569,0.00074628927,0.0005220276,0.00012540547,0.00013573944,0.000016449243,0.00018244494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986321,0.000046651003,0.00028494108,0.00043944985,0.00023400028,0.00036285876],"domain_scores_gemma":[0.9992771,0.00007481078,0.00008362264,0.00029472864,0.00019274563,0.00007698268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003915961,0.00014404689,0.00015444067,0.0003166289,0.00017068417,0.00011222863,0.0004373244,0.00006986176,0.000011397521],"category_scores_gemma":[0.00004327997,0.00014834109,0.000075111086,0.0008360369,0.000039555376,0.0005066223,0.00011246777,0.00008121768,0.000045322224],"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.000032659347,0.0005151972,0.00037953616,0.000036639685,0.0000450778,0.000006274078,0.0018444293,0.0004990024,0.0020793632,0.18309781,0.003933102,0.8075309],"study_design_scores_gemma":[0.001189618,0.00018764904,0.0024889717,0.000016886263,0.0000051503903,0.000012859032,0.000036183887,0.9617264,0.005035156,0.01851182,0.010554418,0.000234887],"about_ca_topic_score_codex":0.0000187112,"about_ca_topic_score_gemma":0.000025968473,"teacher_disagreement_score":0.9612274,"about_ca_system_score_codex":0.000049248327,"about_ca_system_score_gemma":0.00006152302,"threshold_uncertainty_score":0.6049174},"labels":[],"label_agreement":null},{"id":"W2792621615","doi":"","title":"The strong product of graphs and crossing numbers","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Crossing number (knot theory); Product (mathematics); Combinatorics; Geometry; Transport engineering; Engineering","score_opus":0.015905146918008584,"score_gpt":0.2706131690197365,"score_spread":0.2547080221017279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792621615","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.9941605,0.00030286235,0.0017354102,0.0007822308,0.0016067616,0.00008447208,4.2966562e-7,0.000022738031,0.0013046425],"genre_scores_gemma":[0.99832124,0.000013066244,0.0014935939,0.000011289723,0.0000055862156,0.000002801714,4.8036685e-7,0.0000023099108,0.00014966405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994579,0.000025604048,0.000108590284,0.00015681112,0.00014760514,0.00010351413],"domain_scores_gemma":[0.9992215,0.00007431215,0.00012945355,0.00045485378,0.0000888777,0.00003101725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031304735,0.000053310454,0.00006343824,0.000023430666,0.0011796072,0.0006152019,0.000447807,0.000014160457,5.165998e-7],"category_scores_gemma":[0.00011260482,0.000041361174,0.000022134851,0.00007518615,0.00016388673,0.0003853969,0.00017333032,0.000049544597,0.000001458847],"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.0000021140647,0.000012153449,0.0036265766,0.000003901112,0.000007692746,6.3301275e-7,0.00016594726,0.000028539083,0.00039398717,0.96680367,0.0002489225,0.028705869],"study_design_scores_gemma":[0.00039380052,0.00004579693,0.117712945,0.000014686714,0.000004640607,0.000006807125,0.000016927248,0.0069581084,0.007117888,0.86563665,0.001988382,0.00010336352],"about_ca_topic_score_codex":0.000027080921,"about_ca_topic_score_gemma":0.0000064876226,"teacher_disagreement_score":0.11408637,"about_ca_system_score_codex":0.0000070113397,"about_ca_system_score_gemma":0.00005374832,"threshold_uncertainty_score":0.9072705},"labels":[],"label_agreement":null},{"id":"W2792725813","doi":"10.5220/0006623902560263","title":"Interactive Anisotropic Tearing of Elastic Solids","year":2018,"lang":"en","type":"article","venue":"","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":"Tearing; Anisotropy; Computer science; Materials science; Physics; Composite material; Optics","score_opus":0.01306188390121094,"score_gpt":0.263864491637907,"score_spread":0.25080260773669605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792725813","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.13545157,0.0000056916124,0.85601306,0.00008826247,0.00027693572,0.000026528374,1.5292201e-7,0.000032010234,0.008105793],"genre_scores_gemma":[0.93856764,5.7306795e-7,0.06078252,0.00008894228,0.0001098235,8.263703e-7,5.150722e-7,0.0000013281,0.00044782434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996062,0.000015828175,0.000095530886,0.00011595377,0.00009599405,0.00007048972],"domain_scores_gemma":[0.9996469,0.000056207387,0.000035268822,0.00011638353,0.00012253317,0.000022728367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005278637,0.000037621707,0.000050680497,0.00007261722,0.000041539868,0.000027681137,0.00016987696,0.000009978384,0.00006216431],"category_scores_gemma":[0.00003188231,0.000033107062,0.00001832071,0.000214247,0.00002350889,0.0002450902,0.000101370664,0.000027027176,0.00006902188],"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.000023397288,0.00023458924,0.001458266,0.000018774588,0.00005594694,0.000003565086,0.003209213,0.002717959,0.04945015,0.8073094,0.0020830717,0.1334357],"study_design_scores_gemma":[0.0003904113,0.0006350346,0.028245848,0.000024294795,0.0000063593143,0.000019537196,0.00006917069,0.7489672,0.19712465,0.021450978,0.0028809523,0.00018559927],"about_ca_topic_score_codex":0.000010406052,"about_ca_topic_score_gemma":0.0000063916095,"teacher_disagreement_score":0.8031161,"about_ca_system_score_codex":0.000011496656,"about_ca_system_score_gemma":0.000030341806,"threshold_uncertainty_score":0.13500668},"labels":[],"label_agreement":null},{"id":"W2794051019","doi":"","title":"Finite 2-Geodesic-Transitive Cayley Graphs Of Dihedral Groups.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Dihedral group; Transitive relation; Geodesic; Combinatorics; Pure mathematics; Group (periodic table); Geometry; Graph; Physics","score_opus":0.011529566572576458,"score_gpt":0.2370022466951633,"score_spread":0.22547268012258684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794051019","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.8036838,0.00008959723,0.18967605,0.00035674535,0.0029420175,0.00016546999,0.0000058332635,0.00011067483,0.002969824],"genre_scores_gemma":[0.9945888,0.0000065038494,0.005082612,0.00018730709,0.00002374481,0.0000071513,0.000010457049,0.0000065719482,0.00008688056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988987,0.000079085585,0.00023417364,0.00029411656,0.0002932122,0.00020074844],"domain_scores_gemma":[0.9990039,0.0001659065,0.00009859788,0.0003259211,0.00032819735,0.000077498196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025784934,0.00012065478,0.00015620972,0.00016179058,0.00013058944,0.00004791981,0.00042505507,0.000055554556,0.000020396375],"category_scores_gemma":[0.000052065574,0.00012308419,0.00007721331,0.0008015783,0.000107118845,0.00040767598,0.000095745345,0.00008270272,0.000051508847],"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.0000113277965,0.000086370084,0.00042506566,0.000008136287,0.000021103688,0.0000037124562,0.0008952034,0.0001383639,0.001969406,0.9919842,0.00047673294,0.003980372],"study_design_scores_gemma":[0.000795507,0.0004711565,0.013228971,0.0000234052,0.0000148981135,0.000007021927,0.000028436034,0.035065956,0.03454438,0.91500396,0.00058029674,0.00023599593],"about_ca_topic_score_codex":0.000026963606,"about_ca_topic_score_gemma":0.0000076746,"teacher_disagreement_score":0.19090497,"about_ca_system_score_codex":0.000020668938,"about_ca_system_score_gemma":0.00007550822,"threshold_uncertainty_score":0.5019227},"labels":[],"label_agreement":null},{"id":"W2794389974","doi":"10.48550/arxiv.1803.01931","title":"Structure and generation of crossing-critical graphs","year":2018,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Computer science","score_opus":0.056479719220036036,"score_gpt":0.3061149321147666,"score_spread":0.24963521289473056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794389974","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.7615304,0.000367501,0.23637566,0.00038646648,0.0011532194,0.000089971385,0.000014415816,0.000037929596,0.000044419976],"genre_scores_gemma":[0.95981824,0.000016300666,0.03938399,0.00017262825,0.00049320207,0.000005117145,0.0000568865,0.000007372689,0.000046234807],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99874693,0.00007031912,0.0002861636,0.0005081221,0.00024017933,0.00014830517],"domain_scores_gemma":[0.99899125,0.00007150224,0.00012607095,0.00041463782,0.00032357906,0.00007298376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016894753,0.00016628712,0.00019530246,0.00014996089,0.0001972673,0.00025778761,0.00032912733,0.00019175111,0.000021156608],"category_scores_gemma":[0.00013254414,0.00016297474,0.00005942971,0.00020632904,0.00021499135,0.00022365944,0.0005558008,0.0002142889,0.0000054482025],"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.000056031444,0.00045465995,0.3702211,0.0013448258,0.00035998927,0.000042373245,0.006363982,0.017952312,0.22537294,0.28939167,0.01034312,0.078097],"study_design_scores_gemma":[0.0005233333,0.00026483624,0.4504989,0.00017447866,0.00006855474,0.000054123746,0.000010200244,0.2772561,0.14728448,0.121516995,0.001511015,0.00083697774],"about_ca_topic_score_codex":0.000011699161,"about_ca_topic_score_gemma":0.000009540533,"teacher_disagreement_score":0.25930378,"about_ca_system_score_codex":0.000017910123,"about_ca_system_score_gemma":0.00017711242,"threshold_uncertainty_score":0.6645917},"labels":[],"label_agreement":null},{"id":"W2794864174","doi":"","title":"Dilation-optimal edge deletion in polygonal cycles","year":2007,"lang":"en","type":"article","venue":"","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":"Dilation (metric space); Combinatorics; Convex polygon; Mathematics; Shortest path problem; Regular polygon; Time dilation; Euclidean geometry; Time complexity; Polygon (computer graphics); Path (computing); Computer science; Geometry; Physics; Graph","score_opus":0.012578062565869104,"score_gpt":0.26161038318027763,"score_spread":0.24903232061440853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794864174","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.239826,0.000031908443,0.75571185,0.0003788229,0.00016108638,0.00004533339,2.1490334e-7,0.000050416627,0.0037943395],"genre_scores_gemma":[0.901055,0.0000017937019,0.09827072,0.0002560825,0.000105991174,0.0000019292236,0.0000091809825,0.000002001144,0.00029733992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993124,0.000016634931,0.00017435278,0.00017508154,0.00017423944,0.00014730738],"domain_scores_gemma":[0.99968916,0.000086953885,0.000029276369,0.00010217007,0.00004848451,0.000043956137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040724187,0.000057042984,0.000050188428,0.00021254853,0.000053126987,0.00005131814,0.00015254575,0.000033395092,0.000035207515],"category_scores_gemma":[0.000020067075,0.00005603611,0.00002319708,0.0004833294,0.000009691997,0.00038054213,0.000047578716,0.00005285973,0.00005400905],"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.000018752748,0.0001413945,0.008461179,0.0000046038467,0.000005639426,0.000013811025,0.00042734752,0.044152476,0.005308947,0.52699286,0.0008345211,0.41363847],"study_design_scores_gemma":[0.00038241036,0.000039362163,0.44408134,0.0000061680994,0.0000011763598,0.000018857285,0.000023377519,0.53520924,0.010328267,0.006118772,0.0036055774,0.00018546366],"about_ca_topic_score_codex":0.000018303075,"about_ca_topic_score_gemma":0.000064998414,"teacher_disagreement_score":0.66122895,"about_ca_system_score_codex":0.000034908244,"about_ca_system_score_gemma":0.00003540537,"threshold_uncertainty_score":0.22850864},"labels":[],"label_agreement":null},{"id":"W2795128400","doi":"10.1007/978-3-030-00256-5_1","title":"On Dispersable Book Embeddings","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science; Deutsche Forschungsgemeinschaft","keywords":"Bipartite graph; Combinatorics; Conjecture; Embedding; Mathematics; Planar graph; Bounded function; Book embedding; Graph; Discrete mathematics; Line graph; 1-planar graph; Computer science; Artificial intelligence","score_opus":0.013358847014909098,"score_gpt":0.2710764931829497,"score_spread":0.2577176461680406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795128400","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.014175998,0.00029181514,0.9784091,0.0015192397,0.0048708436,0.00034016318,0.0000033301203,0.00019625144,0.00019327526],"genre_scores_gemma":[0.5821053,0.000015407206,0.41275036,0.004331854,0.0007395955,0.000021400238,0.000008950861,0.000012501719,0.000014640411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604607,0.00008770273,0.00039865516,0.001790617,0.0010460259,0.00063094514],"domain_scores_gemma":[0.9975009,0.000451654,0.00020497381,0.0013556319,0.00031442277,0.000172405],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010203879,0.00040162573,0.00034254973,0.0008792441,0.00032719775,0.0011034075,0.0032815344,0.00022332139,0.00003541453],"category_scores_gemma":[0.0002474843,0.00037233293,0.00011505112,0.0018408353,0.0003673947,0.00066638744,0.0030015546,0.000709565,0.000114747636],"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.0000070450947,0.00008885312,0.000063141255,0.00003029705,0.0000069046387,0.000018545905,0.00072976586,0.82735693,0.00021468688,0.0041745813,0.0006179971,0.16669123],"study_design_scores_gemma":[0.00015461358,0.00015709591,0.00034815772,0.00016958229,0.000002576922,0.00001436532,7.786852e-8,0.87321454,0.007914222,0.11712175,0.0005115428,0.0003914671],"about_ca_topic_score_codex":0.000024172297,"about_ca_topic_score_gemma":0.000014012561,"teacher_disagreement_score":0.56792927,"about_ca_system_score_codex":0.00028934603,"about_ca_system_score_gemma":0.0007058057,"threshold_uncertainty_score":0.99993354},"labels":[],"label_agreement":null},{"id":"W2796591137","doi":"10.1016/j.dam.2018.03.046","title":"Homothetic polygons and beyond: Maximal cliques in intersection graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":"Combinatorics; Mathematics; Homothetic transformation; Chordal graph; Discrete mathematics; Regular polygon; Intersection graph; Indifference graph; Intersection (aeronautics); Polytope; Convex hull; Graph; Line graph","score_opus":0.010098689884852805,"score_gpt":0.24614905667964182,"score_spread":0.23605036679478902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796591137","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.27246383,0.000028006629,0.7139434,0.00023444762,0.00011708473,0.00017304099,0.0000015998288,0.000084019055,0.012954526],"genre_scores_gemma":[0.85018456,0.000007896591,0.14955287,0.00014161503,0.000041620566,0.00002047098,0.0000041024846,0.000007028266,0.000039828945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992299,0.000013026074,0.00022355262,0.00023332899,0.00014358001,0.00015658539],"domain_scores_gemma":[0.9995759,0.000055487268,0.000071663344,0.00021451572,0.000033857465,0.00004855058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021457262,0.0001093645,0.00012883951,0.00020868608,0.00008508657,0.00010438354,0.00018483338,0.000045149558,0.0000098582095],"category_scores_gemma":[0.000014246504,0.00010159185,0.000026827687,0.00036261306,0.00007610042,0.00016730274,0.00012115834,0.00007522807,0.000024355482],"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.0000058503188,0.000058054702,0.000023910554,0.000028230848,0.000007673242,0.0000013051732,0.0037103633,0.00002079651,0.0048438935,0.9751841,0.00010019836,0.016015647],"study_design_scores_gemma":[0.000474878,0.0001884189,0.0011538225,0.000035713314,0.0000117443315,0.00004314077,0.00056026265,0.12612787,0.013853258,0.85684973,0.00039360928,0.000307569],"about_ca_topic_score_codex":0.0000047028675,"about_ca_topic_score_gemma":0.000024316982,"teacher_disagreement_score":0.57772076,"about_ca_system_score_codex":0.000020283747,"about_ca_system_score_gemma":0.000019804922,"threshold_uncertainty_score":0.41427955},"labels":[],"label_agreement":null},{"id":"W2798049874","doi":"10.7939/r38t0m","title":"Scheduling and Deployment Strategies for Mobile Photo Radar Enforcement","year":2014,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Software deployment; Computer science; Radar; Scheduling (production processes); Real-time computing; Computer security; Telecommunications; Engineering; Operations management","score_opus":0.008188505378998985,"score_gpt":0.1916358082302754,"score_spread":0.18344730285127642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798049874","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.19147092,0.00004608098,0.8044679,0.00019790283,0.000052034262,0.00013873057,7.053343e-7,0.000024414057,0.0036012991],"genre_scores_gemma":[0.8282872,0.000016726506,0.17013703,0.00012005667,0.000018605837,5.282909e-7,0.000012281679,0.000002733852,0.0014048356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999645,0.000015977672,0.00005780751,0.00014056034,0.00006769419,0.00007298298],"domain_scores_gemma":[0.99967027,0.00013037102,0.00004174335,0.00010024459,0.000015650281,0.00004173032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000044243443,0.000049783426,0.00006806692,0.000060347615,0.00009332935,0.000043198917,0.00017766564,0.00002057043,0.000048372243],"category_scores_gemma":[0.0000028268655,0.000056704976,0.000027695623,0.00008244781,0.000021474594,0.0008897707,0.00009083755,0.000020189227,0.0000019921179],"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.00006575973,0.00009430331,0.00027962128,0.00010153724,0.000056335048,0.0000011937198,0.005868787,0.04001888,0.0013048812,0.9028143,0.0016180521,0.047776323],"study_design_scores_gemma":[0.001349685,0.0005406447,0.00040496845,0.00003755067,0.00001913461,0.0000033860488,0.0013657097,0.7593795,0.01144659,0.015684726,0.20950411,0.00026397762],"about_ca_topic_score_codex":0.00007655151,"about_ca_topic_score_gemma":0.00001169133,"teacher_disagreement_score":0.8871296,"about_ca_system_score_codex":0.0000046786276,"about_ca_system_score_gemma":0.000056580455,"threshold_uncertainty_score":0.23123617},"labels":[],"label_agreement":null},{"id":"W2798279120","doi":"10.20382/jocg.v12i2a2","title":"Extending Drawings of Graphs to Arrangements of Pseudolines","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Consejo Nacional de Ciencia y Tecnología; European Commission","keywords":"Computer science","score_opus":0.017000399652586207,"score_gpt":0.2873462560179413,"score_spread":0.2703458563653551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798279120","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.40050521,0.00001602754,0.59677976,0.0001603206,0.000796285,0.00044157534,0.000068627065,0.000047590067,0.001184584],"genre_scores_gemma":[0.8780645,0.0000073871174,0.12114852,0.00045107654,0.00012516255,0.000027037553,0.000056079745,0.000011106153,0.000109095745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808466,0.000019982668,0.0009101522,0.00019139699,0.00046146268,0.00033231702],"domain_scores_gemma":[0.9982379,0.000084449515,0.0004179989,0.00045200583,0.0006861771,0.00012144504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005022407,0.00019100761,0.00030097584,0.0005193663,0.00016094153,0.00009225085,0.00077956,0.00007269875,0.000016799611],"category_scores_gemma":[0.000103255894,0.00017956461,0.00015318202,0.00079769996,0.00008475016,0.0009928267,0.00030575643,0.00008021135,0.00003503841],"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.0006622612,0.0020094207,0.022368276,0.003148063,0.00095727516,0.00000477081,0.08598279,0.005672456,0.036400665,0.46256122,0.028947176,0.35128564],"study_design_scores_gemma":[0.00923156,0.004483675,0.021998376,0.0012447714,0.00015325318,0.0000927252,0.0018256004,0.44813782,0.35369104,0.041186403,0.11578959,0.0021651685],"about_ca_topic_score_codex":0.00000880731,"about_ca_topic_score_gemma":0.000005439423,"teacher_disagreement_score":0.47755933,"about_ca_system_score_codex":0.000029688383,"about_ca_system_score_gemma":0.00005322295,"threshold_uncertainty_score":0.7322432},"labels":[],"label_agreement":null},{"id":"W2798468821","doi":"10.4230/lipics.socg.2018.24","title":"Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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":"Combinatorics; Mathematics; Binary logarithm; Unit disk; Bounded function; Upper and lower bounds; Time complexity; Metric space; Graph; Oracle; Discrete mathematics; Computer science","score_opus":0.014313323477263336,"score_gpt":0.2540391938587569,"score_spread":0.23972587038149357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798468821","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.41494054,0.00008704757,0.58176214,0.00021322501,0.00061310193,0.0006182165,0.0001269622,0.00014439496,0.0014943952],"genre_scores_gemma":[0.94625235,0.000049910574,0.052614246,0.00053710176,0.00010480003,0.00006822023,0.0002453932,0.00001763267,0.00011037588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980488,0.00004018807,0.00075151486,0.0003129516,0.00035259943,0.00049395143],"domain_scores_gemma":[0.9987275,0.00011201035,0.0002402207,0.0004677422,0.00029508016,0.00015745436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005095346,0.00027955635,0.00028582534,0.0003899231,0.0003218351,0.00041901862,0.0006022977,0.000120730154,0.0000099021445],"category_scores_gemma":[0.000053742056,0.000256342,0.000076902725,0.0008540256,0.00016448073,0.0017680599,0.00028893576,0.00020087534,0.000030135097],"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.0002705857,0.001011022,0.06973624,0.00074224756,0.0001804612,0.000023042809,0.025883803,0.00046749716,0.00043857517,0.6891161,0.0033620442,0.20876835],"study_design_scores_gemma":[0.002611784,0.00041607537,0.016902862,0.00017451997,0.00001842209,0.000064257074,0.00052302267,0.90933967,0.0016747343,0.026757669,0.040783666,0.00073332083],"about_ca_topic_score_codex":0.000011581323,"about_ca_topic_score_gemma":0.000108714645,"teacher_disagreement_score":0.9088722,"about_ca_system_score_codex":0.000046285335,"about_ca_system_score_gemma":0.00006539116,"threshold_uncertainty_score":0.99998885},"labels":[],"label_agreement":null},{"id":"W2799803339","doi":"10.1002/jgt.21630","title":"Minimal Obstructions for 1‐Immersions and Hardness of 1‐Planarity Testing","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Research Canada; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","funders":"","keywords":"Planarity testing; Combinatorics; Mathematics; Planar graph; Planar; Outerplanar graph; Book embedding; Graph; Planar straight-line graph; Discrete mathematics; Enhanced Data Rates for GSM Evolution; 1-planar graph; Pathwidth; Line graph; Computer science","score_opus":0.037738736367019306,"score_gpt":0.27063856057275837,"score_spread":0.23289982420573907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799803339","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.43891063,0.0005499132,0.5595706,0.00014618324,0.00066548854,0.000039228362,0.000003473457,0.0000042366682,0.000110239926],"genre_scores_gemma":[0.8887986,0.000008835479,0.11098787,0.000036295252,0.0001426296,9.380003e-7,5.466287e-7,0.0000019683348,0.000022306585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946475,0.000057880716,0.00021878337,0.000052017174,0.00011223829,0.00009435836],"domain_scores_gemma":[0.99878824,0.0006116323,0.00022938053,0.000066533175,0.00023126604,0.0000729233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008542916,0.00004617882,0.00010239513,0.00018753456,0.00011452876,0.000017877775,0.00012974012,0.000023441215,0.00000271456],"category_scores_gemma":[0.0003142182,0.000039097442,0.000064106505,0.00025940928,0.000039634117,0.00042493644,0.000030764477,0.00006156968,2.1714025e-7],"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.00009783405,0.00024328493,0.01680957,0.000075485514,0.00012389051,0.0000019648633,0.0016067821,0.000776921,0.019489078,0.8717525,0.0011091807,0.087913536],"study_design_scores_gemma":[0.0018984119,0.00089884375,0.3313382,0.00018028732,0.00019388675,0.0014083027,0.0009629801,0.007850714,0.020121373,0.6310739,0.0036816497,0.00039150435],"about_ca_topic_score_codex":7.679949e-7,"about_ca_topic_score_gemma":2.8958894e-7,"teacher_disagreement_score":0.44988796,"about_ca_system_score_codex":0.000006704391,"about_ca_system_score_gemma":0.00004923046,"threshold_uncertainty_score":0.15943475},"labels":[],"label_agreement":null},{"id":"W2800542763","doi":"10.1139/tcsme-2003-0018","title":"EVALUATION OF COMBINED DELAUNAY TRIANGULATION AND REMESHING FOR FINITE ELEMENT ANALYSIS OF CONDUCTIVE HEAT TRANSFER","year":2004,"lang":"en","type":"article","venue":"Transactions of the Canadian Society for Mechanical Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Delaunay triangulation; Finite element method; Thermal conduction; Triangulation; Heat transfer; Constrained Delaunay triangulation; Bowyer–Watson algorithm; Transient (computer programming); Polygon mesh; Steady state (chemistry); Mathematics; Applied mathematics; Mathematical optimization; Algorithm; Mechanics; Mathematical analysis; Computer science; Geometry; Structural engineering; Physics; Thermodynamics; Engineering; Chemistry","score_opus":0.030800945721917654,"score_gpt":0.253776788179839,"score_spread":0.22297584245792135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800542763","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.06628415,0.000049918537,0.9325762,0.000403685,0.000100386846,0.0004965618,0.000080789316,0.0000070033498,0.0000013558845],"genre_scores_gemma":[0.94001096,0.000002928935,0.059894282,0.000019268358,0.0000062090726,0.000043791097,0.000015826115,0.000004328681,0.0000024067938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992514,0.000016873122,0.0002610331,0.00012752654,0.00024282976,0.000100304496],"domain_scores_gemma":[0.9992548,0.00015168289,0.000030197847,0.00013350042,0.00037477128,0.000055001994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008911062,0.00006586164,0.00016675363,0.00013541534,0.00009958884,0.000009632372,0.00012267088,0.000055937475,0.0000032082517],"category_scores_gemma":[0.000065259366,0.0000633422,0.00036162004,0.0006639384,0.000014647155,0.0001309603,0.0000028147722,0.00004525992,1.0062135e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054254615,0.000014671322,5.868556e-7,0.00002730323,0.0004521198,3.7699026e-9,0.00044497818,0.9597308,0.0137752155,0.023761572,0.0000010479064,0.0017862535],"study_design_scores_gemma":[0.0009400682,0.00007924681,0.000119721495,0.000017370416,0.0008793859,2.0647177e-7,0.000042518925,0.92981637,0.06561509,0.0024195628,0.000015373225,0.000055115284],"about_ca_topic_score_codex":0.001126391,"about_ca_topic_score_gemma":0.004730562,"teacher_disagreement_score":0.8737268,"about_ca_system_score_codex":0.00019409339,"about_ca_system_score_gemma":0.00025697946,"threshold_uncertainty_score":0.26397648},"labels":[],"label_agreement":null},{"id":"W2803492431","doi":"10.22215/etd/2017-12201","title":"Reconstruction Based on Visibility","year":2017,"lang":"en","type":"dissertation","venue":"","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":"Combinatorics; Omega; Regular polygon; Mathematics; Delaunay triangulation; Polygon (computer graphics); Convex polygon; Computer science; Geometry; Physics","score_opus":0.016729306754945668,"score_gpt":0.2881210189209617,"score_spread":0.27139171216601604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803492431","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.0193366,0.00003994158,0.45090085,0.00045712863,0.0084893955,0.0004243091,0.0000063096236,0.00034463976,0.5200008],"genre_scores_gemma":[0.80024755,0.000015005866,0.09378777,0.00064075383,0.0007049175,0.000072132905,0.0012070988,0.000028228176,0.103296556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987632,0.000047775706,0.00020839139,0.00052377715,0.0003322395,0.00012463542],"domain_scores_gemma":[0.99863195,0.000075732365,0.00022676923,0.0008133154,0.00019429026,0.000057965226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026031726,0.00016839948,0.00015617519,0.00022486207,0.00029217408,0.00032448606,0.0005584509,0.0001688861,0.00017225048],"category_scores_gemma":[0.000121129335,0.00015921977,0.00010394785,0.00012485893,0.000010799045,0.00032526505,0.000012195687,0.00017298912,0.00013559732],"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.000028681648,0.00006296275,0.000036561494,0.000039367475,0.000009458431,0.0000025371376,0.00004199553,0.00221822,0.00021637756,0.018745447,0.0015363776,0.977062],"study_design_scores_gemma":[0.00053559616,0.0002433236,0.02265939,0.00017456016,0.00001794421,0.0000078771145,0.000019877936,0.9275586,0.01659768,0.022020975,0.009510993,0.00065317465],"about_ca_topic_score_codex":0.000015682797,"about_ca_topic_score_gemma":0.00007450882,"teacher_disagreement_score":0.97640884,"about_ca_system_score_codex":0.00005809206,"about_ca_system_score_gemma":0.00028462813,"threshold_uncertainty_score":0.64927936},"labels":[],"label_agreement":null},{"id":"W2804593871","doi":"10.4230/lipics.icalp.2018.31","title":"Orthogonal Point Location and Rectangle Stabbing Queries in 3-d","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"National Science Foundation","keywords":"Rectangle; Point (geometry); Combinatorics; Computer science; Point location; Mathematics; Geometry","score_opus":0.05459486520599479,"score_gpt":0.1842160587143405,"score_spread":0.1296211935083457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804593871","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.44666955,0.000071854265,0.5521697,0.000085591426,0.0002573452,0.00010464475,0.0000023974815,0.00005287848,0.0005860962],"genre_scores_gemma":[0.99413586,0.00008646078,0.005316448,0.00006509836,0.00008170692,8.957511e-7,0.000023435383,0.000005758266,0.0002843318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988808,0.00010244713,0.00014831098,0.0006387567,0.00006999301,0.00015966847],"domain_scores_gemma":[0.999227,0.00007252178,0.000120059936,0.00033382993,0.00017995467,0.00006666301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028978952,0.00014912264,0.00014810698,0.00031149856,0.00010105199,0.000105893596,0.0003486825,0.00012407514,0.000010585961],"category_scores_gemma":[0.000045170276,0.00018345373,0.000036710215,0.0006523755,0.000066813926,0.0004335771,0.00074434886,0.0002059523,0.0000150521955],"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.000047453996,0.000097547396,0.0078668855,0.00011972389,0.000036438803,0.000099725505,0.0010477202,0.35952908,0.00012818909,0.6253767,0.00024792747,0.005402576],"study_design_scores_gemma":[0.00035623877,0.00006973875,0.020616425,0.00012788767,0.000013044795,0.00000908516,0.00007339086,0.8743166,0.00027879336,0.103318974,0.00046193475,0.00035790476],"about_ca_topic_score_codex":0.00007073455,"about_ca_topic_score_gemma":0.00020997581,"teacher_disagreement_score":0.54746634,"about_ca_system_score_codex":0.00012860917,"about_ca_system_score_gemma":0.00021253011,"threshold_uncertainty_score":0.7481026},"labels":[],"label_agreement":null},{"id":"W2806627199","doi":"10.1017/fms.2019.51","title":"SPLITTING LOOPS AND NECKLACES: VARIANTS OF THE SQUARE PEG PROBLEM","year":2020,"lang":"en","type":"preprint","venue":"Forum of Mathematics Sigma","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Toeplitz matrix; Loop (graph theory); Rectangle; Square (algebra); Simple (philosophy); Mathematics; Conjecture; Combinatorics; Parallelogram; Planar; Space (punctuation); Discrete mathematics; Pure mathematics; Computer science; Geometry","score_opus":0.022619108698288266,"score_gpt":0.24236260742797788,"score_spread":0.21974349872968962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806627199","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.052944843,0.00030871705,0.94105786,0.0029983646,0.00029487725,0.0006772984,0.00003137818,0.000047925972,0.0016387331],"genre_scores_gemma":[0.69970965,0.000013046248,0.30004093,0.00006422626,0.00004302476,0.00001407501,0.000008466183,0.000010879521,0.00009569783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848056,0.000057596226,0.00056458556,0.00032300773,0.00042409135,0.0001501403],"domain_scores_gemma":[0.99827725,0.00022091338,0.0007187787,0.0005574013,0.00017563246,0.00005002974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004157669,0.0001749747,0.00035039947,0.00007349531,0.00007718076,0.00007615515,0.00083153596,0.000113402595,0.0000073586],"category_scores_gemma":[0.00019441964,0.00013371768,0.000121068195,0.00028026034,0.000049200018,0.000102894366,0.0018501083,0.00021265403,0.000002099988],"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.0000102959375,0.000501278,0.0009340514,0.011257079,0.00024211111,0.000004625155,0.017180944,0.04443521,0.004395303,0.90139955,0.0023128535,0.017326673],"study_design_scores_gemma":[0.00023722074,0.00008101394,0.0008606043,0.0008238144,0.00004202567,0.000013623475,0.000309748,0.5040707,0.0048735873,0.48827416,0.00019994796,0.00021356178],"about_ca_topic_score_codex":0.000008830035,"about_ca_topic_score_gemma":0.0000038122284,"teacher_disagreement_score":0.6467648,"about_ca_system_score_codex":0.000015361198,"about_ca_system_score_gemma":0.00016709567,"threshold_uncertainty_score":0.54528487},"labels":[],"label_agreement":null},{"id":"W2808967831","doi":"","title":"Approximate distance oracles for geometric spanners","year":2004,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Shortest path problem; Combinatorics; Mathematics; Constant (computer programming); Data structure; Euclidean space; Dilation (metric space); Binary logarithm; Euclidean shortest path; Oracle; Path (computing); Computational geometry; Distance; Discrete mathematics; Graph; Longest path problem; Algorithm; Computer science","score_opus":0.018609068560622673,"score_gpt":0.2541232826459556,"score_spread":0.2355142140853329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808967831","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.00544252,0.00011861555,0.9913923,0.001120922,0.0002569296,0.00017188676,0.00000258007,0.00014232153,0.0013519243],"genre_scores_gemma":[0.6035584,0.000005928303,0.39543644,0.00029963965,0.00006530364,0.000026741263,0.000009969478,0.0000036987287,0.00059383846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993154,0.0000064575706,0.00012458402,0.00023901592,0.00015152321,0.00016301879],"domain_scores_gemma":[0.99957657,0.00006153014,0.00003998642,0.00017656018,0.000092106086,0.00005324663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015551687,0.00007245971,0.00007283249,0.00018040814,0.00011177359,0.00011510121,0.00028045336,0.000023030614,0.000005402509],"category_scores_gemma":[0.0000525683,0.00006419043,0.000044950364,0.0009725692,0.000012815162,0.000370367,0.000047969224,0.000027535758,0.00002469908],"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.00000424278,0.000050569273,0.000022963377,0.000012663466,0.0000063188454,0.0000010685264,0.0000590283,0.048840802,0.00028319896,0.8981486,0.0005702297,0.052000325],"study_design_scores_gemma":[0.002965028,0.00039025763,0.0033160911,0.000028541415,0.000014305103,0.000034357443,0.00006856022,0.3923146,0.05855986,0.45708293,0.08437667,0.00084877055],"about_ca_topic_score_codex":0.000006616801,"about_ca_topic_score_gemma":0.0000075332327,"teacher_disagreement_score":0.5981159,"about_ca_system_score_codex":0.000040598075,"about_ca_system_score_gemma":0.000056165616,"threshold_uncertainty_score":0.26176098},"labels":[],"label_agreement":null},{"id":"W2809163898","doi":"10.4153/s0008439518000668","title":"Diameter, Decomposability, and Minkowski Sums of Polytopes","year":2018,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Agence Nationale de la Recherche","keywords":"Minkowski addition; Polytope; Minkowski space; Homothetic transformation; Minkowski's theorem; Bounded function","score_opus":0.009277654902647614,"score_gpt":0.22222619532726734,"score_spread":0.21294854042461972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809163898","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.49370524,0.0001530461,0.48199904,0.010213883,0.00019825788,0.0002517904,0.000010681414,0.000047141006,0.013420919],"genre_scores_gemma":[0.9072078,0.0000020093298,0.09171214,0.0005450378,0.00006826378,0.0000049727864,0.0000018800513,0.0000044385138,0.0004534716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923843,0.000040239913,0.00020346911,0.00020425297,0.00012761279,0.00018601217],"domain_scores_gemma":[0.9991265,0.00021883358,0.000037828653,0.00024407904,0.00009632985,0.00027643354],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002783977,0.0000804275,0.00013619567,0.00012346025,0.00007864386,0.000059828835,0.00025259538,0.000043067623,0.0009934708],"category_scores_gemma":[0.00022365949,0.000074578165,0.000030626416,0.00018322463,0.00015332238,0.000048915575,0.000071820155,0.000044042572,0.0006099879],"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.0000062404442,0.00008004428,0.00066702033,0.0001359062,0.000030737952,0.000011537099,0.001337442,0.0000133043,0.0013504381,0.9243149,0.01636845,0.055683948],"study_design_scores_gemma":[0.0010942905,0.0008184012,0.011841068,0.00021431665,0.000038727216,0.00022525953,0.000119043536,0.0857281,0.029558662,0.6622496,0.20712095,0.0009915765],"about_ca_topic_score_codex":0.00039158,"about_ca_topic_score_gemma":0.00080770545,"teacher_disagreement_score":0.41350254,"about_ca_system_score_codex":0.000026410227,"about_ca_system_score_gemma":0.000106123574,"threshold_uncertainty_score":0.9999198},"labels":[],"label_agreement":null},{"id":"W2809377824","doi":"10.1007/978-3-540-69903-3_33","title":"Spanners of Additively Weighted Point Sets","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Combinatorics; Delaunay triangulation; Voronoi diagram; Mathematics; Embedding; Dual graph; Spanner; Graph; Planar graph; Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.0162288849721434,"score_gpt":0.23743204580784025,"score_spread":0.22120316083569685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809377824","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.00026529358,0.0005232674,0.99310255,0.0005249453,0.0012759342,0.00027226945,0.000017962157,0.000090155125,0.003927629],"genre_scores_gemma":[0.22345024,0.00017816063,0.77421004,0.0011408848,0.00046105,0.000008496093,0.000044061973,0.000032302298,0.000474744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967695,0.00003725944,0.0005684473,0.0011254863,0.0010763669,0.00042295107],"domain_scores_gemma":[0.99774456,0.0004478936,0.00038718764,0.0007828759,0.0004900285,0.00014746582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047705977,0.00040337065,0.00047580304,0.0011320772,0.00018844873,0.00012594556,0.0018432204,0.00022980726,0.00004172711],"category_scores_gemma":[0.000076326454,0.00038473084,0.00019024148,0.0009221654,0.0005532932,0.0005814807,0.00071945874,0.00045302525,0.000036164034],"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.00001038799,0.000056056673,0.000013086085,0.000035817433,0.000028965367,0.00011243786,0.0010667299,0.06438513,0.0002101439,0.01836212,0.0005661246,0.915153],"study_design_scores_gemma":[0.00050038873,0.0003687409,0.00048976816,0.00039683844,0.000012280019,0.00032706108,2.0588807e-7,0.8705686,0.007669664,0.11334016,0.0054020267,0.00092428736],"about_ca_topic_score_codex":0.000012001364,"about_ca_topic_score_gemma":0.00001651276,"teacher_disagreement_score":0.91422874,"about_ca_system_score_codex":0.00018511878,"about_ca_system_score_gemma":0.0008059684,"threshold_uncertainty_score":0.99986047},"labels":[],"label_agreement":null},{"id":"W2809912216","doi":"10.1111/cgf.13592","title":"Solid Geometry Processing on Deconstructed Domains","year":2018,"lang":"en","type":"preprint","venue":"Computer Graphics Forum","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Connaught Fund; Adobe Systems","keywords":"Discretization; Geometry processing; Tetrahedron; Geometry; Boundary (topology); Complex geometry; Convergence (economics); Differential geometry; Solid geometry; Variety (cybernetics); Computer science; Finite element method; Mathematics; Mathematical analysis; Artificial intelligence; Polygon mesh; Engineering; Structural engineering","score_opus":0.018569304563767625,"score_gpt":0.2903201763842542,"score_spread":0.27175087182048663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809912216","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.050130304,0.00028114332,0.9418037,0.0009849563,0.005292687,0.0004262912,0.000023845421,0.0005726373,0.00048446667],"genre_scores_gemma":[0.7664689,0.00006451808,0.22709717,0.003950032,0.0019805897,0.000059363694,0.00024414324,0.000056727167,0.000078568795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627846,0.00013616419,0.0006727777,0.0014437812,0.0007791612,0.00068964896],"domain_scores_gemma":[0.99715304,0.00018630433,0.0004945675,0.0012975066,0.0006197925,0.00024878138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047274612,0.0005813652,0.0005228787,0.0013984278,0.0005541534,0.0010306108,0.0020843917,0.00049430743,0.000013007122],"category_scores_gemma":[0.00003960108,0.000595567,0.0003306075,0.0014480272,0.00019701854,0.0003926152,0.0026868354,0.00091478304,0.000080042366],"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.00005086983,0.0006045425,0.0016675001,0.0004973599,0.00040377368,0.00010043366,0.00079541275,0.033705942,0.00008717762,0.5319553,0.042154804,0.38797688],"study_design_scores_gemma":[0.00044643437,0.0002854486,0.0025793163,0.00032797077,0.000023054854,0.00006748282,0.000005152304,0.85957134,0.0007537276,0.12857592,0.00656866,0.00079549773],"about_ca_topic_score_codex":0.000005337408,"about_ca_topic_score_gemma":0.000009595792,"teacher_disagreement_score":0.8258654,"about_ca_system_score_codex":0.0000965657,"about_ca_system_score_gemma":0.00047187586,"threshold_uncertainty_score":0.9996496},"labels":[],"label_agreement":null},{"id":"W2809944305","doi":"10.1145/3197517.3201353","title":"Tetrahedral meshing in the wild","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":251,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Robustness (evolution); Computer science; Computation; T-vertices; Algorithm; Enhanced Data Rates for GSM Evolution; Polygon mesh; Geometry processing; Tetrahedron; Mesh generation; Mathematics; Computer vision; Geometry; Computer graphics (images); Finite element method","score_opus":0.028490074276512317,"score_gpt":0.2749468525037155,"score_spread":0.24645677822720316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809944305","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.035620917,0.000024543873,0.95688343,0.0063649854,0.00042497835,0.000092868126,0.0000019018804,0.000059398608,0.0005269611],"genre_scores_gemma":[0.98003745,0.000019904897,0.01720289,0.0025967436,0.0000830119,0.000014836208,0.000001949975,0.000003566043,0.000039660772],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991612,0.000084407824,0.00013692364,0.00020522327,0.0002643049,0.00014798257],"domain_scores_gemma":[0.9991455,0.00024372297,0.00002553143,0.0004979083,0.000058814192,0.000028503526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037854072,0.000079999525,0.00005814524,0.00026692648,0.00029881726,0.0001177336,0.0007724855,0.000045594403,0.000013189314],"category_scores_gemma":[0.000028846802,0.00006228027,0.00005624142,0.0014713529,0.000056793804,0.0003488223,0.000006288377,0.00021214398,0.000027922011],"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.00003736123,0.0007916072,0.0007838191,0.000016376944,0.00005800175,0.000022796761,0.00911734,0.009607717,0.0006684157,0.41094768,0.002161412,0.5657875],"study_design_scores_gemma":[0.0021704983,0.0015045669,0.076256946,0.000113864204,0.00005318057,0.00022201681,0.00060050905,0.33480734,0.011078454,0.48764673,0.08436183,0.0011840952],"about_ca_topic_score_codex":0.00001742417,"about_ca_topic_score_gemma":0.0001551633,"teacher_disagreement_score":0.9444165,"about_ca_system_score_codex":0.000013215278,"about_ca_system_score_gemma":0.00003605465,"threshold_uncertainty_score":0.25397155},"labels":[],"label_agreement":null},{"id":"W2810709785","doi":"10.1145/3197517.3201328","title":"Box cutter","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"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 British Columbia","funders":"","keywords":"Minimum bounding box; Atlas (anatomy); Computer science; Parameterized complexity; Boundary (topology); Process (computing); Algorithm; Bounding overwatch; Engineering drawing; Artificial intelligence; Mathematics; Engineering; Geology","score_opus":0.02284723420775557,"score_gpt":0.2651926098493226,"score_spread":0.242345375641567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810709785","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.007876594,0.000015576241,0.98659074,0.003785306,0.00074257475,0.00006543294,0.000002766939,0.00014554751,0.0007754618],"genre_scores_gemma":[0.92591536,0.000020264602,0.070197105,0.0033283394,0.00013970981,0.000012485665,0.00000272133,0.0000059044633,0.00037808076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992457,0.000032101205,0.00012193627,0.00024387562,0.00021335487,0.00014300115],"domain_scores_gemma":[0.99914205,0.00008754113,0.000026829339,0.000553698,0.0001286635,0.00006122673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011965187,0.00008641443,0.00006136305,0.00024891365,0.0002995822,0.00008010236,0.0004827402,0.000051724655,0.00007033241],"category_scores_gemma":[0.00001317581,0.0000844742,0.00006878404,0.00086872163,0.000057496938,0.00030321607,0.00000807382,0.00012232384,0.00020514848],"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.0000495949,0.0007484971,0.00020971918,0.000019627814,0.00015593454,0.000014111817,0.0017094982,0.0037179976,0.0034128,0.26493582,0.010827862,0.7141985],"study_design_scores_gemma":[0.0018528709,0.0019953568,0.010824497,0.000062790175,0.000071246286,0.00014896564,0.000052000327,0.11947443,0.1283623,0.41415873,0.32163575,0.0013610732],"about_ca_topic_score_codex":0.0000051548327,"about_ca_topic_score_gemma":0.00002011879,"teacher_disagreement_score":0.9180388,"about_ca_system_score_codex":0.000011856276,"about_ca_system_score_gemma":0.00003552783,"threshold_uncertainty_score":0.34447578},"labels":[],"label_agreement":null},{"id":"W2810772462","doi":"10.1007/978-3-319-95165-2_29","title":"Molecular Structure Determination in the Phillips’ Model: A Degree of Freedom Approach","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Windsor","funders":"","keywords":"Dihedral angle; Atom (system on chip); Euclidean space; Physics; Degrees of freedom (physics and chemistry); Torsion (gastropod); Axiom; Euclidean geometry; Mathematics; Combinatorics; Molecule; Geometry; Computer science; Quantum mechanics","score_opus":0.027589475560635904,"score_gpt":0.2495506531724413,"score_spread":0.2219611776118054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810772462","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.0019763415,0.00021804753,0.9951562,0.00023793208,0.00044274595,0.00043452598,0.000008089361,0.0000317357,0.0014943545],"genre_scores_gemma":[0.51719123,0.0000056667477,0.4821619,0.0004026187,0.00018399056,0.0000065581603,0.000013336641,0.000012041188,0.000022623117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692696,0.00007089895,0.0005036177,0.0009881173,0.0011608722,0.00034953112],"domain_scores_gemma":[0.9980151,0.0002603464,0.00030824286,0.0010196158,0.00033960666,0.00005706386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092446554,0.0003580526,0.00034891168,0.0009307637,0.000126298,0.0002381105,0.002900544,0.0002613359,0.0000067894794],"category_scores_gemma":[0.0000865861,0.00027817397,0.000106034655,0.001026369,0.0004798957,0.0004531822,0.00053863274,0.0004977658,0.000002671833],"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.000003554005,0.000027140037,0.000006594055,0.000028850485,0.000003775979,0.000011737442,0.0015629961,0.81477576,0.00041823465,0.02477052,0.000008529462,0.15838228],"study_design_scores_gemma":[0.00015490582,0.00008461826,0.00006896071,0.00006873437,0.000005023106,0.000041873485,2.833211e-7,0.8026306,0.0010092483,0.19565995,0.000040898307,0.00023487426],"about_ca_topic_score_codex":0.0000086163445,"about_ca_topic_score_gemma":0.000055629458,"teacher_disagreement_score":0.5152149,"about_ca_system_score_codex":0.00012639958,"about_ca_system_score_gemma":0.00041265544,"threshold_uncertainty_score":0.99996704},"labels":[],"label_agreement":null},{"id":"W2816890","doi":"10.1007/978-3-642-23719-5_8","title":"Can Nearest Neighbor Searching Be Simple and Always Fast?","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 British Columbia","funders":"","keywords":"Voronoi diagram; Computer science; Point location; Delaunay triangulation; Logarithm; k-nearest neighbors algorithm; Algorithm; Simple (philosophy); Nearest neighbor search; Predicate (mathematical logic); Computational geometry; Theoretical computer science; Point (geometry); Data mining; Mathematics; Artificial intelligence","score_opus":0.028346842792293915,"score_gpt":0.253094582071666,"score_spread":0.2247477392793721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2816890","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.0005498215,0.00031652584,0.99380165,0.001254089,0.0007952403,0.00027623423,0.000011123018,0.00010980688,0.002885497],"genre_scores_gemma":[0.6578996,0.00007031963,0.33728933,0.0033035371,0.000786062,0.000010768141,0.000031515192,0.000042173597,0.0005666649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698097,0.000041240764,0.0003666647,0.0012828535,0.0007818449,0.0005464424],"domain_scores_gemma":[0.99822706,0.0003831605,0.00017345684,0.00075761485,0.00021344805,0.00024524578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000677186,0.0004011772,0.00034925697,0.00075710367,0.00041573436,0.0006637495,0.0015772156,0.00018774855,0.000028408731],"category_scores_gemma":[0.00007706922,0.0003828168,0.00007320193,0.0005374153,0.0004239914,0.00055947277,0.0013536154,0.0006049923,0.000012819682],"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.000004213149,0.000017850492,0.00005826129,0.000026894804,0.000009579576,0.000051998522,0.0016687461,0.018098136,0.00013086459,0.08016772,0.000043536787,0.8997222],"study_design_scores_gemma":[0.00027018672,0.00022873774,0.00068966625,0.0001285625,0.000007849221,0.000113288224,3.470956e-7,0.60396904,0.0011445911,0.38897485,0.003763098,0.00070978276],"about_ca_topic_score_codex":0.00009797816,"about_ca_topic_score_gemma":0.00027228743,"teacher_disagreement_score":0.8990124,"about_ca_system_score_codex":0.00013307772,"about_ca_system_score_gemma":0.00055664574,"threshold_uncertainty_score":0.9998624},"labels":[],"label_agreement":null},{"id":"W2887511890","doi":"10.1007/s12065-018-0166-0","title":"Mesh smoothing of complex geometry using variations of cohort intelligence algorithm","year":2018,"lang":"en","type":"article","venue":"Evolutionary Intelligence","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 Windsor","funders":"","keywords":"Computer science; Smoothing; Algorithm; Enhanced Data Rates for GSM Evolution; Node (physics); Object (grammar); Artificial intelligence; Computer vision","score_opus":0.04388587278373347,"score_gpt":0.30649646739819564,"score_spread":0.2626105946144622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887511890","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.012001177,0.00027934829,0.98574066,0.00009394469,0.00068760716,0.00021923764,0.000027577651,0.00006518992,0.0008852282],"genre_scores_gemma":[0.5560657,0.000043142005,0.44361943,0.000044252734,0.00013809779,0.0000046459177,0.000016432414,0.0000059782897,0.0000623299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772817,0.00011711183,0.000796232,0.00045533694,0.0006335997,0.000269551],"domain_scores_gemma":[0.99751836,0.0003445951,0.00039527274,0.00053709775,0.0011120441,0.00009262809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060408656,0.0001801221,0.00027090838,0.00050301285,0.0002507638,0.00003271937,0.00090620556,0.00008927932,0.00023648802],"category_scores_gemma":[0.000235167,0.00019673168,0.00011364692,0.0021584225,0.00033729573,0.0006670481,0.00032334396,0.00013446086,0.000043523316],"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.000020883477,0.00049317215,0.0037369437,0.00007234726,0.00021067086,0.0000052476207,0.0015255053,0.088536054,0.014569203,0.6047364,0.00046321552,0.28563035],"study_design_scores_gemma":[0.000032628563,0.00015619934,0.009800691,0.000049616752,0.00002021024,0.00004206198,0.00006224004,0.9257232,0.03045076,0.033114783,0.00035355924,0.00019404256],"about_ca_topic_score_codex":0.00018337012,"about_ca_topic_score_gemma":0.0000045650304,"teacher_disagreement_score":0.8371872,"about_ca_system_score_codex":0.000111373236,"about_ca_system_score_gemma":0.00029480754,"threshold_uncertainty_score":0.8022485},"labels":[],"label_agreement":null},{"id":"W2888306059","doi":"10.20382/jocg.v9i1a9","title":"Drawing planar graphs with prescribed face areas","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Planar graph; Bipartite graph; Combinatorics; Mathematics; Eulerian path; Universality (dynamical systems); Plane (geometry); Graph; Geometry; Discrete mathematics; Pure mathematics; Physics; Lagrangian","score_opus":0.014040307801698399,"score_gpt":0.21825494128515086,"score_spread":0.20421463348345245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888306059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23076102,0.00008662563,0.7648448,0.0011923914,0.00039601006,0.00008983851,0.0000058980518,0.00003300745,0.0025904332],"genre_scores_gemma":[0.9343609,0.000016324648,0.06463087,0.00013143303,0.00013122679,1.5191648e-7,0.000008271719,0.0000087041235,0.0007120866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9982682,0.00008875074,0.0003141987,0.00027615693,0.0008211787,0.00023151195],"domain_scores_gemma":[0.99746716,0.00023454166,0.00087271834,0.0003601491,0.0008477575,0.00021765934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035037135,0.00018697919,0.00028340236,0.0011749406,0.00073397503,0.0004615825,0.0014829998,0.00007113507,0.000016227872],"category_scores_gemma":[0.00009443492,0.00017690269,0.00016594116,0.000764102,0.00011043779,0.0022702133,0.0001637605,0.00026566652,0.000009727454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003753092,0.0003133982,0.011616519,0.00004317398,0.00054984464,0.0011460419,0.00073171523,0.7190493,0.00041651487,0.23886375,0.0025410901,0.02435335],"study_design_scores_gemma":[0.0139824115,0.0030262098,0.5953817,0.00063022936,0.0003945897,0.0027179793,0.00089716935,0.17484665,0.0026294503,0.08622423,0.11702953,0.0022398718],"about_ca_topic_score_codex":0.000013452413,"about_ca_topic_score_gemma":0.0000052367163,"teacher_disagreement_score":0.7035999,"about_ca_system_score_codex":0.00011072807,"about_ca_system_score_gemma":0.0003872507,"threshold_uncertainty_score":0.7213882},"labels":[],"label_agreement":null},{"id":"W2889537410","doi":"10.1007/s00454-023-00499-9","title":"Improved Routing on the Delaunay Triangulation","year":2023,"lang":"en","type":"article","venue":"Discrete & 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":"Carleton University; University of Ottawa","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Delaunay triangulation; Combinatorics; Vertex (graph theory); Mathematics; Constrained Delaunay triangulation; Minimum-weight triangulation; Euclidean geometry; Discrete mathematics; Graph; Geometry","score_opus":0.024599141864490155,"score_gpt":0.2717554313335173,"score_spread":0.24715628946902715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889537410","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.1362397,0.000033399556,0.85553867,0.0054501984,0.00066420884,0.00032373267,0.000014431276,0.00045301995,0.0012826591],"genre_scores_gemma":[0.99037826,0.000003463411,0.007019031,0.0012990872,0.0002931975,0.00004540925,0.00027335653,0.000016914411,0.0006712563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978477,0.00016411569,0.000401765,0.0005134442,0.0007121691,0.00036083598],"domain_scores_gemma":[0.9977041,0.0014174541,0.00017917893,0.000385107,0.00021594195,0.000098220364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009956033,0.00021015461,0.00016429147,0.0005372908,0.0005884862,0.00033850395,0.0006414426,0.00007158295,0.00005462715],"category_scores_gemma":[0.00038093803,0.00016266767,0.00014991744,0.0034304454,0.000044367596,0.00042066994,0.00022222039,0.00020908714,0.0004741527],"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.000016477316,0.00003255612,0.00019337957,0.0000063182574,0.000042866286,0.0000060079647,0.00029740637,0.58054227,0.0004071314,0.38678142,0.0028355683,0.028838627],"study_design_scores_gemma":[0.0003608951,0.00007864828,0.029950246,0.000015143374,0.000006126,0.000007692057,0.000044940414,0.9215655,0.00034775038,0.04619119,0.0012189192,0.00021299183],"about_ca_topic_score_codex":0.0000078829335,"about_ca_topic_score_gemma":0.0000013112224,"teacher_disagreement_score":0.8541386,"about_ca_system_score_codex":0.00006850522,"about_ca_system_score_gemma":0.00011719578,"threshold_uncertainty_score":0.6633395},"labels":[],"label_agreement":null},{"id":"W2889862494","doi":"10.1190/segam2018-2997918.1","title":"An optimized approach to compute traveltimes in 3D unstructured meshes","year":2018,"lang":"en","type":"article","venue":"","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":"Université Laval; Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Shortest path problem; Computation; Algorithm; Inversion (geology); Polygon mesh; Computational science; Computer graphics (images); Geology; Theoretical computer science; Seismology; Graph; Tectonics","score_opus":0.015510117932545786,"score_gpt":0.26261131361065193,"score_spread":0.24710119567810615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889862494","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.04163927,0.0000098256605,0.9470973,0.00022973488,0.00027593755,0.00019641231,8.277168e-7,0.0001279382,0.010422742],"genre_scores_gemma":[0.44782078,3.9577859e-7,0.55132806,0.00054838194,0.000115525676,0.000006506532,0.000007547157,0.0000031943814,0.00016958083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988569,0.00008131794,0.00020733134,0.00043231784,0.0002150624,0.0002070963],"domain_scores_gemma":[0.9993638,0.00003560442,0.000031614094,0.0003352626,0.00010660387,0.00012715442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002635671,0.00012143285,0.00014958878,0.00025252532,0.00008823451,0.00017496737,0.00057368306,0.0000478404,0.000032566248],"category_scores_gemma":[0.000013670834,0.000106646134,0.000027709868,0.00084606855,0.000029884945,0.00042235138,0.000093855866,0.000058294903,0.00004043521],"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.000070256385,0.00043863937,0.00026336082,0.000012031803,0.000030274969,0.0000050415674,0.005387656,0.4582687,0.0048182276,0.2263828,0.0040562903,0.3002667],"study_design_scores_gemma":[0.00048748223,0.00013440906,0.008412235,0.0000031160084,0.0000015008566,0.000011637579,0.000020805044,0.9836746,0.0039265193,0.002080041,0.00107726,0.0001704005],"about_ca_topic_score_codex":0.000030587245,"about_ca_topic_score_gemma":0.000015140966,"teacher_disagreement_score":0.5254059,"about_ca_system_score_codex":0.000024963178,"about_ca_system_score_gemma":0.00006364394,"threshold_uncertainty_score":0.43489033},"labels":[],"label_agreement":null},{"id":"W2890636645","doi":"10.20382/jocg.v9i1a11","title":"Planar and Poly-Arc Lombardi Drawings","year":2011,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Planarity testing; Planar graph; Planar; Graph; Book embedding; Combinatorics; Mathematics; Computer science; Line graph; 1-planar graph; Computer graphics (images)","score_opus":0.016700989118549496,"score_gpt":0.21151987308479653,"score_spread":0.19481888396624703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890636645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09115114,0.0014664007,0.9021047,0.0007943499,0.0014070111,0.00015580046,0.000023598508,0.000060077728,0.0028369215],"genre_scores_gemma":[0.82711947,0.00024802182,0.17081194,0.0003756849,0.00050629245,3.5986935e-7,0.000045260258,0.000022339744,0.00087064365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975006,0.00019841053,0.0006240464,0.000509973,0.0008805044,0.00028647555],"domain_scores_gemma":[0.99685216,0.00035256904,0.0010867526,0.00030291482,0.0010734686,0.0003321583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005815089,0.0003504359,0.0005842397,0.0027252282,0.00022304371,0.0002688437,0.0012689235,0.0002781157,0.00003513324],"category_scores_gemma":[0.0000799468,0.00038828034,0.0003335296,0.0011809642,0.00011631482,0.00089517643,0.00085302896,0.00083034567,0.000012581102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042887757,0.0007260964,0.0028168363,0.0004841758,0.0018868125,0.001872816,0.0027783653,0.3333571,0.0003518336,0.5454227,0.010229656,0.099644735],"study_design_scores_gemma":[0.0059113773,0.0015853631,0.06792969,0.00094172056,0.0006892581,0.0025703446,0.000461805,0.09039583,0.0008436583,0.7467583,0.07912401,0.0027886564],"about_ca_topic_score_codex":0.00002564971,"about_ca_topic_score_gemma":0.0000019135225,"teacher_disagreement_score":0.73596835,"about_ca_system_score_codex":0.00020860296,"about_ca_system_score_gemma":0.00083272456,"threshold_uncertainty_score":0.9998569},"labels":[],"label_agreement":null},{"id":"W2890802049","doi":"10.20382/jocg.v11i1a3","title":"New lower bounds for the number of pseudoline arrangements","year":2019,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Sorting network; Graph; Sorting; Constant (computer programming); Sorting algorithm; Algorithm; Computer science; Mathematical analysis","score_opus":0.010241576557437881,"score_gpt":0.23630385694285558,"score_spread":0.2260622803854177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890802049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12761119,0.0000913307,0.868996,0.0009478314,0.0011693058,0.0001603427,0.000006647335,0.000010581798,0.0010067571],"genre_scores_gemma":[0.84943384,0.00002270233,0.14566875,0.00025404122,0.0003169988,1.9542509e-7,0.00000845316,0.000008401885,0.004286649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862784,0.000051550105,0.00037968054,0.00017015872,0.0006142573,0.00015652663],"domain_scores_gemma":[0.99750024,0.00072448817,0.00055204233,0.00018369299,0.000936345,0.00010316261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000415199,0.0001230734,0.00023633068,0.0005286659,0.00010848236,0.00006843848,0.0008004395,0.0000531739,0.00015542553],"category_scores_gemma":[0.000051133946,0.00010458182,0.00025727262,0.0013644767,0.000030450605,0.0006704436,0.00011512517,0.00013598983,0.000021476722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036707125,0.00023286311,0.0045490786,0.000053985408,0.00049445714,0.000017706121,0.00025090954,0.76712364,0.00054645486,0.18143284,0.011163259,0.03376774],"study_design_scores_gemma":[0.013724636,0.0017733303,0.06756922,0.00022783424,0.00037006912,0.0004932868,0.00044121692,0.33808392,0.0017529353,0.076426566,0.4981629,0.0009740938],"about_ca_topic_score_codex":0.0000070913075,"about_ca_topic_score_gemma":7.8265896e-7,"teacher_disagreement_score":0.7233273,"about_ca_system_score_codex":0.00008328468,"about_ca_system_score_gemma":0.000431644,"threshold_uncertainty_score":0.42647228},"labels":[],"label_agreement":null},{"id":"W2892139754","doi":"10.1137/1.9781611974331.ch70","title":"Windrose Planarity: Embedding Graphs with Direction-Constrained Edges","year":2015,"lang":"en","type":"preprint","venue":"","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":"Planarity testing; Combinatorics; Planar graph; Embedding; Mathematics; Planar; Vertex (graph theory); Monotone polygon; Graph drawing; Partition (number theory); Book embedding; Planar straight-line graph; Graph; Discrete mathematics; 1-planar graph; Geometry; Line graph; Computer science; Artificial intelligence","score_opus":0.029522677122966717,"score_gpt":0.27217843166851413,"score_spread":0.24265575454554741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892139754","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.018200625,0.00021500567,0.95982826,0.0010266968,0.0015756899,0.00030525136,0.00001195474,0.0005066751,0.018329857],"genre_scores_gemma":[0.7983815,0.000022658449,0.1977992,0.00039128147,0.00035710676,0.00006193922,0.00016747034,0.000019160161,0.0027996951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829966,0.00006930495,0.00027158216,0.0006759771,0.0004561013,0.00022737557],"domain_scores_gemma":[0.99871516,0.00008886999,0.00016663273,0.00051606726,0.0003491115,0.00016416267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041832318,0.0002623369,0.00027327417,0.00035511405,0.00014807109,0.00046025348,0.0005800714,0.00016604457,0.00002523917],"category_scores_gemma":[0.00004204456,0.00022231598,0.00007822552,0.00047477472,0.000051756175,0.0003190887,0.00051809254,0.000354699,0.000025503972],"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.00006175807,0.00035321293,0.0012795,0.00016376992,0.00055245776,0.0001230859,0.0019113002,0.5168928,0.00021158559,0.2559741,0.032725126,0.18975133],"study_design_scores_gemma":[0.0010470287,0.00029005692,0.0024407639,0.0002285866,0.00008423823,0.0003003822,0.00011006996,0.839492,0.002221385,0.14136183,0.011036731,0.0013868902],"about_ca_topic_score_codex":0.0000685957,"about_ca_topic_score_gemma":0.00006751306,"teacher_disagreement_score":0.7801809,"about_ca_system_score_codex":0.00007217276,"about_ca_system_score_gemma":0.00058458623,"threshold_uncertainty_score":0.9065783},"labels":[],"label_agreement":null},{"id":"W2892655831","doi":"10.1007/978-3-662-58039-4_6","title":"A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Windsor","funders":"","keywords":"Computer science; Chordal graph; Distance matrix; Algorithm; Point (geometry); Matrix (chemical analysis); Embedding; Plane (geometry); Theoretical computer science; Graph; Mathematics; Artificial intelligence; Geometry","score_opus":0.0329702169910604,"score_gpt":0.28323056348933356,"score_spread":0.25026034649827317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892655831","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.000103082755,0.00016431652,0.99467963,0.0012840135,0.0010802527,0.0013903939,0.000018335044,0.00005139983,0.0012286027],"genre_scores_gemma":[0.050329845,0.000008463582,0.9452076,0.002730461,0.0010275801,0.0001284365,0.000084460495,0.000022055408,0.00046110485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966157,0.00005536727,0.0005122548,0.0012838006,0.0010168945,0.0005159955],"domain_scores_gemma":[0.99803865,0.0005722886,0.00019741575,0.00084268855,0.00024800605,0.00010092566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018819836,0.0003823983,0.00036315894,0.00068660267,0.00029828624,0.00063770404,0.0023680548,0.00014735573,0.000008998016],"category_scores_gemma":[0.00006994574,0.00030323688,0.00009013334,0.0008683205,0.00022073326,0.00034849322,0.0004762601,0.00033452708,0.000025875395],"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.000072409595,0.00024262574,0.00001469116,0.00013017879,0.000019091847,0.00002138434,0.0075798226,0.6089344,0.000110685105,0.16858426,0.0015005055,0.21278995],"study_design_scores_gemma":[0.00041291176,0.00038117138,0.00012417082,0.00013326596,0.0000053136323,0.000060398244,0.0000018122727,0.8913923,0.0001282678,0.093662255,0.013239575,0.00045857744],"about_ca_topic_score_codex":0.000015001569,"about_ca_topic_score_gemma":0.00008270773,"teacher_disagreement_score":0.2824579,"about_ca_system_score_codex":0.00034949323,"about_ca_system_score_gemma":0.00026653844,"threshold_uncertainty_score":0.99994195},"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":"W2895069531","doi":"10.22215/etd/2014-10404","title":"Obstacle-Avoiding Path Existence Queries in a Simple Polygon","year":2014,"lang":"en","type":"dissertation","venue":"","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Simple polygon; Obstacle; Disjoint sets; Path (computing); Set (abstract data type); Simple (philosophy); Regular polygon; Computer science; Convex polygon; Computational geometry; Mathematics; Visibility polygon; Polygon covering; Plane (geometry); Algorithm; Combinatorics; Geometry; Geography","score_opus":0.0138925241113814,"score_gpt":0.2613839704125718,"score_spread":0.24749144630119038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895069531","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.37308168,0.00066215475,0.5898521,0.00023980485,0.0021602416,0.00043585032,0.0000051126776,0.0003299803,0.033233102],"genre_scores_gemma":[0.9706284,0.000031600273,0.019054892,0.00026094605,0.0001610216,0.000045478984,0.0004966897,0.000017041071,0.009303927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983302,0.00011684419,0.00038535852,0.0005372946,0.00036479035,0.0002655098],"domain_scores_gemma":[0.99907374,0.00020106493,0.00017013804,0.00035644227,0.00012878451,0.000069835034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003926903,0.00022875455,0.00025649398,0.0003536281,0.00015508774,0.00023896253,0.0005389483,0.00016071416,0.00003590045],"category_scores_gemma":[0.00016162648,0.0002297664,0.0000774591,0.0006546561,0.000010037147,0.00044913156,0.00006241493,0.00026388807,0.00005340134],"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.00004944532,0.00014838103,0.0005528242,0.000320629,0.000028151744,0.00003409475,0.0055657527,0.005604523,0.0031760777,0.8039498,0.0027803925,0.17778993],"study_design_scores_gemma":[0.0017734085,0.0005766387,0.05661881,0.00077840115,0.000039500563,0.00005239917,0.0030256154,0.65396625,0.03624063,0.189576,0.05399954,0.0033528325],"about_ca_topic_score_codex":0.00019442735,"about_ca_topic_score_gemma":0.0010369458,"teacher_disagreement_score":0.6483617,"about_ca_system_score_codex":0.00007210483,"about_ca_system_score_gemma":0.00019239508,"threshold_uncertainty_score":0.93696016},"labels":[],"label_agreement":null},{"id":"W2895411163","doi":"10.55016/ojs/cdm.v10i1.62303","title":"Visibility-monotonic polygon deflation","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Visibility; Visibility polygon; Rectilinear polygon; Star-shaped polygon; Point in polygon; Simple polygon; Monotonic function; Polygon covering; Computer science; Monotone polygon; Computer vision; Regular polygon; Combinatorics; Computer graphics (images); Mathematics; Artificial intelligence; Polygon mesh; Geometry; Mathematical analysis; Physics; Optics; Convex set","score_opus":0.024631269072147997,"score_gpt":0.31846043104266714,"score_spread":0.2938291619705191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895411163","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.022575824,0.000093245915,0.9709751,0.0028727,0.00027949238,0.00040493134,0.000029923513,0.00019359075,0.0025752091],"genre_scores_gemma":[0.86306673,0.0000017658634,0.13609554,0.00022685665,0.00011046745,0.000050235503,0.000042833562,0.0000073885844,0.00039816837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987076,0.00006324527,0.00034324467,0.00028578195,0.00034982985,0.00025032109],"domain_scores_gemma":[0.9983851,0.00013868019,0.00009322853,0.0005477855,0.00055324635,0.00028200686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070397876,0.00013318831,0.00016945212,0.0001698649,0.00016451438,0.00021521354,0.00040859502,0.00005866528,0.000009032182],"category_scores_gemma":[0.00095493026,0.00012586128,0.00006810418,0.00080443773,0.000020542246,0.00043684215,0.00019768349,0.000084209016,0.00040230903],"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.0000072665243,0.00014772122,0.000040978135,0.000015231729,0.00002303177,0.0000027695849,0.0015721779,0.012178498,0.0016170373,0.97361314,0.0040555494,0.006726593],"study_design_scores_gemma":[0.00071519025,0.00019438687,0.0005710798,0.000034150125,0.000025079906,0.000028014972,0.000109410525,0.72811455,0.0062572616,0.2505297,0.013050419,0.0003707262],"about_ca_topic_score_codex":0.000004134146,"about_ca_topic_score_gemma":0.000005886126,"teacher_disagreement_score":0.84049094,"about_ca_system_score_codex":0.00021724045,"about_ca_system_score_gemma":0.00022298709,"threshold_uncertainty_score":0.5171003},"labels":[],"label_agreement":null},{"id":"W2897577023","doi":"10.1007/978-3-030-24766-9_12","title":"On the Minimum Consistent Subset Problem","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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 Ottawa; Carleton University; University of Waterloo","funders":"","keywords":"Colored; Combinatorics; Mathematics; Cardinality (data modeling); Binary logarithm; Point (geometry); Time complexity; Voronoi diagram; Set (abstract data type); Deterministic algorithm; Running time; Class (philosophy); Algorithm; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.022878295508387887,"score_gpt":0.25747789485969685,"score_spread":0.23459959935130897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897577023","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.031905632,0.00016697249,0.954869,0.008257713,0.003751563,0.0007954757,0.0000054963543,0.00010446746,0.00014369922],"genre_scores_gemma":[0.8049006,0.000007940873,0.19086985,0.003928875,0.00022917341,0.000039090562,0.000009012703,0.000008970161,0.0000065057334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623805,0.0001979898,0.00043959374,0.0014766228,0.0011073024,0.0005404277],"domain_scores_gemma":[0.9961936,0.001481636,0.00025409463,0.0016736267,0.00029460082,0.0001024677],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016170766,0.00037946465,0.00032896813,0.000527741,0.00028821704,0.0010689279,0.003721968,0.00018518275,0.000011809915],"category_scores_gemma":[0.00022636297,0.00026739595,0.00013424191,0.0017141941,0.00029729464,0.00025792717,0.002833244,0.0009077873,0.00008774859],"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.000004386505,0.00006401814,0.000097042685,0.000030592513,0.000007791933,0.000009401312,0.0005939176,0.9012604,0.00016401423,0.013922341,0.00019574529,0.08365036],"study_design_scores_gemma":[0.00014233039,0.00010703555,0.0007419057,0.0001571058,0.0000030949495,0.000017500402,2.7742993e-7,0.8449854,0.0027146684,0.15068465,0.00013832402,0.00030770316],"about_ca_topic_score_codex":0.000019723624,"about_ca_topic_score_gemma":0.000021502898,"teacher_disagreement_score":0.77299494,"about_ca_system_score_codex":0.00022382518,"about_ca_system_score_gemma":0.0010088456,"threshold_uncertainty_score":0.9999778},"labels":[],"label_agreement":null},{"id":"W2899582626","doi":"10.1007/s00454-022-00418-4","title":"Dual Circumference and Collinear Sets","year":2022,"lang":"en","type":"preprint","venue":"Discrete & 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","keywords":"Combinatorics; Circumference; Vertex (graph theory); Mathematics; Omega; Planar graph; Degree (music); Triangulation; Graph; Planar; Line (geometry); Geometry; Physics; Computer science","score_opus":0.023055911642320546,"score_gpt":0.2864938477798974,"score_spread":0.2634379361375768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899582626","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.16794108,0.0016523987,0.8237679,0.0017715924,0.001917938,0.00059283274,0.0003629204,0.00034391816,0.0016494166],"genre_scores_gemma":[0.8885135,0.00007646914,0.107670955,0.00080500887,0.0002932827,0.00012766654,0.0020257114,0.000033985987,0.0004534374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959803,0.00025387196,0.00065738993,0.001363758,0.0013179709,0.00042668133],"domain_scores_gemma":[0.99781203,0.0005690924,0.00039610962,0.0006251759,0.00034090446,0.00025666424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006470541,0.00048329253,0.0004823376,0.0008393134,0.00056562567,0.0006843341,0.0009783685,0.00020767827,0.00028066293],"category_scores_gemma":[0.00013098106,0.0005522558,0.00018886525,0.0012722634,0.000110707675,0.000415834,0.003726007,0.0009066136,0.000043322387],"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.000017779994,0.00011277988,0.0010054561,0.00014516369,0.00014464783,0.000066831766,0.00053073943,0.8814932,0.00002432176,0.0954507,0.0023165238,0.018691817],"study_design_scores_gemma":[0.00054359203,0.00013594676,0.03928462,0.000049229726,0.000036188536,0.00011204272,0.00006105143,0.81451756,0.000029091543,0.13813391,0.006256966,0.000839829],"about_ca_topic_score_codex":0.00003554746,"about_ca_topic_score_gemma":0.0000027315753,"teacher_disagreement_score":0.7205724,"about_ca_system_score_codex":0.00017245393,"about_ca_system_score_gemma":0.0006759567,"threshold_uncertainty_score":0.9996929},"labels":[],"label_agreement":null},{"id":"W2901475388","doi":"10.1007/s10107-020-01524-y","title":"Approximate multi-matroid intersection via iterative refinement","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Matroid; Rounding; Matroid partitioning; Mathematics; Weighted matroid; Combinatorics; Knapsack problem; Relaxation (psychology); Polytope; Cardinality (data modeling); Intersection (aeronautics); Mathematical optimization; Discrete mathematics; Graphic matroid; Computer science","score_opus":0.04079817346689619,"score_gpt":0.2750983584804017,"score_spread":0.23430018501350552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901475388","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.0029513137,0.00003216836,0.9940331,0.0018632403,0.000100993195,0.00032510364,4.790603e-7,0.00028739645,0.0004062275],"genre_scores_gemma":[0.43733245,5.16001e-7,0.56208324,0.00038319398,0.000080082784,0.00005439018,0.0000065443514,0.0000068390264,0.000052734333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988469,0.00005137876,0.00030123527,0.00033411843,0.00025385723,0.00021249743],"domain_scores_gemma":[0.99947083,0.00006857453,0.000083553314,0.00016184067,0.00007798497,0.0001372016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021729233,0.00013493586,0.00015484043,0.00005557084,0.00012402545,0.00024225445,0.00026095755,0.000037439386,0.000039025337],"category_scores_gemma":[0.0001257823,0.000117913456,0.00007232872,0.0003962072,0.000024256726,0.00032769638,0.00017600856,0.0001219815,0.0001614949],"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.000024726689,0.0005980972,0.000027739348,0.00037974998,0.00007639175,0.000026474188,0.01092822,0.001976815,0.010364097,0.21024105,0.0004100045,0.76494664],"study_design_scores_gemma":[0.00031992435,0.0001746941,0.000015236,0.000025309955,0.000007682154,0.000017392562,0.000082462655,0.9843763,0.004028781,0.007406012,0.0033813673,0.00016483532],"about_ca_topic_score_codex":9.94075e-7,"about_ca_topic_score_gemma":5.999458e-7,"teacher_disagreement_score":0.98239946,"about_ca_system_score_codex":0.00004280895,"about_ca_system_score_gemma":0.000018331897,"threshold_uncertainty_score":0.4808371},"labels":[],"label_agreement":null},{"id":"W2901689010","doi":"10.1007/s00373-020-02272-8","title":"Art Gallery Problem with Rook and Queen Vision","year":2021,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","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 British Columbia","funders":"Division of Mathematical Sciences; European Commission; National Science Foundation","keywords":"Polyomino; Guard (computer science); Combinatorics; Square tiling; Square (algebra); Matching (statistics); Computer science; Irrational number; Queen (butterfly); Mathematics; Grid; Regular polygon; Geometry; Biology","score_opus":0.0074286925048228,"score_gpt":0.21510356266226568,"score_spread":0.20767487015744288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901689010","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.29011992,0.0046246033,0.69465166,0.0029761412,0.0014814695,0.00082902244,0.0000073269866,0.0003268508,0.004983038],"genre_scores_gemma":[0.963136,0.001949901,0.03333135,0.0002438287,0.000036309204,0.000056489785,0.00009022211,0.000018068056,0.0011378072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986688,0.000057975292,0.00019135018,0.0006040488,0.000313344,0.00016450095],"domain_scores_gemma":[0.9991671,0.000051249917,0.00011561293,0.00034228523,0.00020623844,0.00011750582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019800971,0.00021193268,0.00023352461,0.00017234204,0.00015727678,0.0006051956,0.00022622081,0.00014113178,0.0000025572838],"category_scores_gemma":[0.0000056568942,0.00018764,0.000044014385,0.0003968725,0.000038393253,0.00023645269,0.000760786,0.0002943012,0.0000012962996],"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.000021812299,0.00037265042,0.0042958623,0.00057554845,0.00016823024,0.00010488861,0.0011131867,0.0034333398,0.00005724161,0.9419998,0.007136785,0.040720675],"study_design_scores_gemma":[0.0013001795,0.00069920515,0.026824098,0.0005329455,0.0000679417,0.00013164006,0.00007364287,0.04966562,0.0002901344,0.9015023,0.017789738,0.0011225279],"about_ca_topic_score_codex":0.000013188356,"about_ca_topic_score_gemma":0.000006183227,"teacher_disagreement_score":0.67301613,"about_ca_system_score_codex":0.000019048262,"about_ca_system_score_gemma":0.00014028886,"threshold_uncertainty_score":0.76517373},"labels":[],"label_agreement":null},{"id":"W2901842115","doi":"10.22215/etd/2017-11859","title":"Optimal Bichromatic Plane Spanning Trees For Special Point Sets","year":2017,"lang":"en","type":"dissertation","venue":"","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":"Spanning tree; Combinatorics; Point (geometry); Plane (geometry); Minimum spanning tree; Set (abstract data type); Mathematics; Line (geometry); Enhanced Data Rates for GSM Evolution; Tree (set theory); Algorithm; Computer science; Geometry; Artificial intelligence","score_opus":0.022785504200697262,"score_gpt":0.29913417467779396,"score_spread":0.2763486704770967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901842115","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.04417689,0.00024070186,0.86334884,0.00055736053,0.008944461,0.0010623372,0.00003768613,0.00026794968,0.08136376],"genre_scores_gemma":[0.09951435,0.000035102992,0.6942618,0.00028902566,0.008918034,0.00027246747,0.0076656346,0.00007357092,0.18897003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986122,0.00002256123,0.0003207659,0.00047084858,0.00033277608,0.00024081377],"domain_scores_gemma":[0.9988753,0.00014410172,0.00031599277,0.00042216116,0.00016277605,0.00007964261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024339322,0.00023856705,0.0002856021,0.00023787531,0.0003914878,0.0005200945,0.00074523635,0.00016442555,0.0001473327],"category_scores_gemma":[0.00011542409,0.00022688,0.00013983666,0.00010002189,0.000011783382,0.00044956084,0.00003945175,0.00011754188,0.00007091169],"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.0001865859,0.0002404925,0.000016947484,0.0005579171,0.00028379663,0.000050294526,0.005331706,0.018797478,0.0019804675,0.09855442,0.1543723,0.7196276],"study_design_scores_gemma":[0.0027660588,0.00094926974,0.012537364,0.00066224905,0.00018259547,0.00009416075,0.0006289573,0.83452296,0.021026244,0.027568871,0.0967449,0.0023163348],"about_ca_topic_score_codex":0.000015030567,"about_ca_topic_score_gemma":0.00018720863,"teacher_disagreement_score":0.8157255,"about_ca_system_score_codex":0.000041678304,"about_ca_system_score_gemma":0.00025137266,"threshold_uncertainty_score":0.9251898},"labels":[],"label_agreement":null},{"id":"W2902703949","doi":"10.1016/j.ipl.2018.11.009","title":"Thin trees in 8-edge-connected planar graphs","year":2018,"lang":"en","type":"article","venue":"Information Processing Letters","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Spanning tree; Mathematics; Trémaux tree; Disjoint sets; Graph; Planar straight-line graph; Discrete mathematics; Line graph; 1-planar graph; Pathwidth","score_opus":0.010390285266438311,"score_gpt":0.22778797335976597,"score_spread":0.21739768809332766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902703949","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.24907508,0.000021717435,0.7448801,0.004009753,0.00031143366,0.000098290875,0.0000011350628,0.00017757707,0.001424929],"genre_scores_gemma":[0.96873266,0.0000010975936,0.023324016,0.007811738,0.00007189595,0.000011085746,0.000029944762,0.0000026520165,0.000014899729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913913,0.000027792132,0.00030494656,0.00012399291,0.00023575197,0.00016841081],"domain_scores_gemma":[0.99953616,0.00003307635,0.00013265263,0.00013534668,0.00012484283,0.000037910708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024729196,0.00009207725,0.00007806825,0.00046447094,0.00016138068,0.00033673135,0.0003037161,0.000038384565,0.000008190103],"category_scores_gemma":[0.000054580825,0.00008969343,0.00002183223,0.0009815053,0.000042527077,0.0038969766,0.000030703122,0.000084402665,0.00010549422],"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.00006936718,0.00010587116,0.0031051214,0.00012869862,0.000026183841,0.000010502735,0.039826337,0.02761636,0.015888302,0.06506296,0.026387542,0.82177275],"study_design_scores_gemma":[0.001312852,0.000108253706,0.050418142,0.00012905565,0.0000050736694,0.00004174389,0.00017869528,0.9038743,0.010201751,0.009187473,0.024003506,0.00053916906],"about_ca_topic_score_codex":0.0000122536485,"about_ca_topic_score_gemma":0.000016303771,"teacher_disagreement_score":0.8762579,"about_ca_system_score_codex":0.000037413658,"about_ca_system_score_gemma":0.00006693807,"threshold_uncertainty_score":0.3657592},"labels":[],"label_agreement":null},{"id":"W2904248248","doi":"10.1137/16m1066506","title":"Towards an Optimal Method for Dynamic Planar Point Location","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"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":"Planar; Point (geometry); Mathematical optimization; Computer science; Algorithm; Mathematics; Geometry","score_opus":0.023727244238785725,"score_gpt":0.3418822705149188,"score_spread":0.31815502627613307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904248248","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.021241136,0.000054246448,0.97532773,0.0013708118,0.0014227709,0.0001441378,0.000001339813,0.00008537971,0.0003524731],"genre_scores_gemma":[0.438732,0.0000014641098,0.5597173,0.0006125878,0.0008936314,0.0000013045053,0.0000065773775,0.00000773767,0.000027408403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852043,0.00016823714,0.00036034622,0.00033238792,0.00032968237,0.0002888919],"domain_scores_gemma":[0.99862516,0.00018988804,0.00024151252,0.00022116383,0.0005648957,0.00015737655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016256114,0.00014513182,0.00015570628,0.0002562798,0.00061676,0.0003748626,0.0005169923,0.000055535056,0.000009740704],"category_scores_gemma":[0.00012174208,0.00013483207,0.00007962514,0.00043761186,0.000021342701,0.0005145221,0.000063101004,0.00019544734,0.000022558193],"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.00006457993,0.00010656124,0.0000074115446,0.00001265153,0.000031773874,0.00000797714,0.0010476498,0.18475065,0.0012942093,0.036442824,0.000741644,0.7754921],"study_design_scores_gemma":[0.00043483044,0.0010156233,0.00081028586,0.000042436666,0.000006454563,0.00029875874,0.00004237252,0.9846827,0.002084344,0.008169403,0.002245953,0.0001668456],"about_ca_topic_score_codex":0.0000023553746,"about_ca_topic_score_gemma":0.000002442471,"teacher_disagreement_score":0.79993206,"about_ca_system_score_codex":0.000118086326,"about_ca_system_score_gemma":0.00019943881,"threshold_uncertainty_score":0.5498292},"labels":[],"label_agreement":null},{"id":"W2904743400","doi":"10.1007/s00454-023-00567-0","title":"Stabbing Pairwise Intersecting Disks by Four Points","year":2023,"lang":"en","type":"article","venue":"Discrete & 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":"Mathematics; Combinatorics; Pairwise comparison; Simple (philosophy); Constructive proof; Set (abstract data type); Constructive; Plane (geometry); Discrete mathematics; Computer science; Geometry; Statistics","score_opus":0.02403260326701627,"score_gpt":0.27041770027146167,"score_spread":0.24638509700444539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904743400","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.26213324,0.000097932025,0.7339563,0.0015307971,0.0007468472,0.00017804009,0.000042956133,0.00061113056,0.0007027569],"genre_scores_gemma":[0.97129554,0.000009592849,0.026569346,0.00062406814,0.0002038139,0.00002999323,0.00058808085,0.000027068063,0.00065251504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972113,0.00014597843,0.00050350337,0.00072751305,0.00088776543,0.000523937],"domain_scores_gemma":[0.9983192,0.0006990842,0.00019647382,0.00033265463,0.00024328895,0.00020930721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007857076,0.00027832726,0.00024669644,0.00077207974,0.00044297293,0.00039848514,0.0007104193,0.00008535289,0.00006018774],"category_scores_gemma":[0.0002603401,0.00029197818,0.00016854427,0.003339913,0.000051456584,0.0009110759,0.00048809501,0.00025390496,0.00047069447],"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.000052564148,0.0002109601,0.0066020414,0.00013057831,0.00028704526,0.00013619925,0.0024238918,0.6458869,0.003544875,0.086192116,0.060930733,0.19360211],"study_design_scores_gemma":[0.00066923583,0.00010178629,0.023083203,0.00005017543,0.000011262387,0.000040442315,0.0002142997,0.94010365,0.00049063965,0.029833142,0.004878262,0.0005239047],"about_ca_topic_score_codex":0.000018674993,"about_ca_topic_score_gemma":0.0000028856487,"teacher_disagreement_score":0.7091623,"about_ca_system_score_codex":0.00010507684,"about_ca_system_score_gemma":0.00011561631,"threshold_uncertainty_score":0.9999532},"labels":[],"label_agreement":null},{"id":"W2908868776","doi":"10.1007/s00373-018-02004-z","title":"Improved Bounds for Guarding Plane Graphs with Edges","year":2019,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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; University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Combinatorics; Mathematics; Quadrilateral; Vertex (graph theory); Planar graph; Upper and lower bounds; Graph; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.008659670553227234,"score_gpt":0.20812081277172628,"score_spread":0.19946114221849906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908868776","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.64807737,0.00078164804,0.34834614,0.0002819623,0.001136353,0.0004368642,0.000005102719,0.0001343795,0.00080016284],"genre_scores_gemma":[0.99403393,0.00004046695,0.0054231063,0.00012485049,0.000014672987,0.000026087704,0.000011739452,0.000006881283,0.00031823502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925184,0.000013189804,0.000116091,0.00028947837,0.00014502312,0.000184353],"domain_scores_gemma":[0.9994634,0.00009164823,0.00006071648,0.00020058909,0.00011798425,0.00006568314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015941678,0.000114224626,0.00013191473,0.0001468121,0.00016765899,0.00018163519,0.00019495601,0.000044572258,0.0000014465742],"category_scores_gemma":[0.000007078726,0.0000962766,0.000043223357,0.0005028101,0.000019284202,0.00026077428,0.00005428213,0.00006347536,0.0000018340182],"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.000017744333,0.000042617805,0.0034656813,0.000035360536,0.000025874071,0.0000010004788,0.0001226519,0.00006866105,0.00053655077,0.9785753,0.00028568052,0.016822884],"study_design_scores_gemma":[0.003289981,0.0018536836,0.009859098,0.0000416764,0.0000321897,0.00004959239,0.00009323027,0.09164399,0.0037917832,0.8721466,0.016554857,0.00064331654],"about_ca_topic_score_codex":0.0000062784666,"about_ca_topic_score_gemma":0.0000020165023,"teacher_disagreement_score":0.34595656,"about_ca_system_score_codex":0.000010432903,"about_ca_system_score_gemma":0.000036948128,"threshold_uncertainty_score":0.39260456},"labels":[],"label_agreement":null},{"id":"W2909151540","doi":"10.3233/fi-2019-1757","title":"Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model","year":2019,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Convex hull; Center (category theory); Set (abstract data type); Point (geometry); Regular polygon; Mathematics; Hull; Computer science; Mathematical optimization; Geometry; Engineering","score_opus":0.012166258951016772,"score_gpt":0.24381585005942744,"score_spread":0.23164959110841066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909151540","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.7527221,0.000013832868,0.2453171,0.00014771965,0.00007332375,0.0002194499,0.000021662861,0.000013275613,0.0014715597],"genre_scores_gemma":[0.9780363,0.000005880757,0.02154649,0.00024139024,0.000003066117,0.000004226274,0.000012447598,0.0000029814028,0.00014723069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911904,0.000019666271,0.00037357962,0.00010133546,0.00026711027,0.00011926006],"domain_scores_gemma":[0.99930257,0.000051022118,0.00021178069,0.0003193311,0.00007952293,0.000035752877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012357248,0.00008657954,0.00013978798,0.00009854519,0.000044788954,0.00004168992,0.00030683415,0.00002639303,0.000009117083],"category_scores_gemma":[0.000014358691,0.00006508717,0.00004294711,0.00024161473,0.000038355305,0.0005816479,0.00028567377,0.00006872473,0.000006536953],"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.00002646628,0.0001059594,0.0019629088,0.00020923567,0.000052196574,1.9273496e-7,0.006703507,0.9124899,0.0074118944,0.06435194,0.00023035862,0.006455437],"study_design_scores_gemma":[0.0006006765,0.000048209902,0.0011843123,0.00004520869,0.00000542307,0.000005023482,0.00012360483,0.9946605,0.0007965721,0.0024388556,0.000024249277,0.000067367786],"about_ca_topic_score_codex":0.000007515391,"about_ca_topic_score_gemma":0.0000029648952,"teacher_disagreement_score":0.22531421,"about_ca_system_score_codex":0.00003202737,"about_ca_system_score_gemma":0.000084286374,"threshold_uncertainty_score":0.26541778},"labels":[],"label_agreement":null},{"id":"W2910950761","doi":"10.23638/dmtcs-20-1-1","title":"Monotone Simultaneous Paths Embeddings in $\\mathbb{R}^d$","year":2018,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Embedding; Vertex (graph theory); Combinatorics; Dimension (graph theory); Set (abstract data type); Discrete mathematics; Geometry; Computer science; Graph","score_opus":0.008511425199184918,"score_gpt":0.22645330193266897,"score_spread":0.21794187673348406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910950761","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.21267048,0.00014866008,0.76553637,0.0037895816,0.000168308,0.0001707606,0.0000031262393,0.00017881494,0.017333938],"genre_scores_gemma":[0.8901285,0.00003695843,0.10647459,0.00022821153,0.0000334643,0.00001800658,0.000025907224,0.000011462125,0.0030428914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972772,0.0012290474,0.000348667,0.0005224935,0.00032974855,0.0002928154],"domain_scores_gemma":[0.9963631,0.0011994833,0.00015923563,0.000917751,0.0012383219,0.00012211238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025939227,0.00015964889,0.00016252311,0.00023921416,0.0002657253,0.00027483774,0.0009509367,0.00008369278,0.000060320166],"category_scores_gemma":[0.0011927886,0.00017339524,0.00006397975,0.0010561846,0.000117330914,0.00039290093,0.0003853056,0.00016063669,0.00015121601],"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.000014438236,0.0006944294,0.0013591076,0.000027313237,0.000022644977,0.000027380793,0.018293792,0.0012561467,0.01830654,0.65426993,0.0009101487,0.30481815],"study_design_scores_gemma":[0.0006496597,0.000001822887,0.0032765213,0.00021571122,0.0000049413484,0.000029196648,0.000051865933,0.8566192,0.103041306,0.013293245,0.02245586,0.0003606801],"about_ca_topic_score_codex":0.0001962793,"about_ca_topic_score_gemma":0.0005610755,"teacher_disagreement_score":0.8553631,"about_ca_system_score_codex":0.000072278075,"about_ca_system_score_gemma":0.0001249475,"threshold_uncertainty_score":0.70708525},"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":"W2912332206","doi":"","title":"Proceedings of the twenty-ninth annual symposium on Computational geometry","year":2013,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Presentation (obstetrics); Deliberation; Computer science; Ninth; Process (computing); Library science; Operations research; Political science; Mathematics; Law; Programming language; Medicine","score_opus":0.007017857630912799,"score_gpt":0.212618065796689,"score_spread":0.20560020816577618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912332206","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.80960244,0.000016890985,0.15332589,0.008849716,0.0007210662,0.00050891883,0.0000071759423,0.00013017513,0.026837733],"genre_scores_gemma":[0.97742116,8.5260245e-7,0.019358588,0.0009505919,0.000074663265,0.00001567652,0.0000028555437,0.0000040053837,0.002171582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989698,0.0000120723125,0.00020609291,0.00023076317,0.0004453361,0.00013593335],"domain_scores_gemma":[0.9991767,0.00009305344,0.000106142914,0.00012156022,0.0004514521,0.00005110068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014305029,0.000092966395,0.000089078356,0.00013781057,0.00011157645,0.00010147517,0.0005229579,0.000034138888,0.000081327504],"category_scores_gemma":[0.00002856623,0.00006271519,0.00006222031,0.0007434621,0.00003860017,0.00052671897,0.00017721328,0.000082780425,0.00009797141],"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.0000048987895,0.00023078798,0.0025244576,0.000023877084,0.000029461416,2.008656e-7,0.00058518624,0.05975887,0.00415903,0.8684632,0.052839838,0.01138018],"study_design_scores_gemma":[0.0009212307,0.0004803256,0.28461194,0.0000618732,0.00001240135,0.000036554895,0.00022312172,0.5958838,0.03690751,0.07266949,0.0076882895,0.00050349225],"about_ca_topic_score_codex":0.000013047746,"about_ca_topic_score_gemma":3.815268e-7,"teacher_disagreement_score":0.7957937,"about_ca_system_score_codex":0.00002387691,"about_ca_system_score_gemma":0.000050036295,"threshold_uncertainty_score":0.2557451},"labels":[],"label_agreement":null},{"id":"W2912574978","doi":"10.1007/s00373-015-1553-2","title":"Isoperimetric Enclosures","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Isoperimetric inequality; Mathematics; Combinatorics; Perimeter; Polygon (computer graphics); Regular polygon; Plane (geometry); Constant (computer programming); Polygonal chain; Geometry","score_opus":0.027204253585567377,"score_gpt":0.234674053817538,"score_spread":0.20746980023197062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912574978","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.58181363,0.009402778,0.38851526,0.0010330272,0.002737899,0.00020492461,0.0000016710484,0.00035316873,0.015937636],"genre_scores_gemma":[0.99607,0.00005829831,0.0034374932,0.00015159574,0.000015640302,0.0000042409943,0.0000019520646,0.000002620199,0.00025815633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993969,0.000026520283,0.000092686896,0.00016967808,0.00020727319,0.00010689485],"domain_scores_gemma":[0.99953735,0.000033825105,0.000028919318,0.00014929933,0.00012402702,0.00012658333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020375174,0.00006709414,0.00007174095,0.0001913609,0.00007927211,0.000113491544,0.0001927,0.000030315858,0.0000011946482],"category_scores_gemma":[0.000041646083,0.00006130069,0.000022030912,0.0011409681,0.000015651774,0.00022883891,0.00009957951,0.00005040752,0.000009779462],"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.0000011333041,0.0000370764,0.0017173045,0.000002254906,0.000004207682,0.000003015174,0.00012921309,0.000050657556,0.000019995645,0.9811839,0.002571569,0.01427967],"study_design_scores_gemma":[0.0005290541,0.00022395006,0.007533451,0.0000027723747,0.000004348488,0.000024788045,0.000027764438,0.014217119,0.00068020035,0.9507447,0.025834098,0.00017776358],"about_ca_topic_score_codex":0.000009486894,"about_ca_topic_score_gemma":3.9233882e-7,"teacher_disagreement_score":0.41425636,"about_ca_system_score_codex":0.000011484181,"about_ca_system_score_gemma":0.000047167436,"threshold_uncertainty_score":0.24997696},"labels":[],"label_agreement":null},{"id":"W2913181003","doi":"10.1556/012.2022.01514","title":"Intersecting Hexagons in 3-Space","year":2022,"lang":"en","type":"preprint","venue":"Studia Scientiarum Mathematicarum Hungarica","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 British Columbia","funders":"","keywords":"Combinatorics; Intersection (aeronautics); Vertex (graph theory); Space (punctuation); Point (geometry); Mathematics; Geometry; Graph; Computer science; Geography; Cartography","score_opus":0.023369116181436535,"score_gpt":0.2836194899382624,"score_spread":0.26025037375682586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913181003","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.039950296,0.00095705455,0.8678371,0.0074747587,0.007235504,0.0016446866,0.000031237785,0.0005953288,0.07427404],"genre_scores_gemma":[0.89252704,0.000025530806,0.10530027,0.00021364726,0.00013668482,0.00033015021,0.000036319652,0.00003181125,0.0013985331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957866,0.00032264195,0.0007581129,0.0013443169,0.0011188813,0.00066941645],"domain_scores_gemma":[0.997543,0.0004593317,0.00044099957,0.001273897,0.0001346641,0.00014810712],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021397236,0.0004124435,0.0005812342,0.0010761663,0.00054788304,0.00065190316,0.0023292787,0.00013512236,0.00018697158],"category_scores_gemma":[0.00041084367,0.0004379716,0.00026180773,0.0021280788,0.00008632537,0.00031905,0.008135695,0.0011340517,0.000077574536],"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.000014845901,0.0016788943,0.0011634628,0.0007718074,0.000314124,0.00016075106,0.030528247,0.07323531,0.00081386225,0.86649346,0.014852121,0.009973106],"study_design_scores_gemma":[0.001287967,0.00026219434,0.0051740664,0.0006071531,0.00013249363,0.00008099678,0.0032709618,0.57327896,0.00088810816,0.3920149,0.020572202,0.0024300036],"about_ca_topic_score_codex":0.000035707635,"about_ca_topic_score_gemma":0.000044985816,"teacher_disagreement_score":0.85257673,"about_ca_system_score_codex":0.00038400013,"about_ca_system_score_gemma":0.0006126189,"threshold_uncertainty_score":0.99988633},"labels":[],"label_agreement":null},{"id":"W2913808055","doi":"10.1063/1.5089991","title":"Covering a square with six circles by deterministic global optimization","year":2019,"lang":"en","type":"article","venue":"AIP conference proceedings","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Square (algebra); RADIUS; Global optimization; Mathematics; Mathematical optimization; Computer science; Combinatorics; Applied mathematics; Geometry","score_opus":0.0098765742928116,"score_gpt":0.2226567561389646,"score_spread":0.212780181846153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913808055","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.14372538,0.000026321337,0.851684,0.0003596916,0.00011384481,0.00020522696,0.0000047183926,0.00013131286,0.0037495052],"genre_scores_gemma":[0.96491706,0.000006377094,0.034587834,0.00023211203,0.000030841697,0.000018899364,0.000014359755,0.000005857366,0.0001866565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893713,0.0000058734604,0.0001543257,0.00039895478,0.00029594504,0.00020774925],"domain_scores_gemma":[0.9993438,0.00002465166,0.00010693391,0.00010810037,0.00033729238,0.00007919759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008998338,0.00013794868,0.00012838171,0.000049153987,0.00009232391,0.000440924,0.000366541,0.000049661896,0.000038876406],"category_scores_gemma":[0.000027590975,0.0001315116,0.000022485203,0.00045371917,0.000023501963,0.0008767269,0.00009833363,0.0000670747,0.00005144688],"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.0002352877,0.00052820443,0.24632733,0.0007034607,0.00015963787,0.000020711279,0.004844686,0.08219384,0.034879442,0.49596658,0.0052940054,0.12884681],"study_design_scores_gemma":[0.00042219416,0.00032032828,0.0037599558,0.00007278683,0.000007873868,0.000039182603,0.00008382997,0.99209845,0.0005693382,0.0015787015,0.00078321714,0.00026412553],"about_ca_topic_score_codex":0.000009002676,"about_ca_topic_score_gemma":0.0000023060186,"teacher_disagreement_score":0.9099046,"about_ca_system_score_codex":0.00006199587,"about_ca_system_score_gemma":0.00015631075,"threshold_uncertainty_score":0.53628874},"labels":[],"label_agreement":null},{"id":"W2913852997","doi":"10.1007/s00454-002-2775-7","title":"Flipturning Polygons","year":2002,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Polygon covering; Combinatorics; Polygon (computer graphics); Simple polygon; Rectilinear polygon; Mathematics; Star-shaped polygon; Equiangular polygon; Regular polygon; Midpoint; Sequence (biology); Convex polygon; Simple (philosophy); Bounding overwatch; General position; Convex hull; Convex set; Geometry; Computer science; Convex optimization; Artificial intelligence","score_opus":0.019448622564453854,"score_gpt":0.23897590358612722,"score_spread":0.21952728102167338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913852997","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.03283402,0.0008293243,0.95400715,0.0020448081,0.000655031,0.00014477545,0.000012589477,0.00033527435,0.009137014],"genre_scores_gemma":[0.8968956,0.000012694436,0.100224026,0.001164445,0.00025554813,0.000015714142,0.00008094378,0.0000149410635,0.0013360744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788547,0.00008571915,0.00038494906,0.00055351737,0.0007105785,0.00037974227],"domain_scores_gemma":[0.99879855,0.0003147757,0.0001404483,0.000345675,0.0002071939,0.0001933324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024392587,0.00022704726,0.00019860613,0.0005554921,0.00037329717,0.0003159233,0.0006643518,0.00007599778,0.0004623538],"category_scores_gemma":[0.000105509884,0.00023301157,0.0001459813,0.0017923176,0.000053241612,0.0008400728,0.00023071653,0.00021121485,0.00072624447],"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.000006971552,0.00021013303,0.0014192952,0.000024587223,0.00010031387,0.00004004163,0.0008625202,0.5081085,0.00031998658,0.3586818,0.014418934,0.11580696],"study_design_scores_gemma":[0.00046415447,0.000078036726,0.014438068,0.00001641644,0.0000091376105,0.00008648357,0.000026124375,0.948824,0.00014519914,0.01996084,0.015560027,0.00039149754],"about_ca_topic_score_codex":0.000006370568,"about_ca_topic_score_gemma":9.562483e-7,"teacher_disagreement_score":0.8640616,"about_ca_system_score_codex":0.00006201358,"about_ca_system_score_gemma":0.000043274373,"threshold_uncertainty_score":0.9501936},"labels":[],"label_agreement":null},{"id":"W2914474205","doi":"10.1007/978-3-642-31155-0_1","title":"α-Visibility","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Visibility; Visibility graph; Vertex (graph theory); Computer science; Visibility polygon; Graph; Line segment; Point (geometry); Line (geometry); Plane (geometry); Combinatorics; Artificial intelligence; Mathematics; Geometry; Optics; Physics; Theoretical computer science; Simple polygon; Regular polygon","score_opus":0.021574890168294485,"score_gpt":0.2580028368399176,"score_spread":0.23642794667162312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914474205","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.00010310119,0.0011150081,0.9906897,0.0005328396,0.002318535,0.00026717564,0.0000030988363,0.00014819934,0.0048223636],"genre_scores_gemma":[0.3351216,0.000059103728,0.6605886,0.0017223773,0.0015356286,0.000009335327,0.000015964359,0.000029270299,0.0009181136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967809,0.000034085973,0.00044713248,0.001213072,0.0009600224,0.0005648114],"domain_scores_gemma":[0.9977313,0.00037175135,0.00020414955,0.0012176291,0.00026622057,0.00020893272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012128721,0.000389162,0.00035601362,0.0007194898,0.0002291329,0.00038044376,0.0021118033,0.00024260716,0.00006370719],"category_scores_gemma":[0.00008677181,0.0003688152,0.000121952435,0.0006780825,0.00032641177,0.0008872832,0.0010466278,0.00055025413,0.0001662242],"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.000001974901,0.000027155955,0.000045796598,0.000016317976,0.000004987192,0.000010949595,0.00023213,0.025031399,0.000092148606,0.058022562,0.000025123414,0.9164895],"study_design_scores_gemma":[0.00025341433,0.00012966062,0.0009613394,0.0001297576,0.000009075516,0.000086836866,4.092037e-8,0.49772072,0.0022212197,0.48627216,0.011329531,0.0008862553],"about_ca_topic_score_codex":0.0000072527264,"about_ca_topic_score_gemma":0.000020799973,"teacher_disagreement_score":0.9156032,"about_ca_system_score_codex":0.00028408962,"about_ca_system_score_gemma":0.0005152081,"threshold_uncertainty_score":0.9998764},"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":"W2916594022","doi":"10.1134/s1063778818060261","title":"Different Reflection Generated Polytopes with the Same Number of Vertices in 3D","year":2018,"lang":"en","type":"article","venue":"Physics of Atomic Nuclei","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":"Université de Montréal","funders":"","keywords":"Polytope; Combinatorics; Physics; Euclidean space; Reflection (computer programming); Euclidean geometry; Point (geometry); Space (punctuation); Series (stratigraphy); Euclidean distance; Geometry; Mathematics; Computer science","score_opus":0.01740078780711816,"score_gpt":0.2697924096889954,"score_spread":0.25239162188187725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916594022","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.9141823,0.00001362728,0.08490744,0.00028024058,0.000097963915,0.00006379341,0.0000010523142,0.000013674945,0.00043989095],"genre_scores_gemma":[0.9943329,0.000004113542,0.0054215486,0.000089593,0.00010780166,0.0000030195881,0.0000021955286,0.000004386054,0.000034433167],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943304,0.00004253287,0.00013663997,0.00013867367,0.00016175605,0.0000873376],"domain_scores_gemma":[0.9995172,0.00004681078,0.00010838597,0.0001871606,0.00012453552,0.000015876927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007906887,0.00006807383,0.00010692096,0.000031559583,0.00004676575,0.000022518523,0.0002213406,0.000016948434,0.000007718423],"category_scores_gemma":[0.000004662709,0.000045362696,0.000021719086,0.00042852722,0.00006712505,0.00020208654,0.000057754616,0.000045863402,0.000008506636],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003043002,0.00084855524,0.018244848,0.00007555802,0.00018004884,0.0000017401763,0.008325786,0.009101731,0.4681769,0.3433559,0.0009623556,0.15042228],"study_design_scores_gemma":[0.0007782343,0.00024618235,0.049297787,0.00005138387,0.00001917108,0.0000050259187,0.000056231864,0.38354766,0.5456204,0.01977997,0.00039989175,0.0001980865],"about_ca_topic_score_codex":0.00006768466,"about_ca_topic_score_gemma":0.000048244605,"teacher_disagreement_score":0.37444595,"about_ca_system_score_codex":0.000020313208,"about_ca_system_score_gemma":0.000037437247,"threshold_uncertainty_score":0.1849837},"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":"W2916818086","doi":"10.61091/jcmcc119-31","title":"On the Crossing Numbers of Cartesian Products of Small Graphs with Paths, Cycles and Stars","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stars; Cartesian product; Combinatorics; Cartesian coordinate system; Indifference graph; Mathematics; 1-planar graph; Discrete mathematics; Graph; Chordal graph; Computer science; Geometry","score_opus":0.014043758658799652,"score_gpt":0.2388397086636574,"score_spread":0.22479595000485775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916818086","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.9628227,0.00063611,0.032089528,0.00036122053,0.0037312745,0.00018901922,0.0000015354561,0.000019536463,0.00014912746],"genre_scores_gemma":[0.9860066,0.000019998512,0.013714496,0.000012452262,0.0002295292,8.181862e-7,4.362915e-7,0.000012945717,0.0000026936295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982758,0.00010475384,0.00070073927,0.00020471698,0.00054711144,0.00016688394],"domain_scores_gemma":[0.99740654,0.0011907555,0.00061096234,0.0002088646,0.00050610333,0.000076766584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014411183,0.0001833859,0.00041777093,0.00021731383,0.00021846981,0.0003943794,0.00033757335,0.00006108108,7.69636e-7],"category_scores_gemma":[0.00025663595,0.00012162941,0.00008018314,0.000613833,0.00016882835,0.00021350688,0.0001316005,0.00027193688,1.7573781e-7],"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.000037001562,0.00016374557,0.000058000733,0.0003253985,0.0000911528,0.000012763989,0.0027128214,0.0003316445,0.0012504945,0.9910613,0.00006234855,0.003893352],"study_design_scores_gemma":[0.0014221249,0.001546274,0.00036885857,0.0014122876,0.00008620519,0.0001658455,0.0003076637,0.041801915,0.008172321,0.9443286,0.00015130306,0.00023661555],"about_ca_topic_score_codex":0.00000832131,"about_ca_topic_score_gemma":5.0631616e-7,"teacher_disagreement_score":0.04673269,"about_ca_system_score_codex":0.000024291012,"about_ca_system_score_gemma":0.000266808,"threshold_uncertainty_score":0.49599037},"labels":[],"label_agreement":null},{"id":"W2919291874","doi":"10.1142/s0218195919500018","title":"Partial Enclosure Range Searching","year":2019,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":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":"Rectangle; Polygon (computer graphics); Mathematics; Parallelogram; Intersection (aeronautics); Combinatorics; Range (aeronautics); Set (abstract data type); Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.011409741148092003,"score_gpt":0.2891017941395135,"score_spread":0.27769205299142147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919291874","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.036951885,0.0004154674,0.9571869,0.002207678,0.0011314659,0.0003894588,0.00002014431,0.000060361195,0.0016366397],"genre_scores_gemma":[0.8872913,0.000037555204,0.11034869,0.0006766458,0.0011995522,0.000043839027,0.000059499285,0.000015415162,0.0003275146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968106,0.00010838332,0.00083457044,0.00035009708,0.0016569763,0.0002393369],"domain_scores_gemma":[0.9963299,0.00059293443,0.00062747236,0.00028151952,0.0019866796,0.0001814934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081394723,0.00019284358,0.0002636544,0.0009815131,0.00013269045,0.00035169447,0.0017369393,0.00007872761,0.0002030108],"category_scores_gemma":[0.00006379127,0.00019245855,0.00025273938,0.0010641778,0.00004779246,0.0011531754,0.00024320377,0.0003422991,0.00037224474],"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.000074555945,0.0004890912,0.005637873,0.000029083076,0.0004068453,0.000029281871,0.00028267896,0.5032544,0.000948755,0.30944732,0.0013869469,0.17801316],"study_design_scores_gemma":[0.004329263,0.00048778232,0.032553308,0.0001267928,0.000066433866,0.0015121539,0.00013179223,0.1876976,0.0019054116,0.23150007,0.5387188,0.0009705544],"about_ca_topic_score_codex":0.0000035403975,"about_ca_topic_score_gemma":5.212029e-7,"teacher_disagreement_score":0.8503394,"about_ca_system_score_codex":0.00015237869,"about_ca_system_score_gemma":0.0004175485,"threshold_uncertainty_score":0.7848232},"labels":[],"label_agreement":null},{"id":"W2920125243","doi":"","title":"The crossing numbers of Cartesian products of path with some graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cartesian product; Path (computing); Crossing number (knot theory); Combinatorics; Computer science; Geography","score_opus":0.008350712571765334,"score_gpt":0.22761142148137045,"score_spread":0.2192607089096051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920125243","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.9946048,0.0001667153,0.0030292778,0.0004036848,0.00114352,0.00012628765,8.896104e-7,0.000027576367,0.0004972439],"genre_scores_gemma":[0.9957375,0.0000037843517,0.004134885,0.00003071064,0.000016561049,0.000003573714,0.0000013306733,0.0000043204914,0.000067350345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918246,0.000046723337,0.00017879615,0.00018248628,0.00027233118,0.00013719429],"domain_scores_gemma":[0.99897975,0.00008020795,0.00015162103,0.00035909654,0.00039666952,0.000032671804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002950115,0.000073429685,0.00010121156,0.00004966529,0.0002702506,0.000082753075,0.0003507117,0.000022107019,9.1975147e-7],"category_scores_gemma":[0.000047502028,0.000051282634,0.000025583211,0.00066794467,0.00026914733,0.00028197872,0.000063808664,0.000047575395,0.000002744156],"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.000011341184,0.000048213908,0.00097290927,0.000012212756,0.000017197175,8.966697e-7,0.0008102909,0.00003871543,0.0025811477,0.99075985,0.00041535878,0.0043318784],"study_design_scores_gemma":[0.0009233118,0.0008200294,0.02394431,0.00006854648,0.000015569107,0.00001548368,0.00007405793,0.0053770193,0.16693155,0.7995094,0.0020928993,0.00022782535],"about_ca_topic_score_codex":0.000023620554,"about_ca_topic_score_gemma":0.000005763776,"teacher_disagreement_score":0.19125044,"about_ca_system_score_codex":0.000011798604,"about_ca_system_score_gemma":0.00018080483,"threshold_uncertainty_score":0.2091245},"labels":[],"label_agreement":null},{"id":"W2920900590","doi":"10.1016/j.disc.2019.02.010","title":"Corrigendum to “Enumeration of eulerian and unicursal planar maps” [Discrete Math. 282 (2004) 208–221]","year":2019,"lang":"en","type":"erratum","venue":"Discrete Mathematics","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":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Mathematics; Eulerian path; Planar; Combinatorics; Discrete mathematics; Pure mathematics; Computer science; Lagrangian; Computer graphics (images)","score_opus":0.01874557788561455,"score_gpt":0.25190424745218987,"score_spread":0.23315866956657533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920900590","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.0007062022,0.0014126765,0.9578654,0.0012760835,0.021968469,0.0013130481,0.000607426,0.00017511616,0.014675533],"genre_scores_gemma":[0.0102960635,0.00067132775,0.5426958,0.001315905,0.0032556066,0.00017465351,0.006970373,0.0003040369,0.43431622],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997103,0.000089826586,0.00083551905,0.00072780583,0.0008253217,0.0004185457],"domain_scores_gemma":[0.99774706,0.000094405514,0.00061950483,0.0010368625,0.00028357733,0.00021860638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004826211,0.00050236686,0.00074800785,0.00044007433,0.00015514981,0.0002502356,0.00090817886,0.0003828127,0.0000310263],"category_scores_gemma":[0.00013845859,0.00046982005,0.00015337515,0.0006104111,0.00006014771,0.0003988396,0.0003394975,0.00041143558,0.00015514749],"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.00001601144,0.000086491666,0.000012594811,0.0010689588,0.0001368863,0.000012907383,0.0034271376,0.00067347655,0.00035758366,0.16966899,0.8219749,0.0025641047],"study_design_scores_gemma":[0.0009780895,0.0008493718,0.0003685566,0.0015253794,0.0002361453,0.00011963554,0.0004691021,0.4159949,0.0007487537,0.03497036,0.54179215,0.0019475286],"about_ca_topic_score_codex":0.000022819,"about_ca_topic_score_gemma":0.000027254026,"teacher_disagreement_score":0.4196407,"about_ca_system_score_codex":0.00007975394,"about_ca_system_score_gemma":0.00038460118,"threshold_uncertainty_score":0.99977535},"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":"W2922321031","doi":"10.1007/s00453-007-9151-1","title":"On the Parameterized Complexity of Layered Graph Drawing","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":64,"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; McGill University","funders":"","keywords":"Combinatorics; Parameterized complexity; Pathwidth; Mathematics; Graph drawing; Theory of computation; Bounded function; Crossing number (knot theory); Graph; Time complexity; Span (engineering); Discrete mathematics; Line graph; Algorithm","score_opus":0.04315325250689598,"score_gpt":0.27116115571427796,"score_spread":0.22800790320738198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922321031","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.16618451,0.00001733053,0.83157915,0.0008639134,0.00021107685,0.000098314136,0.000002046857,0.000039667957,0.0010039924],"genre_scores_gemma":[0.91025835,0.0000010147243,0.0891921,0.0004537008,0.000050372146,0.0000028281117,0.0000037836285,0.000002974066,0.000034886834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917084,0.0000562878,0.00019829429,0.00017405652,0.00024940076,0.00015114473],"domain_scores_gemma":[0.9989838,0.0005233147,0.000083895895,0.00029260066,0.000076811804,0.000039581173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005868179,0.00007482795,0.000099118486,0.000097635544,0.00012320513,0.000038968494,0.00039260203,0.000027447539,0.000018135404],"category_scores_gemma":[0.00007340616,0.0000544924,0.00006494367,0.0005055318,0.00007658071,0.000096636555,0.000074718824,0.00008143512,0.000016512884],"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.000023176928,0.00010616557,0.000019500341,0.0000051223547,0.00003228444,0.000005994876,0.00034519885,0.00090234773,0.011869091,0.8940792,0.000640408,0.09197149],"study_design_scores_gemma":[0.0008445407,0.00033097898,0.014038807,0.000031815194,0.000010206701,0.000023371613,0.000052069525,0.22724807,0.20974444,0.5452475,0.0020971706,0.0003310184],"about_ca_topic_score_codex":0.000013499494,"about_ca_topic_score_gemma":0.0000026695775,"teacher_disagreement_score":0.7440738,"about_ca_system_score_codex":0.000012272876,"about_ca_system_score_gemma":0.000023918414,"threshold_uncertainty_score":0.22221357},"labels":[],"label_agreement":null},{"id":"W2929877533","doi":"","title":"Sequences of spanning trees for L-infinity Delaunay triangulations","year":2018,"lang":"en","type":"article","venue":"RECERCAT (Consorci de Serveis Universitaris de Catalunya)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Delaunay triangulation; Combinatorics; Spanning tree; Mathematics; Computer science; Constrained Delaunay triangulation","score_opus":0.027737486128027747,"score_gpt":0.2745958279852234,"score_spread":0.24685834185719568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2929877533","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.37049958,0.00017885756,0.6257929,0.00084657257,0.00019463061,0.0002074202,0.000041620755,0.000090024645,0.0021484082],"genre_scores_gemma":[0.8709409,0.000021720702,0.12789309,0.00012814693,0.00014528309,0.000006356918,0.000069245194,0.000008871521,0.0007863278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987928,0.00011213948,0.00025292838,0.0003458059,0.0001849596,0.0003113509],"domain_scores_gemma":[0.99847114,0.00038257192,0.0001758845,0.00036489297,0.00046338944,0.00014211611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056049455,0.0001466124,0.00020308823,0.000399447,0.00035531816,0.000068080546,0.0006206609,0.00012041362,0.000056721434],"category_scores_gemma":[0.00016701652,0.00016678349,0.00014288287,0.00094034564,0.00013336503,0.00067419466,0.00013057176,0.00009962914,0.000016890202],"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.00052075245,0.0006290359,0.030224482,0.0002857828,0.0006553971,0.00004265023,0.019910429,0.07669312,0.0920605,0.6140758,0.017279739,0.14762233],"study_design_scores_gemma":[0.0036244777,0.0013528997,0.06302712,0.00017595854,0.00028559315,0.0001358397,0.0018006376,0.59623754,0.2271832,0.033335213,0.07159801,0.0012435018],"about_ca_topic_score_codex":0.000258842,"about_ca_topic_score_gemma":0.00022054746,"teacher_disagreement_score":0.5807406,"about_ca_system_score_codex":0.0002326526,"about_ca_system_score_gemma":0.00050088315,"threshold_uncertainty_score":0.6801233},"labels":[],"label_agreement":null},{"id":"W2932744841","doi":"10.4230/lipics.socg.2019.52","title":"Dynamic Planar Point Location in External Memory","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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":"Point location; Auxiliary memory; Binary logarithm; Data structure; Combinatorics; Log-log plot; Upper and lower bounds; Subdivision; Block size; Computer science; Point (geometry); Block (permutation group theory); Planar; Mathematics; Algorithm; Discrete mathematics; Geometry","score_opus":0.022238151429513627,"score_gpt":0.16712577185302235,"score_spread":0.14488762042350872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932744841","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.49146986,0.000018937151,0.5073878,0.00005186605,0.0001482843,0.0000646167,3.1643344e-7,0.000028870645,0.00082941935],"genre_scores_gemma":[0.9947672,0.000007543864,0.0031813495,0.00010338296,0.000012228115,2.0431015e-7,0.000004654434,0.000003010545,0.001920446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935335,0.000046562036,0.00008905959,0.0003240938,0.00005725469,0.00012965621],"domain_scores_gemma":[0.99955255,0.00004417059,0.000049386046,0.0002535007,0.00005505149,0.00004535592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014525437,0.00007250661,0.00007399731,0.00021536229,0.00003703791,0.000030502273,0.0003403549,0.000036746587,0.00003077798],"category_scores_gemma":[0.000008110502,0.00008598882,0.00002891952,0.0007488031,0.000012230074,0.0005676384,0.000067298875,0.00007876178,0.00029453548],"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.000017641627,0.000056360215,0.003960004,0.00001162326,0.0000057095726,0.000054119013,0.00014465742,0.7281615,0.0011821064,0.26289108,0.00004043883,0.003474735],"study_design_scores_gemma":[0.00044067635,0.000051006045,0.024802698,0.000017629694,0.0000022970619,0.0000069168855,0.000039205308,0.95274353,0.00021892259,0.02147542,0.00008489566,0.00011679191],"about_ca_topic_score_codex":0.000035716166,"about_ca_topic_score_gemma":0.000048674607,"teacher_disagreement_score":0.5042065,"about_ca_system_score_codex":0.00011057547,"about_ca_system_score_gemma":0.00006243342,"threshold_uncertainty_score":0.3785756},"labels":[],"label_agreement":null},{"id":"W2941145607","doi":"10.48550/arxiv.1904.12042","title":"Truly Optimal Euclidean Spanners","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Spanner; Combinatorics; Euclidean geometry; Omega; Greedy algorithm; Euclidean space; Upper and lower bounds; Lightness; Mathematics; Euclidean distance; Physics; Computer science; Geometry; Algorithm; Mathematical analysis; Artificial intelligence","score_opus":0.06446235749940528,"score_gpt":0.18396476686576052,"score_spread":0.11950240936635524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941145607","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.2374983,0.0000459478,0.7568129,0.00015606025,0.0012111494,0.0001936758,0.000008596592,0.00017565237,0.0038977596],"genre_scores_gemma":[0.9849222,0.000051052833,0.008385387,0.00016872128,0.00015717541,5.439919e-7,0.000050800492,0.000012768003,0.006251367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827963,0.00010742947,0.00017880497,0.0010251051,0.00012223034,0.0002868255],"domain_scores_gemma":[0.9984839,0.000097741795,0.00019467864,0.0009080083,0.0001737958,0.00014186997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022805035,0.0002611186,0.0002535059,0.00033235655,0.0001191733,0.0001739036,0.0013977276,0.00021592027,0.000041917505],"category_scores_gemma":[0.000025938596,0.00031649467,0.0002074028,0.00059899245,0.00004381409,0.00042073303,0.001452614,0.0004105367,0.0004129379],"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.000010884471,0.00003519698,0.00026411226,0.000024544579,0.00004101363,0.00006666909,0.00009089603,0.8572801,0.000021558244,0.14015839,0.0009262943,0.0010803528],"study_design_scores_gemma":[0.00035702632,0.000054566728,0.0011667359,0.000033665794,0.0000305877,0.0000063155353,0.000026414044,0.9787824,0.00016814693,0.01516329,0.0037969353,0.00041389934],"about_ca_topic_score_codex":0.000036308542,"about_ca_topic_score_gemma":0.0000065535996,"teacher_disagreement_score":0.74842745,"about_ca_system_score_codex":0.00015188608,"about_ca_system_score_gemma":0.00031176413,"threshold_uncertainty_score":0.9999287},"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":"W2943430289","doi":"","title":"Weighted Minimum Backward Frechet Distance.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.054461784248001716,"score_gpt":0.26468968030747553,"score_spread":0.2102278960594738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943430289","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.018820735,0.00017593002,0.93244606,0.0078068376,0.001603395,0.0002778263,0.000096487944,0.00019823197,0.038574494],"genre_scores_gemma":[0.9475096,0.0000048164097,0.04787244,0.0027131655,0.00023646063,0.00002340052,0.00029315386,0.000015969239,0.0013309818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975825,0.00011972413,0.00036938794,0.00065262546,0.0007600853,0.00051569915],"domain_scores_gemma":[0.9971826,0.00022145624,0.00012122797,0.0004210133,0.00087617757,0.0011775226],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043732402,0.00027423122,0.00024573866,0.00096313044,0.00023303003,0.00040749635,0.0008567117,0.00013623257,0.00018742317],"category_scores_gemma":[0.00016574403,0.00029471674,0.00008323672,0.0017084328,0.000074547264,0.00050979515,0.00008239299,0.00025552584,0.00094223523],"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.000016813998,0.00007285745,0.00042124436,0.000009322402,0.000038591308,0.00006393095,0.00029174358,0.030637234,0.00001363782,0.8893742,0.03977151,0.0392889],"study_design_scores_gemma":[0.0010282111,0.00025686444,0.0036723823,0.000043244316,0.00000865927,0.000052994503,0.00011649413,0.72234124,0.00011927214,0.19442363,0.07725434,0.0006826916],"about_ca_topic_score_codex":0.0010482811,"about_ca_topic_score_gemma":0.0027522333,"teacher_disagreement_score":0.9286889,"about_ca_system_score_codex":0.0004631177,"about_ca_system_score_gemma":0.0031347086,"threshold_uncertainty_score":0.99995047},"labels":[],"label_agreement":null},{"id":"W2943463427","doi":"10.1007/s00224-005-1139-0","title":"Bounded-Degree Independent Sets in Planar Graphs","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Independent set; Mathematics; Bounded function; Maximal independent set; Degree (music); Planar graph; Discrete mathematics; Graph; Set (abstract data type); Planar; Planar straight-line graph; 1-planar graph; Chordal graph; Computer science; Physics","score_opus":0.02799329073985854,"score_gpt":0.2603683244860735,"score_spread":0.23237503374621496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943463427","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.511784,0.00044005679,0.4837984,0.00011452349,0.00062893995,0.0001798031,0.0000015050302,0.000092337796,0.0029603934],"genre_scores_gemma":[0.9904761,0.0000029497853,0.009171428,0.000083053805,0.00012420845,0.0000029114885,0.0000046677883,0.0000069356483,0.00012776261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982619,0.0003322379,0.0004958508,0.0002921079,0.0003831514,0.00023469776],"domain_scores_gemma":[0.9989817,0.00032248723,0.00021663678,0.00033247494,0.00008757081,0.00005910834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018864361,0.0001332377,0.00024111189,0.00035763075,0.00008864523,0.000088094326,0.0005753634,0.000063367595,0.0000036114734],"category_scores_gemma":[0.00003413243,0.00013247899,0.0000591767,0.0005118358,0.00003650222,0.00023959253,0.00009729581,0.00012891597,0.000028658533],"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.0000111956015,0.00008117837,0.00049771345,0.00004359684,0.000019986102,0.000006514384,0.0021923964,0.086850315,0.0004122128,0.8611852,0.00016547382,0.04853424],"study_design_scores_gemma":[0.0014799086,0.00018453882,0.032043807,0.00036586373,0.000010559468,0.00018286261,0.000337694,0.8479359,0.001652721,0.11314612,0.002109176,0.0005508327],"about_ca_topic_score_codex":0.000029328683,"about_ca_topic_score_gemma":0.000015075666,"teacher_disagreement_score":0.7610856,"about_ca_system_score_codex":0.00006608241,"about_ca_system_score_gemma":0.00007522335,"threshold_uncertainty_score":0.5402336},"labels":[],"label_agreement":null},{"id":"W2945154147","doi":"10.1002/nla.559","title":"Distance‐two interpolation for parallel algebraic multigrid","year":2007,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":103,"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":"Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Multigrid method; Scalability; Interpolation (computer graphics); Parallel computing; Convergence (economics); Computer science; Mathematics; Algorithm; Computational science; Partial differential equation","score_opus":0.012678977756962645,"score_gpt":0.28310248324648124,"score_spread":0.2704235054895186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945154147","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.0010214596,0.00007874627,0.9964535,0.0008213416,0.0000869726,0.000890103,0.000008910748,0.0001979663,0.0004409669],"genre_scores_gemma":[0.39807963,0.0000024267486,0.6004215,0.00044291024,0.00033323522,0.000392397,0.00012645946,0.000013158932,0.00018829995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863166,0.000020119845,0.00032188857,0.00047243564,0.000259705,0.0002942121],"domain_scores_gemma":[0.99876475,0.00027924665,0.00013579047,0.00041433214,0.00023765877,0.00016821414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028635768,0.0001595212,0.00014608547,0.000121879835,0.00026502428,0.00007593315,0.00040910018,0.00004985603,0.000011449465],"category_scores_gemma":[0.000036320343,0.00014081474,0.00007079913,0.0008615214,0.000046549965,0.00023321294,0.000058188285,0.00011110409,0.000060625305],"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.00011831963,0.0003076294,0.0006893945,0.00002046286,0.0000439732,0.0000012731444,0.00018248013,0.011445663,0.0011630383,0.85338604,0.00087126635,0.13177046],"study_design_scores_gemma":[0.0014699927,0.0002835989,0.0056925905,0.000013417635,0.000023806988,0.000022921344,0.000028196631,0.80687386,0.0016740926,0.020682987,0.16277121,0.00046334197],"about_ca_topic_score_codex":0.000008648601,"about_ca_topic_score_gemma":0.000017554716,"teacher_disagreement_score":0.83270305,"about_ca_system_score_codex":0.000039239792,"about_ca_system_score_gemma":0.00007194395,"threshold_uncertainty_score":0.5742258},"labels":[],"label_agreement":null},{"id":"W2946472266","doi":"10.1016/j.tcs.2019.05.016","title":"Polygon simplification by minimizing convex corners","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"Carleton University; University of Saskatchewan; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Simple polygon; Mathematics; Combinatorics; Convex polygon; Rectilinear polygon; Polygon covering; Regular polygon; Equiangular polygon; Star-shaped polygon; Convex set; Geometry; Convex optimization; Computer science","score_opus":0.0056026312033588856,"score_gpt":0.228981535080546,"score_spread":0.22337890387718712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946472266","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.111366704,0.000038589384,0.8825444,0.001341347,0.0008878209,0.00018830606,0.0000016076382,0.00016248954,0.0034687193],"genre_scores_gemma":[0.925949,0.0000031209338,0.07270229,0.0011396216,0.000083697836,0.0000049363994,0.0000068229965,0.0000058565915,0.00010468142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780846,0.000078270736,0.00026283838,0.0007449452,0.000684158,0.00042134823],"domain_scores_gemma":[0.9986238,0.00023919411,0.000085692394,0.0006351667,0.00020198025,0.00021416944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095756404,0.00015516925,0.00016278037,0.00019091115,0.00026484247,0.0004564179,0.0015276048,0.000049268237,0.000067013156],"category_scores_gemma":[0.000046993675,0.00014143957,0.000049973718,0.0013275346,0.0006054597,0.0008690519,0.0004379539,0.00013393439,0.00038438672],"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.000005047337,0.000037942977,0.000058850084,0.0000046817618,0.0000026414634,8.86459e-7,0.00020186434,0.0009964874,0.019207546,0.94893926,0.0007382395,0.02980653],"study_design_scores_gemma":[0.00026504614,0.00016605588,0.0005932836,0.0000123114605,0.000002591643,0.000019512237,0.000008414015,0.9413645,0.02500797,0.030399164,0.0019094239,0.00025172887],"about_ca_topic_score_codex":0.0000016450597,"about_ca_topic_score_gemma":7.1783475e-8,"teacher_disagreement_score":0.940368,"about_ca_system_score_codex":0.00006695776,"about_ca_system_score_gemma":0.00012934273,"threshold_uncertainty_score":0.5767738},"labels":[],"label_agreement":null},{"id":"W2947767361","doi":"","title":"On Combinatorial Depth Measures.","year":2014,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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; University of Manitoba","funders":"","keywords":"Multiset; Characterization (materials science); Set (abstract data type); Combinatorics; Plane (geometry); Mathematics; Point (geometry); Combinatorial method; Function (biology); Discrete mathematics; Algorithm; Computer science; Physics; Geometry","score_opus":0.015652504579903487,"score_gpt":0.23443793975300267,"score_spread":0.21878543517309917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947767361","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.0054884045,0.00000458636,0.92389864,0.0004750652,0.0012282857,0.000036207377,5.948257e-8,0.00010227514,0.0687665],"genre_scores_gemma":[0.98725384,4.500538e-7,0.011290384,0.0008439818,0.00017400182,0.0000028044813,0.0000015454165,0.0000019126796,0.0004310846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941796,0.000044259046,0.000072015784,0.00015377368,0.00022825625,0.0000837387],"domain_scores_gemma":[0.9995984,0.000105111154,0.00001795583,0.0001788927,0.000054375847,0.000045283236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022820433,0.00004848782,0.000047638565,0.000056023706,0.000066187924,0.00007066699,0.00022095791,0.000021290258,0.000014352406],"category_scores_gemma":[0.00007995835,0.00004114428,0.000022969427,0.00017821121,0.0000058628234,0.000118491225,0.000037006488,0.000039640116,0.0001883649],"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.0000017468502,0.000022690905,0.000013503234,4.7681618e-7,0.0000016310981,2.0415696e-7,0.0000139734375,0.0015581875,0.00010620344,0.9269669,0.0033851736,0.06792928],"study_design_scores_gemma":[0.0008991708,0.00032678925,0.0029822139,0.0000048749857,0.0000021749831,0.0000049118075,0.0000013047727,0.32282996,0.010943618,0.56335634,0.098431796,0.00021681744],"about_ca_topic_score_codex":0.0000033162341,"about_ca_topic_score_gemma":0.0000031687848,"teacher_disagreement_score":0.98176545,"about_ca_system_score_codex":0.000011645063,"about_ca_system_score_gemma":0.000020268859,"threshold_uncertainty_score":0.24211125},"labels":[],"label_agreement":null},{"id":"W2947899984","doi":"10.4230/lipics.gd.2024.9","title":"On problems related to crossing families","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Research, Development and Innovation Office; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal","keywords":"Combinatorics; Plane (geometry); Crossing number (knot theory); Point (geometry); Mathematics; Upper and lower bounds; Set (abstract data type); Computer science; Geometry; Mathematical analysis; Intersection (aeronautics); Geography; Cartography","score_opus":0.053503781814807166,"score_gpt":0.19453922674829655,"score_spread":0.14103544493348938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947899984","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.44765168,0.000019056175,0.54727167,0.0001275254,0.0008342783,0.00026791156,0.0000043621776,0.00015150034,0.0036719788],"genre_scores_gemma":[0.99102736,0.000015709953,0.0021401145,0.000246537,0.000031092477,8.7277897e-7,0.00002354054,0.00001074036,0.006504046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984658,0.00008200773,0.00017009261,0.00093617226,0.00011416778,0.00023178628],"domain_scores_gemma":[0.99872285,0.000115719005,0.00013385473,0.0007555422,0.00015717189,0.00011485199],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020072577,0.00021892255,0.00020236305,0.00042802733,0.00021945541,0.00033338508,0.00091138144,0.00018587499,0.000016471715],"category_scores_gemma":[0.000038687616,0.00025353962,0.00011746053,0.0008648109,0.00003911357,0.00025481745,0.0010236169,0.0003574512,0.00053493195],"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.000008038592,0.00003392634,0.00015693587,0.000024881703,0.00002138418,0.000020055866,0.00033340784,0.8136288,0.000058594684,0.18419367,0.00033362606,0.0011866887],"study_design_scores_gemma":[0.00031411203,0.000111933194,0.0017531806,0.00014705105,0.000014364923,0.0000027870244,0.000019815256,0.8830181,0.00021128269,0.11208236,0.0019200887,0.00040494555],"about_ca_topic_score_codex":0.000033520686,"about_ca_topic_score_gemma":0.000009072154,"teacher_disagreement_score":0.54513156,"about_ca_system_score_codex":0.00016578885,"about_ca_system_score_gemma":0.00024973924,"threshold_uncertainty_score":0.99999166},"labels":[],"label_agreement":null},{"id":"W2949182723","doi":"10.48550/arxiv.1206.5159","title":"Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Intersection (aeronautics); Path (computing); Graph; Plane (geometry); Class (philosophy); Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.06957364345648984,"score_gpt":0.18552273465115454,"score_spread":0.1159490911946647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949182723","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.55790263,0.00021683541,0.43876672,0.0000853728,0.0012260745,0.0002262428,0.000015259517,0.00017837327,0.0013824708],"genre_scores_gemma":[0.9969667,0.00024014137,0.0018833728,0.00013306065,0.00015738753,0.0000014337276,0.000061467166,0.00001175836,0.0005446392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984387,0.00014262479,0.00017091424,0.0008557072,0.00012001523,0.00027204538],"domain_scores_gemma":[0.9988601,0.00010534592,0.00019442455,0.0005515492,0.00011935837,0.00016917427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002476277,0.00028439102,0.00022805834,0.00044159617,0.00021844647,0.00017617496,0.0005331103,0.0002193382,0.000015293703],"category_scores_gemma":[0.000021010157,0.00031830743,0.00012916369,0.0005052532,0.00006817106,0.00046298947,0.0008121679,0.0004031659,0.000038469854],"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.00006821361,0.00025631383,0.0016683872,0.00010709239,0.00015167732,0.00007248809,0.0007310149,0.065126054,0.00017175464,0.92012346,0.00077791803,0.010745629],"study_design_scores_gemma":[0.0016327508,0.00048011134,0.025048379,0.00040662367,0.00021600991,0.00005929421,0.00023940105,0.56399065,0.0008580119,0.39872375,0.006609625,0.0017353978],"about_ca_topic_score_codex":0.00009942469,"about_ca_topic_score_gemma":0.000068699526,"teacher_disagreement_score":0.52139974,"about_ca_system_score_codex":0.00016409837,"about_ca_system_score_gemma":0.00009048922,"threshold_uncertainty_score":0.9999269},"labels":[],"label_agreement":null},{"id":"W2949328509","doi":"10.48550/arxiv.0712.0554","title":"Spanners of Complete $k$-Partite Geometric Graphs","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.07804604793576074,"score_gpt":0.29105767630015394,"score_spread":0.2130116283643932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949328509","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.5859746,0.00076565286,0.41057402,0.00024168867,0.0013227841,0.00019308472,0.0000142999,0.00010097237,0.0008129234],"genre_scores_gemma":[0.9791867,0.00009987913,0.019830339,0.00026682822,0.00019213915,0.000014548595,0.00009570106,0.000014751288,0.00029909535],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99771243,0.00008120187,0.00060010655,0.00068924215,0.00056401506,0.000352999],"domain_scores_gemma":[0.99796635,0.00021899623,0.00043314908,0.00086541375,0.00037294367,0.00014313229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067414995,0.00027631453,0.0003922587,0.0013203054,0.00010117434,0.000075982214,0.0011255065,0.00020409105,0.00003248443],"category_scores_gemma":[0.0001257894,0.0002897311,0.0003092609,0.002208165,0.00007814888,0.0002119453,0.0010613486,0.00042127795,0.00012124531],"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.000086343774,0.0010334605,0.53657687,0.0010178793,0.0010044305,0.00014275766,0.0016572495,0.25636545,0.010824,0.09374527,0.012277672,0.08526859],"study_design_scores_gemma":[0.0006871744,0.00020134513,0.9212453,0.00017152716,0.00007826297,0.000028021841,0.000021896663,0.037462648,0.012537834,0.014385492,0.01219991,0.0009806074],"about_ca_topic_score_codex":0.0000719566,"about_ca_topic_score_gemma":0.000010711256,"teacher_disagreement_score":0.39321214,"about_ca_system_score_codex":0.000057893616,"about_ca_system_score_gemma":0.0001717223,"threshold_uncertainty_score":0.9999555},"labels":[],"label_agreement":null},{"id":"W2949342774","doi":"10.1017/s096354830700884x","title":"On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space","year":2007,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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 Calgary","funders":"","keywords":"Combinatorics; Tetrahedron; Mathematics; Hyperplane; Unit (ring theory); Zero (linguistics); Space (punctuation); Volume (thermodynamics); Physics; Geometry; Computer science","score_opus":0.02058352999818149,"score_gpt":0.25732123944233193,"score_spread":0.23673770944415043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949342774","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.72115225,0.000037864713,0.27709714,0.00034938566,0.0001374184,0.00023028224,4.0282234e-7,0.00003606753,0.00095917867],"genre_scores_gemma":[0.99017805,7.840075e-7,0.00972625,0.000047498474,0.00001939653,0.0000024574383,0.00000139702,0.000006362901,0.000017817147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985492,0.00010620029,0.00034496386,0.00038444498,0.0003553754,0.00025978606],"domain_scores_gemma":[0.99739754,0.0017512602,0.0001613346,0.00040960693,0.00021467116,0.00006558417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018822533,0.00015305127,0.00019103778,0.00009744264,0.00017412913,0.000070407084,0.00041514446,0.000052600783,0.0000024776125],"category_scores_gemma":[0.00033012888,0.00011257812,0.000030987594,0.0012618279,0.00012669241,0.00014214072,0.0002422836,0.00022896087,0.000002337312],"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.000017721715,0.00023119473,0.19428822,0.000041630647,0.0000076086444,0.000004496765,0.00046849588,0.0014502141,0.00002124287,0.7953331,0.000012766257,0.008123315],"study_design_scores_gemma":[0.00055771886,0.00019913423,0.36902478,0.00008048656,0.0000045093298,0.00001843859,0.000043233566,0.16196506,0.0005818185,0.46726906,0.000053403928,0.00020234333],"about_ca_topic_score_codex":0.000033155233,"about_ca_topic_score_gemma":0.000062324645,"teacher_disagreement_score":0.32806402,"about_ca_system_score_codex":0.00006733518,"about_ca_system_score_gemma":0.000083407605,"threshold_uncertainty_score":0.45908025},"labels":[],"label_agreement":null},{"id":"W2949485815","doi":"10.48550/arxiv.0712.0192","title":"The Non-Backtracking Spectrum of the Universal Cover of a Graph","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"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 British Columbia","funders":"","keywords":"Backtracking; Cover (algebra); Graph; Computer science; Spectrum (functional analysis); Mathematics; Combinatorics; Algorithm; Physics; Engineering; Quantum mechanics","score_opus":0.023345994693331623,"score_gpt":0.2501214896734747,"score_spread":0.22677549498014307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949485815","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.743631,0.0001929052,0.2524981,0.000727016,0.0013441506,0.00019382882,0.0000047391045,0.000017817238,0.0013904384],"genre_scores_gemma":[0.9981584,0.000055384244,0.0011721505,0.00009320934,0.00013239452,0.0000022884533,0.0000038325484,0.000006242493,0.0003760747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.998782,0.000071912415,0.00031563453,0.00028423395,0.00037144602,0.000174768],"domain_scores_gemma":[0.9984203,0.0002615445,0.00039799474,0.0007266558,0.00016158188,0.00003192039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053003983,0.00013656127,0.00016622487,0.00011105374,0.00015590568,0.00003997807,0.0012445712,0.00010142618,0.000007683438],"category_scores_gemma":[0.00004978567,0.000091123045,0.00019551837,0.0005602367,0.00012286211,0.00009826779,0.0008906856,0.0003159157,0.000009468457],"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.00012862193,0.0004935114,0.36929345,0.00040390814,0.00069708476,0.000026343696,0.0054611894,0.41026825,0.012411611,0.16898666,0.0038321712,0.027997186],"study_design_scores_gemma":[0.00045863702,0.00008731712,0.8674506,0.00022447653,0.000051703806,0.000009047105,0.000075992124,0.03940427,0.06730671,0.02056555,0.0040098014,0.0003558966],"about_ca_topic_score_codex":0.00006877194,"about_ca_topic_score_gemma":0.00003199178,"teacher_disagreement_score":0.49815714,"about_ca_system_score_codex":0.00004036534,"about_ca_system_score_gemma":0.00025905005,"threshold_uncertainty_score":0.37158898},"labels":[],"label_agreement":null},{"id":"W2949669941","doi":"10.48550/arxiv.1509.03332","title":"Erd\\H{o}s-Szekeres without induction","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Integer (computer science); Regular polygon; Position (finance); Plane (geometry); Mathematics; Upper and lower bounds; General position; Physics; Geometry; Mathematical analysis; Computer science; Finance","score_opus":0.12542338268763195,"score_gpt":0.20732429171355676,"score_spread":0.08190090902592481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949669941","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.38345498,0.00006836091,0.6128716,0.00011423864,0.0011868308,0.00015269149,0.000004969953,0.00020720359,0.0019391213],"genre_scores_gemma":[0.99223125,0.000037651585,0.004872843,0.0000835536,0.00028354203,0.0000010117286,0.00005017182,0.000010495923,0.002429461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984918,0.00013462768,0.00016361008,0.0008541562,0.00013751508,0.00021827027],"domain_scores_gemma":[0.9984907,0.000036772086,0.00019962464,0.0007295856,0.00037179017,0.00017152172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030056795,0.00022932273,0.000216452,0.00032495364,0.00013323687,0.00016424354,0.0009552792,0.00023575124,0.000016801354],"category_scores_gemma":[0.000042534262,0.00026965502,0.00011168769,0.00065058254,0.00005105743,0.0005276014,0.0011559573,0.00039659158,0.00012470415],"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.00002235941,0.00008420213,0.0010553714,0.000031424912,0.00006504876,0.000056732926,0.0002988345,0.81966597,0.00007091957,0.17071116,0.0032807083,0.004657274],"study_design_scores_gemma":[0.00044291772,0.00006428125,0.0017412001,0.00004184429,0.00004286239,0.0000138072555,0.00009191674,0.821047,0.00029630034,0.1727303,0.0030088995,0.00047867605],"about_ca_topic_score_codex":0.00008303296,"about_ca_topic_score_gemma":0.000027002636,"teacher_disagreement_score":0.6087763,"about_ca_system_score_codex":0.00021516246,"about_ca_system_score_gemma":0.00040465422,"threshold_uncertainty_score":0.99997556},"labels":[],"label_agreement":null},{"id":"W2949713296","doi":"10.48550/arxiv.0909.0575","title":"Geometric Properties of Poisson Matchings","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","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 British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Poisson distribution; Matching (statistics); Enhanced Data Rates for GSM Evolution; Translation (biology); Invariant (physics); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.05617579236047593,"score_gpt":0.2547248989452178,"score_spread":0.1985491065847419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949713296","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.7976641,0.0014865058,0.19857185,0.0009075583,0.0006298124,0.00019852273,0.0000024355588,0.00011616108,0.00042306026],"genre_scores_gemma":[0.97903395,0.000094067866,0.019815238,0.00030152535,0.00020508397,0.000014776087,0.000017970066,0.0000098631335,0.0005075388],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99833274,0.00006915962,0.000421212,0.0005308012,0.0004273797,0.00021869087],"domain_scores_gemma":[0.9986972,0.000036680853,0.000309026,0.0006200857,0.00026453324,0.00007247452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038355828,0.00022371706,0.0003128534,0.0005762254,0.00008234326,0.000098771015,0.00096447655,0.00016338234,0.000010786902],"category_scores_gemma":[0.00011498554,0.00020457506,0.00014213563,0.0008912261,0.000028661101,0.0002678395,0.0007694223,0.00033438762,0.000065432985],"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.00010034301,0.0016699448,0.07291667,0.0020476426,0.0004860158,0.00006767389,0.0064929966,0.11368008,0.060854875,0.02673418,0.007054235,0.70789534],"study_design_scores_gemma":[0.0008078956,0.00041151457,0.6736036,0.00084717746,0.000081796235,0.00004212491,0.000041943622,0.048500296,0.24165529,0.024660215,0.007838979,0.0015091532],"about_ca_topic_score_codex":0.0000847821,"about_ca_topic_score_gemma":0.0000030586743,"teacher_disagreement_score":0.7063862,"about_ca_system_score_codex":0.000057783585,"about_ca_system_score_gemma":0.00019382112,"threshold_uncertainty_score":0.83423287},"labels":[],"label_agreement":null},{"id":"W2949750470","doi":"10.48550/arxiv.math/0702344","title":"Complexity of Bezout's Theorem VI: Geodesics in the Condition (Number) Metric","year":2007,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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 Toronto","funders":"","keywords":"Geodesic; Mathematics; Metric (unit); Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis; Economics","score_opus":0.11694917105532839,"score_gpt":0.23206134637263365,"score_spread":0.11511217531730526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949750470","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.31788364,0.000030972573,0.67761385,0.00007729534,0.00025063785,0.00022120032,0.000014104701,0.00003697369,0.003871305],"genre_scores_gemma":[0.99616206,0.00004810874,0.003384468,0.00015613738,0.00006100925,7.0513096e-7,0.000079638805,0.000005702942,0.000102171995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984578,0.000307624,0.0002725484,0.00055112614,0.00019355424,0.00021738122],"domain_scores_gemma":[0.9983468,0.00039933866,0.00030759245,0.0006715071,0.00022079462,0.000053967353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001072918,0.0001920359,0.00024883728,0.00050514156,0.00010596895,0.00006867951,0.0013682126,0.00017525225,0.000029799272],"category_scores_gemma":[0.000058134163,0.00018502642,0.00015315581,0.0021204134,0.00018174286,0.00026480548,0.00059043535,0.0004241949,0.000027951106],"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.000013502268,0.00011362387,0.0016113439,0.000033284596,0.000023358733,0.000043301152,0.0003126188,0.22570512,0.000010674901,0.7709138,0.0000978632,0.0011215337],"study_design_scores_gemma":[0.00045154346,0.000034859626,0.02979398,0.000038240123,0.000036218677,0.000008687649,0.00011586848,0.4139262,0.0003199276,0.5548111,0.00020364898,0.00025971452],"about_ca_topic_score_codex":0.0001398097,"about_ca_topic_score_gemma":0.000058531677,"teacher_disagreement_score":0.67827845,"about_ca_system_score_codex":0.00013274823,"about_ca_system_score_gemma":0.00015467724,"threshold_uncertainty_score":0.7545159},"labels":[],"label_agreement":null},{"id":"W2949782169","doi":"10.48550/arxiv.0806.2332","title":"Triangulation of Simple 3D Shapes with Well-Centered Tetrahedra","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"University of Illinois at Urbana-Champaign; U.S. Department of Energy; National Science Foundation","keywords":"Tetrahedron; Simple (philosophy); Triangulation; Computer science; Computer vision; Artificial intelligence; Geometry; Mathematics; Epistemology; Philosophy","score_opus":0.04958588757068623,"score_gpt":0.2672700062132106,"score_spread":0.2176841186425244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949782169","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.6268704,0.00014239567,0.3715261,0.00020077496,0.0002818706,0.0002497724,0.000008199139,0.000084094005,0.00063643465],"genre_scores_gemma":[0.9786718,0.00007482243,0.020452246,0.00013056892,0.00023137993,0.00002052246,0.00014776194,0.000014544395,0.00025634523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9983058,0.000086073574,0.0004280677,0.0005698997,0.00040743497,0.00020270277],"domain_scores_gemma":[0.9986901,0.00010011697,0.000369915,0.00050068885,0.00026338335,0.00007579027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017422588,0.00023485067,0.00031326886,0.00024769074,0.00010542625,0.00005739743,0.00059156975,0.00014806475,0.000041194926],"category_scores_gemma":[0.000040087154,0.00021420355,0.00011052214,0.0004322178,0.000047656315,0.00026896564,0.00040336174,0.00023472623,0.000042700107],"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.0002942645,0.0010724376,0.24425158,0.00056955323,0.00057772,0.00011054485,0.0036597205,0.63078487,0.00645207,0.004452563,0.0042391745,0.1035355],"study_design_scores_gemma":[0.0017233049,0.0003299875,0.66406953,0.0001867985,0.00005885127,0.000050770712,0.000024483552,0.31282288,0.00998085,0.002032225,0.007965463,0.00075482455],"about_ca_topic_score_codex":0.000051028404,"about_ca_topic_score_gemma":0.000020818943,"teacher_disagreement_score":0.41981795,"about_ca_system_score_codex":0.000051243645,"about_ca_system_score_gemma":0.00022949396,"threshold_uncertainty_score":0.8734967},"labels":[],"label_agreement":null},{"id":"W2949808087","doi":"10.1142/s1793830920500056","title":"Plane and planarity thresholds for random geometric graphs","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Windsor","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planarity testing; Random geometric graph; Euclidean geometry; Unit square; Plane (geometry); Clique; Spatial network; Square (algebra); Graph; Random graph; Euclidean distance; Unit disk graph; Discrete mathematics; Geometry; Line graph; Computer science","score_opus":0.022007980558606647,"score_gpt":0.2754168138140871,"score_spread":0.25340883325548047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949808087","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.002670851,0.0012908035,0.992562,0.0005253331,0.00014747446,0.0019418212,0.00034532096,0.00008533328,0.00043106594],"genre_scores_gemma":[0.15601188,0.0012899493,0.837437,0.00022844641,0.0003849265,0.002634922,0.0013377125,0.000047700403,0.0006274675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850285,0.000017426517,0.0003923945,0.0006300543,0.00024640773,0.00021088352],"domain_scores_gemma":[0.9984169,0.00048501074,0.00025665492,0.000583288,0.00014019253,0.000117964206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042166372,0.00026297028,0.00039374898,0.00032591872,0.0002570746,0.00044665678,0.000432619,0.0001798762,0.000002948524],"category_scores_gemma":[0.000032574644,0.00024072795,0.0000977664,0.00037560557,0.00005508315,0.0001227882,0.00055529125,0.00020904721,0.000005001261],"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.0000110215215,0.0002228212,0.0001296867,0.0015409968,0.00019929501,7.75472e-7,0.0007116849,0.0053309393,0.000057213896,0.90507644,0.0012863012,0.0854328],"study_design_scores_gemma":[0.0007911392,0.000047362722,0.0003322949,0.000053129148,0.00007035595,0.000017741388,0.00004042498,0.5912514,0.000103901795,0.4002019,0.0067069773,0.0003834169],"about_ca_topic_score_codex":0.000010500548,"about_ca_topic_score_gemma":0.0000026003615,"teacher_disagreement_score":0.5859204,"about_ca_system_score_codex":0.000016693626,"about_ca_system_score_gemma":0.00006882058,"threshold_uncertainty_score":0.9816601},"labels":[],"label_agreement":null},{"id":"W2949852651","doi":"10.48550/arxiv.1305.4170","title":"Average Stretch Factor: How Low Does It Go?","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Graph; Euclidean geometry; Dimension (graph theory); Omega; Physics; Geometry; Mathematical analysis","score_opus":0.05189672394712134,"score_gpt":0.18106769675789391,"score_spread":0.12917097281077258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949852651","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.4258046,0.000023362423,0.57132846,0.0005820088,0.0010453634,0.00021924739,0.000023726841,0.00016068296,0.0008126006],"genre_scores_gemma":[0.98754925,0.00010866852,0.0020935114,0.00019723538,0.0002004039,0.0000015045161,0.000054937074,0.000012949511,0.009781517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981565,0.00012956394,0.00015772096,0.0010759204,0.0001597561,0.00032055393],"domain_scores_gemma":[0.9982549,0.000120931414,0.00022474608,0.00094460614,0.00026372593,0.00019112104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000115157534,0.0003248117,0.00027161976,0.00029845347,0.00017086159,0.0004543787,0.0014601483,0.00026970255,0.0002496599],"category_scores_gemma":[0.000031734002,0.00031432972,0.00020366539,0.0004981332,0.000054226675,0.00075946073,0.0014625576,0.00046203317,0.00029620976],"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.0000138036185,0.00019262526,0.0013811149,0.00017406778,0.00018677929,0.00022444042,0.0008836147,0.8171049,0.00031080443,0.16434772,0.005560732,0.009619392],"study_design_scores_gemma":[0.00033389303,0.000038184,0.0017979916,0.00006311915,0.000019313407,0.0000032649195,0.00004409705,0.9498872,0.0010700874,0.042254984,0.003910598,0.00057726813],"about_ca_topic_score_codex":0.00005242529,"about_ca_topic_score_gemma":0.000045655033,"teacher_disagreement_score":0.5692349,"about_ca_system_score_codex":0.0001812593,"about_ca_system_score_gemma":0.00021965468,"threshold_uncertainty_score":0.99993086},"labels":[],"label_agreement":null},{"id":"W2949856235","doi":"10.48550/arxiv.cs/0702117","title":"On a family of strong geometric spanners that admit local routing strategies","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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); Mathematics; Computer science; Mathematical economics; Combinatorics; Sociology; Computer network","score_opus":0.07859429793566869,"score_gpt":0.3009917355227559,"score_spread":0.2223974375870872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949856235","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.4800686,0.0002668231,0.5168536,0.00006116054,0.00068516267,0.00013764494,0.0000048467205,0.00007504727,0.0018471602],"genre_scores_gemma":[0.9926743,0.000034793142,0.006669064,0.00018866861,0.00020909071,0.0000119369615,0.000048978683,0.000017438819,0.00014572483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9975207,0.000089619294,0.00049720163,0.00076351204,0.0007213014,0.0004076675],"domain_scores_gemma":[0.9981425,0.00037263165,0.00043563158,0.00068637484,0.000236542,0.00012633594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007057841,0.00033172956,0.0003844061,0.0009658,0.00012823545,0.00017666398,0.0009777887,0.00025759908,0.000013736864],"category_scores_gemma":[0.000106709136,0.00033468936,0.0001959391,0.0012081321,0.000076587115,0.00035628752,0.0008086616,0.0006091592,0.000051680137],"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.000041700685,0.00023395749,0.017650943,0.00017295973,0.00015779378,0.0000480025,0.0005752146,0.83920264,0.00043547567,0.06434433,0.0004278717,0.07670911],"study_design_scores_gemma":[0.001327148,0.00077194435,0.6619049,0.0007243138,0.00009894498,0.00002140114,0.0016338833,0.2993523,0.018151576,0.013366829,0.0008993165,0.0017474692],"about_ca_topic_score_codex":0.00014216715,"about_ca_topic_score_gemma":0.000013020785,"teacher_disagreement_score":0.6442539,"about_ca_system_score_codex":0.00014539751,"about_ca_system_score_gemma":0.0004948137,"threshold_uncertainty_score":0.99991053},"labels":[],"label_agreement":null},{"id":"W2949868096","doi":"10.48550/arxiv.1103.1431","title":"Approximation Algorithms for Maximum Independent Set of Pseudo-Disks","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Rounding; Approximation algorithm; Set (abstract data type); Independent set; Algorithm; Mathematics; Plane (geometry); Relaxation (psychology); Combinatorics; Linear programming relaxation; Constant (computer programming); Computer science; Discrete mathematics; Linear programming; Geometry","score_opus":0.13441276416516762,"score_gpt":0.22090572822460952,"score_spread":0.0864929640594419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949868096","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.06369821,0.000030553478,0.9341343,0.00003957712,0.0006837573,0.00049258285,0.000045209155,0.00008575648,0.00079003157],"genre_scores_gemma":[0.9535979,0.000031287607,0.045523822,0.000026357997,0.00011290784,0.000004650201,0.00013649517,0.000010709817,0.0005558432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998592,0.00009122429,0.00025469484,0.0007400514,0.00011924905,0.00020273839],"domain_scores_gemma":[0.9984408,0.00009675621,0.00038081853,0.00062935596,0.00036190046,0.00009039443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042315695,0.00021048999,0.0002593134,0.0003358633,0.000096981894,0.000052102536,0.000978304,0.0002321038,0.000017384293],"category_scores_gemma":[0.000032787157,0.00024974442,0.00019981824,0.0004078244,0.00004361993,0.00033769512,0.0007719376,0.00021088087,0.000014724476],"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.000065760025,0.0001813098,0.00024366088,0.00029877725,0.00015750853,0.000019535162,0.00079988135,0.4611853,0.00025448966,0.5187164,0.00039992706,0.01767745],"study_design_scores_gemma":[0.00039374203,0.00006579472,0.0004318159,0.000030714615,0.000040255854,0.0000029260325,0.000028380136,0.7261582,0.0020962511,0.27036002,0.00016359052,0.00022829599],"about_ca_topic_score_codex":0.000057503094,"about_ca_topic_score_gemma":0.000010531434,"teacher_disagreement_score":0.88989973,"about_ca_system_score_codex":0.00009683904,"about_ca_system_score_gemma":0.00020759442,"threshold_uncertainty_score":0.99999547},"labels":[],"label_agreement":null},{"id":"W2949911960","doi":"10.1002/jgt.20214","title":"Simultaneous diagonal flips in plane triangulations","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université du Québec en Outaouais; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Universitat Politècnica de Catalunya; Ministerio de Economía y Competitividad","keywords":"Combinatorics; Diagonal; Mathematics; Triangulation; Vertex (graph theory); Plane (geometry); Graph; Geometry","score_opus":0.006922689708773792,"score_gpt":0.22658589550119923,"score_spread":0.21966320579242543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949911960","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.34873253,0.0006178897,0.648835,0.00040838262,0.00048879633,0.00005214301,0.0000020950768,0.000013725134,0.0008494344],"genre_scores_gemma":[0.98795485,0.000009691611,0.011472678,0.00009686616,0.00026601055,7.8093444e-7,0.0000032726964,0.0000030311837,0.00019283767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990593,0.00014026288,0.00036564656,0.00008697315,0.00023997927,0.000107820975],"domain_scores_gemma":[0.9988418,0.00071510347,0.00019168215,0.000097005584,0.00011476472,0.000039646955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079280074,0.00006571281,0.00012023079,0.00046272908,0.000056045774,0.000051913805,0.00025517156,0.00003415779,0.000020604899],"category_scores_gemma":[0.00012184947,0.000056880144,0.000084877465,0.0005326157,0.000022302736,0.00027673112,0.000022211569,0.0001272716,0.0000057397847],"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.00009348153,0.00022173858,0.0008935659,0.000004751028,0.000020388185,0.00020027379,0.00024175289,0.29602468,0.0020850676,0.664407,0.0008036907,0.035003588],"study_design_scores_gemma":[0.00118673,0.00016746596,0.025220394,0.000028416638,0.00001088081,0.00037523638,0.000028014183,0.021963142,0.0011551785,0.9463697,0.003339295,0.00015555353],"about_ca_topic_score_codex":0.0000038904386,"about_ca_topic_score_gemma":0.000012451712,"teacher_disagreement_score":0.6392223,"about_ca_system_score_codex":0.000025363457,"about_ca_system_score_gemma":0.00007152311,"threshold_uncertainty_score":0.23195049},"labels":[],"label_agreement":null},{"id":"W2949947222","doi":"10.48550/arxiv.1609.08132","title":"Order-preserving 1-string representations of planar graphs","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Planar; Planar graph; String (physics); Order (exchange); Embedding; Mathematics; Planar straight-line graph; Vertex (graph theory); Combinatorics; Book embedding; Representation (politics); 1-planar graph; Graph; Chordal graph; Computer science; Artificial intelligence","score_opus":0.07155117739858435,"score_gpt":0.20894548887623837,"score_spread":0.13739431147765402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949947222","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.13047276,0.00005791741,0.8652587,0.00018557774,0.0004586797,0.00016159793,0.000022943994,0.00010686962,0.0032749672],"genre_scores_gemma":[0.9897846,0.00008461012,0.008841114,0.000027891308,0.000060600643,9.977653e-7,0.000027943472,0.000008242629,0.0011640303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986137,0.00011537983,0.00023315806,0.00071230973,0.000125646,0.00019978039],"domain_scores_gemma":[0.9981455,0.00021787395,0.00028792402,0.000911475,0.0003413991,0.00009582871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020131542,0.00017659226,0.00021554076,0.000456478,0.00013416767,0.00005831894,0.0012744078,0.00013901539,0.00002973545],"category_scores_gemma":[0.00008533466,0.00019010987,0.00014383518,0.0009291664,0.000056705372,0.0004294424,0.0011051381,0.00020511616,0.000020043699],"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.0000101993755,0.000041786534,0.0021963299,0.000051385356,0.000071175804,0.000036658916,0.00012885265,0.22283775,0.00038423328,0.772923,0.00047646632,0.000842193],"study_design_scores_gemma":[0.0004855068,0.000036968766,0.0042420276,0.00015942879,0.000044382898,0.0000048498755,0.00004414336,0.28242314,0.0016619446,0.71011406,0.00041174007,0.0003717724],"about_ca_topic_score_codex":0.000090883215,"about_ca_topic_score_gemma":0.000026630627,"teacher_disagreement_score":0.8593118,"about_ca_system_score_codex":0.000061665334,"about_ca_system_score_gemma":0.0002094579,"threshold_uncertainty_score":0.77524555},"labels":[],"label_agreement":null},{"id":"W2950027524","doi":"10.48550/arxiv.1608.07348","title":"Algorithms for Colourful Simplicial Depth and Medians in the Plane","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Monochrome; Regular polygon; Mathematics; Point (geometry); Convex hull; Plane (geometry); Geometry; Computer science; Artificial intelligence","score_opus":0.08654745105530612,"score_gpt":0.21475639591690465,"score_spread":0.12820894486159853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950027524","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.12804724,0.000036707323,0.8697624,0.000787328,0.00038166603,0.00037598965,0.000030000032,0.00003499055,0.00054366136],"genre_scores_gemma":[0.9969931,0.000048344657,0.0022493775,0.00024555915,0.00019770909,0.0000035109135,0.000026933336,0.00000480535,0.00023063943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905163,0.000086053355,0.000112856935,0.0005007439,0.000067254536,0.00018147114],"domain_scores_gemma":[0.9990735,0.0004063268,0.00009112649,0.0003062578,0.00006882553,0.00005393496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000310433,0.00013537453,0.00014155623,0.0001655185,0.00010913613,0.00007937579,0.0007136344,0.00012888642,0.0000027349042],"category_scores_gemma":[0.00003465153,0.000110084016,0.000055774468,0.00025616126,0.00004683761,0.000147804,0.000367464,0.00015636312,0.0000060533353],"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.00009150584,0.00016803265,0.002876045,0.00009292513,0.00008025757,0.00020755568,0.0018413829,0.0986052,0.000089550835,0.8554916,0.002537277,0.03791867],"study_design_scores_gemma":[0.0011024147,0.0001325972,0.0104022715,0.000046528254,0.000032450804,0.00001585682,0.000088639514,0.6657312,0.00010343531,0.3173245,0.0046407282,0.00037939835],"about_ca_topic_score_codex":0.000032100263,"about_ca_topic_score_gemma":0.00022873851,"teacher_disagreement_score":0.8689459,"about_ca_system_score_codex":0.00005398109,"about_ca_system_score_gemma":0.00012715723,"threshold_uncertainty_score":0.44890958},"labels":[],"label_agreement":null},{"id":"W2950033326","doi":"","title":"Approximating Majority Depth","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Vertex (graph theory); Combinatorics; Set (abstract data type); Point (geometry); Monte Carlo method; Mathematics; Sampling (signal processing); Data set; Algorithm; Discrete mathematics; Computer science; Statistics; Geometry; Graph","score_opus":0.097644669865377,"score_gpt":0.1960307907093336,"score_spread":0.0983861208439566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950033326","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.11161831,0.00010096191,0.88115203,0.000058924965,0.00089530216,0.00016748274,0.0000043245273,0.00021641521,0.0057862317],"genre_scores_gemma":[0.9710485,0.00002248907,0.027654028,0.000081045815,0.00025328202,9.2696195e-7,0.000033668544,0.000008699023,0.00089737127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986108,0.00012077103,0.00018172145,0.0006878709,0.000103706116,0.00029510848],"domain_scores_gemma":[0.9987005,0.00008559043,0.00022158796,0.0006963988,0.00014126627,0.00015468344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036523465,0.0002153083,0.00020671806,0.00019665052,0.000178864,0.00013009974,0.0010205159,0.00018943904,0.00002290374],"category_scores_gemma":[0.00003559492,0.00025910413,0.00014021923,0.00054437347,0.000034221008,0.0005000901,0.0015376776,0.00040370715,0.00012459028],"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.0000069163802,0.00012200323,0.002544111,0.000093777664,0.00006003585,0.000041896405,0.00028492254,0.38530648,0.000059718015,0.60251826,0.0003392848,0.008622609],"study_design_scores_gemma":[0.00021330541,0.000013777639,0.003417515,0.000031098236,0.000034519126,0.0000069733837,0.000018467343,0.92276,0.00026117102,0.072008654,0.000855788,0.00037870265],"about_ca_topic_score_codex":0.000041039268,"about_ca_topic_score_gemma":0.000014722107,"teacher_disagreement_score":0.8594302,"about_ca_system_score_codex":0.00013606835,"about_ca_system_score_gemma":0.00014667798,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null},{"id":"W2950036238","doi":"10.1007/978-3-319-53925-6_24","title":"Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University; University of Manitoba","funders":"","keywords":"Polygon (computer graphics); Computer science; Visibility; Point (geometry); Visibility polygon; Computer graphics (images); Space (punctuation); Computer vision; Simple polygon; Geometry; Mathematics; Telecommunications; Optics; Physics; Monotone polygon; Operating system","score_opus":0.02896338328720742,"score_gpt":0.2746295439546489,"score_spread":0.24566616066744146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950036238","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.0010637853,0.00041645695,0.99258065,0.0037990978,0.00076120166,0.0007483888,0.0000049828654,0.00003399218,0.0005914466],"genre_scores_gemma":[0.80169564,0.000043251643,0.19621113,0.0007483809,0.00052869326,0.000031366802,0.000011470333,0.000027606166,0.000702477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741066,0.00005491766,0.0005040934,0.00103604,0.0006001225,0.00039417815],"domain_scores_gemma":[0.9969639,0.0010355134,0.00048554066,0.0012971782,0.00014741573,0.00007044184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017360316,0.0003137992,0.00042723812,0.00061997876,0.00031942507,0.0002894473,0.002466372,0.00020293922,0.0000035560988],"category_scores_gemma":[0.00032215499,0.000247291,0.0001618486,0.0003537499,0.0005236844,0.0005301714,0.00058200397,0.00041300876,0.000003852318],"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.000031219406,0.000058071368,0.00004928673,0.000071758725,0.000010765971,0.000021229465,0.0022697246,0.10226253,0.00041466008,0.022816947,0.00008446688,0.8719093],"study_design_scores_gemma":[0.0003881439,0.00020260044,0.00070162467,0.00034550374,0.00000633363,0.000050505383,3.3156263e-7,0.84470004,0.0018587477,0.15035477,0.0010612741,0.00033013403],"about_ca_topic_score_codex":0.000017533845,"about_ca_topic_score_gemma":0.00008901537,"teacher_disagreement_score":0.87157923,"about_ca_system_score_codex":0.00021382916,"about_ca_system_score_gemma":0.00053562556,"threshold_uncertainty_score":0.9999979},"labels":[],"label_agreement":null},{"id":"W2950195406","doi":"10.48550/arxiv.1009.3006","title":"Minimum-Area Enclosing Triangle with a Fixed Angle","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Omega; Combinatorics; Regular polygon; Mathematics; Plane (geometry); Algebraic number; Tree (set theory); Computation; Upper and lower bounds; Set (abstract data type); Geometry; Mathematical analysis; Physics; Computer science; Algorithm","score_opus":0.06495320348901368,"score_gpt":0.182681867185143,"score_spread":0.11772866369612933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950195406","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.39965966,0.000031902688,0.5974275,0.00008421632,0.00045789944,0.00018950227,0.000007246448,0.00014191848,0.002000162],"genre_scores_gemma":[0.9839521,0.000015991352,0.013489054,0.00010575803,0.00014008394,0.0000015140672,0.000046768448,0.000012834338,0.0022358885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842936,0.000092877315,0.00016574972,0.0009152143,0.00012931932,0.00026750346],"domain_scores_gemma":[0.99843353,0.00013758017,0.00022343177,0.0008177751,0.00023131169,0.00015636488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018722756,0.0002636518,0.00027438,0.00033431832,0.00020071042,0.00020174042,0.0010267093,0.00025347568,0.00005208546],"category_scores_gemma":[0.000036328183,0.000274363,0.00014072913,0.00078633975,0.000067171175,0.00039726426,0.0007689806,0.0005295002,0.000042827418],"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.00019342486,0.00046169985,0.001707344,0.00011979059,0.00024393131,0.00078247767,0.0007864944,0.82288665,0.0028148545,0.15957755,0.00239732,0.0080284495],"study_design_scores_gemma":[0.0011590363,0.00016506025,0.0010948096,0.000099000936,0.00007768685,0.00002667838,0.000042849722,0.9701737,0.0017087329,0.02216949,0.0026156714,0.0006672656],"about_ca_topic_score_codex":0.000039149432,"about_ca_topic_score_gemma":0.00007319508,"teacher_disagreement_score":0.5842924,"about_ca_system_score_codex":0.00009667555,"about_ca_system_score_gemma":0.00037370514,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W2950301797","doi":"10.48550/arxiv.math/0505164","title":"Incidence theorems for pseudoflats","year":2005,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bounded function; Class (philosophy); Mathematics; Algebraic number; Degree (music); Type (biology); Discrete mathematics; Incidence (geometry); Combinatorics; Pure mathematics; Computer science; Artificial intelligence; Mathematical analysis; Geometry; Physics","score_opus":0.05287292820282545,"score_gpt":0.3031805044761336,"score_spread":0.25030757627330813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950301797","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.35615423,0.00036426738,0.6394381,0.0016229933,0.0013418214,0.00035618254,0.0000075906623,0.00015238591,0.0005624384],"genre_scores_gemma":[0.92832524,0.0000551956,0.06781662,0.0011434049,0.0012202231,0.00013726804,0.00006354058,0.000016116106,0.0012223723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830633,0.000056772078,0.0003385788,0.000729199,0.00028842094,0.00028069262],"domain_scores_gemma":[0.9984577,0.0002273241,0.00021226954,0.0007453094,0.0002586721,0.00009873004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047440146,0.00023999321,0.00023252191,0.00016044996,0.00016479532,0.00016912553,0.0011730404,0.0001947749,0.00002193375],"category_scores_gemma":[0.0001468146,0.0002388726,0.00016769867,0.00024076836,0.000037140624,0.00031837728,0.0009379355,0.00029396906,0.00015047217],"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.000083920684,0.0005465779,0.048795488,0.00046719983,0.00031406205,0.000039309394,0.0034367186,0.27210912,0.008847409,0.34814137,0.03050272,0.28671607],"study_design_scores_gemma":[0.0011674311,0.00026307502,0.1739358,0.00026544588,0.000069038164,0.000057952417,0.000019655332,0.5162647,0.02470125,0.20254236,0.07877299,0.0019403324],"about_ca_topic_score_codex":0.0000110544825,"about_ca_topic_score_gemma":0.0000115463,"teacher_disagreement_score":0.57217103,"about_ca_system_score_codex":0.000079747806,"about_ca_system_score_gemma":0.0002641292,"threshold_uncertainty_score":0.9740942},"labels":[],"label_agreement":null},{"id":"W2950420494","doi":"10.48550/arxiv.1512.02730","title":"Plane Bichromatic Trees of Low Degree","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Combinatorics; Bipartite graph; Mathematics; Degree (music); Disjoint sets; Graph; Plane (geometry); Upper and lower bounds; Spanning tree; Discrete mathematics; Physics; Geometry; Mathematical analysis","score_opus":0.11740832421506919,"score_gpt":0.1946905479037339,"score_spread":0.07728222368866472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950420494","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.39893734,0.00007332224,0.59828246,0.00004348729,0.00043538614,0.00012779603,0.000012367664,0.00008011934,0.002007718],"genre_scores_gemma":[0.99413574,0.00002692994,0.0046484754,0.000027232833,0.00006821261,4.063172e-7,0.000043987595,0.0000061435326,0.0010428659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989205,0.000093102026,0.00019284515,0.0005114298,0.0001253187,0.00015682784],"domain_scores_gemma":[0.9986483,0.000096619755,0.00024541764,0.00065742666,0.00023714357,0.00011509609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002384343,0.00017524781,0.00025647093,0.00029671952,0.00004892818,0.000043408952,0.0010120004,0.00014528843,0.000020538488],"category_scores_gemma":[0.000041415988,0.00019597929,0.00010489975,0.0005544889,0.000054004144,0.00021862252,0.0008256227,0.00018413583,0.000051908693],"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.000017421704,0.00012861266,0.00046939935,0.00014916384,0.00008375987,0.00007174252,0.00028207223,0.90512365,0.00015113255,0.08919804,0.001464787,0.002860208],"study_design_scores_gemma":[0.00046369742,0.00008510841,0.002735161,0.00012079124,0.000040065068,0.000006060698,0.000028515486,0.9174742,0.00081115274,0.07770266,0.00022707753,0.00030553507],"about_ca_topic_score_codex":0.00005039758,"about_ca_topic_score_gemma":0.000043001728,"teacher_disagreement_score":0.5951984,"about_ca_system_score_codex":0.00009141621,"about_ca_system_score_gemma":0.00034598558,"threshold_uncertainty_score":0.7991804},"labels":[],"label_agreement":null},{"id":"W2950465163","doi":"10.48550/arxiv.1505.00184","title":"Instance Optimal Geometric Algorithms","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Mathematics; Algorithm; Combinatorics; Permutation (music); Multilinear map; Sequence (biology); Upper and lower bounds; Random permutation; Order (exchange); Constant (computer programming); Convex hull; Regular polygon; Class (philosophy); Sigma; Discrete mathematics; Computer science; Block (permutation group theory); Pure mathematics","score_opus":0.09796609758647327,"score_gpt":0.2022774825929172,"score_spread":0.10431138500644392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950465163","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.10789041,0.0002735985,0.8872855,0.00008393357,0.0011685222,0.00018322883,0.000015503561,0.00022287473,0.0028764838],"genre_scores_gemma":[0.9691642,0.00010948479,0.026850965,0.000099332596,0.00021279059,0.0000011380869,0.00005162015,0.000012181257,0.0034983188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981925,0.000101063335,0.00019671087,0.0010235246,0.00018297596,0.00030321025],"domain_scores_gemma":[0.99817693,0.00008126781,0.00021437343,0.0008378612,0.00046102807,0.00022856555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038491044,0.0002679239,0.00026559184,0.00073764334,0.00013307492,0.0001804877,0.0015290309,0.00022643707,0.00001968572],"category_scores_gemma":[0.00006289268,0.00032533018,0.0001430462,0.0022911855,0.000052420244,0.0005386211,0.001694098,0.0004388222,0.00016317725],"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.000009332458,0.000067952205,0.00012423913,0.000019211257,0.000039381845,0.00013539169,0.00008258639,0.9274278,0.000005127072,0.06383592,0.0017372385,0.0065157968],"study_design_scores_gemma":[0.00040485215,0.000058924576,0.0005200403,0.000024100027,0.000024137711,0.000009183881,0.000017782515,0.9673175,0.000098057644,0.025636785,0.005476948,0.0004116943],"about_ca_topic_score_codex":0.00003470796,"about_ca_topic_score_gemma":0.000006063976,"teacher_disagreement_score":0.86127377,"about_ca_system_score_codex":0.00030149546,"about_ca_system_score_gemma":0.000498516,"threshold_uncertainty_score":0.9999199},"labels":[],"label_agreement":null},{"id":"W2950548256","doi":"10.48550/arxiv.1509.08285","title":"The Continuous 1.5D Terrain Guarding Problem: Discretization, Optimal Solutions, and PTAS","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"D-Wave Systems (Canada)","funders":"","keywords":"Guard (computer science); Discretization; Terrain; Mathematics; Combinatorics; Approximation algorithm; Monotone polygon; Mathematical optimization; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.06643551490681902,"score_gpt":0.1925055789738809,"score_spread":0.1260700640670619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950548256","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.05804383,0.0004116388,0.9386866,0.0007598145,0.00044464998,0.0003224212,0.000010965847,0.00013524924,0.0011848118],"genre_scores_gemma":[0.99035734,0.00019238732,0.007141704,0.000055298642,0.00012821877,0.0000026534158,0.00005060141,0.000009669829,0.0020621235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985538,0.00019479584,0.00019468217,0.00066113076,0.00011983421,0.00027574523],"domain_scores_gemma":[0.9987031,0.00012803948,0.00020109261,0.00050454086,0.0003327229,0.0001304781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072325335,0.00020103848,0.0001782164,0.00014740627,0.0006056971,0.0003968571,0.0007592547,0.0001325484,0.0000031858206],"category_scores_gemma":[0.00007554386,0.00018617511,0.00007540619,0.00044771578,0.00012363704,0.00037882957,0.0015610087,0.00027560967,0.000014175617],"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.00001240618,0.00002706191,0.0004405964,0.000018192492,0.0000549323,0.000020319132,0.0005239452,0.6436538,0.000014162194,0.3493745,0.0029350342,0.0029250293],"study_design_scores_gemma":[0.0003159525,0.000042561802,0.00054167927,0.0000398884,0.000038343092,0.000012836844,0.00013594251,0.9106594,0.000016577333,0.08021663,0.007693687,0.0002865429],"about_ca_topic_score_codex":0.000041384043,"about_ca_topic_score_gemma":0.000034524455,"teacher_disagreement_score":0.9323135,"about_ca_system_score_codex":0.00012487671,"about_ca_system_score_gemma":0.00028027548,"threshold_uncertainty_score":0.75920004},"labels":[],"label_agreement":null},{"id":"W2950599253","doi":"10.1016/j.tcs.2016.06.045","title":"Simultaneous visibility representations of plane st-graphs using L-shapes","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":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; Visibility; Vertex (graph theory); Mathematics; Visibility graph; Plane (geometry); Embedding; Representation (politics); Geometry; Graph; Computer science; Physics; Artificial intelligence; Optics; Regular polygon","score_opus":0.01628924726108992,"score_gpt":0.2906817391612559,"score_spread":0.27439249190016596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950599253","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.22675195,0.00001370073,0.7721399,0.00040097555,0.00025136495,0.00010984177,0.0000075194803,0.00007205638,0.00025266665],"genre_scores_gemma":[0.80913,0.0000024184583,0.19071326,0.00008963576,0.000052724627,0.0000015923567,7.5129935e-7,0.0000031741627,0.0000064137375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787533,0.000121665435,0.0003554247,0.0006358751,0.0006886696,0.0003230428],"domain_scores_gemma":[0.9976206,0.001136282,0.00011251155,0.0005528146,0.00040620044,0.00017161641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009982622,0.00012924334,0.00017256389,0.00025578216,0.00026116354,0.00012301048,0.0012258921,0.000037042653,0.000057076253],"category_scores_gemma":[0.00036005882,0.00008870703,0.00006561573,0.0013701457,0.0015579509,0.0006676285,0.0005342274,0.00006320068,0.000014749434],"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.000009520674,0.000068537294,0.00015153403,0.000005386909,0.0000046678456,0.0000057894604,0.00013650658,0.008408453,0.024160597,0.9203718,0.000012592419,0.046664625],"study_design_scores_gemma":[0.00020536498,0.00013363862,0.0014082856,0.000026737307,0.000004337182,0.000032256925,0.0000028014408,0.7621389,0.020239504,0.21563956,0.000028718076,0.00013991905],"about_ca_topic_score_codex":0.000004902706,"about_ca_topic_score_gemma":8.3664753e-7,"teacher_disagreement_score":0.7537304,"about_ca_system_score_codex":0.000046932288,"about_ca_system_score_gemma":0.00017120718,"threshold_uncertainty_score":0.5740335},"labels":[],"label_agreement":null},{"id":"W2950684605","doi":"10.48550/arxiv.1612.09277","title":"On Planar Greedy Drawings of 3-Connected Planar Graphs","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Combinatorics; Planar graph; Mathematics; Embedding; Conjecture; Greedy algorithm; Planar straight-line graph; Euclidean geometry; Regular polygon; Graph drawing; Discrete mathematics; Graph; Computer science; Pathwidth; Line graph; Geometry; Algorithm","score_opus":0.0450492770512331,"score_gpt":0.18066342611694167,"score_spread":0.13561414906570857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950684605","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.4057555,0.00002717071,0.5901331,0.00016926351,0.00063298363,0.00018336004,0.000041320713,0.00013903112,0.002918298],"genre_scores_gemma":[0.99772906,0.000031619235,0.001195866,0.00012810834,0.000060515413,6.574569e-7,0.000042255208,0.000010447993,0.0008014411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843574,0.00011488204,0.0002247265,0.0008347488,0.00015230723,0.00023758005],"domain_scores_gemma":[0.99831194,0.00027836123,0.00031014465,0.0007691366,0.00020720363,0.00012321108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018985583,0.00025501233,0.00029360596,0.00060326,0.0001161202,0.00004598013,0.0011699116,0.00021363226,0.000030039759],"category_scores_gemma":[0.000049522067,0.0002551586,0.00018949245,0.00066331186,0.00007586995,0.00024354477,0.00032448414,0.00026199105,0.000063884705],"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.00005421505,0.00008107026,0.00039399444,0.000041109823,0.00008800671,0.00008990048,0.00011737297,0.04319512,0.00043392272,0.9536204,0.0011294351,0.00075547775],"study_design_scores_gemma":[0.00087248447,0.00021589344,0.0035154384,0.00022520337,0.00004842868,0.0000068309187,0.000014626212,0.09919436,0.0018399518,0.8930077,0.00052279886,0.0005362748],"about_ca_topic_score_codex":0.00004735248,"about_ca_topic_score_gemma":0.000015151701,"teacher_disagreement_score":0.5919736,"about_ca_system_score_codex":0.00008798902,"about_ca_system_score_gemma":0.00017650634,"threshold_uncertainty_score":0.99999005},"labels":[],"label_agreement":null},{"id":"W2950768660","doi":"10.48550/arxiv.1508.01076","title":"Representing Directed Trees as Straight Skeletons","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Polygon (computer graphics); Combinatorics; Simple polygon; Tracing; Tree (set theory); Mathematics; Simple (philosophy); Graph; Skeleton (computer programming); Process (computing); Monotone polygon; Computer science; Geometry","score_opus":0.08704673763001707,"score_gpt":0.21170099699540448,"score_spread":0.12465425936538742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950768660","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.3573387,0.00012384789,0.6118573,0.00024276877,0.0010567439,0.0002584219,0.000013314426,0.00068743766,0.028421478],"genre_scores_gemma":[0.98393774,0.000036253008,0.0047226595,0.000058489823,0.00019915859,0.000001009943,0.00007318082,0.000011888796,0.010959635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813384,0.00017607083,0.00020281876,0.0010451402,0.00015795908,0.0002841971],"domain_scores_gemma":[0.9981255,0.00012242702,0.00022504236,0.00093029824,0.00038567887,0.00021104311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030586685,0.0002496027,0.00024851636,0.00034638782,0.00018192733,0.0002080985,0.0012370578,0.00020386824,0.000062238105],"category_scores_gemma":[0.00012851333,0.00029632731,0.00016702233,0.00094583636,0.000050607232,0.00042583805,0.0015814154,0.00039170648,0.00014842066],"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.000013020184,0.00011426881,0.00067540386,0.000024938288,0.00010445202,0.00027240187,0.0002793116,0.7712571,0.00014938157,0.21942346,0.0045956075,0.003090665],"study_design_scores_gemma":[0.0003701684,0.000041735046,0.002124002,0.000048158494,0.00004634475,0.000012070664,0.0000318438,0.8818238,0.00038575326,0.10992168,0.0047384743,0.00045597428],"about_ca_topic_score_codex":0.00013648221,"about_ca_topic_score_gemma":0.0000727084,"teacher_disagreement_score":0.626599,"about_ca_system_score_codex":0.00015146477,"about_ca_system_score_gemma":0.00046066643,"threshold_uncertainty_score":0.99994886},"labels":[],"label_agreement":null},{"id":"W2950815454","doi":"10.48550/arxiv.1409.5466","title":"Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Delaunay triangulation; Mathematics; Equilateral triangle; Combinatorics; Dual graph; Boundary (topology); Discrete mathematics; Graph; Geometry; Line graph; Mathematical analysis","score_opus":0.04802649729739771,"score_gpt":0.18081444097247798,"score_spread":0.13278794367508026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950815454","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.08674886,0.00026630153,0.9086878,0.00043700097,0.0012477211,0.00030604377,0.0000075273792,0.00028863258,0.0020101166],"genre_scores_gemma":[0.99138814,0.00009484365,0.005810316,0.00028271764,0.00015200335,0.0000036412443,0.000034902794,0.00001863527,0.002214793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976476,0.00029927757,0.00028154295,0.001201459,0.0001942413,0.0003758855],"domain_scores_gemma":[0.998035,0.00010922916,0.00021815418,0.0010425281,0.0003967001,0.00019836683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003925296,0.00036673885,0.00036672957,0.000391942,0.00026336755,0.0002223112,0.0014690151,0.00029991532,0.00007621286],"category_scores_gemma":[0.000059043436,0.0003771405,0.00026808155,0.0011482241,0.0003379032,0.00033204607,0.00093515083,0.00048364612,0.0000824504],"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.00003687697,0.00006728274,0.00009145606,0.000049773094,0.00005888886,0.000043400516,0.00006398142,0.18951388,0.000045593144,0.8088389,0.0005393902,0.0006505439],"study_design_scores_gemma":[0.0005453989,0.00006783994,0.0003184062,0.00007825298,0.000056511573,0.000004644468,0.000009567198,0.46104777,0.0003147287,0.53386796,0.0031669855,0.0005219385],"about_ca_topic_score_codex":0.000018466044,"about_ca_topic_score_gemma":0.000009217075,"teacher_disagreement_score":0.9046393,"about_ca_system_score_codex":0.00009946417,"about_ca_system_score_gemma":0.00021057519,"threshold_uncertainty_score":0.99986804},"labels":[],"label_agreement":null},{"id":"W2950837452","doi":"10.48550/arxiv.0911.0452","title":"Unexpected behaviour of crossing sequences","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Combinatorics; Crossing number (knot theory); Graph; Genus; Mathematics; Surface (topology); Geography; Botany; Geometry; Biology; Cartography","score_opus":0.07537243854393766,"score_gpt":0.208705871795033,"score_spread":0.13333343325109534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950837452","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.49815056,0.00006255229,0.50086874,0.000040812043,0.00023341124,0.00007622377,0.0000047715666,0.0000770598,0.00048584666],"genre_scores_gemma":[0.9895654,0.000025587819,0.009910996,0.000031679392,0.00005587501,2.2228927e-7,0.000024112305,0.000004442943,0.00038173565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988228,0.00009602635,0.0001970277,0.00060797064,0.00010534029,0.00017083091],"domain_scores_gemma":[0.9988318,0.00005274999,0.00027346925,0.0005112948,0.00025376157,0.00007690837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016579746,0.00017210905,0.00021769176,0.00028075668,0.00016156014,0.0001639203,0.00091422227,0.00015807216,0.000012469842],"category_scores_gemma":[0.000021421121,0.00020439991,0.00013706698,0.0007498103,0.00009676361,0.00031318527,0.00050408574,0.00023615407,0.000009274949],"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.000011555981,0.000110300694,0.002120106,0.000033103894,0.000034218232,0.00010742023,0.00034629888,0.82668084,0.0009742619,0.16638982,0.000090036614,0.0031020003],"study_design_scores_gemma":[0.0004363783,0.000093669194,0.02467609,0.00014491862,0.000065551685,0.000010933814,0.000052473857,0.81590223,0.0058165444,0.15213433,0.00011978256,0.00054710713],"about_ca_topic_score_codex":0.00010198029,"about_ca_topic_score_gemma":0.000018702056,"teacher_disagreement_score":0.4914148,"about_ca_system_score_codex":0.00009089004,"about_ca_system_score_gemma":0.00038305283,"threshold_uncertainty_score":0.8335186},"labels":[],"label_agreement":null},{"id":"W2950881801","doi":"10.48550/arxiv.1708.09778","title":"Drawing bobbin lace graphs, or, Fundamental cycles for a subclass of periodic graphs","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Bobbin; Embedding; Combinatorics; Mathematics; Computer science; Torus; Geometry; Artificial intelligence; Engineering","score_opus":0.09412573734022699,"score_gpt":0.2296348983039291,"score_spread":0.13550916096370214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950881801","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.552525,0.00011566402,0.4457586,0.00009168518,0.0006845471,0.0003613068,0.000044246328,0.00007981599,0.00033914513],"genre_scores_gemma":[0.9916843,0.00012191643,0.006684968,0.00004105776,0.000050782048,0.0000034453071,0.000057146848,0.000012805036,0.0013435576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842685,0.00008211143,0.0002370583,0.000844464,0.00013318766,0.0002763451],"domain_scores_gemma":[0.99819297,0.00016136952,0.00044772218,0.00085573207,0.0002230672,0.00011916549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030539357,0.00026501995,0.00034698707,0.000446193,0.00043947354,0.00023020108,0.0014781083,0.00019177997,0.000014352258],"category_scores_gemma":[0.00005384754,0.00028931175,0.00034385582,0.00037539232,0.00015790449,0.00046638254,0.00097439863,0.00022814385,0.000006929725],"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.00029634085,0.00031963616,0.0073821424,0.00047712366,0.00032831967,0.00012534762,0.0009792845,0.20707382,0.00083843013,0.77608097,0.0010638736,0.005034738],"study_design_scores_gemma":[0.0020137944,0.00033824545,0.00955887,0.00029381053,0.00017504679,0.000016285896,0.00020531214,0.6630144,0.0019529017,0.31876442,0.0027134551,0.0009534895],"about_ca_topic_score_codex":0.00009466372,"about_ca_topic_score_gemma":0.000079910744,"teacher_disagreement_score":0.45731655,"about_ca_system_score_codex":0.00010042997,"about_ca_system_score_gemma":0.00037639975,"threshold_uncertainty_score":0.9999559},"labels":[],"label_agreement":null},{"id":"W2950918794","doi":"","title":"An \\Omega(n log n) lower bound for computing the sum of even-ranked elements","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Omega; Rank (graph theory); Combinatorics; Computation; Order (exchange); Upper and lower bounds; Sequence (biology); Binary logarithm; Algebraic number; Mathematics; Tree (set theory); Real number; Discrete mathematics; Algorithm; Physics; Mathematical analysis","score_opus":0.06434977933723116,"score_gpt":0.22533352614373278,"score_spread":0.16098374680650163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950918794","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.35425106,0.000036528712,0.6444944,0.00009179659,0.00051396474,0.0003297067,0.000011822751,0.000050508635,0.00022019728],"genre_scores_gemma":[0.98882407,0.000016812655,0.010504051,0.0001787823,0.0001531818,7.358749e-7,0.00006154936,0.000008476003,0.00025236377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984788,0.00014373739,0.00028775365,0.00069666636,0.0001311733,0.00026190883],"domain_scores_gemma":[0.99822026,0.00018311282,0.00037053318,0.00080621435,0.0003359097,0.0000839631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005899954,0.00021401905,0.00024772895,0.00019978793,0.00026731697,0.00012666595,0.0015008579,0.00013742194,0.000006652913],"category_scores_gemma":[0.000028086433,0.0002091116,0.00018956365,0.0005097687,0.00006601836,0.00030077517,0.00049124705,0.00022708917,0.000005988968],"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.000054119504,0.00023651605,0.0004404293,0.0000524709,0.00010674514,0.000013729636,0.00024033296,0.8148168,0.0002451384,0.17748033,0.00033876847,0.005974635],"study_design_scores_gemma":[0.0005457399,0.00018979964,0.0028932998,0.000041452728,0.00004923935,0.000001788038,0.000025943507,0.92446303,0.00030901196,0.07032346,0.0009062455,0.00025098384],"about_ca_topic_score_codex":0.000026068066,"about_ca_topic_score_gemma":0.0000228427,"teacher_disagreement_score":0.634573,"about_ca_system_score_codex":0.00009351998,"about_ca_system_score_gemma":0.00021070504,"threshold_uncertainty_score":0.8527324},"labels":[],"label_agreement":null},{"id":"W2951107219","doi":"10.1016/j.tcs.2019.05.004","title":"Approximability of covering cells with line segments","year":2019,"lang":"en","type":"preprint","venue":"Theoretical Computer Science","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; United States-Israel Binational Science Foundation","keywords":"Parameterized complexity; Line segment; Line (geometry); Combinatorics; Cover (algebra); Plane (geometry); Orientation (vector space); Set (abstract data type); Mathematics; Computer science; Geometry","score_opus":0.011110302829467116,"score_gpt":0.2442435876333809,"score_spread":0.23313328480391377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951107219","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.112527415,0.000026707597,0.88459384,0.00016046401,0.0011587009,0.000423089,0.00000820812,0.00009131299,0.0010102721],"genre_scores_gemma":[0.6795452,0.000003244319,0.3202346,0.00010073849,0.00008679431,0.0000067483334,0.00000457355,0.000006338153,0.0000117277095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662846,0.00011856864,0.00044499227,0.0011876202,0.001210191,0.0004101761],"domain_scores_gemma":[0.99735457,0.0002485339,0.00025912042,0.0014210282,0.00053663127,0.00018014891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015398929,0.00028999377,0.00042243357,0.00026911445,0.0001404629,0.0003357469,0.0027474728,0.00011015304,0.000017482442],"category_scores_gemma":[0.000036307527,0.00023225264,0.000095063486,0.0009875316,0.0015192558,0.00039087338,0.004013053,0.00040502567,0.000024140994],"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.000022308648,0.0001542149,0.00004871263,0.0001474557,0.000014354278,0.000003437531,0.00028489102,0.44161448,0.0012365775,0.5436227,0.000011802606,0.012839108],"study_design_scores_gemma":[0.00022790198,0.00030165524,0.00041990128,0.00011664431,0.0000089348605,0.000008117344,0.0000014633863,0.90272063,0.040041346,0.055863507,0.000018135413,0.00027178664],"about_ca_topic_score_codex":0.000004380631,"about_ca_topic_score_gemma":2.2983554e-7,"teacher_disagreement_score":0.5670178,"about_ca_system_score_codex":0.00010228611,"about_ca_system_score_gemma":0.00062439375,"threshold_uncertainty_score":0.9470988},"labels":[],"label_agreement":null},{"id":"W2951228294","doi":"10.48550/arxiv.1611.01661","title":"Spanning Trees in Multipartite Geometric Graphs","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Spanning tree; Combinatorics; Minimum spanning tree; Mathematics; Bipartite graph; Multipartite; Disjoint sets; Euclidean minimum spanning tree; k-minimum spanning tree; Connected dominating set; Tree (set theory); Distributed minimum spanning tree; Graph; Shortest-path tree; Discrete mathematics; K-ary tree; Tree structure; Binary tree; Physics","score_opus":0.07213391808977292,"score_gpt":0.19599065417814282,"score_spread":0.1238567360883699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951228294","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.3599733,0.00011401516,0.63814676,0.00009097201,0.00048722402,0.00013669698,0.000005543711,0.000105191306,0.0009402607],"genre_scores_gemma":[0.9959264,0.000105138795,0.0026820626,0.000058320264,0.00007103449,0.0000014082992,0.000013192338,0.0000090700705,0.001133414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834234,0.000119169476,0.00021334844,0.00090274314,0.00011236285,0.00031001307],"domain_scores_gemma":[0.9987648,0.00018971674,0.00018206082,0.00062077836,0.0001251831,0.00011745321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029861947,0.00022824513,0.00024151591,0.0015852277,0.00009437469,0.00010359046,0.00101091,0.0001808613,0.00001941182],"category_scores_gemma":[0.000068686364,0.00023924907,0.0001490948,0.002258443,0.000044931112,0.00047687916,0.0010385754,0.00029561372,0.00008378564],"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.000017128048,0.00009686053,0.013569761,0.000022583454,0.00003822156,0.00020090831,0.00013975927,0.7651615,0.00016073002,0.21121189,0.00023103236,0.009149627],"study_design_scores_gemma":[0.0008338356,0.000044888773,0.04535818,0.0001409724,0.000018654506,0.0000041317858,0.000015027576,0.79256856,0.00046110104,0.15915348,0.0008660297,0.00053512777],"about_ca_topic_score_codex":0.00005789782,"about_ca_topic_score_gemma":0.000066095614,"teacher_disagreement_score":0.63595307,"about_ca_system_score_codex":0.00015644297,"about_ca_system_score_gemma":0.00013964834,"threshold_uncertainty_score":0.9756294},"labels":[],"label_agreement":null},{"id":"W2951279353","doi":"10.48550/arxiv.1809.10531","title":"Closest-Pair Queries in Fat Rectangles","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Rectangle; Combinatorics; Binary logarithm; Mathematics; Data structure; Set (abstract data type); Range (aeronautics); Time complexity; Range query (database); Plane (geometry); Log-log plot; Discrete mathematics; Computer science; Sargable; Geometry; Search engine; Information retrieval","score_opus":0.06901978753838377,"score_gpt":0.19126772434390446,"score_spread":0.1222479368055207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951279353","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.5220338,0.00008366084,0.4742459,0.0001764454,0.0008293898,0.00016524357,0.000006349101,0.0001649352,0.0022942454],"genre_scores_gemma":[0.9918487,0.0000732439,0.0062721893,0.000107781285,0.00020227506,0.0000011864382,0.000027809778,0.000008758687,0.0014580279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985178,0.00014805076,0.00017866681,0.00082923786,0.00009035263,0.00023585555],"domain_scores_gemma":[0.9988694,0.00010402982,0.00014336286,0.0006350434,0.0001641533,0.00008398925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021146322,0.0002143772,0.00021619716,0.0004086556,0.000106592226,0.00011449452,0.00096679275,0.00020083103,0.000028534421],"category_scores_gemma":[0.000052899377,0.00025759754,0.000108680375,0.00084114424,0.000085974374,0.0004063933,0.0011392471,0.0002928012,0.00009936659],"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.000055876608,0.00020172169,0.010139806,0.00009955643,0.00006534052,0.00038264852,0.0008233348,0.46106002,0.0001164667,0.5187302,0.0038007388,0.004524241],"study_design_scores_gemma":[0.0005238224,0.00012486041,0.009182115,0.0001461592,0.000023002853,0.0000084317135,0.0000641842,0.70687515,0.0012558714,0.2746194,0.0064684856,0.0007085433],"about_ca_topic_score_codex":0.000109051725,"about_ca_topic_score_gemma":0.0002188317,"teacher_disagreement_score":0.46981493,"about_ca_system_score_codex":0.00017753556,"about_ca_system_score_gemma":0.00018982642,"threshold_uncertainty_score":0.9999876},"labels":[],"label_agreement":null},{"id":"W2951404224","doi":"","title":"Genus, Treewidth, and Local Crossing Number","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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 Ottawa","funders":"","keywords":"Treewidth; Combinatorics; Mathematics; 1-planar graph; Partial k-tree; Clique-sum; Vertex (graph theory); Planar graph; Graph; Tree-depth; Pathwidth; Upper and lower bounds; Discrete mathematics; Chordal graph; Line graph; Mathematical analysis","score_opus":0.07642809829201305,"score_gpt":0.20763978648381803,"score_spread":0.13121168819180498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951404224","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.30558705,0.000090002926,0.6919547,0.000054379052,0.0003935379,0.00007999847,0.0000048476854,0.00009168961,0.001743814],"genre_scores_gemma":[0.9928677,0.000022945798,0.005237586,0.00012393469,0.000121302306,3.584015e-7,0.000017978484,0.000008149506,0.0016000225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987486,0.00008578876,0.00013168748,0.00073664583,0.000094641226,0.00020265793],"domain_scores_gemma":[0.9989853,0.00005458679,0.00011836158,0.0004598197,0.0001999741,0.00018198005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023626955,0.00019333848,0.00018737922,0.00012550151,0.00021267237,0.00035867916,0.0005418484,0.00017865848,0.000015822221],"category_scores_gemma":[0.000018706685,0.00022922263,0.000070679016,0.0003904938,0.00014879531,0.00037772415,0.0012333741,0.0002749794,0.000077132005],"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.000024148156,0.00007520584,0.0029974212,0.000055923916,0.00006434248,0.00024358614,0.00055780925,0.79137653,0.000016800379,0.17679441,0.0020924555,0.025701376],"study_design_scores_gemma":[0.0003826824,0.000021339121,0.0014096639,0.000030897194,0.000026713298,0.000025583973,0.000029055278,0.90442127,0.00006152614,0.08749276,0.005774834,0.00032364848],"about_ca_topic_score_codex":0.00007651407,"about_ca_topic_score_gemma":0.000028881464,"teacher_disagreement_score":0.68728065,"about_ca_system_score_codex":0.00014087971,"about_ca_system_score_gemma":0.00037178927,"threshold_uncertainty_score":0.93474275},"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":"W2951681033","doi":"10.48550/arxiv.0805.1401","title":"Approximation Algorithms for Shortest Descending Paths in Terrains","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Algorithm; Computer science; Terrain; Geography; Cartography","score_opus":0.1028770499663755,"score_gpt":0.30734998029018573,"score_spread":0.20447293032381023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951681033","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.30269545,0.00010766776,0.695103,0.00031947452,0.0009347429,0.00052158843,0.000010275051,0.00010667656,0.00020113534],"genre_scores_gemma":[0.8810919,0.00007800277,0.11756062,0.00018194034,0.00043393497,0.00023672007,0.00026036275,0.000017137332,0.00013938223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822736,0.00006351394,0.00044118965,0.00070978736,0.00026045446,0.00029772258],"domain_scores_gemma":[0.9989899,0.00013707149,0.00019739107,0.00045975563,0.00014133645,0.000074563424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039968686,0.0002399547,0.00026800807,0.00036643998,0.00014963058,0.00011573923,0.00063404045,0.0001993469,0.000003113546],"category_scores_gemma":[0.00012394245,0.0002624073,0.00012595468,0.00039360832,0.000027757882,0.0003524326,0.0004704424,0.00031283,0.00001921239],"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.0000411241,0.0011157303,0.17858995,0.00058012165,0.00015746968,0.00011139213,0.009967155,0.31802177,0.0047244895,0.014039231,0.0031993284,0.46945223],"study_design_scores_gemma":[0.00042375064,0.00005933497,0.10769761,0.000120588025,0.000008892611,0.000020065972,0.000022890965,0.88383204,0.0020168202,0.0041011055,0.0012634628,0.00043345583],"about_ca_topic_score_codex":0.000023703371,"about_ca_topic_score_gemma":0.000017318831,"teacher_disagreement_score":0.57839644,"about_ca_system_score_codex":0.00016834811,"about_ca_system_score_gemma":0.0002224474,"threshold_uncertainty_score":0.99998283},"labels":[],"label_agreement":null},{"id":"W2951690324","doi":"10.5281/zenodo.8288791","title":"Perfect Delaunay Polytopes in Low Dimensions","year":2007,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Queen's University","funders":"","keywords":"Delaunay triangulation; Polytope; Combinatorics; Mathematics; Geometry","score_opus":0.022404024497686293,"score_gpt":0.2468800445071805,"score_spread":0.2244760200094942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951690324","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.15815264,0.00015279496,0.79569507,0.0009493382,0.00025437915,0.0003478228,0.000013750575,0.0007476756,0.04368656],"genre_scores_gemma":[0.9950263,0.000019774436,0.0039114123,0.00022823234,0.00008846731,1.583421e-8,0.0001714231,0.00019369631,0.000360678],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986851,0.00015879859,0.0002163207,0.00033813214,0.00029797995,0.00030362638],"domain_scores_gemma":[0.9991826,0.00005455737,0.000052468447,0.00031432553,0.00026754235,0.00012850927],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011200148,0.000092250404,0.00008631821,0.00040742455,0.0009720583,0.00044455507,0.00079048245,0.0000410698,0.00065671635],"category_scores_gemma":[0.00030593504,0.000097696764,0.000033930435,0.0011281169,0.00004372604,0.00040116126,0.00072801433,0.00016743438,0.0017278916],"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.00006733491,0.0004950245,0.000044290424,0.00004642633,0.00003102507,0.00010284188,0.003235164,0.0065294956,0.027670594,0.16051655,0.043305937,0.7579553],"study_design_scores_gemma":[0.00086877804,0.00031552656,0.012513194,0.000053342144,0.000005031522,0.00023563026,0.00014867994,0.032926857,0.0073207845,0.0018906866,0.94334716,0.00037430777],"about_ca_topic_score_codex":0.000010689072,"about_ca_topic_score_gemma":0.0000014541985,"teacher_disagreement_score":0.9000412,"about_ca_system_score_codex":0.00010236576,"about_ca_system_score_gemma":0.0000051878874,"threshold_uncertainty_score":0.99904937},"labels":[],"label_agreement":null},{"id":"W2951836815","doi":"10.1007/s00453-017-0305-5","title":"Improved Spanning Ratio for Low Degree Plane Spanners","year":2017,"lang":"en","type":"article","venue":"Algorithmica","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":"Carleton University","funders":"","keywords":"Spanner; Degree (music); Combinatorics; Plane (geometry); Mathematics; Graph; Spanning tree; Theory of computation; Approx; Discrete mathematics; Computer science; Algorithm; Physics; Geometry; Distributed computing","score_opus":0.034622320597333035,"score_gpt":0.2812098634081065,"score_spread":0.24658754281077347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951836815","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.006089964,0.00004062142,0.99016654,0.0017586985,0.0009671841,0.00024343727,0.000009236904,0.00008219121,0.00064209494],"genre_scores_gemma":[0.6173879,0.0000041659255,0.37955773,0.0003416004,0.00076737185,0.00005911786,0.00004827281,0.000011977572,0.0018219085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991276,0.000014340211,0.00016091166,0.00032597082,0.00014234112,0.0002287839],"domain_scores_gemma":[0.99901485,0.00009377551,0.00014818214,0.00053716596,0.00012606238,0.00007998255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021176244,0.0001118317,0.00011950759,0.00006980593,0.0006255551,0.00044136672,0.0007492926,0.000051612406,0.000006016327],"category_scores_gemma":[0.00013697402,0.00011065492,0.00006201839,0.00006634326,0.00003285769,0.0005891701,0.00014688133,0.000068732945,0.000021571093],"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.000023018622,0.00006842681,0.000058488433,0.000026282882,0.00006583437,0.000010372882,0.00030250184,0.0017390006,0.01619946,0.035248052,0.005066348,0.9411922],"study_design_scores_gemma":[0.00066595734,0.000111362075,0.0028144098,0.000013164219,0.00000919916,0.000013147204,0.00000822737,0.95991397,0.02589946,0.0035790312,0.006757522,0.00021453464],"about_ca_topic_score_codex":0.000023423008,"about_ca_topic_score_gemma":0.000007711078,"teacher_disagreement_score":0.958175,"about_ca_system_score_codex":0.000024481891,"about_ca_system_score_gemma":0.000087386245,"threshold_uncertainty_score":0.48113272},"labels":[],"label_agreement":null},{"id":"W2951850611","doi":"","title":"Time-Space Trade-offs for Triangulating a Simple Polygon","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Simple polygon; Diagonal; Combinatorics; Polygon (computer graphics); Partition (number theory); Workspace; Simple (philosophy); Mathematics; Path (computing); Polygon covering; Space (punctuation); Point (geometry); Shortest path problem; SIMPLE algorithm; Algorithm; Monotone polygon; Computer science; Graph; Geometry; Artificial intelligence; Physics","score_opus":0.0924171337344036,"score_gpt":0.2158240879709775,"score_spread":0.12340695423657388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951850611","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.112096086,0.00008002015,0.8852116,0.0003603597,0.00047749135,0.0004910491,0.000033057247,0.00021354319,0.0010368135],"genre_scores_gemma":[0.98352057,0.0000073889137,0.012598346,0.000111059664,0.0003009552,0.0000027595647,0.00014307087,0.000016996077,0.0032988666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984294,0.00011187118,0.00019942167,0.0008527315,0.00011202542,0.00029455047],"domain_scores_gemma":[0.99857247,0.00021532178,0.00024532992,0.0006098717,0.00017663396,0.0001803591],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044680748,0.00024710837,0.0002883629,0.0002721107,0.00018052469,0.00013966087,0.0008741953,0.00021389873,0.00001570217],"category_scores_gemma":[0.000104097206,0.00029905868,0.00021342064,0.00059002265,0.000038188293,0.00033787978,0.00067370076,0.00023237824,0.000042665117],"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.000048692902,0.00007111641,0.000040004117,0.000048170125,0.00006210384,0.00002468138,0.000358136,0.9105508,0.0001898515,0.07898329,0.005815335,0.0038078113],"study_design_scores_gemma":[0.0007719925,0.00007669644,0.0000991898,0.00002238521,0.0000397987,0.0000033048764,0.000029315564,0.9224376,0.0002610388,0.07111226,0.0048253764,0.00032101423],"about_ca_topic_score_codex":0.000027754451,"about_ca_topic_score_gemma":0.000010554953,"teacher_disagreement_score":0.87261325,"about_ca_system_score_codex":0.00019956127,"about_ca_system_score_gemma":0.00039263908,"threshold_uncertainty_score":0.9999462},"labels":[],"label_agreement":null},{"id":"W2951975964","doi":"10.48550/arxiv.math/0202114","title":"On Finite-Dimensional Maps II","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","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":"Nipissing University","funders":"","keywords":"Geography; Geology","score_opus":0.050540099523818514,"score_gpt":0.2572013214427319,"score_spread":0.20666122191891337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951975964","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.84767115,0.00041827877,0.13742137,0.003482803,0.0044511613,0.0003415091,0.000034617846,0.00035615356,0.0058229594],"genre_scores_gemma":[0.97711354,0.000020985755,0.011108602,0.0020975433,0.0005223227,0.000035451598,0.00015227143,0.00001657578,0.008932725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980658,0.00008411745,0.0003148145,0.0007816698,0.0004919438,0.0002616096],"domain_scores_gemma":[0.99851096,0.00027618228,0.00016759934,0.0007669377,0.00016036183,0.00011797642],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000224394,0.00027380695,0.00022883902,0.00025383307,0.00028081515,0.000097165714,0.00077604817,0.00020837634,0.00018627805],"category_scores_gemma":[0.0001052643,0.00027274436,0.00015103354,0.00031434844,0.000028959766,0.00015056157,0.0014174675,0.0005263716,0.00095509505],"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.000025558758,0.0007369374,0.0033738692,0.00008916076,0.00013275324,0.00011173601,0.00080391736,0.814722,0.0005311436,0.061581396,0.09750752,0.020384032],"study_design_scores_gemma":[0.001320637,0.00068340666,0.045899052,0.0003879992,0.00004482569,0.000042860127,0.0000070188985,0.73205376,0.0051616468,0.107318886,0.10512829,0.0019516171],"about_ca_topic_score_codex":0.00001170169,"about_ca_topic_score_gemma":0.0000027969074,"teacher_disagreement_score":0.12944236,"about_ca_system_score_codex":0.00007162679,"about_ca_system_score_gemma":0.00012239498,"threshold_uncertainty_score":0.99997246},"labels":[],"label_agreement":null},{"id":"W2952056800","doi":"","title":"The Price of Order","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Combinatorics; Vertex (graph theory); Mathematics; Disjoint sets; Order (exchange); Graph; Discrete mathematics","score_opus":0.05095069383361098,"score_gpt":0.18066504255536403,"score_spread":0.12971434872175305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952056800","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.038190413,0.000090376256,0.95594513,0.0003457759,0.00060827244,0.000119139695,0.00000429534,0.00005017007,0.0046464275],"genre_scores_gemma":[0.99424505,0.00012645505,0.0017017993,0.000038116257,0.00006991322,4.2885267e-7,0.0000030085148,0.000004089285,0.003811154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917674,0.00008139319,0.00012769672,0.0003926121,0.00007934816,0.00014218522],"domain_scores_gemma":[0.9985615,0.00023646675,0.00019453473,0.00064213364,0.00031612933,0.00004923137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023057415,0.000111970476,0.00011266048,0.00009498978,0.00014209913,0.000050038514,0.0011281217,0.00008788687,0.000008705144],"category_scores_gemma":[0.000052404346,0.00008355098,0.000082882936,0.0004799529,0.000065677275,0.00015685086,0.0010044641,0.00013661897,0.00003332126],"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.000009513163,0.000024769233,0.0001519079,0.00001587012,0.000040550458,0.00000948825,0.000055452434,0.08881923,0.0000800762,0.9064647,0.00053643185,0.0037920224],"study_design_scores_gemma":[0.0003831888,0.00004891012,0.0020426146,0.00006475845,0.000026047965,0.0000033743552,0.000017608556,0.5583551,0.0009770076,0.4234021,0.014363685,0.0003155808],"about_ca_topic_score_codex":0.000008644576,"about_ca_topic_score_gemma":0.000005881474,"teacher_disagreement_score":0.9560546,"about_ca_system_score_codex":0.000050881506,"about_ca_system_score_gemma":0.0002285536,"threshold_uncertainty_score":0.340711},"labels":[],"label_agreement":null},{"id":"W2952076588","doi":"10.1007/s00453-019-00611-7","title":"Weak Coverage of a Rectangular Barrier","year":2019,"lang":"en","type":"article","venue":"Algorithmica","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; Concordia University; University of British Columbia; University of Ottawa; Carleton University","funders":"","keywords":"Rectangle; Minimax; Homogeneous; Combinatorics; Metric (unit); Mathematics; Theory of computation; Position (finance); Heuristic; Integer programming; Algorithm; Geometry; Mathematical optimization","score_opus":0.005442089762581016,"score_gpt":0.21502248222305528,"score_spread":0.20958039246047427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952076588","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.13740118,0.00014093872,0.8531607,0.00024768154,0.000679316,0.00016231241,0.0000054175302,0.00006111834,0.008141339],"genre_scores_gemma":[0.92479455,0.0000067466053,0.07312104,0.00019887954,0.00008495872,0.000004406088,0.000007803891,0.000005164835,0.0017764453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993591,0.000024889554,0.00013322935,0.00018580562,0.00019429208,0.0001027345],"domain_scores_gemma":[0.9995018,0.00006868647,0.00005315875,0.0002642764,0.000072287956,0.000039741895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001287897,0.00006010572,0.00009634909,0.000080587735,0.000021393733,0.000022941751,0.00025766593,0.000031876312,0.000073173],"category_scores_gemma":[0.000024425795,0.00005872965,0.000047713907,0.0003148479,0.000007654547,0.00020114843,0.000079901874,0.000048869362,0.0001130796],"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.000021201358,0.00019452337,0.0012731955,0.00005981458,0.00010361949,0.000013494147,0.00063721975,0.008501774,0.08391679,0.34181228,0.0046741017,0.558792],"study_design_scores_gemma":[0.0010893674,0.00036889268,0.008714337,0.00003829824,0.000011622041,0.0000462154,0.000015598078,0.7255351,0.11264251,0.018504575,0.13260074,0.0004327445],"about_ca_topic_score_codex":0.000007764666,"about_ca_topic_score_gemma":3.811819e-7,"teacher_disagreement_score":0.7873934,"about_ca_system_score_codex":0.000013629341,"about_ca_system_score_gemma":0.000055921442,"threshold_uncertainty_score":0.23949257},"labels":[],"label_agreement":null},{"id":"W2952269279","doi":"10.48550/arxiv.0801.4013","title":"Spanners of Additively Weighted Point Sets","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Point (geometry); Mathematics; Combinatorics; Computer science; Geometry","score_opus":0.042275667128379525,"score_gpt":0.26614891033549665,"score_spread":0.22387324320711713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952269279","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.7729602,0.00030455767,0.22187501,0.00085686165,0.0012753138,0.00025349105,0.000050908497,0.00014227354,0.0022814195],"genre_scores_gemma":[0.97183573,0.00018576755,0.026787553,0.0002931457,0.00021619287,0.000026268119,0.0001998422,0.0000137605775,0.0004417555],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99823743,0.000102658174,0.00042164957,0.0006185656,0.0003908105,0.00022886347],"domain_scores_gemma":[0.998473,0.0001253543,0.00034548732,0.0006091534,0.00034405664,0.0001029583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019456097,0.00024370068,0.00031740047,0.00026991792,0.0000945265,0.000037008514,0.0007845976,0.00018292665,0.000048401183],"category_scores_gemma":[0.00007258921,0.00024716603,0.0002221775,0.0004147474,0.00006756805,0.00022795364,0.00087006745,0.00034091173,0.00011666786],"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.00029288247,0.0034425093,0.12854412,0.0015691479,0.0030288936,0.0010617082,0.019746989,0.19276105,0.016885232,0.082606465,0.2501921,0.29986888],"study_design_scores_gemma":[0.0015957571,0.00040219066,0.6879998,0.00056343444,0.000100448065,0.00019278524,0.000070704984,0.20174201,0.061789386,0.020287553,0.023247536,0.0020083822],"about_ca_topic_score_codex":0.000040321414,"about_ca_topic_score_gemma":0.0000042236625,"teacher_disagreement_score":0.5594557,"about_ca_system_score_codex":0.00006436927,"about_ca_system_score_gemma":0.00035224535,"threshold_uncertainty_score":0.99999803},"labels":[],"label_agreement":null},{"id":"W2952341250","doi":"10.48550/arxiv.1210.5484","title":"Hamiltonian Tetrahedralizations with Steiner Points","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 British Columbia","funders":"","keywords":"Combinatorics; Convex hull; Mathematics; Tetrahedron; Vertex (graph theory); Hamiltonian (control theory); Regular polygon; Hamiltonian path; Graph; Discrete mathematics; Geometry","score_opus":0.06129525507129696,"score_gpt":0.18044554631221288,"score_spread":0.11915029124091592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952341250","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.10434014,0.000060989463,0.8916074,0.00021719265,0.0004883527,0.00020337659,0.000011217229,0.00019840848,0.0028729325],"genre_scores_gemma":[0.9837396,0.000028281873,0.012857617,0.00016475274,0.00013804292,0.0000012873459,0.000069591086,0.0000141225155,0.002986712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866796,0.00009842366,0.00014454985,0.0006796899,0.00012233423,0.0002870606],"domain_scores_gemma":[0.9985907,0.00005773749,0.00016228021,0.0007722895,0.00023526384,0.00018169335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001560288,0.00024194617,0.0001917112,0.0003012269,0.00018931115,0.00013958494,0.00085648586,0.00015728548,0.00005083677],"category_scores_gemma":[0.000014548406,0.000247663,0.000090975285,0.00087375514,0.00005767021,0.0005719482,0.0007039034,0.00028433945,0.000120618424],"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.000010879977,0.00011485124,0.0034745776,0.000032939693,0.00007566283,0.000053112966,0.00022702549,0.56062555,0.000025295312,0.43406606,0.0004812696,0.0008127829],"study_design_scores_gemma":[0.0009834799,0.00010947284,0.023987481,0.00013019517,0.00015306006,0.000032793923,0.000046690966,0.92136043,0.0003615665,0.043096554,0.008597801,0.001140457],"about_ca_topic_score_codex":0.00003778488,"about_ca_topic_score_gemma":0.000053970063,"teacher_disagreement_score":0.8793994,"about_ca_system_score_codex":0.00012034452,"about_ca_system_score_gemma":0.00023214318,"threshold_uncertainty_score":0.99999756},"labels":[],"label_agreement":null},{"id":"W2952377780","doi":"10.48550/arxiv.1212.1617","title":"Similarity of Polygonal Curves in the Presence of Outliers","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Mathematics; Bounded function; Outlier; Similarity (geometry); Combinatorics; Time complexity; Polynomial; Polygonal chain; Measure (data warehouse); Degree (music); Geometry; Mathematical analysis; Image (mathematics); Computer science; Regular polygon; Physics; Statistics","score_opus":0.09155839867787585,"score_gpt":0.2068731686914268,"score_spread":0.11531477001355095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952377780","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.53356254,0.0005784736,0.46347666,0.00029658581,0.00038354585,0.0002803055,0.000021376902,0.000020511256,0.0013799829],"genre_scores_gemma":[0.9985532,0.00016418818,0.0010555619,0.00008412086,0.000030230412,5.0469913e-7,0.000011855448,0.0000024977394,0.00009780519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989812,0.00022261932,0.00019096183,0.00031784148,0.00014290928,0.00014449678],"domain_scores_gemma":[0.99878997,0.0002527564,0.00023993342,0.0005507314,0.00012675594,0.000039850645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058873935,0.000115868366,0.00018802781,0.00017988143,0.000034815937,0.000013179926,0.0013032352,0.00009356235,0.000011081176],"category_scores_gemma":[0.00006765084,0.00010822766,0.00010586444,0.00065243826,0.00009460301,0.00024681978,0.0006660896,0.0002599948,0.0000024455155],"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.000029849092,0.00039417652,0.019972734,0.00046756302,0.00005726026,0.000021046993,0.0015012689,0.59908605,0.00015469083,0.37665352,0.0006372697,0.0010245432],"study_design_scores_gemma":[0.00060884195,0.00009117375,0.13766922,0.0004996986,0.000091367256,0.0000068134336,0.00021427344,0.7743686,0.0016331639,0.08391438,0.00039806266,0.00050440844],"about_ca_topic_score_codex":0.00011611879,"about_ca_topic_score_gemma":0.000028641942,"teacher_disagreement_score":0.46499068,"about_ca_system_score_codex":0.00003062147,"about_ca_system_score_gemma":0.00016693787,"threshold_uncertainty_score":0.44133958},"labels":[],"label_agreement":null},{"id":"W2952421026","doi":"10.48550/arxiv.0804.1041","title":"On the Stretch Factor of Convex Delaunay Graphs","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Combinatorics; Mathematics; Voronoi diagram; Delaunay triangulation; Dual graph; Weighted Voronoi diagram; Regular polygon; Convex set; Euclidean distance; Euclidean geometry; Convex body; Convex hull; Graph; Planar graph; Geometry; Convex optimization","score_opus":0.06281456578218414,"score_gpt":0.26553117933295006,"score_spread":0.20271661355076592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952421026","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.95443374,0.00014829538,0.042637493,0.0009362011,0.000979917,0.00024097363,0.000018776745,0.000066530345,0.0005380781],"genre_scores_gemma":[0.99792,0.00010286814,0.0011821783,0.0004992845,0.000091203576,0.000022575572,0.000026999642,0.000009134615,0.00014578317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985332,0.00011815041,0.00031541352,0.00045726355,0.00040201045,0.00017397643],"domain_scores_gemma":[0.9982959,0.00038994037,0.00025220765,0.0007972112,0.00020470214,0.000060021976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016282467,0.00020569806,0.00022878632,0.00015248748,0.00012045658,0.000045609297,0.0009890511,0.00014413311,0.00008934274],"category_scores_gemma":[0.00010642178,0.00015239297,0.00017084916,0.0003333811,0.000077402634,0.00009351548,0.00052424177,0.00039714904,0.00007809267],"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.00009252996,0.0012278404,0.19442993,0.0003594859,0.0009320031,0.00009996083,0.00960036,0.06967503,0.0065761106,0.61025417,0.025463201,0.08128939],"study_design_scores_gemma":[0.00080926635,0.00044582697,0.6746042,0.0002973073,0.000046758672,0.000030865016,0.0000567726,0.14597207,0.066803,0.10565688,0.004007034,0.001270023],"about_ca_topic_score_codex":0.000027646334,"about_ca_topic_score_gemma":0.000003821923,"teacher_disagreement_score":0.50459725,"about_ca_system_score_codex":0.000029230825,"about_ca_system_score_gemma":0.00018798948,"threshold_uncertainty_score":0.6214405},"labels":[],"label_agreement":null},{"id":"W2952457607","doi":"10.48550/arxiv.cs/0405112","title":"Really Straight Graph Drawings","year":2004,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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; McGill University","funders":"","keywords":"Graph; Computer science; Graph drawing; Computer graphics (images); Mathematics; Combinatorics","score_opus":0.032486039358693174,"score_gpt":0.26401207838090546,"score_spread":0.23152603902221228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952457607","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.4021508,0.00030768735,0.58927333,0.0015178117,0.0018683283,0.00023785063,0.000007329525,0.0003048926,0.004331955],"genre_scores_gemma":[0.9751523,0.0000624188,0.022348367,0.0007178224,0.0004932572,0.00003168917,0.00009817748,0.000016963571,0.0010790203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9980218,0.00005942414,0.00037449127,0.0008228084,0.0004187359,0.0003027622],"domain_scores_gemma":[0.9985852,0.00005618596,0.00021365687,0.00080237695,0.0002052386,0.00013733761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027885655,0.00028524356,0.00025392877,0.00027819784,0.00017401476,0.00024340786,0.0011452775,0.000231231,0.00004926935],"category_scores_gemma":[0.000045156812,0.00029337074,0.00019129924,0.0004735874,0.000045163222,0.00031608396,0.0009035849,0.00050132634,0.00019845463],"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.000041138548,0.00094861473,0.055113446,0.00066761905,0.0005831633,0.00043669323,0.005037738,0.48705545,0.008410025,0.35494247,0.011359511,0.075404145],"study_design_scores_gemma":[0.0012006559,0.00023179434,0.7157969,0.00045652344,0.000077984434,0.00007571905,0.000018511968,0.014704472,0.010592852,0.23885754,0.016084654,0.0019023828],"about_ca_topic_score_codex":0.00006136092,"about_ca_topic_score_gemma":0.000015321422,"teacher_disagreement_score":0.66068345,"about_ca_system_score_codex":0.000102126956,"about_ca_system_score_gemma":0.00046054114,"threshold_uncertainty_score":0.99995184},"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":"W2952626446","doi":"10.48550/arxiv.1012.5664","title":"Bounds on the maximum multiplicity of some common geometric graphs","year":2010,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"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; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Mathematics; Multiplicity (mathematics); Combinatorics; Discrete mathematics; Geometry","score_opus":0.04330723801176086,"score_gpt":0.1801914841971991,"score_spread":0.13688424618543824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952626446","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.89541477,0.00000799593,0.10278966,0.00019699542,0.00034587758,0.000100915735,0.000003196849,0.00004929439,0.0010913012],"genre_scores_gemma":[0.99898326,0.000009909683,0.00048894616,0.0002238425,0.00003615306,3.740706e-7,0.0000030668489,0.0000037975078,0.00025064527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992577,0.00006139968,0.00011487196,0.00030136094,0.000106418614,0.00015824332],"domain_scores_gemma":[0.99886507,0.0003402339,0.00010714216,0.0005278226,0.00009224092,0.00006749062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002843843,0.00010169282,0.00010977624,0.00037015692,0.00021010442,0.000043740907,0.00077772746,0.00006011258,0.000025045845],"category_scores_gemma":[0.00005722012,0.000086824424,0.00009280856,0.0019463246,0.00008939158,0.00034697689,0.00017077547,0.00021690909,0.00004471556],"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.000011991492,0.000112240894,0.0032041888,0.000003963125,0.00001560888,0.00000876748,0.00004478996,0.016184025,0.0018049413,0.97525907,0.00019754794,0.0031528766],"study_design_scores_gemma":[0.00080475677,0.0002532607,0.065577485,0.000011031134,0.00002332036,0.000008096862,0.000039384424,0.485079,0.018949497,0.42659155,0.0023123058,0.0003503488],"about_ca_topic_score_codex":0.00005191535,"about_ca_topic_score_gemma":0.000034914134,"teacher_disagreement_score":0.54866755,"about_ca_system_score_codex":0.000019710707,"about_ca_system_score_gemma":0.0000403807,"threshold_uncertainty_score":0.35405973},"labels":[],"label_agreement":null},{"id":"W2952746235","doi":"10.1007/s00454-021-00355-8","title":"Circumscribing Polygons and Polygonizations for Disjoint Line Segments","year":2022,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Mathematics; Combinatorics; Disjoint sets; Star-shaped polygon; Rectilinear polygon; Polygon (computer graphics); Polygon covering; Line segment; Diagonal; Monotone polygon; Conjecture; Simple polygon; Discrete mathematics; Geometry; Regular polygon; Convex set","score_opus":0.01887991619814172,"score_gpt":0.26261876149551594,"score_spread":0.24373884529737422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952746235","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.053865235,0.00045485457,0.9415022,0.0026063835,0.0005779368,0.00042209716,0.00021314977,0.00014824004,0.0002098872],"genre_scores_gemma":[0.90543884,0.000005528072,0.09207516,0.0009505207,0.0001452471,0.00016594342,0.00084139244,0.00001975029,0.0003576124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997999,0.00009725368,0.00039696097,0.00059037353,0.000590998,0.00032538205],"domain_scores_gemma":[0.99884015,0.00040143018,0.00016322105,0.00024525222,0.00019569507,0.00015426747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042042544,0.0001985822,0.0001965906,0.00055959733,0.0012585032,0.00023338526,0.0004374002,0.00003415086,0.00007034618],"category_scores_gemma":[0.000101393634,0.00022756541,0.00010811368,0.0014131803,0.000050103845,0.00047017896,0.0005876101,0.0001683247,0.0000075293956],"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.00002157703,0.00015496908,0.0010800593,0.000027105469,0.000076368684,0.0000047261597,0.00050946366,0.7243386,0.0005048463,0.24923454,0.0012890028,0.022758765],"study_design_scores_gemma":[0.0009880959,0.00026058656,0.011659132,0.00000965917,0.000023377921,0.000085557826,0.00017185917,0.92972416,0.00016398921,0.05121887,0.0053003794,0.0003943207],"about_ca_topic_score_codex":0.0000119014585,"about_ca_topic_score_gemma":0.0000014843848,"teacher_disagreement_score":0.8515736,"about_ca_system_score_codex":0.00011192214,"about_ca_system_score_gemma":0.000181011,"threshold_uncertainty_score":0.96795166},"labels":[],"label_agreement":null},{"id":"W2952809384","doi":"10.48550/arxiv.1012.1240","title":"Tight lower bounds for the size of epsilon-nets","year":2010,"lang":"en","type":"preprint","venue":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Dimension (graph theory); Inverse; Omega; Euclidean space; Range (aeronautics); Space (punctuation); Upper and lower bounds; Bounded function; Function (biology); Euclidean geometry; Mathematical analysis; Geometry; Physics","score_opus":0.02044931827025209,"score_gpt":0.253747759086752,"score_spread":0.23329844081649992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952809384","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.65735036,0.012696653,0.010172772,0.27985042,0.018077368,0.007597953,0.00054489844,0.00044848616,0.013261076],"genre_scores_gemma":[0.94606876,0.00022566236,0.043988183,0.0020935356,0.00070277485,0.000056109027,0.0000043523346,0.000052452833,0.0068081636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99431825,0.00058583956,0.0018378635,0.0010446272,0.0017000881,0.0005133613],"domain_scores_gemma":[0.99286544,0.0023015006,0.0034766262,0.0011375113,0.00006436705,0.000154565],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014711829,0.00053205417,0.00088391616,0.0003125704,0.00092714146,0.00024614672,0.015350995,0.00096375035,0.00003794049],"category_scores_gemma":[0.00023800037,0.00030989584,0.0011325795,0.0016941746,0.00299915,0.0031170014,0.007104809,0.0020021829,0.0000013817322],"study_design_candidate":"bench_or_experimental","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.0005758451,0.0010200652,0.0122761205,0.0025516732,0.001180513,0.0000014301922,0.0030832132,0.10023746,0.21906555,0.54588217,0.1048974,0.009228558],"study_design_scores_gemma":[0.0005647918,0.00018649606,0.06649945,0.0008921474,0.00019667641,0.000044159344,0.00003302426,0.052763212,0.7116002,0.13324146,0.03340526,0.00057312474],"about_ca_topic_score_codex":0.000009906701,"about_ca_topic_score_gemma":1.3945858e-7,"teacher_disagreement_score":0.49253464,"about_ca_system_score_codex":0.000017559465,"about_ca_system_score_gemma":0.0010880668,"threshold_uncertainty_score":0.9999353},"labels":[],"label_agreement":null},{"id":"W2952863744","doi":"10.1007/s004530010078","title":"Circular Separability of Polygons","year":2001,"lang":"en","type":"preprint","venue":"Algorithmica","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":"Université du Québec en Outaouais","funders":"","keywords":"Polygon (computer graphics); Separable space; Combinatorics; Regular polygon; Mathematics; Point (geometry); Line (geometry); Planar; Set (abstract data type); Line segment; Convex set; Computer science; Geometry; Mathematical analysis; Convex optimization; Computer graphics (images)","score_opus":0.019312491417049823,"score_gpt":0.26891320208100056,"score_spread":0.24960071066395073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952863744","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.030502006,0.00056969456,0.9653507,0.00066910574,0.0010130855,0.00022746068,0.000020058465,0.00010866005,0.0015392457],"genre_scores_gemma":[0.8653436,0.000037948794,0.13392192,0.00012457071,0.00028172872,0.000026595611,0.000060334038,0.0000096413405,0.00019370523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841946,0.00009824708,0.00037207076,0.000557849,0.00036334645,0.00018902899],"domain_scores_gemma":[0.9985062,0.000072506526,0.00020263788,0.000906027,0.00023018182,0.00008243544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003235529,0.00017873694,0.00028147208,0.00017285315,0.00005748392,0.000065121305,0.00088667736,0.00017474015,0.000025671825],"category_scores_gemma":[0.000055151217,0.00019152267,0.00018312527,0.0003997394,0.00004885902,0.00011802344,0.0008722158,0.00027998173,0.000023512472],"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.000019528195,0.0011989217,0.0009896116,0.0006781768,0.00042445227,0.00008648155,0.0014585052,0.12877005,0.0032634127,0.073773414,0.0047704666,0.784567],"study_design_scores_gemma":[0.00037622455,0.000096265176,0.007675031,0.00010283104,0.000048788326,0.00005747338,0.000009619334,0.7607206,0.012547119,0.20689407,0.010808928,0.0006630148],"about_ca_topic_score_codex":0.0000703029,"about_ca_topic_score_gemma":0.0000018669734,"teacher_disagreement_score":0.83484155,"about_ca_system_score_codex":0.000057862253,"about_ca_system_score_gemma":0.0003004876,"threshold_uncertainty_score":0.78100675},"labels":[],"label_agreement":null},{"id":"W2952886233","doi":"10.48550/arxiv.cs/0512001","title":"Which n-Venn diagrams can be drawn with convex k-gons?","year":2005,"lang":"en","type":"preprint","venue":"ArXiv.org","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 Victoria","funders":"","keywords":"Venn diagram; Diagram; Simple (philosophy); Quadrilateral; Mathematics; Regular polygon; Combinatorics; Discrete mathematics; Geometry; Physics; Statistics; Thermodynamics","score_opus":0.036472966220559504,"score_gpt":0.2607949740243243,"score_spread":0.22432200780376477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952886233","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.7738967,0.0002486691,0.21342902,0.009157358,0.0010920882,0.00038310658,0.0000170556,0.0002719442,0.0015040794],"genre_scores_gemma":[0.98245853,0.000044430733,0.01353314,0.0013831442,0.0008039724,0.00008707972,0.0002015578,0.000025350315,0.0014627913],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99762416,0.000111792724,0.00036896422,0.0009695959,0.00051945733,0.00040603912],"domain_scores_gemma":[0.99796724,0.00012571718,0.00025649375,0.0010251099,0.00041933698,0.00020607149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032006387,0.00037457971,0.00036156378,0.00020382353,0.00028836523,0.00044868837,0.001099102,0.00023763877,0.00005242568],"category_scores_gemma":[0.00006654802,0.00034320046,0.00010146196,0.0006790486,0.000084013955,0.0002631006,0.0008597238,0.00062647084,0.00011804268],"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.00011145963,0.0013122862,0.4596362,0.000491772,0.00097614696,0.00022171895,0.0113256,0.34002736,0.0019827823,0.04981381,0.015088672,0.11901217],"study_design_scores_gemma":[0.00207984,0.00056974863,0.7292924,0.00044139463,0.00017621412,0.0001657217,0.00009779967,0.15387172,0.012206318,0.0059143677,0.09215121,0.0030333002],"about_ca_topic_score_codex":0.00016411091,"about_ca_topic_score_gemma":0.0011761172,"teacher_disagreement_score":0.26965615,"about_ca_system_score_codex":0.00012565775,"about_ca_system_score_gemma":0.0008636298,"threshold_uncertainty_score":0.999902},"labels":[],"label_agreement":null},{"id":"W2952903853","doi":"10.48550/arxiv.1206.0514","title":"Simultaneous Embeddings with Vertices Mapping to Pre-Specified Points","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Combinatorics; Planar graph; Mathematics; Vertex (graph theory); Piecewise linear function; Embedding; Planar; Upper and lower bounds; Piecewise; Book embedding; Random graph; Graph; Discrete mathematics; 1-planar graph; Geometry; Chordal graph; Computer science; Mathematical analysis","score_opus":0.06647366577109444,"score_gpt":0.19666673550964675,"score_spread":0.13019306973855233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952903853","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.3690383,0.000029752899,0.6290994,0.00013185634,0.00036125485,0.00023853821,0.0000038778917,0.00014475128,0.0009522119],"genre_scores_gemma":[0.97724944,0.000015726862,0.020729305,0.0002425793,0.00017321244,0.0000015800548,0.000016888516,0.000014005723,0.0015572694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998334,0.000080077596,0.0001737565,0.0008900736,0.0001579071,0.00036421802],"domain_scores_gemma":[0.99841166,0.00020864792,0.00017339007,0.0006940306,0.0002448921,0.0002673945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020694348,0.0002755443,0.00024243802,0.0003441244,0.00017432147,0.00019210891,0.0010883794,0.00014674007,0.000031959476],"category_scores_gemma":[0.000051427152,0.00029379147,0.00008600038,0.0008587263,0.000033723612,0.00047036193,0.0011574513,0.00030264593,0.00015684229],"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.00008809331,0.00007535986,0.0003034103,0.000046773053,0.00006601852,0.00012015623,0.0011933863,0.9546454,0.00009760416,0.040968105,0.0001577191,0.0022379921],"study_design_scores_gemma":[0.00044311138,0.00010379196,0.0031876017,0.0001536176,0.000052973155,0.000016777112,0.000087951186,0.9820078,0.00060796796,0.007228594,0.0053926567,0.0007171593],"about_ca_topic_score_codex":0.00003889686,"about_ca_topic_score_gemma":0.000022971011,"teacher_disagreement_score":0.6083701,"about_ca_system_score_codex":0.00017715177,"about_ca_system_score_gemma":0.00013385572,"threshold_uncertainty_score":0.9999514},"labels":[],"label_agreement":null},{"id":"W2952934260","doi":"10.48550/arxiv.cs/0604008","title":"Minimum-Cost Coverage of Point Sets by Disks","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"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; Ames Research Center; National Aeronautics and Space Administration; National Science Foundation","keywords":"Point (geometry); Computer science; Mathematics; Geometry","score_opus":0.029929736766341412,"score_gpt":0.27216282717818446,"score_spread":0.24223309041184304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952934260","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.612681,0.00027986398,0.38360116,0.00061397586,0.0008435302,0.0002668236,0.0000782297,0.000070511676,0.0015649148],"genre_scores_gemma":[0.9930163,0.00004667559,0.004974627,0.00033158928,0.00016198329,0.000035256893,0.00048562934,0.0000142616545,0.0009336932],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9981801,0.00008875322,0.00047526098,0.0006333688,0.00038366686,0.00023885496],"domain_scores_gemma":[0.9985602,0.00012294734,0.00033797667,0.00071984157,0.00017270779,0.0000863184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025963635,0.0002539381,0.00031210366,0.00014931525,0.00007926878,0.0000927769,0.0007975075,0.00018837297,0.000027554794],"category_scores_gemma":[0.000048664602,0.0002627712,0.00016048315,0.00028776794,0.000040167382,0.00021675133,0.00084361335,0.00031224097,0.00007044121],"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.00008848482,0.0020907284,0.25557932,0.0008928899,0.00044475545,0.00011457081,0.001998313,0.19580266,0.018196838,0.009623309,0.29823697,0.21693116],"study_design_scores_gemma":[0.002059869,0.00029373565,0.7280436,0.0003734118,0.0000967124,0.0000334167,0.000015924827,0.14792229,0.050438423,0.021191321,0.04754319,0.001988105],"about_ca_topic_score_codex":0.00012314231,"about_ca_topic_score_gemma":0.000012391411,"teacher_disagreement_score":0.47246426,"about_ca_system_score_codex":0.00006866697,"about_ca_system_score_gemma":0.00017021946,"threshold_uncertainty_score":0.9999825},"labels":[],"label_agreement":null},{"id":"W2952959227","doi":"10.1137/1.9781611973730.106","title":"Compatible Connectivity-Augmentation of Planar Disconnected Graphs","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Planar graph; Vertex (graph theory); Morphing; Upper and lower bounds; Planar; Mathematics; Graph; Discrete mathematics; Computer science; Computer graphics (images)","score_opus":0.02246285873730274,"score_gpt":0.26784171246039973,"score_spread":0.24537885372309698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952959227","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.16343266,0.000059232534,0.8329384,0.00036363647,0.00079472247,0.00027009135,0.000013642275,0.00013017797,0.0019974813],"genre_scores_gemma":[0.92134815,0.000010275786,0.077999294,0.00016243722,0.00006338998,0.000025978203,0.0002621005,0.000007310503,0.000121069854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984079,0.00017588303,0.00040164648,0.0004974002,0.00036791497,0.00014926246],"domain_scores_gemma":[0.9985394,0.00029258124,0.00034841007,0.0005295908,0.00022447226,0.000065568216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034427922,0.00019834974,0.00033077342,0.00035840392,0.0000755118,0.000114304916,0.00058275065,0.000121917845,0.00003472639],"category_scores_gemma":[0.000052263076,0.00019149079,0.00012025365,0.00037743794,0.000034353576,0.0002102157,0.00033774602,0.00019192624,0.000015458068],"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.0000204878,0.00021373302,0.00086393865,0.00023290052,0.00012091469,0.000002014585,0.0005642583,0.086136036,0.0029795514,0.8896324,0.0029692957,0.016264472],"study_design_scores_gemma":[0.00077138486,0.00017950484,0.0132295815,0.000108772765,0.00003212015,0.000006865577,0.000028936092,0.667638,0.023160413,0.29390672,0.00044140764,0.0004962795],"about_ca_topic_score_codex":0.0001390187,"about_ca_topic_score_gemma":0.000058331105,"teacher_disagreement_score":0.7579155,"about_ca_system_score_codex":0.000033032888,"about_ca_system_score_gemma":0.00012844604,"threshold_uncertainty_score":0.78087676},"labels":[],"label_agreement":null},{"id":"W29530736","doi":"10.1007/978-3-642-41905-8_10","title":"Globally Rigid Ball-Polyhedra in Euclidean 3-Space","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Calgary","funders":"","keywords":"Polyhedron; Ball (mathematics); Regular polygon; Rigidity (electromagnetism); Euclidean space; Euclidean geometry; Convex body; Mathematics; Combinatorics; Computer science; Geometry; Convex optimization; Physics","score_opus":0.01262976441198229,"score_gpt":0.23869491168733967,"score_spread":0.22606514727535737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29530736","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.00045636197,0.00059566775,0.98170996,0.0021852131,0.0020899584,0.0005025056,0.0000040475993,0.00015103247,0.012305261],"genre_scores_gemma":[0.24519336,0.000086191496,0.7468573,0.0040286058,0.0010248179,0.000026427204,0.000023233732,0.000051336792,0.0027087044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533856,0.000060294253,0.0006906167,0.0017698575,0.001362279,0.00077836774],"domain_scores_gemma":[0.9974951,0.00044566536,0.0003020873,0.0011946791,0.00032497587,0.00023749757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010250972,0.0005886862,0.00054909574,0.0013260719,0.00020233636,0.00097093283,0.0034864368,0.00035280344,0.000091273345],"category_scores_gemma":[0.00012257976,0.00057520956,0.00013778901,0.0013750264,0.0003586304,0.0011153312,0.0013816062,0.0007806759,0.0003069375],"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.000005325299,0.00005270705,0.000090798814,0.000030212674,0.000010099439,0.00010713421,0.00045130518,0.1779006,0.00020736502,0.16606255,0.00024053504,0.65484136],"study_design_scores_gemma":[0.00042968543,0.00017392988,0.0009739462,0.00031384613,0.0000050574326,0.000119068915,1.7393624e-7,0.6960709,0.00071731396,0.29273576,0.007546039,0.00091429806],"about_ca_topic_score_codex":0.00008190601,"about_ca_topic_score_gemma":0.00025109798,"teacher_disagreement_score":0.6539271,"about_ca_system_score_codex":0.0004989768,"about_ca_system_score_gemma":0.00084289897,"threshold_uncertainty_score":0.9996699},"labels":[],"label_agreement":null},{"id":"W2953144065","doi":"10.48550/arxiv.1404.6233","title":"Towards Tight Bounds on Theta-Graphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Combinatorics; Mathematics; Upper and lower bounds; Disjoint sets; Vertex (graph theory); Matching (statistics); Discrete mathematics; Indifference graph; Graph","score_opus":0.06320896069905092,"score_gpt":0.19057531717368315,"score_spread":0.12736635647463224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953144065","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.16082714,0.000041063944,0.8143972,0.00032138557,0.0014187081,0.0001863239,0.000008209094,0.0002481631,0.02255176],"genre_scores_gemma":[0.9935927,0.000054380824,0.0020313938,0.00038618414,0.00015895751,0.0000010981714,0.000039942966,0.000011776217,0.0037235583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824,0.00016381616,0.00017191764,0.0009978265,0.00016276704,0.00026369],"domain_scores_gemma":[0.9983701,0.00009413613,0.00018558801,0.0010239297,0.00017568213,0.00015052783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030305295,0.00028572243,0.00026248206,0.00042826522,0.00020713099,0.00020936638,0.0014018018,0.00022511487,0.000044703742],"category_scores_gemma":[0.00002804049,0.00030400726,0.00025211714,0.00065287505,0.00006288297,0.00022566416,0.0009206873,0.00042035652,0.00022892024],"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.00001130978,0.00005739366,0.00007497913,0.000017905695,0.000043856326,0.000034254717,0.0000615572,0.33789727,0.000012796404,0.6580121,0.0010821491,0.0026944457],"study_design_scores_gemma":[0.00030579406,0.000106257925,0.0016169159,0.000042815376,0.000033632565,0.0000037841644,0.0000047380613,0.6124919,0.00029390166,0.37432674,0.010364756,0.0004087224],"about_ca_topic_score_codex":0.000032605356,"about_ca_topic_score_gemma":0.000011033257,"teacher_disagreement_score":0.8327656,"about_ca_system_score_codex":0.00012361228,"about_ca_system_score_gemma":0.00022922321,"threshold_uncertainty_score":0.99994123},"labels":[],"label_agreement":null},{"id":"W2953148407","doi":"10.48550/arxiv.1709.01456","title":"Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Combinatorics; Mathematics; Degree (music); Upper and lower bounds; Binary tree; Planar; Enhanced Data Rates for GSM Evolution; Point (geometry); Binary number; Tree (set theory); Plane (geometry); Set (abstract data type); Path (computing); Discrete mathematics; Geometry; Computer science; Physics; Mathematical analysis; Arithmetic","score_opus":0.07633630512208274,"score_gpt":0.21167642309058252,"score_spread":0.13534011796849976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953148407","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.15113182,0.000022191727,0.84646446,0.00029907117,0.0006420545,0.00041801983,0.000017921386,0.00014028462,0.00086418673],"genre_scores_gemma":[0.98712546,0.000016688835,0.009273886,0.00012766586,0.0002030995,0.000004806928,0.000059718284,0.000016013282,0.0031726677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841696,0.000056979905,0.00014452821,0.0009999169,0.00009894991,0.0002826874],"domain_scores_gemma":[0.9981352,0.00018121669,0.00031474544,0.0009870657,0.00026184053,0.00011992079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023333503,0.00028628262,0.0002763283,0.00027577812,0.0005330107,0.00042539905,0.0013131595,0.00017636012,0.000006962982],"category_scores_gemma":[0.00006882055,0.00029098472,0.00016581926,0.0002001046,0.00007366594,0.00043105072,0.0006022787,0.0002595026,0.000014340354],"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.00085935474,0.00051960995,0.0012537572,0.00029179498,0.000603956,0.00020099727,0.0009350876,0.554153,0.0015914954,0.4081995,0.0014539125,0.029937528],"study_design_scores_gemma":[0.0012376251,0.00033370187,0.0020936811,0.00012783961,0.00006157997,0.0000033696501,0.000020945188,0.9621081,0.0011833052,0.030955825,0.0013740167,0.000500014],"about_ca_topic_score_codex":0.000034685912,"about_ca_topic_score_gemma":0.00008808103,"teacher_disagreement_score":0.83719057,"about_ca_system_score_codex":0.00012928422,"about_ca_system_score_gemma":0.00031896698,"threshold_uncertainty_score":0.9999542},"labels":[],"label_agreement":null},{"id":"W2953164326","doi":"","title":"Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Combinatorics; Mathematics; Upper and lower bounds; Integer (computer science); Spanning tree; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.06529230270907187,"score_gpt":0.18938095446724235,"score_spread":0.12408865175817048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953164326","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.39675564,0.000017575354,0.59702855,0.0004591064,0.00042147143,0.00017905535,0.0000058420187,0.0000612301,0.0050715697],"genre_scores_gemma":[0.99736434,0.000018409668,0.0011459348,0.00025129112,0.000062046594,9.500043e-7,0.000016136595,0.0000068843237,0.00113403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987459,0.00020458827,0.00019116179,0.00055433164,0.0001310449,0.00017293556],"domain_scores_gemma":[0.99834853,0.0003451309,0.0002727467,0.000773208,0.00019868622,0.00006172139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004376677,0.00019815858,0.00022083054,0.00025028051,0.00019519946,0.00010295416,0.0010289155,0.00012891463,0.00003902154],"category_scores_gemma":[0.000059612514,0.00016921155,0.00020902918,0.0005095826,0.00014643588,0.00014019618,0.00051091326,0.00031820673,0.000029859219],"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.000007726144,0.000026737202,0.00017945448,0.000011114808,0.0000498824,0.00000514987,0.00012235956,0.3411716,0.00013793874,0.6577528,0.0002573303,0.00027791466],"study_design_scores_gemma":[0.00023911757,0.000074916185,0.0014623528,0.00006116072,0.000040770952,0.0000026626763,0.000039255854,0.83644956,0.0009770584,0.15976043,0.0006650976,0.00022762055],"about_ca_topic_score_codex":0.000018853721,"about_ca_topic_score_gemma":0.000003900996,"teacher_disagreement_score":0.6006087,"about_ca_system_score_codex":0.0000433825,"about_ca_system_score_gemma":0.00019200657,"threshold_uncertainty_score":0.6900247},"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":"W2953372027","doi":"10.48550/arxiv.1702.01719","title":"A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Outerplanar graph; Planar graph; Mathematics; Pathwidth; Combinatorics; Planar; Graph; 1-planar graph; Book embedding; Graph drawing; Discrete mathematics; Chordal graph; Line graph; Computer science; Computer graphics (images)","score_opus":0.07535675814771045,"score_gpt":0.20615544575116324,"score_spread":0.13079868760345278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953372027","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.03697621,0.0000941028,0.9608248,0.00042850658,0.0006678362,0.0004395132,0.0000262332,0.000052117084,0.0004906821],"genre_scores_gemma":[0.9900583,0.00006311446,0.0088424655,0.000055881283,0.00010902889,0.0000038046596,0.000041307067,0.0000070140536,0.0008190921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989905,0.000048294907,0.00017298237,0.0005276028,0.00009708872,0.00016355157],"domain_scores_gemma":[0.9981823,0.00019414558,0.00041881326,0.00089111004,0.00026395044,0.000049657614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034209673,0.00016741121,0.00019908127,0.00019449864,0.0003448033,0.00014801441,0.0015571625,0.00013354201,0.0000047750505],"category_scores_gemma":[0.000048962444,0.00015105284,0.00022501759,0.00020516962,0.000085481974,0.00035211837,0.0006372472,0.00017475299,0.0000057206],"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.000053598458,0.00007483037,0.00030885384,0.0001394948,0.00014950385,0.000012193982,0.0004123415,0.35284284,0.000093519375,0.6386777,0.00094336283,0.0062917587],"study_design_scores_gemma":[0.00032755648,0.000045112763,0.0013545922,0.000041201096,0.000060123875,0.0000026958028,0.000015701742,0.81228507,0.0004916354,0.18380791,0.0013893549,0.00017903073],"about_ca_topic_score_codex":0.000048482852,"about_ca_topic_score_gemma":0.000014794782,"teacher_disagreement_score":0.9530821,"about_ca_system_score_codex":0.000043948014,"about_ca_system_score_gemma":0.00015428248,"threshold_uncertainty_score":0.61597556},"labels":[],"label_agreement":null},{"id":"W2953917802","doi":"10.1137/1.9781611976014.8","title":"A Short Proof of the Toughness of Delaunay Triangulations","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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 Windsor","funders":"","keywords":"Delaunay triangulation; Constrained Delaunay triangulation; Combinatorics; Pitteway triangulation; Chew's second algorithm; Mathematics; Vertex (graph theory); Conjecture; Bowyer–Watson algorithm; Graph","score_opus":0.0595907023605166,"score_gpt":0.24722822843110392,"score_spread":0.1876375260705873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953917802","genre_codex":"methods","genre_gemma":"other","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.003152636,0.00015024375,0.7156797,0.00023736016,0.0009884017,0.006484634,0.00028389212,0.000060301063,0.27296284],"genre_scores_gemma":[0.26888534,0.000016451651,0.25631586,0.00022278298,0.0015864886,0.00035597308,0.00015439228,0.00015233358,0.47231036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988559,0.0000038236503,0.00050475384,0.00022694425,0.00029971125,0.00010888193],"domain_scores_gemma":[0.99880683,0.00026622476,0.00040756253,0.0003530894,0.00013519068,0.000031079562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033134365,0.00018223819,0.0003921397,0.000036830414,0.000105894345,0.00002865095,0.00034741784,0.00032969035,0.000003220981],"category_scores_gemma":[0.000016210091,0.00013546109,0.00040994651,0.000043301126,0.0001041646,0.000027201231,0.00019144216,0.0001785117,3.885581e-7],"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.0000065924846,0.000020125688,2.4185303e-7,0.00020293272,0.00012147456,1.5398976e-8,0.00067823473,0.0002270186,0.00043068454,0.96829844,0.00070849585,0.029305747],"study_design_scores_gemma":[0.002110051,0.00016344734,0.0000038611693,0.0005043683,0.00045306253,0.0000064421156,0.00013910873,0.014488947,0.034097347,0.920536,0.026908431,0.0005889267],"about_ca_topic_score_codex":4.2310583e-7,"about_ca_topic_score_gemma":7.0538385e-7,"teacher_disagreement_score":0.45936382,"about_ca_system_score_codex":0.000019795774,"about_ca_system_score_gemma":0.0002475998,"threshold_uncertainty_score":0.5523943},"labels":[],"label_agreement":null},{"id":"W2956434516","doi":"10.1145/3306346.3323029","title":"Symmetric moving frames","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Mathematics; Field (mathematics); Polygon mesh; Initialization; Vector field; Symmetry (geometry); Algorithm; Tangent; Nonlinear system; Computer science; Topology (electrical circuits); Geometry; Pure mathematics","score_opus":0.015567554383434436,"score_gpt":0.24226941935088406,"score_spread":0.22670186496744962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956434516","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.049034946,0.00008447871,0.94779295,0.0012329879,0.0007723898,0.00012205808,0.0000025702604,0.00015726918,0.0008003379],"genre_scores_gemma":[0.95750654,0.00005828367,0.04094832,0.0010122049,0.000027854061,0.00001068635,0.0000030357317,0.0000067715696,0.0004262967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990781,0.00003723994,0.00014541626,0.0002878749,0.00029361263,0.00015778563],"domain_scores_gemma":[0.99890876,0.00029307647,0.00003998401,0.00061408494,0.000083315135,0.00006077663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001589773,0.00010122406,0.00009251298,0.0006202484,0.0001605405,0.0001031203,0.000545755,0.00006839717,0.000055283268],"category_scores_gemma":[0.000028224396,0.00010174793,0.000096751,0.002062742,0.000014346526,0.0003965831,0.000010585845,0.00020532141,0.0002024732],"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.000014799571,0.0003820607,0.00077568827,0.000037714803,0.00009433369,0.0000057676757,0.00040288625,0.07140016,0.0011454504,0.40746862,0.00035247472,0.5179201],"study_design_scores_gemma":[0.0018407274,0.0010256805,0.03095392,0.000094387055,0.000058592614,0.0000771322,0.00010587431,0.65383416,0.018286806,0.24832416,0.04403144,0.0013671315],"about_ca_topic_score_codex":0.00000810299,"about_ca_topic_score_gemma":0.0000042577685,"teacher_disagreement_score":0.9084716,"about_ca_system_score_codex":0.0000199192,"about_ca_system_score_gemma":0.000045475026,"threshold_uncertainty_score":0.414916},"labels":[],"label_agreement":null},{"id":"W2956823442","doi":"10.1137/19m1303010","title":"Maximum Rectilinear Convex Subsets","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México; Comisión Nacional de Investigación Científica y Tecnológica; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Ministerio de Ciencia e Innovación; Gobierno de Aragón; Natural Sciences and Engineering Research Council of Canada; European Commission; Universidad de Santiago de Chile","keywords":"Convex hull; Mathematics; Combinatorics; Regular polygon; Convex set; Boundary (topology); Polygon (computer graphics); Convex polygon; Computational geometry; Orthogonal convex hull; Interior point method; Polygon covering; Point (geometry); Time complexity; Plane (geometry); Convex body; Algorithm; Geometry; Convex optimization; Mathematical analysis; Computer science","score_opus":0.01997149189643241,"score_gpt":0.27068021760967814,"score_spread":0.25070872571324576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956823442","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.113271,0.0004246352,0.8770235,0.0020622339,0.0029505296,0.00004621042,5.7055814e-7,0.00009853308,0.0041227504],"genre_scores_gemma":[0.90095073,0.000029671008,0.095441125,0.0019292678,0.0011691182,4.2771973e-7,0.0000048651805,0.000010837998,0.00046398098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844474,0.00018941103,0.00034799657,0.00030413023,0.00043676756,0.00027694032],"domain_scores_gemma":[0.998788,0.0002522151,0.00017385333,0.0002423896,0.00038522604,0.00015832618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006449372,0.0001314978,0.00017015084,0.00014913338,0.00043145852,0.00045847034,0.00037180728,0.000050473976,0.000055410044],"category_scores_gemma":[0.0001809403,0.00012825352,0.00011427597,0.00065925415,0.00001407321,0.00026902117,0.00015519273,0.00040701023,0.00013839667],"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.00002508717,0.00031846663,0.0006680049,0.000026426282,0.00010216753,0.0014238233,0.00074259436,0.12429998,0.0052598165,0.059190016,0.008440485,0.79950315],"study_design_scores_gemma":[0.001409443,0.00030370764,0.00657611,0.00019343615,0.000013324424,0.005676563,0.000078565485,0.8380751,0.032479968,0.02322861,0.09137536,0.0005898228],"about_ca_topic_score_codex":6.2119136e-7,"about_ca_topic_score_gemma":7.137744e-7,"teacher_disagreement_score":0.7989133,"about_ca_system_score_codex":0.00006558293,"about_ca_system_score_gemma":0.00024983648,"threshold_uncertainty_score":0.5230027},"labels":[],"label_agreement":null},{"id":"W2962679572","doi":"","title":"Computing the Coverage of an Opaque Forest","year":2012,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Opacity; Computer science; Upper and lower bounds; Algorithm; Mathematics; Optics; Physics","score_opus":0.017225078745608795,"score_gpt":0.2603594274655207,"score_spread":0.2431343487199119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962679572","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.280875,0.000035024615,0.7143254,0.00015784374,0.00019118095,0.00004293157,2.2966587e-7,0.00002460475,0.0043477793],"genre_scores_gemma":[0.96820897,0.0000011313551,0.031203529,0.00032609695,0.00014472306,8.283807e-7,0.0000028603288,0.0000016035324,0.000110263354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995357,0.00004539805,0.000105323685,0.000074563584,0.00013050342,0.00010853431],"domain_scores_gemma":[0.99958014,0.00010305174,0.00004343845,0.00018795347,0.000044964483,0.000040440398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003410874,0.000040551935,0.000045998553,0.000030338486,0.00008225093,0.000037032038,0.00027123437,0.000013740991,0.0000106899715],"category_scores_gemma":[0.000017024082,0.00002660539,0.000021321619,0.0002047159,0.000012649218,0.00045133944,0.00009046991,0.000034227585,0.0000113640435],"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.0000016450231,0.000092785944,0.0045875725,0.000004715458,0.000006627379,3.4070786e-7,0.0007713456,0.041531414,0.00065579783,0.8330733,0.00031820402,0.118956216],"study_design_scores_gemma":[0.00017433544,0.000066725916,0.15974838,0.0000040942864,0.0000029616092,0.000024878145,0.000031269727,0.8217526,0.007150448,0.0063562295,0.004581574,0.000106524196],"about_ca_topic_score_codex":0.000015744961,"about_ca_topic_score_gemma":0.0000078234025,"teacher_disagreement_score":0.8267171,"about_ca_system_score_codex":0.0000062262598,"about_ca_system_score_gemma":0.000020678362,"threshold_uncertainty_score":0.10849363},"labels":[],"label_agreement":null},{"id":"W2962774723","doi":"","title":"Dual Circumference and Collinear Sets","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Vertex (graph theory); Circumference; Mathematics; Planar graph; Degree (music); Graph; Triangulation; Discrete mathematics; Geometry; Physics","score_opus":0.0641297881983234,"score_gpt":0.18407164562394776,"score_spread":0.11994185742562435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962774723","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.50406724,0.000009878061,0.49436858,0.00007187243,0.00011583876,0.000034599794,0.0000010835992,0.000046194684,0.00128469],"genre_scores_gemma":[0.9960407,0.000013100201,0.0029273585,0.00013921497,0.000071908544,9.718682e-8,0.0000020981565,0.0000021338533,0.0008033782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994452,0.000032917207,0.000055322467,0.0003066571,0.000042384567,0.000117515825],"domain_scores_gemma":[0.99954605,0.000047017154,0.000032182892,0.00018392353,0.00011337551,0.000077439574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009406278,0.00006478112,0.000058382022,0.000085500724,0.00016279765,0.000053284388,0.00019154992,0.00003211116,0.000021989255],"category_scores_gemma":[0.000016626564,0.000073593976,0.000017620267,0.00054018537,0.00007340837,0.00036347707,0.000137619,0.000043745713,0.00009116803],"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.000018590896,0.000057525427,0.0031664253,0.000007858948,0.000022552891,0.00008884575,0.00038817,0.0080566425,0.0009816067,0.97712135,0.0010797813,0.009010667],"study_design_scores_gemma":[0.00037880748,0.00014363599,0.010912458,0.000006292674,0.000007692587,0.000021860707,0.000023396457,0.95524,0.0013353741,0.028616076,0.0031432367,0.00017114292],"about_ca_topic_score_codex":0.000009985791,"about_ca_topic_score_gemma":0.000012953,"teacher_disagreement_score":0.9485053,"about_ca_system_score_codex":0.000019623394,"about_ca_system_score_gemma":0.000048988022,"threshold_uncertainty_score":0.30010754},"labels":[],"label_agreement":null},{"id":"W2962803978","doi":"10.4230/lipics.isaac.2018.61","title":"Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Deutsche Forschungsgemeinschaft; European Commission","keywords":"Rectangle; Set cover problem; Approximation algorithm; Logarithm; Line segment; Cover (algebra); Combinatorics; Mathematics; Computational geometry; Constant (computer programming); Boundary (topology); Set (abstract data type); Line (geometry); Plane (geometry); Discrete mathematics; Computer science; Algorithm; Geometry; Mathematical analysis","score_opus":0.026819945950279842,"score_gpt":0.2810604631147204,"score_spread":0.2542405171644405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962803978","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.37586895,0.000074945645,0.61887306,0.0017692767,0.0010486051,0.0006902632,0.00021930161,0.0001623117,0.0012932695],"genre_scores_gemma":[0.93869174,0.000020263084,0.0579251,0.0017625527,0.00040555716,0.00006568479,0.0007269561,0.000020295874,0.00038186213],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979386,0.000079837315,0.000614586,0.00030256942,0.0005544056,0.00051005674],"domain_scores_gemma":[0.9983155,0.0001652822,0.00041145433,0.0005239449,0.00044133357,0.00014249008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006693158,0.00029898956,0.00025149793,0.0001633621,0.0009324819,0.00089475146,0.0010793338,0.000116036645,0.000021971182],"category_scores_gemma":[0.0000500176,0.00023513834,0.00014674998,0.00047816848,0.00019061184,0.0018285781,0.00037228424,0.00023432673,0.00007809798],"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.0012011571,0.005917203,0.0052717435,0.0019324207,0.0015020515,0.000018795448,0.09741903,0.005790742,0.10835266,0.08836241,0.3925349,0.29169688],"study_design_scores_gemma":[0.0032990507,0.0010361774,0.0007050028,0.0001558079,0.000053431202,0.00006534521,0.0010290563,0.72910684,0.13898446,0.0048469426,0.11978519,0.00093271426],"about_ca_topic_score_codex":0.000009151388,"about_ca_topic_score_gemma":0.000021249065,"teacher_disagreement_score":0.7233161,"about_ca_system_score_codex":0.00011617202,"about_ca_system_score_gemma":0.00007167639,"threshold_uncertainty_score":0.95886636},"labels":[],"label_agreement":null},{"id":"W2962974790","doi":"","title":"Collinearities in Kinetic Point Sets","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Collinearity; Combinatorics; Plane (geometry); Trajectory; Mathematics; Point (geometry); Constant (computer programming); Line (geometry); Set (abstract data type); Kinetic energy; Line segment; Geometry; Physics; Mathematical analysis; Computer science; Classical mechanics","score_opus":0.055974921718670016,"score_gpt":0.24644584040733972,"score_spread":0.1904709186886697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962974790","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.22995827,0.00022338986,0.64729124,0.004261881,0.0016447824,0.0007531479,0.000101164784,0.00024700857,0.11551909],"genre_scores_gemma":[0.96019185,0.0000060899124,0.037617464,0.0017911475,0.000045585068,0.00002399813,0.00006354454,0.000009565462,0.00025077662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983532,0.00008127113,0.00033606388,0.00046394393,0.00035651817,0.00040902954],"domain_scores_gemma":[0.9988538,0.0001460317,0.00007339252,0.00026327942,0.0002921491,0.00037133263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028003464,0.00019265029,0.00018553367,0.0014028116,0.00013988165,0.00015553363,0.0005736016,0.000092016046,0.00053923886],"category_scores_gemma":[0.00008450185,0.00021820205,0.00005239577,0.0013860612,0.000059697602,0.00036086465,0.00005799311,0.00020897697,0.00027959654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.000011320459,0.00009311322,0.0015758929,0.000012792736,0.000015446349,0.000110134206,0.00079096516,0.034006994,0.000010872491,0.93208224,0.0012032529,0.03008697],"study_design_scores_gemma":[0.0007892773,0.00026759907,0.21220934,0.00007463246,0.0000045156166,0.00006151238,0.00012638805,0.58036655,0.00018754673,0.20341101,0.0019040847,0.0005975232],"about_ca_topic_score_codex":0.008000307,"about_ca_topic_score_gemma":0.013177802,"teacher_disagreement_score":0.73023355,"about_ca_system_score_codex":0.000214758,"about_ca_system_score_gemma":0.0011825039,"threshold_uncertainty_score":0.9986055},"labels":[],"label_agreement":null},{"id":"W2963014926","doi":"","title":"Stochastic Domain Decomposition for Time Dependent Adaptive Mesh Generation","year":2015,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Memorial University of Newfoundland","funders":"","keywords":"Domain decomposition methods; Polygon mesh; Mesh generation; Laplacian smoothing; Partial differential equation; T-vertices; Computer science; Generator (circuit theory); Applied mathematics; Domain (mathematical analysis); Measure (data warehouse); Context (archaeology); Representation (politics); Mathematical optimization; Mathematics; Topology (electrical circuits); Algorithm; Finite element method; Mathematical analysis; Geometry; Physics; Power (physics)","score_opus":0.03836226809429923,"score_gpt":0.2830736365517634,"score_spread":0.24471136845746413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963014926","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.012686515,0.000037068115,0.9850931,0.0005663853,0.00039892606,0.00034645223,0.0000041625444,0.00010595883,0.00076138694],"genre_scores_gemma":[0.6225792,2.8757478e-7,0.37582725,0.00030847895,0.00032422587,0.00006634338,0.00008103383,0.0000054417387,0.00080772256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990974,0.000054562595,0.0001683805,0.0002758677,0.00026046502,0.00014331072],"domain_scores_gemma":[0.9993207,0.000071991635,0.000057564037,0.00015800585,0.00027925693,0.000112471884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039844506,0.00009421585,0.00008954219,0.000107181695,0.00011194287,0.00012526872,0.00018937002,0.000040689425,0.000013190244],"category_scores_gemma":[0.000029729934,0.00009007362,0.000040330175,0.00018476103,0.00000897532,0.00047495362,0.00005751747,0.00003323596,0.0001237134],"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.00006250133,0.00015449412,0.0000024801666,0.0000036254855,0.000038429844,0.0000026086786,0.00070046535,0.38886842,0.024621563,0.53363323,0.02068004,0.031232145],"study_design_scores_gemma":[0.00059855636,0.00024107947,0.00001787595,0.0000024877274,0.0000054242482,0.000016367936,0.000015898777,0.96503687,0.005019661,0.028515043,0.00039966585,0.00013110033],"about_ca_topic_score_codex":0.0000041992967,"about_ca_topic_score_gemma":0.0000094046645,"teacher_disagreement_score":0.60989267,"about_ca_system_score_codex":0.00009223161,"about_ca_system_score_gemma":0.0001187236,"threshold_uncertainty_score":0.36730957},"labels":[],"label_agreement":null},{"id":"W2963098896","doi":"","title":"Approximation Schemes for Covering and Packing in the Streaming Model.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on 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 British Columbia","funders":"","keywords":"Computer science; Streaming data; Approximation algorithm; Packing problems; Context (archaeology); Streaming algorithm; Theoretical computer science; Cluster analysis; Cover (algebra); Mathematical optimization; Algorithm; Mathematics; Upper and lower bounds; Artificial intelligence; Data mining","score_opus":0.06221067361608096,"score_gpt":0.29343118656529077,"score_spread":0.2312205129492098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963098896","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.13679844,0.000032826585,0.8572922,0.0037182635,0.00013350628,0.00029489934,0.000022885144,0.000017842778,0.0016891834],"genre_scores_gemma":[0.9594206,0.0000048235006,0.03963016,0.0007425181,0.00006261288,0.00004277864,0.00004456231,0.0000055133846,0.000046420697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989642,0.000030435613,0.00018273114,0.0003314771,0.00024661593,0.00024453842],"domain_scores_gemma":[0.9990364,0.00026404948,0.00011931048,0.0002967704,0.00016990902,0.000113574926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046351558,0.00012592741,0.00011542777,0.00038922866,0.0007495591,0.00093837525,0.00060826563,0.0000547229,0.0000035779979],"category_scores_gemma":[0.00023973522,0.00011694278,0.000031467276,0.00018887498,0.000050554558,0.0005883492,0.000055222725,0.00011946208,0.0000040079613],"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.0000037486338,0.0000139764425,0.0005776681,0.000014572175,0.0000068542945,0.0000033158622,0.00040438052,0.18803534,0.000022921646,0.7284396,0.000113248585,0.082364336],"study_design_scores_gemma":[0.00027975376,0.00003055329,0.012883754,0.00003187109,0.0000022297013,0.0000064531364,0.000055782744,0.9072805,0.00002849073,0.07879485,0.00047535467,0.00013041077],"about_ca_topic_score_codex":0.0005991442,"about_ca_topic_score_gemma":0.003045164,"teacher_disagreement_score":0.8226222,"about_ca_system_score_codex":0.00008558494,"about_ca_system_score_gemma":0.00046554566,"threshold_uncertainty_score":0.9048774},"labels":[],"label_agreement":null},{"id":"W2963151262","doi":"10.37236/7224","title":"More Turán-Type Theorems for Triangles in Convex Point Sets","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Regular polygon; Type (biology); Point (geometry); General position; Set (abstract data type); Position (finance); Geometry; Computer science","score_opus":0.007912578110471075,"score_gpt":0.25405777358528264,"score_spread":0.24614519547481156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963151262","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.70942307,0.0042268503,0.2789511,0.0047935676,0.0019128937,0.0004130924,5.762392e-7,0.000017459182,0.00026136116],"genre_scores_gemma":[0.9990803,0.0001616862,0.0002353803,0.00021864839,0.000070911236,0.0000022857928,0.0000014403324,0.0000068475215,0.0002225202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998862,0.0001019072,0.0003261768,0.0001131262,0.00029183365,0.0003049564],"domain_scores_gemma":[0.9987825,0.00040851967,0.0002587771,0.00020959313,0.00030227238,0.000038330887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016101472,0.000096442986,0.0001983764,0.0001532742,0.000055577017,0.000059985483,0.00067224784,0.000043946955,0.000005968106],"category_scores_gemma":[0.00011307513,0.00006624292,0.00009121616,0.0006045071,0.0000174064,0.0002827229,0.000050110855,0.0003020418,0.000007310637],"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.00007979218,0.00007442715,0.000107281936,0.000009780132,0.000028139739,0.0000019860836,0.0004591036,0.0038850566,0.00033783296,0.9918923,0.00040114843,0.0027231537],"study_design_scores_gemma":[0.0018016654,0.0009512839,0.0004963606,0.000019391391,0.000010971822,0.000105464875,0.00008023576,0.035557598,0.0018591923,0.95302594,0.005978312,0.000113598595],"about_ca_topic_score_codex":0.0000012717683,"about_ca_topic_score_gemma":0.0000013758572,"teacher_disagreement_score":0.2896572,"about_ca_system_score_codex":0.00017973669,"about_ca_system_score_gemma":0.00050091615,"threshold_uncertainty_score":0.27013078},"labels":[],"label_agreement":null},{"id":"W2963225177","doi":"","title":"Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in $\\mathbb{R}^d$.","year":2013,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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 Victoria","funders":"","keywords":"k-nearest neighbors algorithm; Graph; Nearest neighbor graph; Mathematics; Combinatorics; Kinetic energy; Computer science; Physics; Artificial intelligence","score_opus":0.08440288280805093,"score_gpt":0.19908076213445294,"score_spread":0.11467787932640201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963225177","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.40950772,0.00012680967,0.5893564,0.0004334028,0.00013991335,0.00027691002,0.0000070220694,0.00003077342,0.00012100955],"genre_scores_gemma":[0.9974903,0.00006697363,0.0019252362,0.00026779468,0.000038056893,0.0000012820161,0.000019476682,0.00000386217,0.00018704546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927616,0.000036610527,0.00008706736,0.0003915402,0.00004776385,0.00016084457],"domain_scores_gemma":[0.99906874,0.00026675206,0.000045790326,0.0005061472,0.0000553275,0.00005724849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012641297,0.00008970364,0.00007654223,0.00011336879,0.00011579909,0.00012311294,0.0008082382,0.00003702151,0.000014629792],"category_scores_gemma":[0.00003545351,0.00007512038,0.000022347638,0.00048279,0.000049484726,0.00062105013,0.00034227708,0.0000725609,0.000008409937],"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.000018311586,0.000050405255,0.0057765096,0.00002581419,0.000057900863,0.000017135884,0.00034804732,0.3637289,0.00038667556,0.6152371,0.0035383513,0.010814829],"study_design_scores_gemma":[0.00033896882,0.000029993993,0.04194398,0.000004253669,0.000012806492,0.000003921755,0.00004242382,0.89918953,0.000043171833,0.0559046,0.0023805222,0.000105842766],"about_ca_topic_score_codex":0.00020045905,"about_ca_topic_score_gemma":0.00012236732,"teacher_disagreement_score":0.58798254,"about_ca_system_score_codex":0.000015078077,"about_ca_system_score_gemma":0.000030184468,"threshold_uncertainty_score":0.306332},"labels":[],"label_agreement":null},{"id":"W2963234396","doi":"10.1016/j.jcta.2009.03.008","title":"Extremal problems on triangle areas in two and three dimensions","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Tel Aviv University; National Science Foundation","keywords":"Combinatorics; Mathematics; General position; Regular polygon; Span (engineering); Upper and lower bounds; Position (finance); Plane (geometry); Point (geometry); Discrete geometry; Unit (ring theory); Geometry; Mathematical analysis","score_opus":0.013936423538197943,"score_gpt":0.2565667971483106,"score_spread":0.24263037361011267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963234396","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.94299406,0.0007698082,0.047330543,0.00264708,0.0040399535,0.00022839436,8.8602144e-7,0.000029867748,0.0019594321],"genre_scores_gemma":[0.9971689,0.000026685744,0.0022660368,0.00015494837,0.00031842597,0.0000011733179,4.3418245e-7,0.0000031892255,0.000060198665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897116,0.00015557758,0.0003483822,0.00012602848,0.00026760015,0.00013122632],"domain_scores_gemma":[0.9992057,0.0002337992,0.00020831282,0.0001348052,0.00013460872,0.00008275648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010393048,0.000100467434,0.0002157998,0.00022223117,0.00008600238,0.00010217711,0.00022811852,0.000031618325,0.000007723781],"category_scores_gemma":[0.0001817616,0.00008211504,0.000058946305,0.0003413513,0.000027157732,0.0006226009,0.00004045748,0.00017295935,0.0000015770138],"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.00031923078,0.0001668975,0.00010312922,0.0000021448998,0.000009264823,0.000030862513,0.0002816457,0.0017154728,0.0006616104,0.9804753,0.000083165614,0.016151289],"study_design_scores_gemma":[0.0020618043,0.0012453333,0.0037649903,0.000058886733,0.000005786145,0.00012316232,0.000021179612,0.00089827745,0.00077610184,0.98946774,0.0014789527,0.00009779947],"about_ca_topic_score_codex":0.0000011874714,"about_ca_topic_score_gemma":0.0000034680393,"teacher_disagreement_score":0.054174874,"about_ca_system_score_codex":0.000035422385,"about_ca_system_score_gemma":0.00008760127,"threshold_uncertainty_score":0.3348554},"labels":[],"label_agreement":null},{"id":"W2963302799","doi":"","title":"Sliding k-Transmitters: Hardness and Approximation","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on 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 Manitoba; University of Waterloo","funders":"","keywords":"Monotone polygon; Simple polygon; Combinatorics; Polygon (computer graphics); Mathematics; Perpendicular; Guard (computer science); Line segment; Algorithm; Geometry; Mathematical analysis; Computer science; Telecommunications","score_opus":0.028130455835106392,"score_gpt":0.23365218653069406,"score_spread":0.20552173069558766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963302799","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.034785304,0.000053450804,0.94840986,0.013612465,0.000552627,0.00017477285,0.000029822631,0.000093672665,0.0022880235],"genre_scores_gemma":[0.97416514,0.000013817161,0.023754636,0.0014643541,0.0000958638,0.000019290444,0.000028870016,0.000009476597,0.00044852443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850225,0.000066684035,0.00024191545,0.00050172705,0.00035993478,0.0003275029],"domain_scores_gemma":[0.9988057,0.00021592592,0.00007746775,0.0002136682,0.00027848157,0.0004087582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002739561,0.00018063607,0.0001506371,0.0007955847,0.0002637123,0.00028129827,0.00035574866,0.000078676196,0.00009925749],"category_scores_gemma":[0.00009077435,0.00015142334,0.000041760264,0.0006491955,0.00005044367,0.000656114,0.000042681848,0.0000903245,0.00013817642],"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.000004591402,0.000017313856,0.00040437898,0.000012016149,0.000017262313,0.000010286116,0.00011750658,0.0015630481,0.00033715705,0.77562606,0.0011440155,0.22074634],"study_design_scores_gemma":[0.0024570338,0.00039195007,0.08643523,0.00039312048,0.00002148985,0.00017786521,0.00009885716,0.55318516,0.0016617597,0.32886893,0.024780098,0.0015285368],"about_ca_topic_score_codex":0.00032929974,"about_ca_topic_score_gemma":0.00047226524,"teacher_disagreement_score":0.9393799,"about_ca_system_score_codex":0.00018407391,"about_ca_system_score_gemma":0.0006385663,"threshold_uncertainty_score":0.6174865},"labels":[],"label_agreement":null},{"id":"W2963327335","doi":"10.4153/cjm-2014-025-x","title":"Obstructions of Connectivity Two for Embedding Graphs into the Torus","year":2014,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Torus; Embedding; Mathematics; Graph embedding; Set (abstract data type); Surface (topology); Combinatorics; Graph; Computer science; Geometry; Artificial intelligence","score_opus":0.018287356407260508,"score_gpt":0.2666214642845619,"score_spread":0.2483341078773014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963327335","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.16597342,0.00014560943,0.8324284,0.0007454728,0.00048922905,0.00006447989,0.0000015802219,0.0000028511092,0.00014893932],"genre_scores_gemma":[0.8374194,0.0000023553462,0.1623573,0.00009679931,0.00009381765,0.0000017136236,3.476622e-7,0.0000031455593,0.000025132635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994474,0.00003334922,0.00025442374,0.00005398441,0.00011333582,0.000097474665],"domain_scores_gemma":[0.99870545,0.00046987014,0.000249151,0.00014893658,0.00030573946,0.00012085592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006463956,0.00005114815,0.00012115833,0.00015803974,0.00017389863,0.00005598089,0.00032230976,0.000018634357,0.0000056696167],"category_scores_gemma":[0.00047846834,0.000038206457,0.000081129234,0.00021727983,0.00003815792,0.000185889,0.000010518754,0.00006338399,7.7537845e-7],"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.0000011151537,0.000019488474,0.00010902681,0.000040353203,0.000047184276,0.0000011652634,0.0044604107,0.021907486,0.00046832397,0.94379264,0.0016170577,0.027535759],"study_design_scores_gemma":[0.0004921135,0.00018104665,0.0006327115,0.00007666374,0.000047242174,0.0001886597,0.00045992504,0.39904898,0.0037345805,0.57978773,0.015212309,0.0001380438],"about_ca_topic_score_codex":0.00013875238,"about_ca_topic_score_gemma":0.002100645,"teacher_disagreement_score":0.67144597,"about_ca_system_score_codex":0.00003527945,"about_ca_system_score_gemma":0.00029347913,"threshold_uncertainty_score":0.15580142},"labels":[],"label_agreement":null},{"id":"W2963350132","doi":"10.4230/lipics.swat.2018.12","title":"Boundary Labeling for Rectangular Diagrams","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Carleton University","funders":"","keywords":"Boundary (topology); Rectangle; Combinatorics; Time complexity; Set (abstract data type); Mathematics; Graph; Polynomial; Computer science; Geometry; Discrete mathematics; Algorithm; Mathematical analysis; Programming language","score_opus":0.01661868606084442,"score_gpt":0.27406740591457013,"score_spread":0.2574487198537257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963350132","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.053549133,0.00011010981,0.94097435,0.0005141031,0.0021665469,0.0010198336,0.00014537585,0.00023955967,0.0012809595],"genre_scores_gemma":[0.44507614,0.00003228201,0.5473714,0.0035801362,0.001630366,0.00034921814,0.00091714354,0.00005306763,0.0009902673],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790627,0.000027062199,0.00076469476,0.00030575492,0.00039768,0.00059852266],"domain_scores_gemma":[0.99809194,0.00021369703,0.0002858851,0.0005664768,0.000674579,0.00016742699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007704735,0.0002751527,0.00028131087,0.00025058188,0.0007306545,0.00066009257,0.0008526333,0.00015275882,0.000016342172],"category_scores_gemma":[0.00019417859,0.00026224117,0.00020898347,0.0004891387,0.000104272556,0.0015960382,0.00025533413,0.00016292221,0.00012236179],"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.00044013088,0.0009588869,0.0018955627,0.0012746283,0.00062072184,0.000006897,0.026642527,0.001930452,0.002543761,0.22830006,0.0753253,0.66006106],"study_design_scores_gemma":[0.002387906,0.00071559567,0.00029118345,0.00008538079,0.000029555244,0.00004354837,0.00018199721,0.4816543,0.0065079243,0.012958179,0.49456945,0.0005749937],"about_ca_topic_score_codex":0.0000041546964,"about_ca_topic_score_gemma":0.0000140713055,"teacher_disagreement_score":0.65948606,"about_ca_system_score_codex":0.00009720123,"about_ca_system_score_gemma":0.00014409996,"threshold_uncertainty_score":0.99998295},"labels":[],"label_agreement":null},{"id":"W2963433266","doi":"","title":"$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on 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":"Combinatorics; Planar; Planar graph; Vertex (graph theory); Mathematics; Graph; String (physics); Face (sociological concept); Computer science","score_opus":0.061165323226796596,"score_gpt":0.28277101308477515,"score_spread":0.22160568985797854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963433266","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.45389658,0.00052946614,0.5292067,0.010498142,0.0011942897,0.00046150986,0.00018877351,0.00015529056,0.0038692225],"genre_scores_gemma":[0.9792682,0.000012276664,0.01951511,0.00070599216,0.0001401046,0.000012803022,0.00014888782,0.000008714987,0.00018792684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982873,0.00008803008,0.00035831434,0.000452098,0.0005121221,0.0003021085],"domain_scores_gemma":[0.9981615,0.00031295788,0.00014392412,0.00026587254,0.00050279306,0.0006129523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003005493,0.0001772888,0.0002175682,0.00088333216,0.00017202874,0.00020057143,0.00039538386,0.00008066216,0.000022219545],"category_scores_gemma":[0.00024413543,0.0001957905,0.000047354642,0.00085874886,0.00010274822,0.0006002969,0.00006335907,0.00014359146,0.00004851869],"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.000010685272,0.00003883219,0.002044339,0.0000109869225,0.00003218587,0.0000196383,0.0002827569,0.06346679,0.000087330896,0.92345273,0.0030865888,0.0074671223],"study_design_scores_gemma":[0.0018609889,0.00056633836,0.07315975,0.00010995489,0.000031482934,0.000107883316,0.0004714073,0.5722563,0.0014300907,0.33970174,0.00942587,0.00087815936],"about_ca_topic_score_codex":0.002377385,"about_ca_topic_score_gemma":0.002050191,"teacher_disagreement_score":0.583751,"about_ca_system_score_codex":0.000114552975,"about_ca_system_score_gemma":0.0016462125,"threshold_uncertainty_score":0.7984105},"labels":[],"label_agreement":null},{"id":"W2963552320","doi":"10.4230/lipics.icalp.2018.31","title":"Orthogonal Point Location and Rectangle Stabbing Queries in 3-d","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"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":"Rectangle; Data structure; Disjoint sets; Point location; Combinatorics; Recursion (computer science); Linear space; Computer science; Logarithm; Pointer (user interface); Binary logarithm; Time complexity; Mathematics; Discrete mathematics; Point (geometry); Algorithm; Geometry","score_opus":0.011409725992905883,"score_gpt":0.24882596063621948,"score_spread":0.2374162346433136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963552320","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.3251092,0.00005490167,0.67170227,0.00041700748,0.00055163377,0.00041873218,0.00002706021,0.00008975146,0.0016294665],"genre_scores_gemma":[0.93860656,0.000017808601,0.0602665,0.0006690005,0.00016559611,0.000045520905,0.00011858756,0.0000107490505,0.00009965998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998537,0.00003294899,0.0005931574,0.0002198521,0.00027849528,0.00033855162],"domain_scores_gemma":[0.99898523,0.00010314957,0.00018745841,0.0002863012,0.00034247272,0.00009540268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058209547,0.00018075595,0.00018808809,0.0003089604,0.00025156324,0.00031347343,0.00031629537,0.00009161441,0.000010268749],"category_scores_gemma":[0.00011344836,0.0001758851,0.000045327477,0.00056727947,0.00009306995,0.0019311806,0.00022031435,0.00014422122,0.00003504476],"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.00034303556,0.0006363461,0.023582017,0.00093331205,0.00014798841,0.000010162416,0.062791154,0.0025770364,0.0011633766,0.61678475,0.005028485,0.28600234],"study_design_scores_gemma":[0.004033726,0.000957914,0.027432293,0.00033100936,0.000019019748,0.00016392303,0.0016368184,0.8812994,0.00609041,0.014322339,0.06270643,0.0010067153],"about_ca_topic_score_codex":0.000013039848,"about_ca_topic_score_gemma":0.00010775017,"teacher_disagreement_score":0.87872237,"about_ca_system_score_codex":0.00008244346,"about_ca_system_score_gemma":0.00010453472,"threshold_uncertainty_score":0.71723866},"labels":[],"label_agreement":null},{"id":"W2963586601","doi":"","title":"Angle-monotone Paths in Non-obtuse Triangulations","year":2017,"lang":"en","type":"article","venue":"Smith ScholarWorks (Smith College)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Monotone polygon; Combinatorics; Mathematics; Regular polygon; Triangulation; Path (computing); Boundary (topology); Enhanced Data Rates for GSM Evolution; Spanning tree; Point (geometry); Set (abstract data type); Geometry; Computer science; Mathematical analysis","score_opus":0.015920439705961787,"score_gpt":0.2751843106201424,"score_spread":0.2592638709141806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963586601","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.24974778,0.0009829017,0.73168325,0.0035624858,0.002135833,0.00114238,0.000039320006,0.00021167855,0.010494357],"genre_scores_gemma":[0.9587164,0.00005973537,0.037462987,0.00028904327,0.00032107273,0.00009617188,0.000007919152,0.000021006816,0.003025677],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9976281,0.00013618688,0.00051294506,0.0007082159,0.00052754494,0.00048702126],"domain_scores_gemma":[0.99750876,0.0001775197,0.00032240638,0.001514336,0.00025426262,0.00022270346],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010509853,0.0002728856,0.0003326443,0.00047834686,0.0012283549,0.0010558716,0.001554852,0.00019526875,0.00003927021],"category_scores_gemma":[0.00041224514,0.0002794582,0.00013195569,0.00091042137,0.000077721634,0.0026641462,0.0004607892,0.0005256608,0.00012551107],"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.000498335,0.002388273,0.18539381,0.0001955667,0.0003190331,0.0012435418,0.004081327,0.098659895,0.0014419,0.29512694,0.046007987,0.36464337],"study_design_scores_gemma":[0.0035606283,0.00014340965,0.7049287,0.00021422256,0.000018594546,0.000033338583,0.00006370742,0.2650325,0.0008236581,0.009246912,0.015270123,0.0006641922],"about_ca_topic_score_codex":0.000054204662,"about_ca_topic_score_gemma":0.0000954081,"teacher_disagreement_score":0.7089686,"about_ca_system_score_codex":0.00014462297,"about_ca_system_score_gemma":0.00041988003,"threshold_uncertainty_score":0.9999811},"labels":[],"label_agreement":null},{"id":"W2963824103","doi":"","title":"Compatible 4-Holes in Point Sets","year":2017,"lang":"en","type":"article","venue":"arXiv (Cornell University)","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":"General position; Combinatorics; Disjoint sets; Convex hull; Mathematics; Regular polygon; Position (finance); Upper and lower bounds; Point (geometry); Convex set; Plane (geometry); Pairwise comparison; Type (biology); Set (abstract data type); Discrete mathematics; Geometry; Convex optimization; Mathematical analysis; Computer science","score_opus":0.08184835720691144,"score_gpt":0.2034536764282575,"score_spread":0.12160531922134607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963824103","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.589926,0.000009390233,0.40563384,0.00023715988,0.00015973544,0.000053851618,9.386996e-7,0.000038536866,0.0039405487],"genre_scores_gemma":[0.99735713,0.000010289489,0.0019507552,0.000081398546,0.000020598456,1.6991527e-7,0.0000025082527,0.0000024696035,0.0005746909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994076,0.000035627574,0.00007543837,0.0002970466,0.00004550853,0.00013878976],"domain_scores_gemma":[0.9992785,0.000036653833,0.00007976585,0.00049787754,0.000049632567,0.00005755982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014927963,0.00007150729,0.000083528306,0.00013766569,0.0002539439,0.00013054721,0.00073157833,0.00003174257,0.000013226302],"category_scores_gemma":[0.000027297969,0.00008275152,0.000035597695,0.00021939594,0.000050601244,0.0008542581,0.00024380576,0.00007068686,0.00008534723],"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.000012394045,0.00009537499,0.026216978,0.0000075477396,0.000009714954,0.00017725701,0.0002052062,0.17296216,0.0002096971,0.79383063,0.0004258341,0.005847199],"study_design_scores_gemma":[0.000589195,0.000035603516,0.10962162,0.000015293834,0.000003111117,0.0000043502455,0.00002494765,0.8286677,0.00060375954,0.059589718,0.0006853325,0.00015937409],"about_ca_topic_score_codex":0.00007339741,"about_ca_topic_score_gemma":0.0001182252,"teacher_disagreement_score":0.7342409,"about_ca_system_score_codex":0.000044202483,"about_ca_system_score_gemma":0.000044193694,"threshold_uncertainty_score":0.3374509},"labels":[],"label_agreement":null},{"id":"W2963846312","doi":"10.5555/3310435.3310527","title":"Every collinear set in a planar graph is free","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Planarity testing; Planar graph; Combinatorics; Planar; Graph; Plane (geometry); Mathematics; Planar straight-line graph; Set (abstract data type); Graph drawing; Discrete mathematics; Computer science; Geometry; Line graph; 1-planar graph; Computer graphics (images)","score_opus":0.011157125908587074,"score_gpt":0.24427974828954613,"score_spread":0.23312262238095904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963846312","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.49647826,0.00075090525,0.4358565,0.030766709,0.0059059816,0.0024113797,0.00044402175,0.00065478694,0.026731461],"genre_scores_gemma":[0.92179006,0.00016853109,0.064082205,0.0060111578,0.0005631305,0.000097057855,0.00020769273,0.000050547744,0.0070296023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983007,0.0000759792,0.00027808824,0.00055928226,0.0004783701,0.00030760153],"domain_scores_gemma":[0.9989501,0.00010764763,0.00008075672,0.00070197764,0.00006057488,0.00009894884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027702135,0.00018877785,0.00020005647,0.00033627922,0.00007087105,0.00013769038,0.0006907137,0.000087279084,0.000047596564],"category_scores_gemma":[0.000013238293,0.00017837144,0.00009353019,0.00090903643,0.000021222419,0.00043618286,0.0001405135,0.00016896486,0.00036150104],"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.00066004385,0.0016538972,0.019102657,0.0004311272,0.0005605876,0.00058661646,0.017972846,0.27133393,0.052422546,0.4067499,0.18127982,0.047246013],"study_design_scores_gemma":[0.0036239612,0.0011006814,0.011781394,0.00014051185,0.000014736359,0.00004598148,0.00010891073,0.9017927,0.01430708,0.038808927,0.027170843,0.0011042954],"about_ca_topic_score_codex":0.000056257555,"about_ca_topic_score_gemma":0.000012474795,"teacher_disagreement_score":0.6304587,"about_ca_system_score_codex":0.000058301204,"about_ca_system_score_gemma":0.0000870386,"threshold_uncertainty_score":0.7273776},"labels":[],"label_agreement":null},{"id":"W2963935545","doi":"10.1109/coase.2017.8256076","title":"Optimal Algorithms for Separating a Polyhedron from Its Single-Part Mold","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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":"Mold; Polyhedron; Casting; Product (mathematics); Object (grammar); Computer science; Orientation (vector space); Engineering drawing; Algorithm; Materials science; Mathematics; Composite material; Geometry; Artificial intelligence; Engineering","score_opus":0.16478238384147184,"score_gpt":0.23585686722514285,"score_spread":0.071074483383671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963935545","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.1857825,0.0001549572,0.81115687,0.00013837252,0.0013866782,0.00035389222,0.000097159835,0.00014534938,0.00078421086],"genre_scores_gemma":[0.9399397,0.00002978844,0.055516705,0.00008084639,0.0006531816,0.000004369032,0.00020258444,0.000017267983,0.0035555975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812,0.000071605806,0.00021806521,0.0011512552,0.00011994292,0.00031912228],"domain_scores_gemma":[0.99807745,0.00018891589,0.00040440616,0.000906926,0.00027227774,0.00015003086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022495547,0.00029343623,0.00030402906,0.00019286362,0.00043708962,0.00041847673,0.0014768819,0.00025150768,0.000018666778],"category_scores_gemma":[0.00008192227,0.0003663478,0.00023066903,0.00018803502,0.000041295414,0.0006173935,0.0011877094,0.00028100953,0.00004771313],"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.000033650864,0.00011375082,0.00006967641,0.00003649159,0.0001135665,0.00006663438,0.00021428596,0.9643718,0.0005653705,0.028232863,0.00095864834,0.0052232356],"study_design_scores_gemma":[0.00047882722,0.0000862165,0.00015369507,0.0000779911,0.000051199993,0.0000027198564,0.000013392181,0.98048294,0.0028435367,0.012360152,0.0030383645,0.0004109398],"about_ca_topic_score_codex":0.00007113835,"about_ca_topic_score_gemma":0.000020153691,"teacher_disagreement_score":0.75564015,"about_ca_system_score_codex":0.00015162848,"about_ca_system_score_gemma":0.00024943362,"threshold_uncertainty_score":0.9998788},"labels":[],"label_agreement":null},{"id":"W2963964459","doi":"10.20382/jocg.v7i2a3","title":"Shortest path in a polygon using sublinear space","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Sublinear function; Mathematics; Polygon (computer graphics); Simple polygon; Shortest path problem; Combinatorics; Path (computing); Space (punctuation); Constant (computer programming); K shortest path routing; Time complexity; Discrete mathematics; Algorithm; Monotone polygon; Computer science; Graph; Geometry","score_opus":0.03357880101853126,"score_gpt":0.24181612233605343,"score_spread":0.20823732131752218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963964459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40606287,0.00017050683,0.59226096,0.0004754034,0.00039689773,0.000056824727,0.0000024909416,0.000017455604,0.0005565974],"genre_scores_gemma":[0.8764902,0.000012637083,0.12297618,0.00012389963,0.00018963273,6.020312e-8,0.000006633626,0.000007383888,0.00019341505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817723,0.00016302888,0.00041792725,0.00023051345,0.0007854962,0.00022578769],"domain_scores_gemma":[0.99799806,0.00021569103,0.0004044597,0.00014604247,0.00096365233,0.00027211205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007133261,0.00015515534,0.0002739132,0.002327229,0.00008037606,0.000119852506,0.00061156263,0.00007982643,0.000010071776],"category_scores_gemma":[0.00014408988,0.00017023894,0.0001277155,0.0035065592,0.00004065016,0.0014059378,0.00016118369,0.0002641914,0.000008625356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006370879,0.00015612054,0.0038533655,0.000006129977,0.00003310038,0.00032665272,0.00024877393,0.9709492,0.00016725049,0.021574,0.00047017055,0.0021515838],"study_design_scores_gemma":[0.0034247458,0.0005414117,0.01358094,0.00009338988,0.00003700768,0.00073783094,0.00049844675,0.9488744,0.00031814547,0.011948532,0.019492654,0.0004524757],"about_ca_topic_score_codex":0.00003066978,"about_ca_topic_score_gemma":0.000005258901,"teacher_disagreement_score":0.4704273,"about_ca_system_score_codex":0.00039826796,"about_ca_system_score_gemma":0.0009527583,"threshold_uncertainty_score":0.6942143},"labels":[],"label_agreement":null},{"id":"W2963977128","doi":"","title":"1Graph Layouts via Layered Separators","year":2016,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Book embedding; Discrete mathematics; Graph; Queue; Outerplanar graph; Line graph; Voltage graph; 1-planar graph; Computer science","score_opus":0.008436494078361941,"score_gpt":0.22187397214453547,"score_spread":0.21343747806617352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963977128","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.03834383,0.00002536046,0.95426476,0.0014510382,0.00032663695,0.00004798291,7.2437354e-7,0.00015287173,0.005386789],"genre_scores_gemma":[0.97544616,0.0000034946474,0.02170066,0.0004739194,0.00006910351,0.000005027255,9.1533155e-7,0.0000025000913,0.0022981877],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999384,0.000026204778,0.00010658461,0.0002007336,0.00015690291,0.00012556683],"domain_scores_gemma":[0.99957263,0.00006319009,0.000027149234,0.00020787863,0.00006457621,0.00006454328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001112042,0.000063369276,0.00005560714,0.00009339263,0.000059118494,0.000045041674,0.00025114117,0.000025688709,0.00009681758],"category_scores_gemma":[0.000013280881,0.00003940722,0.00003630837,0.00034238902,0.000011679412,0.00036536402,0.00006744876,0.000018092447,0.00038706846],"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.0000070516858,0.0000788128,0.0017881796,0.0000036853867,0.000028700604,0.000008975555,0.0001658837,0.0008944519,0.03638146,0.36550838,0.019649584,0.5754849],"study_design_scores_gemma":[0.0028563964,0.0004420438,0.048785426,0.00004335922,0.000012130635,0.000107870044,0.000015630369,0.15407586,0.38233954,0.18613157,0.22381105,0.0013791263],"about_ca_topic_score_codex":0.0000039417405,"about_ca_topic_score_gemma":0.0000054076354,"teacher_disagreement_score":0.9371024,"about_ca_system_score_codex":0.000012941177,"about_ca_system_score_gemma":0.000030887775,"threshold_uncertainty_score":0.4975111},"labels":[],"label_agreement":null},{"id":"W2963987091","doi":"","title":"Diffuse Reflections in Simple Polygons","year":2013,"lang":"en","type":"article","venue":"arXiv (Cornell University)","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 Calgary","funders":"","keywords":"Polygon (computer graphics); Specular reflection; Simple polygon; Simple (philosophy); Conjecture; Point (geometry); Combinatorics; Surface (topology); Mathematics; Geometry; Diffuse reflection; Physics; Optics; Regular polygon; Computer science; Telecommunications","score_opus":0.06691093066911748,"score_gpt":0.1981934363147318,"score_spread":0.13128250564561433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963987091","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.50671697,0.000006837864,0.4903891,0.00018715332,0.00008933785,0.00007591864,5.7314264e-7,0.00006594257,0.0024681552],"genre_scores_gemma":[0.99636686,0.000009308731,0.001754862,0.00017008815,0.000027609349,9.415429e-7,0.000003875915,0.000002961918,0.0016634789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993904,0.000046865385,0.00008138586,0.00028268062,0.000037314076,0.00016133752],"domain_scores_gemma":[0.9995223,0.00006070407,0.000031544238,0.00025150023,0.000059328115,0.0000745862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006002077,0.000069385926,0.00006494933,0.00023178413,0.00011117926,0.00005902328,0.0003045532,0.000035643672,0.00007041453],"category_scores_gemma":[0.000018686684,0.00007980002,0.000036729103,0.0012043972,0.000019878698,0.0006999738,0.000108069384,0.000080626036,0.00025376637],"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.0000055722126,0.00029913522,0.0073634917,0.000005020309,0.000015747473,0.000045327313,0.00032386926,0.18918453,0.0024461723,0.7933335,0.0020431872,0.0049344413],"study_design_scores_gemma":[0.0006688999,0.000055728597,0.04188475,0.000004763407,0.0000047038907,0.0000067842825,0.00007471654,0.8468501,0.00050047424,0.10661664,0.0031158389,0.00021661253],"about_ca_topic_score_codex":0.0002497334,"about_ca_topic_score_gemma":0.00018785152,"teacher_disagreement_score":0.68671685,"about_ca_system_score_codex":0.00006339056,"about_ca_system_score_gemma":0.0000427172,"threshold_uncertainty_score":0.32617378},"labels":[],"label_agreement":null},{"id":"W2964027251","doi":"10.20382/jocg.v7i1a12","title":"An algorithm for the Euclidean cell decomposition of a non-compact strictly convex projective surface","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council","keywords":"Mathematics; Euclidean geometry; Regular polygon; Convex body; Projective test; Decomposition; Surface (topology); Algorithm; Combinatorics; Computer science; Pure mathematics; Convex optimization; Geometry; Chemistry","score_opus":0.018727385570210524,"score_gpt":0.26946614948031444,"score_spread":0.2507387639101039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964027251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16736381,0.00010373286,0.8311759,0.00026920665,0.00043696447,0.00026378146,0.000025942327,0.000016835076,0.0003438097],"genre_scores_gemma":[0.79972565,0.000010057386,0.19986448,0.00009527692,0.00016726636,2.2334653e-7,0.00002166006,0.000008368565,0.00010699255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981867,0.00018154421,0.00045913752,0.00023619956,0.00073869526,0.00019771344],"domain_scores_gemma":[0.9953975,0.0008903874,0.00081508927,0.00019740775,0.002479571,0.00022002365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008977657,0.0001727222,0.0003210512,0.0008325056,0.00019236577,0.000110993096,0.0008802412,0.000074802185,0.000005377822],"category_scores_gemma":[0.000046836976,0.00015112461,0.00021653395,0.0018633474,0.00007100813,0.0012252331,0.000069402835,0.00019794275,0.000002736924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013244474,0.00033725693,0.00033733368,0.000015923903,0.0001309007,0.000019696501,0.0007365102,0.97682595,0.00086567225,0.0032396254,0.001174719,0.016183976],"study_design_scores_gemma":[0.0027051212,0.0015969201,0.0056176474,0.000026774673,0.00008902432,0.00009338339,0.000944359,0.9783935,0.0041384934,0.0034431035,0.0027260343,0.00022566745],"about_ca_topic_score_codex":0.000023715445,"about_ca_topic_score_gemma":0.0000012143931,"teacher_disagreement_score":0.6323619,"about_ca_system_score_codex":0.00021512625,"about_ca_system_score_gemma":0.0008630632,"threshold_uncertainty_score":0.6162683},"labels":[],"label_agreement":null},{"id":"W2964073220","doi":"10.48550/arxiv.1207.1500","title":"The Erdős-Sós Conjecture for Geometric Graphs","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Discrete mathematics","score_opus":0.027482280549933232,"score_gpt":0.27425150183263947,"score_spread":0.24676922128270623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964073220","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.0013353332,0.0030549574,0.9863992,0.002390839,0.0040580775,0.0006566159,0.000013048744,0.00015879655,0.0019331509],"genre_scores_gemma":[0.82656133,0.00025701785,0.16408329,0.0010694693,0.0011985874,0.00041276854,0.00016117755,0.000024785159,0.0062315706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855304,0.000059344227,0.00027527643,0.00043925288,0.0003296011,0.00034349423],"domain_scores_gemma":[0.99803525,0.0007599472,0.00017170918,0.00069054146,0.00024157886,0.00010097076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072943006,0.00021190858,0.00017818001,0.00030876862,0.0003918843,0.0005088731,0.0011980423,0.0001900679,0.000016618353],"category_scores_gemma":[0.00013609405,0.00013959616,0.0002181093,0.00077513227,0.000030976647,0.00015750816,0.0008220151,0.00028174766,0.000031094587],"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.0000063728007,0.00004816835,0.00006414686,0.00005315127,0.00008570243,5.2071704e-7,0.00013353872,0.010531538,0.000031421885,0.7293303,0.03237536,0.22733976],"study_design_scores_gemma":[0.0005211653,0.0000950874,0.0035213523,0.00002302069,0.000053489788,0.000022650487,0.000015393822,0.13790481,0.0022832975,0.48610398,0.36869946,0.0007562875],"about_ca_topic_score_codex":0.00001149988,"about_ca_topic_score_gemma":0.000010380229,"teacher_disagreement_score":0.825226,"about_ca_system_score_codex":0.00004225681,"about_ca_system_score_gemma":0.00017998074,"threshold_uncertainty_score":0.5692566},"labels":[],"label_agreement":null},{"id":"W2964178647","doi":"10.20382/jocg.v7i2a8","title":"$1$-string $B_2$-VPG representation of planar graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Planar; Planar graph; String (physics); Enhanced Data Rates for GSM Evolution; Graph; Representation (politics); Grid; Geometry; Computer science; Telecommunications","score_opus":0.015875335257328694,"score_gpt":0.22345510327284096,"score_spread":0.20757976801551226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964178647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2756798,0.000067839814,0.7224192,0.00078835455,0.00037764994,0.00006012265,0.000008315471,0.00002176776,0.00057693326],"genre_scores_gemma":[0.9363845,0.00005744989,0.06290654,0.00007496798,0.00010829849,1.2056027e-7,0.000005757868,0.0000067076926,0.00045568464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813753,0.00014510263,0.0005313532,0.00023470823,0.0007721624,0.00017916568],"domain_scores_gemma":[0.99712986,0.00070805516,0.0008030337,0.00019286698,0.001019963,0.00014621034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003670637,0.00014137368,0.0002948705,0.0019786227,0.000108634944,0.000042725806,0.0006823573,0.00007112702,0.00003553852],"category_scores_gemma":[0.00014914453,0.000121306846,0.00023962442,0.0024775623,0.00007316462,0.0013307363,0.00010039441,0.00011965205,0.000008917067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025985885,0.00030620172,0.009236641,0.0000435363,0.00038475558,0.00020969738,0.00031017634,0.14525874,0.011620088,0.73451537,0.002991404,0.09486351],"study_design_scores_gemma":[0.018895123,0.0034112835,0.2783292,0.0010547773,0.00040738197,0.0017458133,0.00083416636,0.031623747,0.06105848,0.53684765,0.063637756,0.0021546038],"about_ca_topic_score_codex":0.0000064622423,"about_ca_topic_score_gemma":0.0000012405343,"teacher_disagreement_score":0.6607047,"about_ca_system_score_codex":0.00012447375,"about_ca_system_score_gemma":0.0002698093,"threshold_uncertainty_score":0.49467498},"labels":[],"label_agreement":null},{"id":"W2964188527","doi":"10.48550/arxiv.1403.3004","title":"Approximation of length minimization problems among compact connected\\n sets","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Social connectedness; Geodesic; Minification; Compact space; Convergence (economics); Limit (mathematics); Measure (data warehouse); Term (time); Mathematical analysis; Applied mathematics; Mathematical optimization","score_opus":0.04168812356260129,"score_gpt":0.17055537393608455,"score_spread":0.12886725037348326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964188527","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.41602218,0.0000038055161,0.5824635,0.000032578522,0.00007358174,0.000090563706,9.62597e-7,0.000055291446,0.0012575309],"genre_scores_gemma":[0.9969978,0.0000057549255,0.0026944166,0.000029291194,0.000022440065,2.3567426e-7,0.000026338423,0.000004361303,0.00021937187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922407,0.00012024028,0.0001500441,0.00029947862,0.00008130527,0.00012489443],"domain_scores_gemma":[0.9991972,0.00011620834,0.00017532716,0.0002627829,0.00018516186,0.000063313884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020556903,0.00009411,0.00012277947,0.0001865748,0.0000934343,0.000034270764,0.00030566953,0.000052036143,0.000013982441],"category_scores_gemma":[0.000053231433,0.0001053173,0.000048661837,0.00080741534,0.000042153544,0.0006564456,0.00005382941,0.000057105273,0.000015063268],"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.0000063552416,0.00006426236,0.004793534,0.000023658298,0.000014501674,0.0000011736579,0.0001995111,0.7275888,0.00039210165,0.26503232,0.00014088103,0.0017429373],"study_design_scores_gemma":[0.0003943262,0.00007203344,0.018183593,0.000016401927,0.0000102597405,0.000001473009,0.000016724023,0.96804845,0.0016105259,0.011299389,0.00023017249,0.00011666609],"about_ca_topic_score_codex":0.000024356781,"about_ca_topic_score_gemma":0.000014327301,"teacher_disagreement_score":0.5809756,"about_ca_system_score_codex":0.00003473574,"about_ca_system_score_gemma":0.000033730823,"threshold_uncertainty_score":0.42947146},"labels":[],"label_agreement":null},{"id":"W2964200445","doi":"10.20382/jocg.v8i2a2","title":"Degree four plane spanners: Simpler and better","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Spanner; Combinatorics; Degree (music); Mathematics; Upper and lower bounds; Equilateral triangle; Bounded function; Euclidean geometry; Delaunay triangulation; Plane (geometry); General position; Geometry; Physics; Mathematical analysis","score_opus":0.036005960153360064,"score_gpt":0.2348440229917289,"score_spread":0.19883806283836886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964200445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39610547,0.0000843818,0.59787905,0.0031747108,0.00050440547,0.00006388726,0.000006814359,0.000020893327,0.0021603976],"genre_scores_gemma":[0.9302503,0.000030442658,0.0684603,0.00034097306,0.0003047906,8.829125e-8,0.000005763838,0.0000068839317,0.0006004574],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986403,0.00007430752,0.00029736655,0.00023904868,0.00055150525,0.0001974827],"domain_scores_gemma":[0.99802625,0.00028455618,0.0006567106,0.00026668457,0.00056627166,0.00019951769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037149768,0.00015582066,0.00024907675,0.0009247123,0.00052887475,0.0004006527,0.0009485638,0.00007668456,0.000028692317],"category_scores_gemma":[0.0001238828,0.00015906087,0.00012349385,0.00037717377,0.00009777942,0.0017757309,0.0003152146,0.00022521801,0.000011797703],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041174327,0.00045167122,0.03607296,0.000119815515,0.0009908316,0.0028376637,0.00082369044,0.23738602,0.0011591668,0.22077347,0.017323932,0.48164904],"study_design_scores_gemma":[0.006109811,0.00095122895,0.6902185,0.00015242868,0.00015674367,0.0022490926,0.0001999284,0.089277245,0.0006118878,0.0561374,0.1529264,0.0010093083],"about_ca_topic_score_codex":0.0000103309785,"about_ca_topic_score_gemma":0.000004445116,"teacher_disagreement_score":0.65414554,"about_ca_system_score_codex":0.00007490083,"about_ca_system_score_gemma":0.00018508513,"threshold_uncertainty_score":0.64863145},"labels":[],"label_agreement":null},{"id":"W2964205487","doi":"10.1214/16-ecp4418","title":"Recurrence of multiply-ended planar triangulations","year":2017,"lang":"en","type":"article","venue":"Electronic Communications in Probability","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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 British Columbia","funders":"Agence Nationale de la Recherche","keywords":"Planar; Combinatorics; Computer science; Mathematics; Computer graphics (images)","score_opus":0.06071986030963653,"score_gpt":0.3370456674072857,"score_spread":0.27632580709764915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964205487","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.2853054,0.0025377835,0.67795557,0.015552275,0.00041944016,0.0018989863,0.000023606985,0.00019578487,0.016111135],"genre_scores_gemma":[0.92699385,0.000101860634,0.072722524,0.000016821325,0.000010757508,0.00007408386,0.000018813036,0.0000027587225,0.00005851437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866766,0.00025164417,0.00040920987,0.00027724035,0.00017104864,0.00022318691],"domain_scores_gemma":[0.9951934,0.00034690727,0.00028394494,0.003963718,0.00017691847,0.000035088673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011674445,0.00009261373,0.00015834435,0.00012579856,0.0004843804,0.000084770516,0.0030338783,0.000051773004,0.000006668965],"category_scores_gemma":[0.0008718331,0.00009986745,0.0000595329,0.00034261396,0.00018884066,0.0005561609,0.00047296268,0.00026813438,0.0000061191954],"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.000011350015,0.00038942546,0.008515415,0.0000131929555,0.0000126858995,1.5385906e-7,0.00045316876,0.0008890012,0.00039492283,0.9075117,0.000061565755,0.081747435],"study_design_scores_gemma":[0.00084786804,0.000103984516,0.25471365,0.000036171623,0.000007100621,0.000004807314,0.000013550079,0.17070115,0.0012205279,0.5670078,0.005125428,0.0002179757],"about_ca_topic_score_codex":0.0001022169,"about_ca_topic_score_gemma":0.0012437821,"teacher_disagreement_score":0.64168847,"about_ca_system_score_codex":0.0001711568,"about_ca_system_score_gemma":0.00040605117,"threshold_uncertainty_score":0.5637751},"labels":[],"label_agreement":null},{"id":"W2964334818","doi":"10.4230/lipics.socg.2016.19","title":"On Visibility Representations of Non-Planar Graphs","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"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":"Planar graph; Combinatorics; Embedding; Book embedding; Time complexity; Mathematics; Discrete mathematics; Rectangle; Visibility; 1-planar graph; Computer science; Graph; Chordal graph; Geometry; Artificial intelligence; Physics","score_opus":0.013139787585957508,"score_gpt":0.27598739435984493,"score_spread":0.2628476067738874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964334818","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.23635943,0.00000693278,0.75931764,0.00045072514,0.0005656066,0.0005327106,0.0002268415,0.00007765274,0.0024624693],"genre_scores_gemma":[0.9613677,0.000011793705,0.037639916,0.00046174935,0.00005336833,0.00005773566,0.000120882854,0.000011198411,0.00027562867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805236,0.000036942267,0.00083703786,0.00027159753,0.00047198663,0.00033007096],"domain_scores_gemma":[0.9979041,0.00043719515,0.00036490208,0.0007893513,0.00037508385,0.00012935225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005095562,0.00020414537,0.0002573629,0.00034876956,0.00018916845,0.00010230219,0.0007055845,0.00009784882,0.000025612026],"category_scores_gemma":[0.0001898495,0.00014923,0.00019674854,0.00048803652,0.00008024809,0.001247325,0.0001315832,0.00010736971,0.00009042201],"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.00037664457,0.0015665467,0.013495621,0.00062393973,0.00038469964,0.0000061138066,0.0086745685,0.0029880835,0.0070020393,0.77343464,0.030400874,0.1610462],"study_design_scores_gemma":[0.022128932,0.0042191087,0.11346473,0.0011118053,0.00014564987,0.00014080905,0.00092161883,0.32870752,0.12205149,0.35928768,0.04479794,0.0030227164],"about_ca_topic_score_codex":0.000008238844,"about_ca_topic_score_gemma":0.000006992368,"teacher_disagreement_score":0.7250083,"about_ca_system_score_codex":0.000059950202,"about_ca_system_score_gemma":0.00008324995,"threshold_uncertainty_score":0.6085423},"labels":[],"label_agreement":null},{"id":"W2969438042","doi":"10.1007/978-3-030-35802-0_2","title":"Representing Graphs and Hypergraphs by Touching Polygons in 3D","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of British Columbia","funders":"","keywords":"Regular polygon; Vertex (graph theory); Graph; Point (geometry); Enhanced Data Rates for GSM Evolution; Graph drawing; Construct (python library); Time complexity","score_opus":0.010227860605101719,"score_gpt":0.2329833352907458,"score_spread":0.22275547468564408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969438042","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.0053824023,0.0015414597,0.98900145,0.00044956,0.0010984038,0.00030563836,0.000004238804,0.00008435681,0.0021324884],"genre_scores_gemma":[0.64453524,0.00021601994,0.3520407,0.0016697532,0.00020860249,0.000009162305,0.000022306507,0.00003959811,0.0012586254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687797,0.000041463012,0.00046129778,0.0014516804,0.0006771422,0.00049044815],"domain_scores_gemma":[0.99838877,0.00048354163,0.00020264307,0.0007024467,0.00010732797,0.00011527147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081009086,0.00034256667,0.00038418625,0.0011302918,0.00021535995,0.00070652907,0.0012745078,0.00021150042,0.000008427552],"category_scores_gemma":[0.00008936745,0.00036915232,0.00007649828,0.0009794023,0.00024170031,0.000731778,0.0009727888,0.0006233035,0.000009602001],"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.0000041566855,0.000035047444,0.0013625142,0.000043186443,0.000011130816,0.000053364776,0.000643103,0.073745005,0.00096054695,0.030733023,0.0000755891,0.8923333],"study_design_scores_gemma":[0.00037507882,0.00009369097,0.0012108077,0.00035482107,0.000005388174,0.00011615074,3.157585e-7,0.8293495,0.0005780964,0.16589814,0.0013119801,0.0007059815],"about_ca_topic_score_codex":0.0001054259,"about_ca_topic_score_gemma":0.00018491426,"teacher_disagreement_score":0.8916274,"about_ca_system_score_codex":0.000095481555,"about_ca_system_score_gemma":0.00028912057,"threshold_uncertainty_score":0.999876},"labels":[],"label_agreement":null},{"id":"W2969485706","doi":"10.1007/978-3-030-35802-0_31","title":"Line and Plane Cover Numbers Revisited","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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 Waterloo","funders":"","keywords":"Combinatorics; Cover (algebra); Mathematics; Vertex (graph theory); Vertex cover; Planar graph; Graph; Covering space; Plane (geometry); Dimension (graph theory); Discrete mathematics; Geometry","score_opus":0.014416126338365564,"score_gpt":0.26437236772436823,"score_spread":0.24995624138600267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969485706","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.029602492,0.0006753543,0.9656298,0.0012248384,0.0023110546,0.0003846849,0.0000075892367,0.000108953645,0.00005521567],"genre_scores_gemma":[0.68859804,0.00004842175,0.309629,0.001378533,0.00030361357,0.000006125324,0.000022730388,0.0000072856624,0.000006258355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997006,0.00009069946,0.00037648535,0.0014148372,0.00069303875,0.0004189456],"domain_scores_gemma":[0.99806935,0.0004344522,0.00019614208,0.0009567457,0.0002095397,0.00013376481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009083942,0.00032441833,0.00037487835,0.00059728563,0.0001450407,0.0008368509,0.0016291791,0.00020879418,0.000009277202],"category_scores_gemma":[0.0001523455,0.0003050147,0.00006010608,0.001471646,0.00018872811,0.00047435454,0.0028113688,0.00065108243,0.000039873157],"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.0000047519957,0.000028732607,0.0005986072,0.00007218049,0.0000064769774,0.00001563323,0.0004552449,0.78180337,0.00023188701,0.00054218934,0.000050694303,0.21619025],"study_design_scores_gemma":[0.00024697298,0.00007653739,0.002801201,0.00017807673,0.0000042487595,0.00004939187,1.11070975e-7,0.9745637,0.0023734076,0.019045934,0.0002937581,0.00036665966],"about_ca_topic_score_codex":0.000037102127,"about_ca_topic_score_gemma":0.0000104960745,"teacher_disagreement_score":0.6589955,"about_ca_system_score_codex":0.00013149,"about_ca_system_score_gemma":0.0004938725,"threshold_uncertainty_score":0.9999402},"labels":[],"label_agreement":null},{"id":"W2970239944","doi":"","title":"Description de formes complexes par subdivision de graphes de courbures","year":2018,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Centre Hospitalier de l’Université de Montréal","funders":"","keywords":"Computer science; Subdivision; Geography","score_opus":0.02783221269685329,"score_gpt":0.24990239681461124,"score_spread":0.22207018411775795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970239944","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.27178404,0.0015804275,0.7111139,0.008074661,0.0004677093,0.00035682003,0.000041030347,0.00028947424,0.006291893],"genre_scores_gemma":[0.7034108,0.00095530954,0.29048818,0.00033054978,0.0001515549,0.00006710553,0.00036780947,0.00003755118,0.004191166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98864454,0.007763705,0.00080474897,0.0011370471,0.0007190284,0.0009309534],"domain_scores_gemma":[0.9918599,0.001882087,0.0007165723,0.0017587164,0.0033033446,0.00047938924],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.011226234,0.0005379672,0.00047710774,0.00040027028,0.0012480343,0.0016771164,0.0021215165,0.0004822754,0.00016396066],"category_scores_gemma":[0.0017843922,0.00062459905,0.0003686917,0.000892181,0.00057029806,0.000729327,0.0014346502,0.0006773085,0.00009295404],"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.000046878464,0.001259518,0.019950528,0.00036185244,0.00018809712,0.000018544191,0.030974578,0.0054575177,0.026560836,0.7930104,0.016475312,0.10569591],"study_design_scores_gemma":[0.00061056897,0.0000041590047,0.08647566,0.0018417977,0.0000895988,0.00012501156,0.00011528958,0.63887966,0.12009386,0.1202247,0.030780556,0.0007591257],"about_ca_topic_score_codex":0.002595829,"about_ca_topic_score_gemma":0.002152765,"teacher_disagreement_score":0.67278576,"about_ca_system_score_codex":0.00052746764,"about_ca_system_score_gemma":0.0013399654,"threshold_uncertainty_score":0.99962056},"labels":[],"label_agreement":null},{"id":"W2970343152","doi":"10.20382/jocg.v10i2a3","title":"Orthogonal Terrain Guarding is NP-complete","year":2019,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Terrain; Combinatorics; Vertex (graph theory); Mathematics; Order (exchange); Monotone polygon; Algorithm; Geometry; Graph; Geography; Cartography","score_opus":0.010550889057796328,"score_gpt":0.20784771048753956,"score_spread":0.19729682142974322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970343152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35260877,0.00009159531,0.6398996,0.0014064705,0.00089289853,0.00011333229,0.00001319812,0.000039111168,0.0049350304],"genre_scores_gemma":[0.91521174,0.000014987518,0.081475385,0.001112743,0.00026339618,1.3303078e-7,0.000016140182,0.000011996683,0.0018934581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.997724,0.0001464547,0.0005049536,0.0003422288,0.0010017285,0.00028065155],"domain_scores_gemma":[0.99766797,0.0004119608,0.0005972962,0.00023662786,0.0008835862,0.00020257809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005635735,0.00020992896,0.00035995516,0.0018531737,0.00017549275,0.00016359218,0.00097519305,0.000092108035,0.00023320063],"category_scores_gemma":[0.000046160527,0.00022438138,0.00033213175,0.002246298,0.000043489566,0.0014479941,0.00023446864,0.00032114927,0.00013858668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017168628,0.00028014317,0.007530789,0.000065054584,0.00047425376,0.0002977289,0.0009125161,0.6896392,0.0029999828,0.26360837,0.009153525,0.024866756],"study_design_scores_gemma":[0.0070738066,0.0015060169,0.059542533,0.00021376666,0.00013734629,0.0020003582,0.00054829527,0.2662038,0.00092956866,0.04445071,0.6159052,0.0014885953],"about_ca_topic_score_codex":0.0000038223616,"about_ca_topic_score_gemma":6.744673e-7,"teacher_disagreement_score":0.6067517,"about_ca_system_score_codex":0.00019476346,"about_ca_system_score_gemma":0.00040995583,"threshold_uncertainty_score":0.9150007},"labels":[],"label_agreement":null},{"id":"W2971434485","doi":"10.1109/focs.2019.00069","title":"Truly Optimal Euclidean Spanners","year":2019,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":31,"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 Victoria","funders":"","keywords":"Spanner; Combinatorics; Euclidean geometry; Dimension (graph theory); Euclidean space; Mathematics; Greedy algorithm; Inverse; Euclidean distance; Discrete mathematics; Computer science; Algorithm; Geometry","score_opus":0.0060988982193769655,"score_gpt":0.2129762548403736,"score_spread":0.20687735662099666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971434485","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.21020004,0.00001788724,0.75285566,0.0008839766,0.0004778122,0.00007265698,2.4046253e-7,0.00011368812,0.035378058],"genre_scores_gemma":[0.86947626,0.0000013732171,0.11929574,0.00062364404,0.000060675484,0.000001836541,0.0000035908793,0.0000025588974,0.010534347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994327,0.000016131433,0.00009067944,0.00019450921,0.00015247734,0.00011352356],"domain_scores_gemma":[0.9996539,0.00003775196,0.000022067768,0.00019841071,0.000041957388,0.00004592825],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000118490025,0.00005413135,0.000055720866,0.000070691916,0.000033576,0.000085565094,0.00026275616,0.00001997515,0.00019918397],"category_scores_gemma":[0.000008227531,0.00004795688,0.00003264854,0.00025489356,0.0000052581213,0.00034654725,0.00007811578,0.00003819323,0.0011233081],"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.0000056355434,0.00004759775,0.00083515636,0.00000684044,0.000014920298,0.000004675044,0.00026692386,0.08468595,0.003523828,0.81887907,0.008237392,0.083492],"study_design_scores_gemma":[0.0004915423,0.00015516671,0.007597253,0.000005098297,0.0000023430669,0.000023555422,0.000035917048,0.90472525,0.008179218,0.0038419373,0.07467458,0.0002681229],"about_ca_topic_score_codex":0.0000048498414,"about_ca_topic_score_gemma":9.652601e-7,"teacher_disagreement_score":0.82003933,"about_ca_system_score_codex":0.000012014726,"about_ca_system_score_gemma":0.00003657086,"threshold_uncertainty_score":0.9996544},"labels":[],"label_agreement":null},{"id":"W2972518024","doi":"10.1007/978-3-030-30786-8_20","title":"Maximum Matchings and Minimum Blocking Sets in $$\\varTheta _6$$ -Graphs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Collège Boréal; University of Waterloo","funders":"","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Conjecture; Discrete mathematics; Equilateral triangle; Geometry","score_opus":0.012409481188551409,"score_gpt":0.23575382215726337,"score_spread":0.22334434096871197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972518024","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.009314737,0.0007563952,0.9850661,0.0010298679,0.00159671,0.00042253805,0.0000036199995,0.00008562398,0.0017243744],"genre_scores_gemma":[0.7267802,0.000108256,0.27006543,0.0021836017,0.00025696817,0.0000085890315,0.000014983606,0.00004209671,0.0005398845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653065,0.000044032826,0.00052708155,0.0015155036,0.0008276806,0.0005550419],"domain_scores_gemma":[0.9982523,0.00042781077,0.00024155916,0.0007951916,0.00014780033,0.00013535573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095712615,0.00046792868,0.00048397118,0.0014916984,0.00017899853,0.00059229875,0.0015435079,0.00026972275,0.000012854991],"category_scores_gemma":[0.00005044344,0.00045976855,0.00009145259,0.0008610652,0.00026845865,0.0007044908,0.0011095803,0.00066854025,0.00003382813],"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.000009979118,0.00004157143,0.00063247886,0.00008337701,0.000013034875,0.00010368193,0.0016896884,0.099333696,0.00032551456,0.047442812,0.000025547595,0.85029864],"study_design_scores_gemma":[0.00036852102,0.00011252949,0.0008535064,0.0003314251,0.0000047003778,0.00012024043,2.6013797e-7,0.62307364,0.0003038023,0.37326792,0.0009882321,0.0005752605],"about_ca_topic_score_codex":0.000022225042,"about_ca_topic_score_gemma":0.00010320584,"teacher_disagreement_score":0.84972334,"about_ca_system_score_codex":0.00013707299,"about_ca_system_score_gemma":0.00045544954,"threshold_uncertainty_score":0.9997854},"labels":[],"label_agreement":null},{"id":"W2973401770","doi":"10.1142/s021819591950002x","title":"Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints","year":2019,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"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":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Upper and lower bounds; Discrete mathematics; Graph","score_opus":0.015887978363585277,"score_gpt":0.2665921095269326,"score_spread":0.2507041311633473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973401770","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.4646575,0.00093246263,0.5324724,0.000940255,0.00020256416,0.00035862645,0.000011494109,0.0000067919523,0.00041797047],"genre_scores_gemma":[0.9721727,0.000051307987,0.02751811,0.00013738051,0.000070986,0.00001953685,0.00000739021,0.000004168102,0.000018448256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796796,0.00009168549,0.00075266033,0.00017434385,0.0009088488,0.000104506595],"domain_scores_gemma":[0.9973347,0.00058394525,0.0006696178,0.00016226222,0.0012090615,0.000040413805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079694006,0.0001047398,0.00021040045,0.00074301806,0.000038645616,0.0000700178,0.0010129589,0.000040129587,0.000016794249],"category_scores_gemma":[0.00008200781,0.00008328645,0.000092167225,0.0008820293,0.00016427018,0.0004918272,0.00011757468,0.0001647352,0.0000041946514],"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.000079751815,0.00061075157,0.016470691,0.00012086344,0.0002454332,0.0000071652294,0.0019321749,0.32316786,0.009401512,0.5369038,0.00012564499,0.110934354],"study_design_scores_gemma":[0.0062542967,0.00096697046,0.30764565,0.0013165897,0.00010452135,0.0019317808,0.0026006585,0.201872,0.01938675,0.44356826,0.013351771,0.0010007451],"about_ca_topic_score_codex":0.000007037305,"about_ca_topic_score_gemma":9.76101e-7,"teacher_disagreement_score":0.5075152,"about_ca_system_score_codex":0.000026024127,"about_ca_system_score_gemma":0.00020870096,"threshold_uncertainty_score":0.33963227},"labels":[],"label_agreement":null},{"id":"W2982460817","doi":"10.48550/arxiv.1910.14289","title":"Expected Complexity of Routing in $Θ$ 6 and Half-$Θ$ 6 Graphs","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Equal-cost multi-path routing; Static routing; Multipath routing; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Combinatorics; Computer science; Mathematics; Dynamic Source Routing; Discrete mathematics; Algorithm; Routing (electronic design automation); Computer network; Routing protocol","score_opus":0.10356198600229301,"score_gpt":0.19935055110720415,"score_spread":0.09578856510491114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982460817","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.683966,0.00004298762,0.31495064,0.000041282146,0.00019905315,0.00014289051,0.00000377189,0.000037756527,0.00061564654],"genre_scores_gemma":[0.996667,0.000037297974,0.003097835,0.000022904613,0.000014694852,2.9610413e-7,0.000017948829,0.0000046066866,0.0001373625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988791,0.00011277406,0.00018946311,0.00059242186,0.00007272419,0.00015355767],"domain_scores_gemma":[0.9991043,0.00009768949,0.0002006935,0.00042710188,0.000116596784,0.00005360661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002019782,0.00014922123,0.0002502185,0.0003898613,0.000047001202,0.000039997634,0.0005149618,0.00012255936,0.0000066966627],"category_scores_gemma":[0.000026439393,0.00018434889,0.0000722699,0.0006903622,0.00008609254,0.00021196474,0.00095236424,0.00024118765,0.0000049204177],"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.000014939079,0.00006538553,0.015488913,0.00006952056,0.000025567098,0.000025863796,0.00046556516,0.21202107,0.00015042299,0.77112806,0.000018723875,0.00052598165],"study_design_scores_gemma":[0.00044148153,0.0000308788,0.053642955,0.00007490613,0.000008627432,0.000002552802,0.00006281966,0.8012636,0.00021294931,0.1440304,0.000017117854,0.00021175551],"about_ca_topic_score_codex":0.00024740817,"about_ca_topic_score_gemma":0.00009294749,"teacher_disagreement_score":0.62709767,"about_ca_system_score_codex":0.000056376688,"about_ca_system_score_gemma":0.0001102679,"threshold_uncertainty_score":0.7517529},"labels":[],"label_agreement":null},{"id":"W2985209850","doi":"10.1145/3355089.3356514","title":"Checkerboard patterns with black rectangles","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"King Abdullah University of Science and Technology","keywords":"Polygon mesh; Checkerboard; Diagonal; Volume mesh; Computer science; Integer (computer science); Mathematics; Computer graphics (images); Geometry; Mesh generation; Engineering; Finite element method","score_opus":0.013406366388505963,"score_gpt":0.22449910994542144,"score_spread":0.21109274355691549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985209850","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.23076381,0.000012150798,0.76709396,0.0012867263,0.00023790041,0.00013621172,0.0000064150863,0.00011852474,0.00034432937],"genre_scores_gemma":[0.97493374,0.00004695966,0.023859598,0.000699465,0.000026800617,0.000013601154,0.000008247582,0.0000095316445,0.00040205487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999064,0.000036972575,0.00012742254,0.00031668582,0.00029464273,0.00016027765],"domain_scores_gemma":[0.9990503,0.00011436595,0.000043192584,0.0006388976,0.00009000552,0.0000632318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010750816,0.000121974415,0.00010112232,0.00023396619,0.000110986664,0.000084251194,0.00045542858,0.000056520155,0.000054625005],"category_scores_gemma":[0.0000052188525,0.0001057203,0.0000694123,0.0007888526,0.000026932878,0.0003200542,0.0000071117743,0.00017897364,0.0001297425],"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.00036387204,0.002089796,0.01808225,0.0002898602,0.00073952845,0.00006387621,0.0049291486,0.2890427,0.0054159504,0.23014942,0.0015276064,0.44730598],"study_design_scores_gemma":[0.009630483,0.008073336,0.20082897,0.0007217412,0.00027382182,0.0003521885,0.00078458694,0.49209347,0.11063848,0.10389801,0.06794935,0.004755554],"about_ca_topic_score_codex":0.000012161945,"about_ca_topic_score_gemma":0.00005695647,"teacher_disagreement_score":0.74416995,"about_ca_system_score_codex":0.000018639977,"about_ca_system_score_gemma":0.00004782337,"threshold_uncertainty_score":0.43111485},"labels":[],"label_agreement":null},{"id":"W2985259086","doi":"10.1007/978-3-030-39881-1_8","title":"Packing Trees into 1-Planar Graphs","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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 Lethbridge","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Planar; Packing problems; Disjoint sets; Matching (statistics); Path (computing); Graph; Computer science","score_opus":0.02224383213300857,"score_gpt":0.27244506797246365,"score_spread":0.2502012358394551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985259086","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.0136282565,0.0004622832,0.9763004,0.0056254785,0.0033640314,0.00031634,0.0000030127287,0.0002724781,0.000027675958],"genre_scores_gemma":[0.56056005,0.000015437272,0.4376645,0.0014075852,0.00031937545,0.000012573988,0.000012009219,0.000008066306,3.7455055e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959539,0.00013266705,0.0004982331,0.0018354148,0.001034571,0.00054519816],"domain_scores_gemma":[0.9978457,0.00038048677,0.00024238694,0.0010581465,0.00024384061,0.00022943204],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00081839104,0.00042698171,0.0004277695,0.0009243837,0.00033015394,0.0011683697,0.0036838015,0.00021568696,0.000004585331],"category_scores_gemma":[0.00023361195,0.00041415653,0.00014581053,0.0033060077,0.00026795085,0.00061526446,0.0026271744,0.000893886,0.000025434218],"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.0000037667783,0.000039072977,0.00048257588,0.00004740741,0.00000959949,0.000048999296,0.002161529,0.49196923,0.00175021,0.0048043616,0.000037473255,0.49864578],"study_design_scores_gemma":[0.00012344742,0.00006328168,0.002371383,0.0000933769,0.0000034805878,0.000015671149,3.189395e-7,0.6721887,0.004912375,0.31978023,0.00009600086,0.00035171545],"about_ca_topic_score_codex":0.000096307835,"about_ca_topic_score_gemma":0.00014366437,"teacher_disagreement_score":0.5469318,"about_ca_system_score_codex":0.0001981808,"about_ca_system_score_gemma":0.0008128846,"threshold_uncertainty_score":0.9998685},"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":"W2989202310","doi":"10.1007/978-3-030-39881-1_9","title":"Angle Covers: Algorithms and Complexity","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 British Columbia","funders":"","keywords":"Graph; Vertex (graph theory); Planar graph; Degree (music); Angle of rotation; Vertex cover; Planar; Regular graph","score_opus":0.038577695229011257,"score_gpt":0.2577262969465937,"score_spread":0.21914860171758246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989202310","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.000050154933,0.00053249067,0.99330705,0.0021047005,0.0010726192,0.0002535025,0.000010290525,0.00013137303,0.0025378298],"genre_scores_gemma":[0.09855936,0.000064896594,0.895908,0.004274837,0.000859043,0.0000058614005,0.000026402176,0.00002572578,0.00027588126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972258,0.000028558105,0.00034622668,0.001292178,0.000760365,0.0003468546],"domain_scores_gemma":[0.9985808,0.0002853078,0.00017253506,0.0005597054,0.00018420095,0.00021745084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041444294,0.0003649511,0.000382108,0.0004496424,0.00025535075,0.00056171196,0.0013204714,0.0001708548,0.000019051588],"category_scores_gemma":[0.0000689249,0.00036156358,0.00007413721,0.00060543156,0.0005496322,0.000596797,0.0011752634,0.00047696976,0.000038974747],"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.000005449458,0.000021760023,0.00001920338,0.000030410736,0.000012685247,0.000077070494,0.00050330115,0.025112959,0.0001434284,0.14597085,0.00009739379,0.8280055],"study_design_scores_gemma":[0.00020846087,0.00014622015,0.00016492956,0.000067405825,0.0000045658103,0.000062428175,8.892554e-8,0.69116414,0.00048513536,0.30338648,0.0039248765,0.0003853014],"about_ca_topic_score_codex":0.000012346401,"about_ca_topic_score_gemma":0.000022829765,"teacher_disagreement_score":0.8276202,"about_ca_system_score_codex":0.00013761861,"about_ca_system_score_gemma":0.00037425026,"threshold_uncertainty_score":0.99988365},"labels":[],"label_agreement":null},{"id":"W2991021809","doi":"10.20382/jocg.v11i1a9","title":"Expected complexity of routing in $\\Theta_6$ and half-$\\Theta_6$ graphs","year":2019,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Agence Nationale de la Recherche; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Combinatorics; Routing (electronic design automation); Mathematics; Computer science; Computer network","score_opus":0.017390958792990508,"score_gpt":0.22358187761549406,"score_spread":0.20619091882250354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991021809","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.7478125,0.0002470143,0.23887195,0.002560464,0.00009376434,0.00022358214,0.0000033182707,0.00008256893,0.010104861],"genre_scores_gemma":[0.9351166,0.000037978396,0.06404961,0.000051145133,0.0000041253847,0.000008070715,0.000029778246,0.000007900765,0.00069483294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717927,0.0015159763,0.00037930757,0.00043277,0.00028334168,0.00020934579],"domain_scores_gemma":[0.9975665,0.00071986375,0.00022869316,0.00077179656,0.0006338431,0.000079267484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024788857,0.000137265,0.00021844998,0.00025391215,0.00011944503,0.00013542989,0.00060941675,0.00006398054,0.00004029783],"category_scores_gemma":[0.0003219705,0.00014546793,0.0000659538,0.0008932788,0.00012885946,0.0003581938,0.00036388382,0.000149717,0.000014594162],"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.0000052215637,0.00021664468,0.014769036,0.000029286819,0.000013612614,0.0000011292702,0.0049588396,0.00012643539,0.010843133,0.9457712,0.000028424087,0.023237038],"study_design_scores_gemma":[0.0022882482,0.0000036456577,0.279628,0.0007332757,0.0000146943985,0.000036997233,0.00029100053,0.5401661,0.1000458,0.07454634,0.0015842256,0.00066170224],"about_ca_topic_score_codex":0.00034831095,"about_ca_topic_score_gemma":0.00055468094,"teacher_disagreement_score":0.8712249,"about_ca_system_score_codex":0.000030013432,"about_ca_system_score_gemma":0.00007866979,"threshold_uncertainty_score":0.593201},"labels":[],"label_agreement":null},{"id":"W2991556759","doi":"10.1007/978-3-030-35802-0_36","title":"Homotopy Height, Grid-Major Height and Graph-Drawing Height","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Pathwidth; Planarity testing; Planar graph; Outerplanar graph; Mathematics; Graph; Grid; Combinatorics; Lattice graph; Line graph; Homotopy; Computer science; Discrete mathematics; Geometry; Pure mathematics; Voltage graph","score_opus":0.01081039062675383,"score_gpt":0.22602708188842885,"score_spread":0.21521669126167503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991556759","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.000602199,0.002263791,0.9878404,0.001237819,0.0041055433,0.00057497615,0.000013367294,0.00015360328,0.0032083036],"genre_scores_gemma":[0.20509282,0.00047043685,0.7819714,0.0055115735,0.0033909224,0.000030275713,0.00009308332,0.00011528378,0.0033241946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527943,0.00005929516,0.00064611656,0.0020660073,0.0012131601,0.0007359957],"domain_scores_gemma":[0.997222,0.0006037637,0.00032544564,0.0012501639,0.00033433782,0.00026428423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087204046,0.00068829645,0.00065103394,0.0013929652,0.0005031636,0.0009804652,0.0022210067,0.0003668399,0.000038416434],"category_scores_gemma":[0.00006074442,0.00062668667,0.00017774059,0.0010734752,0.00048019926,0.001149559,0.0013952192,0.0007701853,0.00008160103],"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.00002015604,0.000092933,0.00023744088,0.0001868763,0.000073277486,0.00019895477,0.0013868569,0.058766894,0.0008309303,0.17823179,0.00038606857,0.7595878],"study_design_scores_gemma":[0.0010506148,0.00050062547,0.0010504003,0.0006732856,0.000035643156,0.00040905076,4.267756e-7,0.61979896,0.004563657,0.3443499,0.025500609,0.0020668374],"about_ca_topic_score_codex":0.000015328776,"about_ca_topic_score_gemma":0.000051750525,"teacher_disagreement_score":0.757521,"about_ca_system_score_codex":0.00018494033,"about_ca_system_score_gemma":0.00068790064,"threshold_uncertainty_score":0.9996185},"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":"W2993575088","doi":"10.22215/etd/2019-13533","title":"Shortest Paths Among Dynamic Obstacles","year":2019,"lang":"en","type":"dissertation","venue":"","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":"Shortest path problem; Tangent; Obstacle; Point (geometry); Pathfinding; Path (computing); Line segment; Algorithm; Computer science; Line (geometry); Time complexity; Motion planning; Point location; Computational geometry; Preprocessor; Euclidean shortest path; Start point; Mathematics; K shortest path routing; Combinatorics; Geometry; Robot; Artificial intelligence; Geography; Graph","score_opus":0.006687352231645865,"score_gpt":0.24391898873060605,"score_spread":0.23723163649896017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993575088","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.36150575,0.00092573214,0.552442,0.00013235235,0.0071791876,0.0007283879,0.00001244864,0.0005553701,0.07651874],"genre_scores_gemma":[0.8814227,0.00004938193,0.010769145,0.00011402469,0.00007912916,0.000027568116,0.0016666676,0.000021514952,0.10584988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856174,0.000032704567,0.00028001048,0.0005286077,0.0003944106,0.00020250736],"domain_scores_gemma":[0.9990552,0.0000927585,0.00014946065,0.00045088716,0.00018331636,0.000068367786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012517949,0.00022586365,0.0002095332,0.00025394527,0.00009526726,0.00025487272,0.00062105246,0.00019314539,0.00009230396],"category_scores_gemma":[0.000028226443,0.00021783482,0.00011250187,0.00040487808,0.000008747958,0.00045329652,0.000053343872,0.0001877305,0.00033773488],"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.000026890775,0.00033414955,0.0018634747,0.00033494722,0.0002063164,0.000053027074,0.0029298242,0.015523828,0.0045369277,0.18337344,0.009222934,0.7815942],"study_design_scores_gemma":[0.00037344563,0.00015153683,0.14968954,0.000157587,0.000041943164,0.000009911062,0.00035503865,0.8319174,0.0027238207,0.007184646,0.006206849,0.0011882485],"about_ca_topic_score_codex":0.000027044303,"about_ca_topic_score_gemma":0.00030057368,"teacher_disagreement_score":0.8163936,"about_ca_system_score_codex":0.000054653316,"about_ca_system_score_gemma":0.00019905437,"threshold_uncertainty_score":0.8883046},"labels":[],"label_agreement":null},{"id":"W2995839712","doi":"","title":"Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Constant (computer programming); Dimension (graph theory); Combinatorics; Linear space; k-nearest neighbors algorithm; Mathematics; Space (punctuation); Discrete mathematics; Computer science","score_opus":0.04014110122099491,"score_gpt":0.2516269006426904,"score_spread":0.2114857994216955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995839712","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.18890926,0.00041355775,0.7989307,0.0075876694,0.00050986017,0.00031413892,0.00009029301,0.000059838356,0.0031846706],"genre_scores_gemma":[0.96908796,0.000004389392,0.02977623,0.0007732207,0.000114824536,0.000014237693,0.00005201728,0.000009458167,0.00016766529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998212,0.00011432798,0.00040459225,0.00041886483,0.0005427315,0.00030748514],"domain_scores_gemma":[0.99798065,0.0005261568,0.00022042071,0.00028520258,0.00057496276,0.00041258652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005888759,0.0001913532,0.0002145028,0.00033332026,0.00027793084,0.00033678906,0.00057153817,0.00006374648,0.000014259528],"category_scores_gemma":[0.0004099148,0.00016378335,0.000045848996,0.0009740194,0.00016686798,0.0004107229,0.000090418354,0.00018584229,0.000018133649],"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.000020755058,0.000055683493,0.004418085,0.000045433335,0.000036906138,0.0000172309,0.0011588226,0.06739419,0.00002321406,0.8703899,0.0014130701,0.055026714],"study_design_scores_gemma":[0.00045355948,0.00016186356,0.017558303,0.000082808074,0.000007446168,0.000021679063,0.00030261863,0.93214566,0.00007076755,0.045107365,0.003800857,0.00028705876],"about_ca_topic_score_codex":0.0012519957,"about_ca_topic_score_gemma":0.002465487,"teacher_disagreement_score":0.86475146,"about_ca_system_score_codex":0.00011254535,"about_ca_system_score_gemma":0.0012230882,"threshold_uncertainty_score":0.6678891},"labels":[],"label_agreement":null},{"id":"W2995864758","doi":"10.1142/s0219265919500087","title":"Traversal with Enumeration of Geometric Graphs in Bounded Space","year":2019,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","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":"Simon Fraser University","funders":"","keywords":"Geometric graph theory; Graph traversal; Tree traversal; Vertex (graph theory); Spatial network; Bounded function; Graph; Enumeration; Path graph; Edge-graceful labeling","score_opus":0.004675571913619606,"score_gpt":0.2007537409321477,"score_spread":0.1960781690185281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995864758","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.44412684,0.000107774,0.5547479,0.0001294551,0.00064861216,0.000057504833,1.0167772e-7,0.000005112782,0.00017671728],"genre_scores_gemma":[0.99201614,0.000037804493,0.00771014,0.000061604354,0.00010041154,9.721655e-7,0.00000133836,0.0000043021732,0.00006726999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990038,0.00008102393,0.00041564024,0.00012608297,0.00026171314,0.00011168373],"domain_scores_gemma":[0.9989401,0.00015489025,0.00042836778,0.00011727707,0.00031651708,0.000042840467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005441608,0.000083288796,0.0001912563,0.0008786524,0.000024645307,0.000063092,0.00019633089,0.00005727503,0.00003287241],"category_scores_gemma":[0.000038165235,0.000069224974,0.00007589571,0.001570864,0.000013461162,0.00073802326,0.000022080185,0.00021135045,0.0000027769763],"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.0002561778,0.00017382372,0.009420925,0.00001948722,0.000076605116,0.0000125535125,0.00056033395,0.9353795,0.0017078003,0.023500022,0.00048162608,0.028411122],"study_design_scores_gemma":[0.0035515607,0.0032849256,0.046033002,0.00032741515,0.000027540224,0.0006060702,0.0003086975,0.9310074,0.0083593745,0.004797089,0.0013663599,0.00033059088],"about_ca_topic_score_codex":0.000013493316,"about_ca_topic_score_gemma":0.00003875023,"teacher_disagreement_score":0.5478893,"about_ca_system_score_codex":0.000068812275,"about_ca_system_score_gemma":0.000072515206,"threshold_uncertainty_score":0.28229126},"labels":[],"label_agreement":null},{"id":"W2996340505","doi":"","title":"Geometric red-blue set cover for unit squares and related problems","year":2013,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":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; Approximation algorithm; Computational geometry; Algorithm; Computer science; Geometry","score_opus":0.023802531107612147,"score_gpt":0.24420679408636015,"score_spread":0.220404262978748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996340505","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.13711718,0.0001728245,0.8575965,0.0017457617,0.0002209697,0.0005369426,0.000002848689,0.00012227944,0.0024846776],"genre_scores_gemma":[0.95749587,0.000015061387,0.030716868,0.00030236246,0.000035933725,0.000072198905,0.000030063302,0.0000056067643,0.011326033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992904,0.000022938832,0.00016559588,0.00023936207,0.00013375036,0.00014795962],"domain_scores_gemma":[0.9993686,0.00018092121,0.00004830895,0.00015641045,0.00017759691,0.00006817856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017810643,0.0000793758,0.00008141145,0.0002621383,0.00010932437,0.00019375926,0.00017031464,0.000047672118,0.00014627622],"category_scores_gemma":[0.00006833867,0.00006726453,0.000026255138,0.0009269142,0.000014361621,0.0005596802,0.00008139194,0.000045440294,0.00010153908],"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.000011303961,0.00024444796,0.0032981823,0.00019733486,0.00015559094,0.000003058941,0.0017217511,0.111887716,0.005985482,0.32767326,0.214437,0.3343849],"study_design_scores_gemma":[0.00093652494,0.00030384585,0.029463444,0.000013342904,0.0000086362115,0.000031839325,0.00002818261,0.8726906,0.0020077804,0.045423098,0.048792347,0.00030031134],"about_ca_topic_score_codex":0.00002708813,"about_ca_topic_score_gemma":0.000001642793,"teacher_disagreement_score":0.8268796,"about_ca_system_score_codex":0.000010633556,"about_ca_system_score_gemma":0.000029830595,"threshold_uncertainty_score":0.27429682},"labels":[],"label_agreement":null},{"id":"W2996702648","doi":"10.61091/jcmcc119-01","title":"On \\({k}\\)-Dyck Paths with a Negative Boundary","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Van Dyke beard; Boundary (topology); Computer science; Mathematics; History; Mathematical analysis; Art history","score_opus":0.010831596643308785,"score_gpt":0.2506812811634222,"score_spread":0.2398496845201134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996702648","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.4461558,0.000941704,0.5266694,0.00077449414,0.022867959,0.00033398464,0.0000022065997,0.00015972693,0.0020947573],"genre_scores_gemma":[0.9719337,0.000021194268,0.026727945,0.00006884202,0.0012066202,0.0000019380886,8.850991e-7,0.00002305145,0.00001582146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777967,0.000099862285,0.0006990335,0.0003037524,0.0008523578,0.00026529975],"domain_scores_gemma":[0.99721247,0.0014917931,0.00040887707,0.0002322947,0.00047548758,0.00017909473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011691835,0.00026988686,0.00045977777,0.0003694777,0.00028106154,0.0010197251,0.00048100503,0.00009673744,0.000004814197],"category_scores_gemma":[0.00025501623,0.00020532322,0.00013258675,0.00074515765,0.000068885216,0.0005732145,0.00017226364,0.00050325604,0.000007552782],"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.000055413282,0.00023849092,0.000005280384,0.00011199867,0.00011202104,0.0001154776,0.0013671222,0.00045052372,0.00012432481,0.98764193,0.0005305187,0.009246916],"study_design_scores_gemma":[0.0017697272,0.0021306658,0.00003817825,0.0006579686,0.000047813523,0.00034555333,0.00007406427,0.08347226,0.000789625,0.90840036,0.0019959798,0.0002778019],"about_ca_topic_score_codex":0.0000021062442,"about_ca_topic_score_gemma":1.6319991e-7,"teacher_disagreement_score":0.52577794,"about_ca_system_score_codex":0.000094666895,"about_ca_system_score_gemma":0.00038532735,"threshold_uncertainty_score":0.9833233},"labels":[],"label_agreement":null},{"id":"W2998384899","doi":"10.3934/math.2019.6.1796","title":"Optimal covering points and curves","year":2019,"lang":"en","type":"article","venue":"AIMS Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"","keywords":"Mathematics; Optimal design; Square (algebra); Set (abstract data type); Unit square; Mathematical optimization; RADIUS; Combinatorics; Algorithm; Geometry; Computer science; Statistics","score_opus":0.010343997283098328,"score_gpt":0.22871256787250502,"score_spread":0.2183685705894067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998384899","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.38830015,0.00022895286,0.6088477,0.00043845456,0.00013530695,0.00010369789,5.8422603e-7,0.00004997908,0.0018952204],"genre_scores_gemma":[0.48555863,0.00007799461,0.512776,0.0005830447,0.000033825836,0.000004443756,0.0000030584592,0.0000061386568,0.0009568447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995433,0.000008641884,0.00010611207,0.00012235944,0.00013738697,0.00008221297],"domain_scores_gemma":[0.9996369,0.00008874311,0.000042259722,0.00016913898,0.000031569994,0.000031402597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015633978,0.00005574118,0.000079606245,0.00003555429,0.000030947922,0.000061172774,0.00014173015,0.000016339483,0.000023256893],"category_scores_gemma":[0.000027826565,0.000051349656,0.000016440772,0.00011871104,0.00000750945,0.00024908365,0.00011168534,0.000035293004,0.00012294693],"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.0000034254138,0.0002292368,0.0010167686,0.0013633111,0.000058600854,0.000009675021,0.003409889,0.008764,0.0054118726,0.95116067,0.004353102,0.024219422],"study_design_scores_gemma":[0.00034653145,0.000100595644,0.0021488303,0.00025505282,0.000008282423,0.0000824082,0.000050347247,0.9531885,0.0036207864,0.037031204,0.002910199,0.0002572592],"about_ca_topic_score_codex":6.037395e-7,"about_ca_topic_score_gemma":1.6676749e-7,"teacher_disagreement_score":0.9444245,"about_ca_system_score_codex":0.0000065892254,"about_ca_system_score_gemma":0.000015423557,"threshold_uncertainty_score":0.20939781},"labels":[],"label_agreement":null},{"id":"W2998427191","doi":"10.2514/6.2020-0902","title":"Advancing Layer Surface Mesh Generation","year":2020,"lang":"en","type":"article","venue":"AIAA Scitech 2020 Forum","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Layer (electronics); Computer science; Mesh generation; Materials science; Composite material; Finite element method; Engineering; Structural engineering","score_opus":0.02086833946598773,"score_gpt":0.2520371260432375,"score_spread":0.2311687865772498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998427191","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.03734872,0.0002079724,0.9229263,0.03790099,0.0005227857,0.00016873154,0.0000036705687,0.00026193686,0.00065886084],"genre_scores_gemma":[0.8823364,0.000022283499,0.109929115,0.007007028,0.00038743243,0.0000069425814,0.000030179772,0.000010644755,0.0002699685],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985943,0.000050778184,0.00023227053,0.000461549,0.0003569676,0.00030412117],"domain_scores_gemma":[0.9993345,0.000046663743,0.00007705509,0.00024309369,0.000120093675,0.00017860658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020781203,0.00013782206,0.00013161803,0.00004419234,0.00021433867,0.00020185717,0.0004468244,0.00005728326,0.00005203207],"category_scores_gemma":[0.00008994244,0.0001407926,0.00006530993,0.00096724846,0.000014004056,0.00083626364,0.00023283536,0.00012835728,0.00023613422],"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.000015148789,0.000066373104,0.0008903504,0.000027745466,0.00004043531,0.000037348906,0.0009656229,0.191668,0.4298698,0.07522111,0.226526,0.07467204],"study_design_scores_gemma":[0.00023463726,0.00011561652,0.00013849809,0.000005220039,0.0000042671686,0.000010031148,0.000028908464,0.86459225,0.06482234,0.0011295803,0.06870793,0.00021074295],"about_ca_topic_score_codex":0.0000061285873,"about_ca_topic_score_gemma":0.000011598494,"teacher_disagreement_score":0.8449877,"about_ca_system_score_codex":0.00003664998,"about_ca_system_score_gemma":0.00009634573,"threshold_uncertainty_score":0.5741356},"labels":[],"label_agreement":null},{"id":"W3003473369","doi":"10.1007/978-3-030-38919-2_50","title":"Simplified Emanation Graphs: A Sparse Plane Spanner with Steiner Points","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Saskatchewan","funders":"","keywords":"Spanner; Computer science; Steiner tree problem; Plane (geometry); Combinatorics; Algorithm; Computational science; Geometry; Mathematics; Database","score_opus":0.01842235744981871,"score_gpt":0.2278014774821379,"score_spread":0.20937912003231918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003473369","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.00031333166,0.0001577462,0.99305815,0.0028257174,0.0009080349,0.00044527117,0.000008396852,0.00018981534,0.0020935219],"genre_scores_gemma":[0.46449563,0.00002869666,0.5282685,0.0056084082,0.0008264248,0.000020591717,0.00009727704,0.000057481746,0.000596963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961544,0.000041032596,0.0004774613,0.0015704818,0.0012916616,0.0004649422],"domain_scores_gemma":[0.99798673,0.00029147541,0.0003127873,0.0008263155,0.00035036303,0.00023229551],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049038173,0.0005201372,0.00046184324,0.0009769564,0.00024235266,0.0005474749,0.0017195228,0.00021700426,0.000024979501],"category_scores_gemma":[0.00006562485,0.00043981173,0.00009692508,0.0012138253,0.000293107,0.0007383395,0.0005878327,0.0005900425,0.00007877016],"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.00005574874,0.00006829941,0.000067723035,0.00007784133,0.00005269308,0.0003159726,0.00090602774,0.32135355,0.00033693586,0.21262455,0.00026017445,0.46388048],"study_design_scores_gemma":[0.00075888226,0.000580292,0.00045242166,0.00029134605,0.000022155551,0.00016615335,3.1922798e-7,0.7330269,0.0016731198,0.25805476,0.0039174426,0.0010561969],"about_ca_topic_score_codex":0.00001150944,"about_ca_topic_score_gemma":0.00008525282,"teacher_disagreement_score":0.46478963,"about_ca_system_score_codex":0.00015750423,"about_ca_system_score_gemma":0.00050646043,"threshold_uncertainty_score":0.9998054},"labels":[],"label_agreement":null},{"id":"W3004387713","doi":"10.22215/etd/2016-11226","title":"Discrete Geometric Path Analysis in Computational Geometry","year":2016,"lang":"en","type":"dissertation","venue":"","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; Natural Resources Canada","funders":"","keywords":"Mathematics; Measure (data warehouse); Similarity (geometry); Path (computing); Shortest path problem; Outlier; Computation; Similarity measure; Polygonal chain; Algorithm; Combinatorics; Geometry; Computer science; Artificial intelligence; Data mining; Graph","score_opus":0.00854278346283061,"score_gpt":0.26317281125894354,"score_spread":0.25463002779611293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004387713","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.03414526,0.00054569764,0.94873875,0.0003088824,0.00093275885,0.000274669,0.00003392337,0.00016098715,0.014859074],"genre_scores_gemma":[0.94166386,0.000072883566,0.03738734,0.00018746479,0.00017610888,0.00005596514,0.0028419304,0.000024166431,0.017590277],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9967726,0.00011506492,0.0007461833,0.0009792345,0.0009751211,0.0004117885],"domain_scores_gemma":[0.9981999,0.00044609382,0.00034851808,0.00052132143,0.0003391078,0.00014506144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053507707,0.00037942835,0.0005754941,0.007015205,0.00014206147,0.00026694656,0.0009137335,0.00028021637,0.00046780458],"category_scores_gemma":[0.00013270474,0.00031894204,0.00036332634,0.012586152,0.000016841386,0.00063281745,0.00010659506,0.00026414776,0.00020447168],"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.00011890736,0.00066261215,0.016007662,0.00027801222,0.002487352,0.0001439403,0.0010083196,0.23826683,0.00026603646,0.2614236,0.0041826162,0.47515413],"study_design_scores_gemma":[0.0014234846,0.00015426449,0.6736432,0.00013570483,0.00035790564,0.000009939211,0.00008883952,0.27988666,0.00063471665,0.039938226,0.002013345,0.0017137284],"about_ca_topic_score_codex":0.000069233975,"about_ca_topic_score_gemma":0.00020695348,"teacher_disagreement_score":0.9113514,"about_ca_system_score_codex":0.00017909509,"about_ca_system_score_gemma":0.0003120623,"threshold_uncertainty_score":0.99992627},"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":"W3005130258","doi":"10.1002/jgt.22665","title":"Drawings of complete graphs in the projective plane","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Projective test; Projective plane; Real projective plane; Pencil (optics); Mathematics; Blocking set; Plane (geometry); Combinatorics; Geometry; Art; Computer science; Projective space; Pure mathematics; Collineation; Physics; Optics","score_opus":0.016653585679728317,"score_gpt":0.24803122593837826,"score_spread":0.23137764025864993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005130258","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.6849951,0.0012453195,0.31020382,0.0012071802,0.0005076479,0.00009916285,0.0000035493013,0.000006618371,0.0017316098],"genre_scores_gemma":[0.9930966,0.000032857275,0.006455531,0.00034774575,0.000043547036,9.475873e-7,0.000001206608,0.0000019219299,0.000019681145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988637,0.00036887804,0.00030166926,0.000084173465,0.00029859575,0.00008301156],"domain_scores_gemma":[0.99887604,0.00046174866,0.00024379483,0.00013904879,0.00025796372,0.000021434867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014569709,0.000056298795,0.0001367718,0.00028466876,0.00004787026,0.000038591614,0.00039181774,0.00002185028,0.000007226581],"category_scores_gemma":[0.00010608593,0.00003819291,0.00011068947,0.00093215297,0.00004405982,0.00022907896,0.000038426722,0.00015822476,7.935829e-7],"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.00005120458,0.00016016614,0.0007036963,0.000013891241,0.000048803366,0.0001028299,0.004485563,0.0011869401,0.0072139255,0.9759008,0.00037576983,0.009756367],"study_design_scores_gemma":[0.00056275947,0.00022864863,0.034201067,0.000060115377,0.000014236935,0.0006104086,0.0007413188,0.00060251175,0.005958569,0.955955,0.0009806633,0.00008469046],"about_ca_topic_score_codex":0.0000019668325,"about_ca_topic_score_gemma":0.0000039089005,"teacher_disagreement_score":0.30810148,"about_ca_system_score_codex":0.000009019017,"about_ca_system_score_gemma":0.0001208468,"threshold_uncertainty_score":0.15574618},"labels":[],"label_agreement":null},{"id":"W3005602433","doi":"10.1007/s00453-017-0376-3","title":"Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges","year":2017,"lang":"en","type":"article","venue":"Algorithmica","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 Waterloo","funders":"","keywords":"Mathematics; Theory of computation; Algorithm; Logarithm; Combinatorics","score_opus":0.021687456885733227,"score_gpt":0.29168267544435494,"score_spread":0.26999521855862174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005602433","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.022387015,0.00007243969,0.9740406,0.002134249,0.00058110896,0.0001980206,0.0000061843252,0.000062476334,0.00051788177],"genre_scores_gemma":[0.48398367,0.0000055311352,0.5143836,0.00021940187,0.00036409099,0.000056215657,0.000006205672,0.00000679792,0.0009744816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914724,0.00001308994,0.00016109706,0.0003287686,0.0001427026,0.00020709967],"domain_scores_gemma":[0.9990315,0.00013686034,0.00015638517,0.00050118426,0.00011404545,0.000060013615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023555447,0.00010229165,0.00012230025,0.000047844733,0.00060538156,0.00038876597,0.00086440187,0.000041920444,0.0000046583436],"category_scores_gemma":[0.00019135764,0.00010204502,0.0000686203,0.000049335235,0.000047267637,0.00043259596,0.00015420768,0.00005015423,0.000029190569],"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.000029977582,0.00006627322,0.000054660126,0.000028489485,0.000024950723,0.000019983698,0.00029544166,0.0010974108,0.0014986086,0.03137227,0.0027968197,0.9627151],"study_design_scores_gemma":[0.0009031639,0.0001694405,0.0036905666,0.000023331559,0.000012835652,0.000035642654,0.00000542459,0.92259556,0.014125586,0.007222104,0.05094172,0.00027460195],"about_ca_topic_score_codex":0.0000057610787,"about_ca_topic_score_gemma":0.0000021953413,"teacher_disagreement_score":0.9624405,"about_ca_system_score_codex":0.000016570695,"about_ca_system_score_gemma":0.00005689339,"threshold_uncertainty_score":0.46561667},"labels":[],"label_agreement":null},{"id":"W3006212172","doi":"10.1007/s00454-022-00398-5","title":"Drawing Graphs as Spanners","year":2022,"lang":"en","type":"article","venue":"Discrete & 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":"H2020 Marie Skłodowska-Curie Actions; Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Spanning tree; Graph; Discrete mathematics","score_opus":0.010740796446093335,"score_gpt":0.2541017257448844,"score_spread":0.24336092929879105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006212172","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.20520924,0.0004157054,0.7843464,0.0022896002,0.0013421917,0.00026511672,0.000034508324,0.0003513176,0.005745904],"genre_scores_gemma":[0.96030945,0.000002785002,0.036288,0.0020816617,0.00011200621,0.00007001404,0.00033565096,0.00001876008,0.00078169856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970816,0.00018904178,0.00040296456,0.0006670696,0.0012675456,0.00039177743],"domain_scores_gemma":[0.9988191,0.00030446835,0.00017633986,0.00035383613,0.00017166669,0.00017455286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005619365,0.00022938746,0.00020634836,0.0008481594,0.0010789527,0.00025872202,0.0009648215,0.000038305432,0.00045843676],"category_scores_gemma":[0.0000744127,0.00026255078,0.00018962202,0.002929578,0.000052981984,0.0006387301,0.00076426053,0.0003225657,0.00015728267],"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.000012074895,0.00006702606,0.0004384508,0.0000070676797,0.000034160523,0.000027372062,0.00029456685,0.64317846,0.00009456928,0.3437337,0.0015725553,0.010539993],"study_design_scores_gemma":[0.0010199809,0.0003680086,0.017798591,0.000008615725,0.00002068729,0.00031615654,0.00037085195,0.6207913,0.00019630871,0.32736224,0.030964172,0.00078304455],"about_ca_topic_score_codex":0.000029223214,"about_ca_topic_score_gemma":8.8793854e-7,"teacher_disagreement_score":0.7551002,"about_ca_system_score_codex":0.00013984065,"about_ca_system_score_gemma":0.00027909369,"threshold_uncertainty_score":0.99998266},"labels":[],"label_agreement":null},{"id":"W3007604789","doi":"10.1017/s0305004121000256","title":"Sphere tangencies, line incidences and Lie’s line-sphere correspondence","year":2021,"lang":"en","type":"preprint","venue":"Mathematical Proceedings of the Cambridge Philosophical Society","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"","keywords":"Isomorphism (crystallography); SPHERES; Incidence (geometry); Mathematics; Line (geometry); Combinatorics; Geometry; Physics; Crystallography","score_opus":0.03191924192922762,"score_gpt":0.2576296744207331,"score_spread":0.22571043249150546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007604789","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.7927133,0.0034520698,0.15384503,0.043865953,0.0009870906,0.0012092468,0.00004348762,0.00027629704,0.0036075416],"genre_scores_gemma":[0.91595644,0.0002087568,0.08157194,0.0009609554,0.000658251,0.0000584964,0.000008860623,0.00002683923,0.00054944615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965501,0.0000410774,0.00084493996,0.0009568826,0.0012304846,0.000376518],"domain_scores_gemma":[0.9974235,0.00040789272,0.00059382844,0.00047205127,0.0008715249,0.00023119265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097429927,0.00046187,0.0007253449,0.00003513092,0.00028741956,0.00054694345,0.0018916364,0.0005255043,0.0000373057],"category_scores_gemma":[0.00087551406,0.00034445184,0.0005658747,0.0007437861,0.00045064322,0.00041278347,0.004826685,0.0011801358,0.000008765407],"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.000040490384,0.0006745258,0.00023673203,0.0046856464,0.0003221494,0.000008456017,0.0025349802,0.0010578878,0.008317939,0.9702908,0.0065643345,0.005266062],"study_design_scores_gemma":[0.00036605462,0.0001585395,0.0006478813,0.0014811193,0.00014609676,0.00012040772,0.00032247382,0.28825313,0.008227121,0.69924825,0.00030661206,0.0007223109],"about_ca_topic_score_codex":0.000008085209,"about_ca_topic_score_gemma":8.9021256e-7,"teacher_disagreement_score":0.28719527,"about_ca_system_score_codex":0.00011981292,"about_ca_system_score_gemma":0.0003640218,"threshold_uncertainty_score":0.99990076},"labels":[],"label_agreement":null},{"id":"W3008457491","doi":"10.4230/lipics.mfcs.2020.14","title":"Layered Fan-Planar Graph Drawings","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca; University of Waterloo; Deutsche Forschungsgemeinschaft","keywords":"Planar graph; Embedding; Planar; Combinatorics; Graph drawing; Pathwidth; Mathematics; Graph; Representation (politics); Book embedding; Computer science; Discrete mathematics; Computer graphics (images); Line graph; Artificial intelligence","score_opus":0.028163835996368642,"score_gpt":0.26729729868200985,"score_spread":0.2391334626856412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008457491","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.013429794,0.00013810434,0.9732242,0.002585018,0.0035508315,0.0016046223,0.0008650662,0.00061004027,0.0039923037],"genre_scores_gemma":[0.7697176,0.00012677186,0.21571127,0.006491953,0.0011259264,0.00043021198,0.0057612355,0.00010242963,0.0005326643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584836,0.00007135785,0.0015838786,0.0007433429,0.00096244377,0.0007906413],"domain_scores_gemma":[0.99671423,0.00018849115,0.0009199585,0.0012237512,0.0005428646,0.0004106717],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005977238,0.00074478675,0.00079656416,0.0006109058,0.00045537806,0.0013790119,0.0025967972,0.0005531804,0.00002529849],"category_scores_gemma":[0.00014670202,0.0007536224,0.0006084913,0.0006930168,0.000084956155,0.0014070908,0.0013169419,0.0011213128,0.00026484817],"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.00061702164,0.0018131158,0.0026331441,0.011122597,0.0032856415,0.00014379698,0.07213164,0.061509475,0.0017656529,0.43234405,0.27468288,0.13795097],"study_design_scores_gemma":[0.004687745,0.0006058913,0.0014321323,0.0006496863,0.00016977613,0.00014244695,0.00050768617,0.6242999,0.0048592547,0.09679855,0.26284564,0.0030013006],"about_ca_topic_score_codex":0.000022799624,"about_ca_topic_score_gemma":0.000010674877,"teacher_disagreement_score":0.757513,"about_ca_system_score_codex":0.00016125343,"about_ca_system_score_gemma":0.0003723139,"threshold_uncertainty_score":0.99965763},"labels":[],"label_agreement":null},{"id":"W3010708132","doi":"10.22215/etd/2019-13678","title":"Improved Spanning and Routing Ratios on Geometric Graphs","year":2019,"lang":"en","type":"dissertation","venue":"","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":"Delaunay triangulation; Combinatorics; Convex hull; Mathematics; Computer science; Regular polygon; Discrete mathematics; Geometry","score_opus":0.012632836070534828,"score_gpt":0.25308669323148625,"score_spread":0.2404538571609514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010708132","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.31676012,0.000735475,0.6421435,0.00022791473,0.0042840363,0.0009545329,0.0000047299486,0.00037492832,0.03451475],"genre_scores_gemma":[0.96358603,0.000040377105,0.013966836,0.0003312377,0.00011695031,0.000021793816,0.00033671063,0.000019721145,0.02158033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851453,0.00003933039,0.00029583884,0.0006025435,0.0003287425,0.00021902371],"domain_scores_gemma":[0.9990231,0.0002159847,0.00021630521,0.00030636738,0.00016645005,0.000071783914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002737721,0.00024124891,0.00023213678,0.0009336367,0.00018075816,0.00036479163,0.0003145715,0.00016739444,0.000020770141],"category_scores_gemma":[0.00011611233,0.00022881474,0.00007547703,0.0011757048,0.0000059042322,0.00035125067,0.000055558976,0.00023918875,0.00004594267],"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.00006114258,0.00013574983,0.0004437121,0.0002650003,0.00014267763,0.000009075882,0.0021380533,0.0042477073,0.0075210067,0.33945668,0.0018238924,0.6437553],"study_design_scores_gemma":[0.0014353475,0.0008488226,0.030674605,0.00028179868,0.000063953536,0.000021060168,0.0006115458,0.9316744,0.024951039,0.0058496515,0.0019224358,0.0016652952],"about_ca_topic_score_codex":0.000023041584,"about_ca_topic_score_gemma":0.000013552152,"teacher_disagreement_score":0.92742676,"about_ca_system_score_codex":0.000032736803,"about_ca_system_score_gemma":0.00012132124,"threshold_uncertainty_score":0.9330794},"labels":[],"label_agreement":null},{"id":"W3015766876","doi":"10.1016/j.dam.2020.03.034","title":"Algorithmic enumeration of surrounding polygons","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","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":"McGill University","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Kayamori Foundation of Informational Science Advancement","keywords":"Enumeration; Mathematics; Combinatorics; Simple polygon; Polygon (computer graphics); Vertex (graph theory); Point in polygon; General position; Point (geometry); Euclidean space; Simple (philosophy); Quadratic equation; Set (abstract data type); Euclidean geometry; Plane (geometry); Time complexity; Monotone polygon; Computer science; Geometry; Graph","score_opus":0.024213076665276362,"score_gpt":0.24634424093120358,"score_spread":0.22213116426592722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015766876","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.011013726,0.000029726343,0.984013,0.0005918376,0.000066886794,0.00017148003,0.000004003666,0.00007996668,0.0040293247],"genre_scores_gemma":[0.6665328,0.0000033859685,0.33319485,0.00015327205,0.00006881834,0.00001022748,0.0000138420655,0.0000059635304,0.00001682265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915856,0.000009910643,0.0002779428,0.00018454174,0.0002524919,0.00011655515],"domain_scores_gemma":[0.999468,0.00008645094,0.0001399274,0.00018808697,0.000047457685,0.00007002854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013520663,0.00009565604,0.00015417242,0.00005451708,0.00006771231,0.00006314232,0.0002891207,0.000033148874,0.000014061451],"category_scores_gemma":[0.000036499823,0.00009208816,0.000045192344,0.00041279037,0.000018229232,0.00017328178,0.0000971889,0.00006144864,0.000035203455],"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.0000026527484,0.000036272,0.000004803048,0.00008966989,0.000018463306,8.64557e-7,0.0031275868,0.0023628452,0.063874245,0.91979,0.00022839519,0.010464198],"study_design_scores_gemma":[0.00038778302,0.00006810898,0.00008163148,0.000019039555,0.000019742361,0.000005668545,0.00027146479,0.8725595,0.08308503,0.042418037,0.0008346664,0.00024935603],"about_ca_topic_score_codex":0.000001055125,"about_ca_topic_score_gemma":2.7423866e-7,"teacher_disagreement_score":0.87737197,"about_ca_system_score_codex":0.000011970251,"about_ca_system_score_gemma":0.00004106745,"threshold_uncertainty_score":0.3755246},"labels":[],"label_agreement":null},{"id":"W3016887704","doi":"10.1145/3357713.3384248","title":"Automating cutting planes is NP-hard","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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 Toronto; Simon Fraser University","funders":"","keywords":"Mathematical proof; Set (abstract data type); Combinatorics; Tree (set theory); Mathematics; Resolution (logic); Time complexity; Polynomial; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.05308497035144756,"score_gpt":0.2804308549479437,"score_spread":0.22734588459649613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016887704","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.00969649,0.00013240766,0.971528,0.008805849,0.0011187005,0.00017633301,0.000008805546,0.00073767593,0.0077957204],"genre_scores_gemma":[0.3126584,0.000013657614,0.67959887,0.0055344934,0.0008313788,0.0000259549,0.00011091664,0.000015039312,0.0012112703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984357,0.000053891363,0.00032285976,0.0006390906,0.0003660847,0.00018237685],"domain_scores_gemma":[0.99912614,0.000117663556,0.00018118897,0.000379875,0.00009929014,0.00009586223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021168585,0.00019632517,0.00020889341,0.000117565716,0.00013145593,0.0004802968,0.0007882375,0.00012007483,0.000099172656],"category_scores_gemma":[0.00007142392,0.00019502183,0.00010118377,0.00026302575,0.000009282768,0.00019067277,0.0014938611,0.00031869594,0.00021248414],"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.000008341662,0.00012351444,0.0015976855,0.0009977354,0.0002992004,0.00009843557,0.008783192,0.11067682,0.0038645782,0.20180035,0.15343778,0.5183124],"study_design_scores_gemma":[0.000091278576,0.000019646583,0.0014247146,0.000050032464,0.0000080393365,0.000017840592,0.000010550787,0.96997595,0.003203688,0.018277483,0.006618716,0.00030208656],"about_ca_topic_score_codex":0.00002333407,"about_ca_topic_score_gemma":0.0000011180866,"teacher_disagreement_score":0.8592991,"about_ca_system_score_codex":0.00003151442,"about_ca_system_score_gemma":0.00017180336,"threshold_uncertainty_score":0.7952759},"labels":[],"label_agreement":null},{"id":"W3017282729","doi":"10.1007/978-3-030-45771-6_3","title":"Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 British Columbia","funders":"","keywords":"Breakpoint; Parametric statistics; Dimension (graph theory); Mathematics; Algorithm; Combinatorics; Graph; Affine transformation; Value (mathematics); Function (biology); Geometry; Statistics","score_opus":0.0328768550676217,"score_gpt":0.2756329620101791,"score_spread":0.24275610694255742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017282729","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.00006467061,0.00070197455,0.99320066,0.0023873167,0.0020018804,0.0011437372,0.000057813464,0.00009565306,0.0003462706],"genre_scores_gemma":[0.03833369,0.000026891092,0.9568637,0.0034390613,0.0010146624,0.000055678116,0.000036968966,0.000025910884,0.00020345683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965975,0.000024360861,0.000518996,0.0016752565,0.0006539463,0.000529917],"domain_scores_gemma":[0.9976698,0.00092309946,0.00025504394,0.00054545567,0.00036028892,0.000246321],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059278787,0.00047799925,0.00051220367,0.0005154852,0.0002843255,0.0008856346,0.0014069643,0.00025910774,0.0000026242608],"category_scores_gemma":[0.00020025896,0.00045818093,0.0001777637,0.0009267889,0.00026014616,0.00061961176,0.00075527275,0.0002556518,0.000009126172],"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.000021715237,0.000024340394,0.000010591142,0.000091574526,0.000019926092,0.000010547032,0.0001791965,0.037034582,0.000048295035,0.069197536,0.00014731077,0.8932144],"study_design_scores_gemma":[0.00048287166,0.00039999015,0.00006916063,0.00007569706,0.000014393798,0.00006429119,1.4634033e-7,0.76114166,0.0002605036,0.23150147,0.0055615804,0.0004282416],"about_ca_topic_score_codex":0.000006549194,"about_ca_topic_score_gemma":0.000009946996,"teacher_disagreement_score":0.89278615,"about_ca_system_score_codex":0.00021882154,"about_ca_system_score_gemma":0.00050825457,"threshold_uncertainty_score":0.999787},"labels":[],"label_agreement":null},{"id":"W3020829986","doi":"","title":"Reconstructing a Polyhedron between Polygons in Parallel Slices.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on 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":"Combinatorics; Vertex (graph theory); Mathematics; Polyhedron; Regular polygon; Surface (topology); Disjoint sets; Planar; Triangulation; Time complexity; Geometry; Computer science; Graph","score_opus":0.027851291218023832,"score_gpt":0.2508997063316967,"score_spread":0.2230484151136729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020829986","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.8117395,0.000097996606,0.15986963,0.004945602,0.000952613,0.0005224417,0.000058566602,0.00012447912,0.021689186],"genre_scores_gemma":[0.96630716,0.0000034080904,0.03193593,0.001092152,0.00012267564,0.00001426227,0.00011944231,0.000012614384,0.00039236958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978192,0.00010142152,0.00043301267,0.00066185906,0.00044068886,0.000543827],"domain_scores_gemma":[0.99849266,0.00039714744,0.00013818429,0.00034423423,0.00019693265,0.00043083524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003824071,0.00023592835,0.00028429064,0.0016713477,0.00015834042,0.0002805601,0.00069978193,0.0001342402,0.00036599374],"category_scores_gemma":[0.000076841236,0.00027397557,0.000074652955,0.001721783,0.00004036592,0.0005224177,0.00007470865,0.0003428168,0.00071245036],"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.00001052643,0.0000477636,0.1328417,0.000027924087,0.000044493572,0.00003482319,0.00036440784,0.16985153,0.00005273057,0.6055724,0.00058678776,0.09056489],"study_design_scores_gemma":[0.0013086281,0.00020948108,0.30791426,0.00013768725,0.0000065171216,0.000050675328,0.00017102582,0.6254803,0.000064348445,0.060806736,0.0030301393,0.00082021294],"about_ca_topic_score_codex":0.004398192,"about_ca_topic_score_gemma":0.0036614444,"teacher_disagreement_score":0.54476565,"about_ca_system_score_codex":0.00033191487,"about_ca_system_score_gemma":0.0015970479,"threshold_uncertainty_score":0.9999713},"labels":[],"label_agreement":null},{"id":"W3020951023","doi":"10.1016/j.cagd.2021.102039","title":"Affine invariant triangulations","year":2021,"lang":"en","type":"article","venue":"Computer Aided Geometric Design","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":"Horizon 2020; Consejo Nacional de Ciencia y Tecnología; Generalitat de Catalunya; Fonds De La Recherche Scientifique - FNRS; Natural Sciences and Engineering Research Council of Canada; FP7 Coherent Development of Research Policies","keywords":"Marie curie; European union; Affine transformation; Invariant (physics); Mathematics; Political science; Pure mathematics; Combinatorics; Computer science; Business; Mathematical physics; International trade","score_opus":0.043849903338694964,"score_gpt":0.24945862474416292,"score_spread":0.20560872140546796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020951023","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.0006773111,0.0006804114,0.9944628,0.0012997156,0.0013548256,0.00022522725,0.00000256822,0.00027889953,0.0010182355],"genre_scores_gemma":[0.15130335,0.000030881827,0.8449783,0.001149686,0.00064660044,0.000025459167,0.000047706817,0.000014722567,0.0018032951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977372,0.0003111641,0.0004444487,0.0006638079,0.00048543912,0.00035792126],"domain_scores_gemma":[0.9975942,0.0009029356,0.00012405567,0.00071234285,0.000483069,0.00018341882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007011791,0.00020938988,0.00027015648,0.0010486472,0.0002464816,0.00048151688,0.0006699823,0.000088675515,0.00017190498],"category_scores_gemma":[0.00031119084,0.0002186915,0.00013260393,0.007897499,0.00002108324,0.00063866423,0.0003820268,0.0001547842,0.00027568202],"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.000011993421,0.00038179237,0.00007496437,0.000017900797,0.00010829263,0.00026730608,0.00020578042,0.2472316,0.0013868537,0.07827118,0.038966272,0.6330761],"study_design_scores_gemma":[0.0015989903,0.0002309452,0.011065813,0.000023147655,0.00002651031,0.00031528698,0.0000051515653,0.93079925,0.011038095,0.016327735,0.028003685,0.00056540093],"about_ca_topic_score_codex":0.0000039045663,"about_ca_topic_score_gemma":9.751889e-7,"teacher_disagreement_score":0.68356764,"about_ca_system_score_codex":0.000079382655,"about_ca_system_score_gemma":0.00038200978,"threshold_uncertainty_score":0.891798},"labels":[],"label_agreement":null},{"id":"W3021716813","doi":"10.1007/s00453-009-9293-4","title":"Computing the Greedy Spanner in Near-Quadratic Time","year":2009,"lang":"en","type":"article","venue":"Algorithmica","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":"Carleton University","funders":"Society for the Study of School Psychology","keywords":"Spanner; Greedy algorithm; Combinatorics; Dimension (graph theory); Logarithm; Mathematics; Time complexity; Running time; Upper and lower bounds; Bounded function; Quadratic equation; Binary logarithm; Metric space; Metric (unit); Euclidean space; Discrete mathematics; Computer science; Algorithm","score_opus":0.006244191694777135,"score_gpt":0.22700146719690986,"score_spread":0.22075727550213273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021716813","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.09516205,0.0001807879,0.8886181,0.012600196,0.00036418563,0.0002525567,8.783066e-7,0.00014746905,0.0026737854],"genre_scores_gemma":[0.9286699,0.0000013398294,0.06908312,0.0016442243,0.00019740277,0.0000020981217,0.0000060463335,0.0000037025573,0.00039213046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990751,0.00007658165,0.00019542083,0.0002350879,0.00021243325,0.00020534683],"domain_scores_gemma":[0.99946445,0.00013007665,0.00005110231,0.00026558965,0.000047621044,0.00004118239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033300318,0.000093678456,0.00010100168,0.00006893509,0.00017554565,0.00019364816,0.0004718193,0.000033066375,0.000015031276],"category_scores_gemma":[0.000032552955,0.00007121839,0.00003826012,0.0006706485,0.000024923635,0.00023156476,0.00007447566,0.00012746712,0.00020694653],"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.0000037916793,0.00012486821,0.000063870466,0.0000027534618,0.000009938166,0.000029766787,0.0012452654,0.0343934,0.0010486987,0.02426555,0.0028329259,0.9359792],"study_design_scores_gemma":[0.00017621051,0.00005935538,0.011477307,0.000008634046,0.0000019405704,0.000024315153,0.000005683263,0.9762887,0.0004057683,0.00917013,0.0022760096,0.00010598505],"about_ca_topic_score_codex":0.000013000063,"about_ca_topic_score_gemma":0.0000024426542,"teacher_disagreement_score":0.94189525,"about_ca_system_score_codex":0.000027084798,"about_ca_system_score_gemma":0.00006201203,"threshold_uncertainty_score":0.29042017},"labels":[],"label_agreement":null},{"id":"W3022463586","doi":"10.1142/s0218195916600050","title":"Planar Matchings for Weighted Straight Skeletons","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"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; Austrian Science Fund","keywords":"Planarity testing; Planar; Mathematics; Matching (statistics); Combinatorics; Set (abstract data type); Line (geometry); Line segment; Wavefront; Algorithm; Computer science; Geometry; Optics","score_opus":0.010909268826992155,"score_gpt":0.28020013969562296,"score_spread":0.2692908708686308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022463586","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.0026118867,0.0002278714,0.9844657,0.010728186,0.0007736365,0.00043805264,0.00014226351,0.00007238484,0.0005399742],"genre_scores_gemma":[0.48510727,0.00006132494,0.51093864,0.0011041724,0.0017522604,0.00019580574,0.000105801766,0.000025742036,0.0007090004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731,0.000056286266,0.000935308,0.0003647911,0.0010788675,0.00025477028],"domain_scores_gemma":[0.99489117,0.0013003527,0.00076372974,0.00024189116,0.0026039958,0.00019884584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005789402,0.00021545209,0.00026387576,0.0010048097,0.00019747362,0.00022225014,0.0016682625,0.00008790503,0.00009364249],"category_scores_gemma":[0.00009403481,0.00016952674,0.00029102445,0.0007330549,0.000074412994,0.0010544619,0.000101520964,0.00013884046,0.000069875576],"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.00006250613,0.0003241464,0.00017743364,0.00001369405,0.0003411902,0.000009027321,0.00007315171,0.007148367,0.0024538091,0.6529191,0.0066968943,0.32978067],"study_design_scores_gemma":[0.001981533,0.00018140113,0.0026214772,0.00006300758,0.000034795237,0.0002929417,0.000015473835,0.00630723,0.0014442576,0.68271065,0.30400744,0.00033979403],"about_ca_topic_score_codex":0.0000015205923,"about_ca_topic_score_gemma":0.0000011248985,"teacher_disagreement_score":0.48249537,"about_ca_system_score_codex":0.00019506065,"about_ca_system_score_gemma":0.00040846024,"threshold_uncertainty_score":0.69131},"labels":[],"label_agreement":null},{"id":"W3023639838","doi":"","title":"Graph Drawing via Layered Partitions.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on 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 Ottawa","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.02048755667012055,"score_gpt":0.2358003441935206,"score_spread":0.21531278752340005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023639838","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.10728054,0.00007893085,0.86313444,0.0045516593,0.0014328356,0.0004043076,0.00004405362,0.00019062174,0.022882603],"genre_scores_gemma":[0.97977674,0.000003878567,0.01617199,0.0029816139,0.0001112985,0.00002177477,0.00018099858,0.000013338386,0.00073838624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797106,0.00008280355,0.0003266281,0.0006107688,0.0005365744,0.0004721629],"domain_scores_gemma":[0.9983306,0.00022682513,0.00010516011,0.00040798582,0.00042664958,0.0005028134],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027191584,0.00022751103,0.00021109892,0.0011841997,0.000305674,0.00036659496,0.00064291595,0.00010568935,0.0007779089],"category_scores_gemma":[0.00004891092,0.00025615148,0.00010458126,0.0016150298,0.000042372238,0.0005464502,0.00006426047,0.00023233594,0.002103801],"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.0000062170297,0.000052700383,0.001293486,0.000015208792,0.000040447023,0.00002245416,0.00012440307,0.3356514,0.0001811916,0.6302716,0.0030013602,0.029339503],"study_design_scores_gemma":[0.00080528494,0.00023455803,0.035961896,0.000065126216,0.000007729516,0.000059854097,0.00004284413,0.72698766,0.00026754302,0.22156425,0.013271258,0.0007320161],"about_ca_topic_score_codex":0.0011530971,"about_ca_topic_score_gemma":0.0013648751,"teacher_disagreement_score":0.8724962,"about_ca_system_score_codex":0.00019304277,"about_ca_system_score_gemma":0.001109019,"threshold_uncertainty_score":0.9999891},"labels":[],"label_agreement":null},{"id":"W3023688963","doi":"10.48550/arxiv.2005.00937","title":"Simultaneous Visibility Representations of Undirected Pairs of Graphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Toronto; University of British Columbia","funders":"","keywords":"Combinatorics; Visibility; Vertex (graph theory); Representation (politics); Graph; Undirected graph; Mathematics; Enhanced Data Rates for GSM Evolution; Visibility graph; Physics; Geometry; Computer science; Artificial intelligence; Optics","score_opus":0.06596478567275253,"score_gpt":0.2154746734001141,"score_spread":0.14950988772736157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023688963","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.3991987,0.000031421634,0.59945756,0.00007299713,0.00022623305,0.00020236355,0.00003359552,0.0000921013,0.0006849786],"genre_scores_gemma":[0.9930246,0.0000387554,0.0066841133,0.00002270761,0.0000204508,4.615083e-7,0.00005330754,0.000006063168,0.00014955104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850553,0.00018697638,0.00031523124,0.0007335083,0.00013127748,0.00012749745],"domain_scores_gemma":[0.9978202,0.00045407857,0.00040133757,0.00076407363,0.00046134868,0.000098965524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016900961,0.00016210234,0.0003043639,0.00026865152,0.000060096812,0.0000220661,0.00084493554,0.00012881318,0.000020587457],"category_scores_gemma":[0.00025559592,0.00019819997,0.00021725547,0.0013877244,0.000100356774,0.0001649869,0.00079749664,0.00021871614,0.0000063128136],"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.000029634937,0.0001245192,0.0017608121,0.00011308414,0.00008742141,0.0000396431,0.00029067896,0.8620053,0.00073608325,0.13398539,0.0000803352,0.0007471067],"study_design_scores_gemma":[0.00025596638,0.00006996619,0.0050635776,0.00003440215,0.00005138524,0.0000013138866,0.00004137052,0.8414556,0.0027443015,0.15006125,0.000038731938,0.00018217393],"about_ca_topic_score_codex":0.00014543768,"about_ca_topic_score_gemma":0.000027686046,"teacher_disagreement_score":0.5938259,"about_ca_system_score_codex":0.000051539642,"about_ca_system_score_gemma":0.00024672196,"threshold_uncertainty_score":0.808236},"labels":[],"label_agreement":null},{"id":"W3023761765","doi":"10.20382/jocg.v11i1a1","title":"On optimal polyline simplification using the Hausdorff and Fréchet distance","year":2018,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hausdorff distance; Subsequence; Combinatorics; Hausdorff space; Line segment; Line (geometry); Time complexity; Algorithm; Geometry; Mathematical analysis","score_opus":0.015877394298005575,"score_gpt":0.2400329222241248,"score_spread":0.22415552792611923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023761765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33496377,0.00006668068,0.66351324,0.0008949733,0.00026259536,0.00005521533,0.0000039097263,0.000012802168,0.00022678741],"genre_scores_gemma":[0.9399724,0.000013084275,0.05910705,0.000368912,0.0003241051,8.235111e-8,0.000004919606,0.0000058658497,0.00020357069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998689,0.00011808496,0.00029612612,0.00021893007,0.00052036764,0.00015752054],"domain_scores_gemma":[0.99806625,0.0004512519,0.00042238823,0.00017150564,0.00077543355,0.000113200564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041859216,0.00013340583,0.0001654358,0.00069564313,0.0003949498,0.00014121787,0.0005171624,0.00005316161,0.000018001785],"category_scores_gemma":[0.00009025353,0.000112693,0.00008566782,0.001453276,0.0001523429,0.0006655,0.000116896044,0.00019015696,0.000005953937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019814982,0.0001445127,0.00034238183,0.000010783157,0.0001128512,0.000050370578,0.0004226692,0.6681176,0.00084548164,0.31299815,0.001116747,0.015640335],"study_design_scores_gemma":[0.0017433878,0.00094136427,0.01376642,0.00007302936,0.00006949489,0.00050348265,0.00025454187,0.9303777,0.0013536119,0.021675017,0.028858133,0.00038378744],"about_ca_topic_score_codex":0.000004052058,"about_ca_topic_score_gemma":0.0000013304812,"teacher_disagreement_score":0.60500866,"about_ca_system_score_codex":0.00012028262,"about_ca_system_score_gemma":0.00019491474,"threshold_uncertainty_score":0.45954874},"labels":[],"label_agreement":null},{"id":"W3023768696","doi":"10.1016/b978-044482537-7/50012-7","title":"Polygon Decomposition","year":2000,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":82,"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 Saskatchewan","funders":"","keywords":"Decomposition; Polygon (computer graphics); Computer science; Chemistry; Computer network","score_opus":0.011667970020942922,"score_gpt":0.24379928106598658,"score_spread":0.23213131104504367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023768696","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023818817,0.00070058845,0.007038594,0.00015576108,0.00054031215,0.0002403557,0.000008250102,0.00017362858,0.99111867],"genre_scores_gemma":[0.0014180669,0.00007501802,0.0097138835,0.0007550583,0.0005083731,0.0000139643635,0.000072369956,0.000028919227,0.98741436],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985774,0.000024026534,0.00032826228,0.0005035048,0.00036922444,0.0001975442],"domain_scores_gemma":[0.99910784,0.000046841957,0.00014341452,0.0005121643,0.00008070513,0.00010902404],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001306969,0.00028504187,0.0002509388,0.0002577887,0.00015294603,0.00015905495,0.00050739676,0.00020384556,0.00024600123],"category_scores_gemma":[0.0000024512628,0.00029983063,0.0001737559,0.00002762376,0.000032501554,0.00014202371,0.00011794319,0.00024762022,0.0007998289],"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.0000035663995,0.0000050037866,7.9922785e-8,0.000007995534,0.000021108144,0.000014162926,0.000061025217,0.0000602467,0.000041768966,0.10332446,0.00021738178,0.8962432],"study_design_scores_gemma":[0.00012535967,0.00005421994,0.000009516188,0.00008493681,0.00001868811,0.00004853206,1.9659714e-7,0.0010949881,0.00019716963,0.10921697,0.88883376,0.00031565016],"about_ca_topic_score_codex":1.9910196e-7,"about_ca_topic_score_gemma":0.0000032368328,"teacher_disagreement_score":0.89592755,"about_ca_system_score_codex":0.00007133862,"about_ca_system_score_gemma":0.00011912934,"threshold_uncertainty_score":0.9999782},"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":"W3024979152","doi":"10.48550/arxiv.2005.06927","title":"Remarks on the structure of simple drawings of $K_n$","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Simple (philosophy); Vertex (graph theory); Intersection (aeronautics); Combinatorics; Face (sociological concept); Graph; Boundary (topology); Computer science; Enhanced Data Rates for GSM Evolution; Mathematics; Calculus (dental); Artificial intelligence; Epistemology; Mathematical analysis; Cartography; Geography; Orthodontics; Philosophy; Medicine; Linguistics","score_opus":0.05346077304852059,"score_gpt":0.18573094174086938,"score_spread":0.13227016869234878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024979152","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.52175236,0.00001496995,0.4765902,0.00040940402,0.00021505936,0.00015830879,0.000027597935,0.00003062479,0.0008015012],"genre_scores_gemma":[0.99839747,0.000012433687,0.0012393544,0.00016881904,0.000051510764,7.712769e-8,0.000021298829,0.0000050577455,0.00010396293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905586,0.000102202954,0.00016978572,0.00044924274,0.00011883499,0.00010408569],"domain_scores_gemma":[0.9986838,0.00020529683,0.00029752438,0.0005897785,0.00017313658,0.000050434912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106722,0.0001416722,0.0002074708,0.00012802792,0.00006676105,0.000025887173,0.0010643571,0.00011445668,0.000037710124],"category_scores_gemma":[0.00006933425,0.00012502504,0.00013676292,0.000601491,0.00006186563,0.00009814846,0.00080533477,0.00029076057,0.000004464504],"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.000022831111,0.000026561549,0.00019527221,0.00006214335,0.00005401298,0.000011497547,0.00029048754,0.46507394,0.0025236316,0.53051203,0.0007074633,0.0005201046],"study_design_scores_gemma":[0.0002575163,0.0001234285,0.0025902195,0.00007180737,0.000044295426,0.0000015413797,0.0000530628,0.6096597,0.023707518,0.3626285,0.0006171172,0.0002453441],"about_ca_topic_score_codex":0.000033961504,"about_ca_topic_score_gemma":0.000007866715,"teacher_disagreement_score":0.47664514,"about_ca_system_score_codex":0.000035298814,"about_ca_system_score_gemma":0.00015390664,"threshold_uncertainty_score":0.50983727},"labels":[],"label_agreement":null},{"id":"W3027090837","doi":"10.1007/s00453-020-00716-4","title":"The Inverse Voronoi Problem in Graphs I: Hardness","year":2020,"lang":"en","type":"article","venue":"Algorithmica","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":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Javna Agencija za Raziskovalno Dejavnost RS; Agence Nationale de la Recherche","keywords":"Voronoi diagram; Parameterized complexity; Combinatorics; Mathematics; Pathwidth; Treewidth; Discrete mathematics; Shortest path problem; Planar graph; Chordal graph; Graph; Geometry; Line graph","score_opus":0.015919088431514503,"score_gpt":0.22144724387770448,"score_spread":0.20552815544618996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027090837","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.012508115,0.00025269046,0.95192075,0.0322671,0.0006947701,0.00034460172,0.0000023956147,0.00016229911,0.0018472928],"genre_scores_gemma":[0.747198,0.0000773047,0.24553198,0.005933482,0.00042137425,0.00009661835,0.000018057664,0.000017791497,0.0007054025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923575,0.000056366804,0.0001551861,0.00022783002,0.00016686287,0.00015800195],"domain_scores_gemma":[0.9996143,0.00007000098,0.000038814836,0.00015769905,0.000046947018,0.00007226403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017502742,0.00007153048,0.00006859963,0.000041771615,0.00012666237,0.0001175807,0.00047017983,0.000025396263,0.0000048147836],"category_scores_gemma":[0.00003363422,0.000055600103,0.000034091998,0.0006871585,0.000025823103,0.0002495623,0.00013245564,0.00009979257,0.000069101974],"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.000015226059,0.00007138861,0.00034138793,0.000016608965,0.000025362036,0.000030396728,0.0024123294,0.00648563,0.0007890228,0.20776002,0.027579071,0.75447357],"study_design_scores_gemma":[0.00041575625,0.000073035866,0.0020555553,0.000006544837,0.0000026202022,0.000006065799,0.000043989312,0.86337113,0.0014771497,0.027398814,0.10497773,0.00017160806],"about_ca_topic_score_codex":0.000013459136,"about_ca_topic_score_gemma":0.000025260984,"teacher_disagreement_score":0.8568855,"about_ca_system_score_codex":0.00001657549,"about_ca_system_score_gemma":0.000066180786,"threshold_uncertainty_score":0.22673063},"labels":[],"label_agreement":null},{"id":"W3027437889","doi":"10.1112/blms.12657","title":"Stochastic approximation of lamplighter metrics","year":2022,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"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; National Science Foundation","keywords":"Mathematics; Metric space; Lipschitz continuity; Embedding; Metric (unit); Combinatorics; Distortion (music); Upper and lower bounds; Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.01476690440357643,"score_gpt":0.22410091096046114,"score_spread":0.20933400655688472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027437889","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.02010059,0.00007998379,0.9756021,0.003235184,0.00013765635,0.00022792531,0.0000053850385,0.000024125646,0.0005870723],"genre_scores_gemma":[0.8024654,0.0000018778243,0.19608416,0.0003949189,0.000029560464,0.000041225718,0.0000034244997,0.0000070568954,0.00097242184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987316,0.00009864847,0.00030872767,0.00014806651,0.00060577696,0.000107164145],"domain_scores_gemma":[0.99894786,0.00037849182,0.00022289094,0.00032729105,0.000098215816,0.000025241252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007012667,0.000073130366,0.0001539498,0.000032336648,0.00016072909,0.00001800708,0.00064318866,0.000025653118,0.0002845907],"category_scores_gemma":[0.00016923202,0.0000542748,0.00021935644,0.0005753319,0.000050315215,0.000026118725,0.0005836233,0.000116996816,0.000010629139],"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.000010429781,0.00056232547,0.000020914196,0.00024638086,0.00006631429,2.1745134e-7,0.0019510412,0.054072086,0.0022922668,0.90823364,0.028001528,0.004542829],"study_design_scores_gemma":[0.0008982646,0.00019203479,0.00044208186,0.000042190208,0.00005545509,0.0000316842,0.00021324136,0.6793361,0.01040321,0.2860307,0.022070348,0.0002846882],"about_ca_topic_score_codex":0.0000020939522,"about_ca_topic_score_gemma":3.268853e-8,"teacher_disagreement_score":0.7823648,"about_ca_system_score_codex":0.000037620426,"about_ca_system_score_gemma":0.000033179527,"threshold_uncertainty_score":0.31160685},"labels":[],"label_agreement":null},{"id":"W3027661369","doi":"10.1007/s00454-022-00456-y","title":"Combinatorics of Intervals in the Plane I: Trapezoids","year":2022,"lang":"en","type":"article","venue":"Discrete & 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; Horizon 2020; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Plane (geometry); Geometry","score_opus":0.015129094553496807,"score_gpt":0.25696632915018014,"score_spread":0.24183723459668333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027661369","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.4425662,0.0004983173,0.55178237,0.0020453539,0.0007167341,0.000346197,0.000060376784,0.000058156256,0.0019263161],"genre_scores_gemma":[0.9938791,0.0000035633811,0.0050360993,0.0007086043,0.00003891323,0.000050693823,0.00019353187,0.0000068790846,0.00008263023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769276,0.00034240008,0.0004572534,0.00031554405,0.0009851445,0.00020688961],"domain_scores_gemma":[0.9987222,0.00066963653,0.00018219255,0.00028223934,0.0001027772,0.000040971707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010614231,0.00013613378,0.00019186102,0.00054747344,0.00023609966,0.00007105536,0.0011299098,0.000027427413,0.00008484447],"category_scores_gemma":[0.000054829623,0.00012083284,0.00010569502,0.0026796395,0.000045380257,0.00025745563,0.00033654613,0.00027334012,0.000008241244],"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.00001980202,0.00028257183,0.00204696,0.000020427333,0.000025248577,0.000019299663,0.0017325868,0.53528684,0.00006814589,0.45267472,0.0011946961,0.006628687],"study_design_scores_gemma":[0.0017813811,0.00075459515,0.15997028,0.000020819976,0.000017321414,0.00019689545,0.001217296,0.55131066,0.00022229766,0.27433923,0.009655343,0.0005139028],"about_ca_topic_score_codex":0.000021138743,"about_ca_topic_score_gemma":0.0000020573543,"teacher_disagreement_score":0.55131286,"about_ca_system_score_codex":0.0000676136,"about_ca_system_score_gemma":0.00012428184,"threshold_uncertainty_score":0.492742},"labels":[],"label_agreement":null},{"id":"W3028849184","doi":"","title":"Slope packings and coverings, and generic algorithms for the discrete logarithm problem.","year":2001,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","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":"Logarithm; Affine transformation; Prime (order theory); Mathematics; Discrete logarithm; Order (exchange); Set (abstract data type); Point (geometry); Plane (geometry); Combinatorics; Algorithm; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.02678645473209214,"score_gpt":0.2749037115644977,"score_spread":0.24811725683240557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028849184","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.009642498,0.0011820794,0.9823922,0.0045598396,0.00062780315,0.0010111923,0.000047608613,0.00009041617,0.00044637188],"genre_scores_gemma":[0.025196822,0.0013795645,0.9719723,0.000604351,0.00032394755,0.0004022705,0.00007836857,0.000022285565,0.00002011826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979919,0.00013025079,0.00035274462,0.00095960934,0.0001850843,0.00038041253],"domain_scores_gemma":[0.99820477,0.0007953733,0.00025229694,0.0005136145,0.00011486807,0.00011910693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044227525,0.00033042132,0.00036938212,0.00017235498,0.000368912,0.00028390955,0.00065640354,0.00017432215,0.000006531682],"category_scores_gemma":[0.000084661115,0.0002620218,0.000103007595,0.00014566703,0.00030497566,0.00013473498,0.002616213,0.00048422685,0.0000050165595],"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.00003505837,0.00003490206,0.00075952953,0.000115108094,0.00018248882,0.000019667426,0.0018624562,0.011926323,0.00024844732,0.77061206,0.0006011572,0.21360278],"study_design_scores_gemma":[0.00040761734,0.00009660164,0.008009484,0.000037819023,0.000042040174,0.0001985548,0.00002865539,0.274726,0.00015377275,0.6988255,0.017150473,0.0003234769],"about_ca_topic_score_codex":0.00005285208,"about_ca_topic_score_gemma":0.000046345278,"teacher_disagreement_score":0.26279968,"about_ca_system_score_codex":0.000030884592,"about_ca_system_score_gemma":0.00014294962,"threshold_uncertainty_score":0.9999832},"labels":[],"label_agreement":null},{"id":"W3033851347","doi":"10.1007/978-3-030-90048-9_3","title":"Negative Instance for the Edge Patrolling Beacon Problem","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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":"Patrolling; Ball (mathematics); Conjecture; Polygon (computer graphics); Combinatorics; Mathematics; Computer science; Artificial intelligence; Geometry; Geography; Telecommunications","score_opus":0.022153382588692344,"score_gpt":0.2726160449172854,"score_spread":0.25046266232859304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033851347","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.0064732577,0.0013520789,0.98361045,0.0036009008,0.0037937434,0.0010494455,0.000006139106,0.00010000554,0.000013978356],"genre_scores_gemma":[0.4947365,0.000027219889,0.50377357,0.00091920316,0.00042111246,0.00010604398,0.0000076092447,0.0000072733337,0.0000014640846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966899,0.00011455226,0.0004680277,0.0014719835,0.00070931326,0.0005461848],"domain_scores_gemma":[0.99606186,0.0018428984,0.00028482723,0.001044022,0.0006746977,0.00009168067],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001504789,0.00035168248,0.00035437968,0.0003396394,0.0005716418,0.0015648176,0.0029344633,0.00017270843,0.0000023079124],"category_scores_gemma":[0.00034663567,0.0002739065,0.00016612007,0.002091088,0.0002617053,0.0006074381,0.002227644,0.00071986014,0.0000019118913],"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.000003633418,0.000026459007,0.000032279422,0.00003606077,0.0000088386205,0.0000035941546,0.0015216105,0.630451,0.000218326,0.00087346,0.000008532602,0.3668162],"study_design_scores_gemma":[0.000259268,0.00005948283,0.0005244461,0.0001782418,0.000007438032,0.000011223924,0.000001919089,0.92457837,0.0110429535,0.06289596,0.0001307051,0.00030998478],"about_ca_topic_score_codex":0.00004085833,"about_ca_topic_score_gemma":0.00013638887,"teacher_disagreement_score":0.48826322,"about_ca_system_score_codex":0.00023240274,"about_ca_system_score_gemma":0.0013577947,"threshold_uncertainty_score":0.99997133},"labels":[],"label_agreement":null},{"id":"W3034529237","doi":"10.1090/tran/8420","title":"Distinct distances in the complex plane","year":2021,"lang":"en","type":"preprint","venue":"Transactions of the American Mathematical Society","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"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; National Science Foundation","keywords":"Omega; Combinatorics; Plane (geometry); Set (abstract data type); Line (geometry); Mathematics; Complex plane; Geometry; Physics; Mathematical analysis; Computer science; Quantum mechanics","score_opus":0.03073720108302195,"score_gpt":0.2845991849249913,"score_spread":0.25386198384196934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034529237","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.07491391,0.000067461675,0.9205386,0.0037094248,0.00012111241,0.00023573704,0.000024227862,0.000028832153,0.00036066832],"genre_scores_gemma":[0.9135451,0.000029874856,0.085972935,0.00031509803,0.000031243504,0.000044571487,0.00001010481,0.000005586759,0.000045483284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984916,0.00021639012,0.0003690198,0.00028480217,0.00047659405,0.00016159078],"domain_scores_gemma":[0.9983133,0.000564024,0.00027296357,0.0007547443,0.00006477764,0.000030200034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041261426,0.00015903814,0.00033941484,0.000022168198,0.00016195081,0.00012387884,0.001344404,0.00004498583,0.00004084946],"category_scores_gemma":[0.0000305669,0.00009654126,0.00044652916,0.0007344933,0.00034655427,0.00007564141,0.00012151926,0.0004425992,0.000002566735],"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.00010423538,0.010851199,0.0014223397,0.005855462,0.0022803566,0.000032244145,0.13268413,0.36694503,0.005849315,0.27317438,0.010929101,0.18987224],"study_design_scores_gemma":[0.00054204,0.00015156608,0.07517992,0.0004948921,0.00022898593,0.00006298992,0.0054919096,0.75814724,0.00093275926,0.15657336,0.0013289601,0.0008653821],"about_ca_topic_score_codex":0.000069167254,"about_ca_topic_score_gemma":0.00003429255,"teacher_disagreement_score":0.8386312,"about_ca_system_score_codex":0.00004952833,"about_ca_system_score_gemma":0.00011873132,"threshold_uncertainty_score":0.39368382},"labels":[],"label_agreement":null},{"id":"W3036993785","doi":"","title":"Ball-Polyhedra","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Calgary","funders":"","keywords":"Polyhedron; Convexity; Ball (mathematics); Regular polygon; Combinatorics; Convex polytope; Mathematics; Geometry; Convex set; Convex optimization","score_opus":0.1037274838273414,"score_gpt":0.1789786081383615,"score_spread":0.0752511243110201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036993785","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.07425674,0.00008263733,0.9104291,0.00007430918,0.0010756416,0.0001493583,0.0000051914813,0.00023648211,0.01369052],"genre_scores_gemma":[0.989569,0.00007196615,0.0063148467,0.00015483054,0.0001341164,6.78631e-7,0.000024716946,0.000009153882,0.0037206812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859554,0.000089269175,0.0001476761,0.0008530165,0.00008244832,0.0002320758],"domain_scores_gemma":[0.99865776,0.000051519084,0.00015724127,0.000837661,0.0001558137,0.00014000923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016937732,0.00021740264,0.00019204448,0.0002678224,0.00012705661,0.00010394552,0.0013952571,0.00019836087,0.00008532544],"category_scores_gemma":[0.00001827969,0.00026138936,0.00015987236,0.00051824487,0.000044547487,0.00035849604,0.0015236429,0.00032877433,0.00027371536],"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.000009976153,0.0000774884,0.0002765782,0.000026614509,0.00005489504,0.00012083974,0.00018264556,0.17752409,0.00004213908,0.81832576,0.0009593121,0.0023996555],"study_design_scores_gemma":[0.00033461995,0.000055969194,0.0022857706,0.000040050156,0.000043616732,0.00000936155,0.000013759306,0.6669946,0.0006032797,0.32583547,0.0032237964,0.0005597034],"about_ca_topic_score_codex":0.00006293414,"about_ca_topic_score_gemma":0.000015544863,"teacher_disagreement_score":0.9153123,"about_ca_system_score_codex":0.000094412084,"about_ca_system_score_gemma":0.00022209871,"threshold_uncertainty_score":0.99998385},"labels":[],"label_agreement":null},{"id":"W3037891713","doi":"10.4230/lipics.sea.2020.27","title":"Path Query Data Structures in Practice","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":"Dalhousie University","funders":"","keywords":"Computer science; Data structure; Tree traversal; Path (computing); Pointer (user interface); Theoretical computer science; Data mining; Algorithm; Artificial intelligence","score_opus":0.04467023161662047,"score_gpt":0.3016617124805083,"score_spread":0.25699148086388784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037891713","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.021447137,0.00015791686,0.96823674,0.0051792753,0.0008626756,0.0008207044,0.0003934566,0.00019859102,0.002703494],"genre_scores_gemma":[0.70722914,0.00005528642,0.27892673,0.0117254695,0.0003926336,0.000037532765,0.0015657851,0.000023579942,0.00004381262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978562,0.00006280074,0.000799696,0.00037330677,0.00050002703,0.00040795843],"domain_scores_gemma":[0.9981574,0.00027217125,0.00032614573,0.000833169,0.0002208818,0.0001902695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005785422,0.00024126281,0.00026475344,0.00017452502,0.0001632184,0.00047219658,0.0017721081,0.00011765666,0.000012438145],"category_scores_gemma":[0.00061380444,0.00022839388,0.00006932009,0.0006479268,0.000035258654,0.004695833,0.0009599432,0.00033783377,0.000074854695],"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.0007476202,0.0012115607,0.0072324583,0.002070596,0.00058502157,0.00012333672,0.06717319,0.03407129,0.00044644467,0.48109528,0.16582206,0.23942113],"study_design_scores_gemma":[0.0017893479,0.00019069524,0.001256623,0.00004087284,0.000020904716,0.000056917703,0.0007341339,0.73767877,0.00027265548,0.0017788918,0.2557616,0.00041858247],"about_ca_topic_score_codex":0.000015091861,"about_ca_topic_score_gemma":0.000008751254,"teacher_disagreement_score":0.7036075,"about_ca_system_score_codex":0.000055993074,"about_ca_system_score_gemma":0.00016849971,"threshold_uncertainty_score":0.9313632},"labels":[],"label_agreement":null},{"id":"W3038075884","doi":"10.4230/lipics.socg.2020.65","title":"Dense Graphs Have Rigid Parts","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; European Commission","keywords":"Embedding; Combinatorics; Line graph; Infinitesimal; Discrete mathematics; Graph; Mathematics; Connection (principal bundle); Graph embedding; Upper and lower bounds; Computer science; Geometry; Artificial intelligence","score_opus":0.02509235238038038,"score_gpt":0.2507870625630595,"score_spread":0.22569471018267911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038075884","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.07811923,0.000079859936,0.913094,0.002811255,0.0009600873,0.00085050263,0.0001541952,0.0003682765,0.0035626255],"genre_scores_gemma":[0.9314845,0.00002628666,0.059858482,0.0076564485,0.00027458082,0.00006872927,0.00038425726,0.000025428195,0.00022125333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776447,0.000038590177,0.00081234943,0.00032461828,0.00053038757,0.0005295882],"domain_scores_gemma":[0.998442,0.00012731944,0.00029535103,0.00047251265,0.0003089419,0.00035386469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032063416,0.00030705062,0.00031283792,0.00019732324,0.00034556774,0.00051561365,0.0009117427,0.00013343796,0.000025604062],"category_scores_gemma":[0.00011846202,0.00029198447,0.0002371264,0.00051364204,0.000059367565,0.0017274646,0.00034458173,0.00026043493,0.000267644],"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.00051332917,0.0011912658,0.016151031,0.0017250871,0.00085512287,0.00011452447,0.07696729,0.027106928,0.0010321555,0.5375199,0.1936247,0.14319867],"study_design_scores_gemma":[0.0026808456,0.00047349863,0.001288267,0.00005202751,0.000033273784,0.0000947528,0.00040147224,0.70227265,0.003117095,0.0076226015,0.28120288,0.000760601],"about_ca_topic_score_codex":0.0000039146917,"about_ca_topic_score_gemma":0.0000057838415,"teacher_disagreement_score":0.8533653,"about_ca_system_score_codex":0.000048016565,"about_ca_system_score_gemma":0.00009939027,"threshold_uncertainty_score":0.9999532},"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":"W3043060859","doi":"10.4230/lipics.itc.2021.18","title":"Differentially Private Approximations of a Convex Hull in Low Dimensions","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Convex hull; Mathematics; Combinatorics; Convex body; Regular polygon; Kernel (algebra); Euclidean space; Bounding overwatch; Minimum bounding box; Ball (mathematics); Euclidean geometry; Discrete mathematics; Geometry; Image (mathematics); Computer science","score_opus":0.06522621556947897,"score_gpt":0.18810887675693655,"score_spread":0.12288266118745758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043060859","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.38410538,0.000016258246,0.6150318,0.00014735939,0.0001752913,0.0001996085,0.000010798868,0.000053819425,0.00025972538],"genre_scores_gemma":[0.99223775,0.00004122105,0.0074231955,0.00006636219,0.000031379222,0.0000014491106,0.000049170085,0.000007231093,0.000142241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987047,0.00012006669,0.00026264344,0.0006442491,0.00010307085,0.00016531062],"domain_scores_gemma":[0.99898857,0.00010052189,0.00023744616,0.00043555786,0.0001362809,0.00010159585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111276684,0.00018024465,0.00028936524,0.0003399045,0.00006322758,0.00004588496,0.00081231835,0.00013577628,0.00001657861],"category_scores_gemma":[0.000047851747,0.0002162893,0.00013057247,0.00090258266,0.00005274627,0.00020922473,0.0012322413,0.00031148677,0.000022535105],"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.000013586681,0.00015363742,0.00056880823,0.00010861859,0.00003920836,0.00004178135,0.00031865065,0.5120517,0.00090561627,0.48547423,0.00004738225,0.0002767722],"study_design_scores_gemma":[0.00039092876,0.000032256186,0.0060281763,0.000095741365,0.000022055661,0.0000010545726,0.0000136280605,0.90074056,0.0008095757,0.09159111,0.00006681107,0.00020808392],"about_ca_topic_score_codex":0.000032099593,"about_ca_topic_score_gemma":0.000025997224,"teacher_disagreement_score":0.60813236,"about_ca_system_score_codex":0.0000703807,"about_ca_system_score_gemma":0.00021543592,"threshold_uncertainty_score":0.8820022},"labels":[],"label_agreement":null},{"id":"W3044976144","doi":"10.1088/1751-8121/aba8cf","title":"Asymptotics of linked polygons","year":2020,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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 Toronto","funders":"","keywords":"Mathematics; Geometry; Combinatorics","score_opus":0.014897189947338726,"score_gpt":0.23402449253807248,"score_spread":0.21912730259073376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044976144","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.11919452,0.0000441333,0.8770457,0.0031970472,0.000040395666,0.000031427426,9.564221e-7,0.000006337966,0.00043948067],"genre_scores_gemma":[0.92891836,0.000008038302,0.07065129,0.00023548615,0.00018026384,2.3471897e-7,2.0759379e-7,0.0000030587628,0.0000030512206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920285,0.00004094901,0.00033372734,0.000077108685,0.0002639083,0.000081443715],"domain_scores_gemma":[0.999177,0.0003038097,0.00014430478,0.000074683136,0.0001496202,0.00015058041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021035968,0.000066634144,0.00021526792,0.000023808914,0.00002374971,0.000035250167,0.00020606306,0.000029524414,0.000021459073],"category_scores_gemma":[0.00021609079,0.00004771904,0.000085364714,0.00018625129,0.00014238733,0.0001344094,0.00009087509,0.00012301383,0.000005276293],"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.000010764842,0.00009375215,0.0000067742976,0.000037316688,0.000020764819,0.0000041763074,0.00047249615,0.000106579915,0.0014710414,0.99161434,0.000037043013,0.0061249607],"study_design_scores_gemma":[0.00020895114,0.00025936373,0.000043659427,0.000025739051,0.000018541428,0.000036473848,0.00001622626,0.13150947,0.0042557293,0.8635396,0.000037840702,0.000048433718],"about_ca_topic_score_codex":2.2407688e-8,"about_ca_topic_score_gemma":2.3327942e-9,"teacher_disagreement_score":0.80972385,"about_ca_system_score_codex":0.000003604407,"about_ca_system_score_gemma":0.000044616016,"threshold_uncertainty_score":0.1945926},"labels":[],"label_agreement":null},{"id":"W3048555161","doi":"10.1145/3386569.3392472","title":"<i>LoopyCuts</i>","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":50,"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 British Columbia","funders":"","keywords":"Hexahedron; Polygon mesh; Robustness (evolution); Subdivision; Curvature; Algorithm; Computer science; Surface (topology); Feature (linguistics); Bounded function; CAD; Mesh generation; Mathematics; Geometry; Finite element method; Computer graphics (images); Engineering drawing; Engineering","score_opus":0.03406031262817144,"score_gpt":0.24509894074439278,"score_spread":0.21103862811622134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048555161","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.001875409,0.00004562977,0.9752759,0.021885466,0.00025958096,0.00007676326,0.0000049277137,0.00022375862,0.00035259474],"genre_scores_gemma":[0.9252323,0.00007550278,0.059486844,0.0150350975,0.00007662959,0.0000139983285,0.000004986522,0.0000074361797,0.000067220484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992161,0.000032249955,0.00013153072,0.00026538782,0.00023053083,0.00012422558],"domain_scores_gemma":[0.99932927,0.00010239889,0.00002830718,0.00035304765,0.000064175314,0.00012280839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006909954,0.000091255,0.00007628686,0.00010845033,0.00018410814,0.000073559204,0.0005521651,0.000045147233,0.000034570003],"category_scores_gemma":[0.000024738118,0.00009332008,0.000085358755,0.0011081005,0.000020574082,0.00028633463,0.000008950441,0.00017117213,0.0001014931],"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.00007096603,0.0006051468,0.00011480662,0.00005557557,0.00017184115,0.00003806436,0.002583986,0.098179154,0.0059209815,0.29943278,0.013279044,0.57954764],"study_design_scores_gemma":[0.0021387974,0.0014670311,0.00205991,0.00003398981,0.00007387977,0.00006278023,0.00007944092,0.49760202,0.062049553,0.11662894,0.31651902,0.0012846367],"about_ca_topic_score_codex":0.0000021161284,"about_ca_topic_score_gemma":0.0000027653668,"teacher_disagreement_score":0.9233569,"about_ca_system_score_codex":0.000007284358,"about_ca_system_score_gemma":0.000041097934,"threshold_uncertainty_score":0.38054824},"labels":[],"label_agreement":null},{"id":"W3067821248","doi":"10.4153/s0008439521000096","title":"Sumsets of semiconvex sets","year":2021,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Monotone polygon; Combinatorics; Quadratic equation; Constant (computer programming); Set (abstract data type); Multiplier (economics); Discrete mathematics; Upper and lower bounds; Geometry; Mathematical analysis","score_opus":0.01186656347716388,"score_gpt":0.22186285856782004,"score_spread":0.20999629509065615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3067821248","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.15867873,0.00043477782,0.75345683,0.028008068,0.00040964136,0.00022434232,0.00002805573,0.00008895455,0.058670595],"genre_scores_gemma":[0.9152848,0.0000049259206,0.080270804,0.0016479838,0.00004184167,0.0000067524666,0.000018900882,0.000007339022,0.0027166437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923134,0.000043025455,0.00019703736,0.00018304212,0.00016182664,0.0001837004],"domain_scores_gemma":[0.99914217,0.00014057441,0.00003581658,0.00027617472,0.00014702167,0.00025822644],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000168194,0.00006998687,0.00012725858,0.00008655281,0.00004932442,0.000044407934,0.00023214637,0.000047470327,0.0033413633],"category_scores_gemma":[0.0002402107,0.00007260808,0.00004894664,0.00027954852,0.000024939314,0.000037313424,0.00005035755,0.00006302221,0.0018860782],"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":[8.2917717e-7,0.00005023849,0.000044643057,0.00007863141,0.00001860872,0.000110776746,0.00032026006,0.00018090554,0.0013577994,0.95338506,0.034270007,0.010182265],"study_design_scores_gemma":[0.0007174606,0.0000765657,0.0015542248,0.00019025957,0.000019298464,0.0004707752,0.000098453784,0.052091822,0.04909818,0.4524213,0.44260916,0.00065247726],"about_ca_topic_score_codex":0.00007697856,"about_ca_topic_score_gemma":0.0001692191,"teacher_disagreement_score":0.7566061,"about_ca_system_score_codex":0.0000392726,"about_ca_system_score_gemma":0.00040504098,"threshold_uncertainty_score":0.99889106},"labels":[],"label_agreement":null},{"id":"W3081569775","doi":"10.1007/978-3-030-58150-3_35","title":"On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs","year":2020,"lang":"en","type":"book-chapter","venue":"Iris (Roma Tre University)","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":"Planar graph; Combinatorics; Planar; Monotone polygon; Embedding; Mathematics; Outerplanar graph; Vertex (graph theory); Planar straight-line graph; Book embedding; Graph; Pathwidth; Discrete mathematics; 1-planar graph; Computer science; Geometry; Chordal graph; Computer graphics (images); Line graph; Artificial intelligence","score_opus":0.036341261493564626,"score_gpt":0.19650881670068415,"score_spread":0.16016755520711953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081569775","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.018967211,0.0002070707,0.113297194,0.003406961,0.0008136442,0.0009779093,0.00036953652,0.00024465416,0.8617158],"genre_scores_gemma":[0.8240101,0.00018323549,0.007199407,0.0009396599,0.00016457231,0.0000013479882,0.00043256552,0.000064163665,0.16700496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987348,0.000047769652,0.00025040336,0.0004004883,0.0004442555,0.00012233765],"domain_scores_gemma":[0.998615,0.00030445584,0.00042167134,0.00040205067,0.00018158303,0.00007519815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008716953,0.0002207372,0.00031794826,0.0006961311,0.0001143243,0.000019600266,0.0008759905,0.00014049174,0.00007205704],"category_scores_gemma":[0.0000353935,0.00020089223,0.00019790139,0.00046632264,0.00008655897,0.00014769366,0.00010766102,0.00018899179,0.000019333907],"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.0000629808,0.000032413907,0.000019927274,0.000023798364,0.00015299662,0.000095383555,0.0001936772,0.00009307114,0.00035932724,0.99023813,0.0072764196,0.0014518475],"study_design_scores_gemma":[0.00532864,0.0043391497,0.0029756646,0.0014324667,0.0007936778,0.000051338287,0.00028237115,0.01077903,0.0048906575,0.5953894,0.37136614,0.0023714278],"about_ca_topic_score_codex":0.000019933523,"about_ca_topic_score_gemma":0.00001093995,"teacher_disagreement_score":0.80504286,"about_ca_system_score_codex":0.000056939,"about_ca_system_score_gemma":0.00011756825,"threshold_uncertainty_score":0.81921476},"labels":[],"label_agreement":null},{"id":"W3082140337","doi":"10.20382/jocg.v11i1a6","title":"On the planar edge-length ratio of planar graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Horizon 2020 Framework Programme; Ministero dell’Istruzione, dell’Università e della Ricerca; Università degli Studi Roma Tre","keywords":"Combinatorics; Mathematics; Planar graph; Planar; Bipartite graph; Outerplanar graph; Enhanced Data Rates for GSM Evolution; 1-planar graph; Book embedding; Pathwidth; Graph; Line graph; Computer science","score_opus":0.010286293005946646,"score_gpt":0.19753086276732693,"score_spread":0.1872445697613803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082140337","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5313244,0.00007717082,0.4632567,0.001758304,0.0007077218,0.00015803204,0.000011872911,0.0000193913,0.0026864393],"genre_scores_gemma":[0.9835957,0.000020447278,0.01527348,0.00043686494,0.00008613258,1.465348e-7,0.000011428649,0.0000071801333,0.00056857156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981113,0.00018787067,0.0004309389,0.00021627393,0.0008793834,0.00017421383],"domain_scores_gemma":[0.9969891,0.0012963287,0.0006604027,0.00024457497,0.00070191507,0.000107679494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055248034,0.00016137485,0.00028481666,0.001391435,0.00013408985,0.00006660689,0.00095297286,0.000071281815,0.00008303735],"category_scores_gemma":[0.000089164154,0.00013241982,0.0002328468,0.0019864226,0.000060176666,0.0006131898,0.0000613526,0.00028528384,0.000040494346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010384072,0.000132643,0.00069299387,0.000016158303,0.00014765172,0.000033624714,0.00024023226,0.24699327,0.00045228863,0.74629873,0.0029710066,0.0019175737],"study_design_scores_gemma":[0.010769458,0.0064790156,0.10602612,0.00060813717,0.00028462405,0.00082005054,0.0020777371,0.25667182,0.0075634704,0.52975225,0.077063054,0.0018842649],"about_ca_topic_score_codex":0.0000042198244,"about_ca_topic_score_gemma":9.238238e-7,"teacher_disagreement_score":0.45227137,"about_ca_system_score_codex":0.00009244758,"about_ca_system_score_gemma":0.00032459706,"threshold_uncertainty_score":0.53999233},"labels":[],"label_agreement":null},{"id":"W3082819694","doi":"10.4230/lipics.esa.2020.67","title":"Light Euclidean Spanners with Steiner Points","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; Blavatnik Family Foundation","keywords":"Spanner; Combinatorics; Bounded function; Upper and lower bounds; Mathematics; Euclidean geometry; Point (geometry); Euclidean distance; Lightness; Discrete mathematics; Binary logarithm; Computer science; Geometry; Mathematical analysis; Artificial intelligence","score_opus":0.015175484887956319,"score_gpt":0.22441194505017908,"score_spread":0.20923646016222278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082819694","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.07789553,0.00004760161,0.9070956,0.009553247,0.0005480498,0.0008080664,0.00007237223,0.00034017608,0.0036393302],"genre_scores_gemma":[0.8566712,0.000016707625,0.13238424,0.009824298,0.00041418572,0.000068614696,0.00030170352,0.00004013907,0.0002789132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785405,0.00003279748,0.00069549854,0.000332284,0.00057615334,0.0005092258],"domain_scores_gemma":[0.99848986,0.000081930026,0.00029991395,0.00046010528,0.00032750954,0.0003407009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028750722,0.00032223453,0.00031896395,0.00018512779,0.0002680377,0.00047474063,0.000903883,0.00010777515,0.000026476975],"category_scores_gemma":[0.00007554987,0.00026358507,0.00014317369,0.00069138163,0.000036354963,0.0019177574,0.00029518004,0.00025723848,0.00025863026],"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.0015335518,0.0016308379,0.01319197,0.0028161332,0.001672733,0.00014348642,0.1058587,0.050981432,0.002814268,0.36458096,0.18046032,0.2743156],"study_design_scores_gemma":[0.005174594,0.0012792028,0.0010293622,0.00012513442,0.000052056148,0.00010655339,0.0008077822,0.53373516,0.007439925,0.0011472782,0.44800666,0.0010962675],"about_ca_topic_score_codex":0.0000030588933,"about_ca_topic_score_gemma":0.000005409534,"teacher_disagreement_score":0.7787757,"about_ca_system_score_codex":0.00005729935,"about_ca_system_score_gemma":0.000115324925,"threshold_uncertainty_score":0.99998164},"labels":[],"label_agreement":null},{"id":"W3087949895","doi":"10.1007/s00453-020-00769-5","title":"On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth","year":2020,"lang":"en","type":"article","venue":"Algorithmica","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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Treewidth; Bounded function; Combinatorics; Mathematics; Theory of computation; Computer science; Discrete mathematics; Graph; Algorithm; Pathwidth","score_opus":0.013151739612575262,"score_gpt":0.2044343008246829,"score_spread":0.19128256121210763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087949895","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.04429655,0.00004027279,0.9437138,0.0078594005,0.00018479294,0.00014623158,0.000008962506,0.0002272444,0.003522737],"genre_scores_gemma":[0.8606428,0.0000023580903,0.13393769,0.0047787433,0.00037523566,0.0000142915005,0.0000320742,0.0000143599,0.00020243967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985393,0.00005310779,0.00019064956,0.0004871577,0.0004704154,0.00025935646],"domain_scores_gemma":[0.9992307,0.00015254365,0.00007570482,0.0002386851,0.00009909394,0.00020327691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011425458,0.00017049667,0.00016023421,0.00009662116,0.00020674865,0.00017994788,0.0004371072,0.000044227345,0.000043449723],"category_scores_gemma":[0.000049846585,0.00014588046,0.000068844514,0.0007512503,0.00003254588,0.00032252836,0.00010444578,0.00016878078,0.00013255789],"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.00013533271,0.0001852033,0.00025095046,0.000017184555,0.00014638218,0.00016455255,0.0007789863,0.013005626,0.0015574779,0.7039222,0.0056888675,0.27414724],"study_design_scores_gemma":[0.0029181293,0.002604339,0.009272167,0.00006667003,0.00005261563,0.00020549983,0.000054178145,0.903147,0.008685805,0.029628275,0.04207647,0.0012888954],"about_ca_topic_score_codex":0.000003095948,"about_ca_topic_score_gemma":0.0000043111863,"teacher_disagreement_score":0.8901413,"about_ca_system_score_codex":0.000030655312,"about_ca_system_score_gemma":0.00020815477,"threshold_uncertainty_score":0.5948832},"labels":[],"label_agreement":null},{"id":"W3089577182","doi":"10.1007/s00454-003-0012-9","title":"Unavoidable Configurations in Complete Topological Graphs","year":2003,"lang":"en","type":"article","venue":"Discrete & 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":"University of British Columbia","funders":"Eidgenössische Technische Hochschule Zürich; Deutsche Forschungsgemeinschaft; Hungarian Scientific Research Fund; City University of New York; National Science Foundation","keywords":"Mathematics; Combinatorics; Topological graph; Discrete mathematics; Induced subgraph; Path graph; Graph homomorphism; Topological graph theory; Graph; Topology (electrical circuits); Line graph; Pathwidth; Graph power; Vertex (graph theory)","score_opus":0.022634841835219056,"score_gpt":0.2668587935351035,"score_spread":0.24422395169988445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089577182","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.10499762,0.0002825602,0.8801593,0.0009455526,0.0004887289,0.00031551748,0.000023293911,0.00015206293,0.012635326],"genre_scores_gemma":[0.92234623,0.0000082267,0.07632601,0.00081773347,0.000037347625,0.000043159867,0.00015748372,0.000010343901,0.00025347562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975579,0.00026905857,0.0005469114,0.00062041124,0.0005795419,0.00042622583],"domain_scores_gemma":[0.998604,0.00055301667,0.00013590184,0.0003174296,0.00022713873,0.00016251834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005635908,0.00024130958,0.00027376274,0.00072731124,0.0002980843,0.0002388262,0.0005004055,0.00010325916,0.00026552958],"category_scores_gemma":[0.0002380998,0.00024262353,0.00012800736,0.002575515,0.000096383075,0.00063527474,0.00009527611,0.0002579637,0.00015679594],"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.0000047553226,0.00009722851,0.0017085684,0.000006664237,0.000014866612,0.000014340037,0.000097666816,0.20254089,0.00019706583,0.7938515,0.00031168066,0.0011547514],"study_design_scores_gemma":[0.0013890119,0.00017459794,0.097541824,0.000026238651,0.000009395672,0.000105978484,0.00011641734,0.28199142,0.00033061416,0.60384107,0.013825045,0.0006483621],"about_ca_topic_score_codex":0.000021662136,"about_ca_topic_score_gemma":0.000014025516,"teacher_disagreement_score":0.8173486,"about_ca_system_score_codex":0.00008873449,"about_ca_system_score_gemma":0.00021255565,"threshold_uncertainty_score":0.9893901},"labels":[],"label_agreement":null},{"id":"W3099384217","doi":"","title":"5-choosability of graphs with crossings far apart","year":2012,"lang":"en","type":"article","venue":"Iowa State University Digital Repository (Iowa State University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Planar graph; Combinatorics; Graph; Book embedding; Mathematics; Computer science; 1-planar graph; Chordal graph","score_opus":0.00733680408094693,"score_gpt":0.172192712311842,"score_spread":0.16485590823089508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099384217","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.8187256,0.000038426995,0.15509173,0.000042923566,0.00028504423,0.00022575833,0.00007125315,0.00019721125,0.025322055],"genre_scores_gemma":[0.97844124,0.000019935309,0.0033094226,0.000032355707,0.00002228086,1.06007676e-7,0.000022166321,0.000011960506,0.018140525],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99806094,0.00012172889,0.00024071203,0.0005527398,0.00050864974,0.00051525765],"domain_scores_gemma":[0.9981436,0.00015493778,0.0003033578,0.00053498516,0.00046489097,0.00039823598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012736501,0.00027883516,0.0002928632,0.00059727876,0.00049983955,0.00022697916,0.00079179206,0.00007254805,0.0000050663357],"category_scores_gemma":[0.000022023298,0.00030864836,0.00016864682,0.0016047673,0.00040968982,0.0049244463,0.00040780695,0.00019021661,0.000015951771],"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.0046311948,0.005998184,0.59915596,0.00074029964,0.002040975,0.0030073577,0.03335196,0.048396792,0.020000545,0.18518746,0.0069261473,0.09056312],"study_design_scores_gemma":[0.008820606,0.002348313,0.24137656,0.0002764414,0.0003410826,0.00045800646,0.0060757366,0.006881869,0.050176058,0.005446956,0.6737563,0.004042054],"about_ca_topic_score_codex":0.000128559,"about_ca_topic_score_gemma":0.000027817618,"teacher_disagreement_score":0.6668302,"about_ca_system_score_codex":0.00032624463,"about_ca_system_score_gemma":0.0003103802,"threshold_uncertainty_score":0.9999366},"labels":[],"label_agreement":null},{"id":"W3102520527","doi":"10.48550/arxiv.1904.09526","title":"Constructive Polynomial Partitioning for Algebraic Curves in\\n $\\\\mathbb{R}^3$ with Applications","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; United States - Israel Binational Science Foundation; National Science Foundation","keywords":"Mathematics; Bounded function; Degree (music); Combinatorics; Polynomial; Integer (computer science); Algebraic number; Discrete mathematics; Algebraic curve","score_opus":0.027151599711875557,"score_gpt":0.168326429779274,"score_spread":0.14117483006739845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102520527","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.23710462,0.00003518521,0.7615072,0.00010356196,0.000074903786,0.00038632457,0.0000043869936,0.000042684995,0.00074112014],"genre_scores_gemma":[0.99288386,0.000012691016,0.006532747,0.00015616087,0.00003593766,0.000007539898,0.000016455331,0.00000394917,0.0003506815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993719,0.000024905765,0.00008367826,0.00033858704,0.000042040778,0.00013888848],"domain_scores_gemma":[0.9994729,0.00011566705,0.00006523163,0.00020242695,0.000098270815,0.000045514687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009407553,0.00007633061,0.00009310973,0.0001284782,0.000087021486,0.00003134851,0.0002342842,0.00002906536,0.000013193005],"category_scores_gemma":[0.0000069615517,0.00008329561,0.000033527976,0.00065634336,0.000035184265,0.0004794613,0.000049165556,0.00005669503,0.00003660066],"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.000035262707,0.00005967866,0.011615293,0.000043653745,0.00002166771,0.0000048912684,0.00009058347,0.14417428,0.00014987195,0.84219193,0.00016148937,0.0014513832],"study_design_scores_gemma":[0.0023137808,0.0002503371,0.016523829,0.0001057709,0.000027706104,0.00001942122,0.00015027974,0.9342294,0.00075832586,0.0396773,0.0054921755,0.00045169046],"about_ca_topic_score_codex":0.00000780911,"about_ca_topic_score_gemma":0.000025184552,"teacher_disagreement_score":0.8025147,"about_ca_system_score_codex":0.00005080599,"about_ca_system_score_gemma":0.000089141846,"threshold_uncertainty_score":0.33966962},"labels":[],"label_agreement":null},{"id":"W3102969010","doi":"","title":"0 ON THE NUMBER OF FACETS OF THREE-DIMENSIONAL DIRICHLET STEREOHEDRA IV: QUARTER CUBIC GROUPS","year":2012,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Dirichlet distribution; Mathematics; Space (punctuation); Group (periodic table); Combinatorics; Geometry; Mathematical analysis; Physics; Computer science; Geography; Quantum mechanics","score_opus":0.022913699130728653,"score_gpt":0.257405298354011,"score_spread":0.23449159922328233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102969010","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.74089617,0.000034207864,0.2546442,0.0007810678,0.00029309324,0.00009545883,0.0000021599108,0.00001834447,0.0032353394],"genre_scores_gemma":[0.9903471,4.4267026e-7,0.008937634,0.0004058461,0.000061650804,0.0000053451595,0.0000034963157,0.000003207546,0.00023527197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990678,0.00006390496,0.000217086,0.00013446926,0.00036557618,0.00015115704],"domain_scores_gemma":[0.9991077,0.00035023995,0.0001010588,0.0002940747,0.00010047854,0.00004645242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034275305,0.00008689886,0.000112743546,0.000052107775,0.000052545456,0.000016363821,0.00027757444,0.000032393604,0.00031688236],"category_scores_gemma":[0.000023005172,0.00005404532,0.00006298545,0.00028396206,0.000032801046,0.0002825666,0.000097281525,0.00006104971,0.00011637634],"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.000015228999,0.00031616716,0.007442365,0.00001205057,0.00003639941,3.2724654e-7,0.00046467717,0.0016979523,0.0033802819,0.97399414,0.0077252574,0.0049151476],"study_design_scores_gemma":[0.0018368002,0.00059917325,0.43996626,0.00011664433,0.00004860532,0.000091666334,0.00012892592,0.3261084,0.093778856,0.13267477,0.003739415,0.0009104909],"about_ca_topic_score_codex":0.000012382274,"about_ca_topic_score_gemma":0.000004180622,"teacher_disagreement_score":0.8413194,"about_ca_system_score_codex":0.000009554283,"about_ca_system_score_gemma":0.000024897994,"threshold_uncertainty_score":0.34696397},"labels":[],"label_agreement":null},{"id":"W3103264504","doi":"","title":"Drawings of planar graphs with few slopes and segments","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Planar graph; Outerplanar graph; Combinatorics; Planar; Plane (geometry); Mathematics; 1-planar graph; Graph drawing; Book embedding; Pathwidth; Graph; Geometry; Chordal graph; Computer science; Line graph; Computer graphics (images)","score_opus":0.006289727804461909,"score_gpt":0.20534325222122524,"score_spread":0.19905352441676333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103264504","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.27391204,0.000084314386,0.72204405,0.000774117,0.000026725029,0.000055623575,5.162784e-7,0.00003108825,0.003071507],"genre_scores_gemma":[0.75583434,0.000007513461,0.24340364,0.0002859318,0.000014237723,0.0000014003087,0.0000015196999,0.0000012483378,0.00045016553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962497,0.000008202851,0.00007383352,0.000114770424,0.00011929022,0.00005892391],"domain_scores_gemma":[0.9998085,0.000021306329,0.000027352333,0.00007745765,0.000035262587,0.000030101435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006323285,0.0000417106,0.00005054504,0.000068641304,0.000037982118,0.000030904263,0.000093016664,0.000010929005,0.000008606233],"category_scores_gemma":[0.0000023229911,0.00003121732,0.000008482476,0.0001901124,0.000015138124,0.0002646039,0.000023964587,0.000018004583,0.0000037288971],"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.00002186855,0.00013246328,0.006989917,0.000028791437,0.000053875025,0.000004095363,0.0013299665,0.004436534,0.0054785493,0.542842,0.0030152171,0.43566674],"study_design_scores_gemma":[0.0065358453,0.002235738,0.2529508,0.00020296086,0.00006747664,0.0003386374,0.00026758478,0.2903054,0.26286373,0.060000293,0.12249407,0.0017374848],"about_ca_topic_score_codex":0.000008695111,"about_ca_topic_score_gemma":0.000013452513,"teacher_disagreement_score":0.4828417,"about_ca_system_score_codex":0.0000036409792,"about_ca_system_score_gemma":0.000016966993,"threshold_uncertainty_score":0.12730055},"labels":[],"label_agreement":null},{"id":"W3104186416","doi":"","title":"Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets","year":2009,"lang":"en","type":"article","venue":"Project Euclid (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Hausdorff Research Institute for Mathematics; Natural Sciences and Engineering Research Council of Canada; Hausdorff Center for Mathematics","keywords":"Mathematics; Polytope; Convex polytope; Combinatorics; Regular polygon; Enhanced Data Rates for GSM Evolution; Graph; Geometry; Convex analysis; Convex optimization; Artificial intelligence; Computer science","score_opus":0.03593175669238988,"score_gpt":0.2157880548931448,"score_spread":0.1798562982007549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104186416","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.054992285,0.000051573483,0.9390543,0.00031841753,0.00017069842,0.0004775841,0.00000829093,0.000171706,0.0047551603],"genre_scores_gemma":[0.95959365,0.000031678308,0.036368262,0.0006397671,0.00009093848,0.0000023414073,0.000020006204,0.000007875852,0.0032454715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893516,0.000049797436,0.00011510987,0.000488205,0.00013036348,0.00028138226],"domain_scores_gemma":[0.99927056,0.00008998603,0.0000894192,0.0002925552,0.00017553144,0.00008195563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014026395,0.00016550419,0.00016917539,0.00042537012,0.00022334435,0.00015504539,0.0004952635,0.00005989554,0.00000935672],"category_scores_gemma":[0.000017476852,0.0001562912,0.00009432127,0.0012009986,0.00004551055,0.0006493711,0.00006479742,0.000087821245,0.000013858902],"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.0013141498,0.0016209834,0.0054679452,0.00020340111,0.00049837976,0.0002918452,0.0049060155,0.030929819,0.0079184715,0.7393115,0.026268538,0.1812689],"study_design_scores_gemma":[0.016983107,0.011703569,0.04390567,0.00026487172,0.00044218177,0.00025982433,0.0011312254,0.41754958,0.04695713,0.090565875,0.3652698,0.0049671456],"about_ca_topic_score_codex":0.000018616403,"about_ca_topic_score_gemma":0.000018327068,"teacher_disagreement_score":0.9046014,"about_ca_system_score_codex":0.00005525056,"about_ca_system_score_gemma":0.00017295037,"threshold_uncertainty_score":0.63733697},"labels":[],"label_agreement":null},{"id":"W3104976496","doi":"","title":"Geometric Spanning Cycles in Bichromatic Point Sets","year":2016,"lang":"en","type":"article","venue":"","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 Toronto; University of Waterloo","funders":"","keywords":"Plane (geometry); Spanning tree; Point (geometry); Colored; Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Set (abstract data type); Geometry; Computer science; Computer vision; Materials science","score_opus":0.01859569722976932,"score_gpt":0.2575038012777347,"score_spread":0.2389081040479654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104976496","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.25035605,0.00006026234,0.7456618,0.0016776661,0.00014348103,0.000055744025,2.6848093e-7,0.00007265205,0.0019720865],"genre_scores_gemma":[0.94387853,0.0000070210513,0.055345647,0.00022226234,0.000027851263,0.0000060081134,7.1812497e-7,0.0000026601801,0.0005093278],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99922454,0.000035366807,0.00018605414,0.00020873349,0.00018653648,0.00015878114],"domain_scores_gemma":[0.999479,0.00021501478,0.0000397561,0.00018408411,0.000034881126,0.000047268346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003099017,0.00006691275,0.00008448921,0.00056954357,0.00003640147,0.000053818567,0.00022106005,0.000024242498,0.00007190471],"category_scores_gemma":[0.00011812359,0.000043924632,0.000025980326,0.0012431195,0.000010186115,0.0004839184,0.00010388923,0.000027745853,0.00018615251],"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.000002954944,0.000106004816,0.0065937457,0.000016290596,0.000011225727,0.00002599537,0.00030702865,0.0023571989,0.007224633,0.08367583,0.002457729,0.8972214],"study_design_scores_gemma":[0.0020815786,0.00020922716,0.62199086,0.00020466327,0.000005288898,0.00009802379,0.000052220275,0.24526751,0.029671066,0.096606895,0.003087976,0.00072472426],"about_ca_topic_score_codex":0.0000136158,"about_ca_topic_score_gemma":0.000009268231,"teacher_disagreement_score":0.89649665,"about_ca_system_score_codex":0.00004446545,"about_ca_system_score_gemma":0.000038529597,"threshold_uncertainty_score":0.23926759},"labels":[],"label_agreement":null},{"id":"W3105922857","doi":"10.20382/jocg.v5i1a10","title":"Steinitz theorems for simple orthogonal polyhedra","year":2013,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; National Science Foundation","keywords":"Polyhedron; Combinatorics; Polyhedral graph; Vertex (graph theory); Mathematics; Bipartite graph; Dual polyhedron; Regular polygon; Graph; 1-planar graph; Line graph; Geometry","score_opus":0.010062048692386947,"score_gpt":0.2102579755694352,"score_spread":0.20019592687704826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105922857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16696058,0.0000857313,0.8301477,0.0010352018,0.00045441606,0.00021077163,0.000011768811,0.00003557342,0.0010582722],"genre_scores_gemma":[0.869669,0.000010618345,0.12876448,0.00042954224,0.00034131616,0.0000010600402,0.000030231915,0.0000112761445,0.00074245967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982504,0.00010884591,0.00047506194,0.00025747257,0.0006345611,0.000273617],"domain_scores_gemma":[0.99659735,0.0008024123,0.0005385073,0.0001726206,0.0016581344,0.00023097348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004316432,0.00018278892,0.00028752256,0.00133733,0.00024541238,0.00020659402,0.0008274965,0.00008602114,0.00013528479],"category_scores_gemma":[0.000122037236,0.00018301597,0.00029739286,0.0015602146,0.00006134825,0.001659138,0.00013934959,0.00018811673,0.000034113167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001034437,0.00027508877,0.00093591877,0.000035451947,0.00026129358,0.00004661219,0.00020748824,0.3678334,0.0008934316,0.5402594,0.009326005,0.07982241],"study_design_scores_gemma":[0.0056646694,0.0017035599,0.034899797,0.00006896485,0.00011388153,0.00052311417,0.00040515367,0.3093488,0.0012870979,0.50430125,0.14071734,0.00096638344],"about_ca_topic_score_codex":0.0000065458426,"about_ca_topic_score_gemma":0.0000011047903,"teacher_disagreement_score":0.7027084,"about_ca_system_score_codex":0.00012816206,"about_ca_system_score_gemma":0.0004106703,"threshold_uncertainty_score":0.7463175},"labels":[],"label_agreement":null},{"id":"W3106756511","doi":"10.1007/978-3-030-61792-9_19","title":"An $$\\varOmega (n^3)$$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Shortest path problem; Upper and lower bounds; Combinatorics; Generalization; Sharpening; Path (computing); Mathematics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.015562966957420864,"score_gpt":0.2614847325972661,"score_spread":0.24592176563984525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106756511","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.034825083,0.000086069194,0.9611379,0.0011982754,0.0014708473,0.00056734623,0.000028253096,0.00005198619,0.0006342755],"genre_scores_gemma":[0.8125169,0.00000237227,0.18433516,0.0026007625,0.00039095114,0.000011792743,0.000026084237,0.000024005187,0.000091941525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966945,0.000055215078,0.00058722176,0.0012478179,0.0009789485,0.0004362904],"domain_scores_gemma":[0.9975348,0.0009351185,0.00031143212,0.0007786223,0.00029784406,0.00014219909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062751764,0.00044537324,0.00044349622,0.00043056096,0.00030965332,0.0005295049,0.0019598117,0.00023742895,0.0000362802],"category_scores_gemma":[0.00007023578,0.00033955192,0.00014543829,0.0007736362,0.0005251357,0.00047432852,0.00039261035,0.000564834,0.000009543441],"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.00024287196,0.00047650596,0.00038158143,0.00013442576,0.000040163748,0.00013813571,0.0031975897,0.36157855,0.015967513,0.38667488,0.00034507792,0.2308227],"study_design_scores_gemma":[0.00036672314,0.0003609841,0.0007121571,0.000115333314,0.000006032322,0.000018680548,2.7491424e-7,0.6427134,0.009304822,0.34561437,0.00035538434,0.00043180012],"about_ca_topic_score_codex":0.000017894774,"about_ca_topic_score_gemma":0.000030490282,"teacher_disagreement_score":0.77769184,"about_ca_system_score_codex":0.00014426213,"about_ca_system_score_gemma":0.0007371891,"threshold_uncertainty_score":0.99990565},"labels":[],"label_agreement":null},{"id":"W3108948946","doi":"10.19086/aic.25431","title":"Box and Segment Intersection Graphs with Large Girth and Chromatic Number","year":2021,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Intersection (aeronautics); Chromatic scale; Girth (graph theory); Chordal graph; Graph; Intersection graph","score_opus":0.00441842215705467,"score_gpt":0.23855275600269135,"score_spread":0.23413433384563667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108948946","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.56640816,0.0030792651,0.42859823,0.00020704485,0.00048995746,0.00009868086,0.0000010134327,0.000041659998,0.0010759882],"genre_scores_gemma":[0.98493254,0.0006857991,0.014169311,0.000107876076,0.000010427831,0.000010352258,0.000004296203,0.0000034761933,0.00007594609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934804,0.000038820042,0.000113391325,0.00023725415,0.00014639576,0.00011606475],"domain_scores_gemma":[0.99966097,0.00007404251,0.00004310188,0.00011637234,0.00006532329,0.000040172166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011717449,0.00007766802,0.000092814145,0.00005788667,0.00007755142,0.00007116861,0.00006668699,0.000022483164,0.0000036400318],"category_scores_gemma":[0.000015475049,0.00007269577,0.000009254812,0.0005664094,0.000019231153,0.00061798404,0.00009628301,0.00007294131,0.0000015690287],"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.000009226201,0.0002398932,0.049913455,0.00011621095,0.000014962952,0.00006225491,0.0009949391,0.00081534043,0.00012121512,0.9052069,0.00005710177,0.042448454],"study_design_scores_gemma":[0.0042076474,0.0005295666,0.052780185,0.00026506037,0.000021498157,0.0006020054,0.000594893,0.07234089,0.0061910483,0.8375186,0.024206566,0.0007420701],"about_ca_topic_score_codex":0.000001978335,"about_ca_topic_score_gemma":0.000038337104,"teacher_disagreement_score":0.41852435,"about_ca_system_score_codex":0.0000340353,"about_ca_system_score_gemma":0.00003061422,"threshold_uncertainty_score":0.29644477},"labels":[],"label_agreement":null},{"id":"W3110015222","doi":"10.1145/3414685.3417810","title":"DHFSlicer","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Slab; Wafer; Embedding; Block (permutation group theory); Fabrication; Process (computing); Surface (topology); Computer science; Decomposition; Materials science; Geometry; Mechanical engineering; Engineering drawing; Mathematics; Engineering; Structural engineering; Optoelectronics; Artificial intelligence; Chemistry","score_opus":0.03950997828536335,"score_gpt":0.2540276153097634,"score_spread":0.21451763702440008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110015222","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.002562865,0.000032601933,0.97637,0.020178393,0.00022795635,0.00006915688,0.000003542492,0.00018948677,0.0003659949],"genre_scores_gemma":[0.9417477,0.000041511666,0.048456322,0.009597798,0.00006843548,0.000012114181,0.0000034555997,0.0000059361487,0.00006667925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992969,0.00002909094,0.00011604105,0.00023955549,0.00020835023,0.00011005982],"domain_scores_gemma":[0.999395,0.00009354611,0.000024708295,0.00031826418,0.000060260605,0.000108190994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006276061,0.00008041411,0.00006637646,0.000109333814,0.00016577881,0.00006658213,0.00047822305,0.00004180703,0.000044395798],"category_scores_gemma":[0.000022695243,0.00008122948,0.00007629801,0.0010006151,0.000017286935,0.0002662959,0.000007715352,0.00015332359,0.00011026017],"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.00005168402,0.00044734523,0.00010238463,0.00004149591,0.00014420922,0.000022777042,0.0027008888,0.08821676,0.00328593,0.30437192,0.005849826,0.59476477],"study_design_scores_gemma":[0.001828476,0.0011653586,0.004700578,0.000027439772,0.000063039384,0.000043721826,0.00008350215,0.60691917,0.032486834,0.096049495,0.25552222,0.0011101735],"about_ca_topic_score_codex":0.0000024625099,"about_ca_topic_score_gemma":0.0000033565432,"teacher_disagreement_score":0.9391849,"about_ca_system_score_codex":0.000007270558,"about_ca_system_score_gemma":0.0000353362,"threshold_uncertainty_score":0.3312442},"labels":[],"label_agreement":null},{"id":"W3112211311","doi":"10.4230/lipics.esa.2025.75","title":"An Improved Bound for Plane Covering Paths","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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; University of Windsor","funders":"Agence Nationale de la Recherche","keywords":"Kernelization; Randomized algorithm; Algorithm; Set cover problem; Upper and lower bounds; Mathematics; Deterministic algorithm; Line (geometry); Cover (algebra); Computational geometry; Monte Carlo method; Combinatorics; Time complexity; Set (abstract data type); Parameterized complexity; Computer science; Geometry; Mathematical analysis","score_opus":0.02555340797288808,"score_gpt":0.28108164930107316,"score_spread":0.2555282413281851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112211311","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.031572796,0.000072363815,0.95908684,0.00055153074,0.0033259292,0.002564836,0.0019980618,0.0004023112,0.00042536578],"genre_scores_gemma":[0.6082856,0.000056556968,0.3740153,0.0030930545,0.001529155,0.0009435551,0.011779271,0.00010328831,0.00019422296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669105,0.00004424303,0.0013343161,0.00068891566,0.0005269076,0.0007145968],"domain_scores_gemma":[0.9969864,0.00022303134,0.0008043251,0.0011058653,0.0005106826,0.0003697353],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00065398373,0.00061911857,0.00067354576,0.00031257432,0.00045307036,0.0017021849,0.001996425,0.0004535316,0.000009722519],"category_scores_gemma":[0.00014613105,0.0006403066,0.000401028,0.00027194477,0.00005491667,0.0016831248,0.0011721886,0.0006532314,0.00003841857],"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.002327894,0.003500575,0.0014392106,0.027129982,0.003335149,0.000054339303,0.08577725,0.203707,0.0099488795,0.1958329,0.06411397,0.40283287],"study_design_scores_gemma":[0.0019507064,0.0005562308,0.00015108257,0.00013156515,0.00005137736,0.000023747802,0.00015482605,0.9294666,0.0019705617,0.010095464,0.05463354,0.0008143033],"about_ca_topic_score_codex":0.00001682588,"about_ca_topic_score_gemma":0.000015323281,"teacher_disagreement_score":0.7257596,"about_ca_system_score_codex":0.00019711778,"about_ca_system_score_gemma":0.00042478772,"threshold_uncertainty_score":0.9996048},"labels":[],"label_agreement":null},{"id":"W3116201698","doi":"10.1007/978-3-030-68211-8_19","title":"Upward Point Set Embeddings of Paths and Trees","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","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":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Monotone polygon; Vertex (graph theory); Path (computing); General position; Tree (set theory); Regular polygon; Point (geometry); Upper and lower bounds; Graph; Discrete mathematics; Computer science; Geometry","score_opus":0.01621143534357818,"score_gpt":0.26991946931503585,"score_spread":0.2537080339714577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116201698","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.21369655,0.0006068752,0.78344494,0.0007720436,0.0012489576,0.00016771158,0.0000040321333,0.00004927328,0.000009634606],"genre_scores_gemma":[0.6061254,0.00003219681,0.39340886,0.00030951368,0.000104765335,0.0000062559598,0.00000768594,0.0000046640776,6.3561725e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971375,0.00010727175,0.00046287835,0.0012339322,0.00070307596,0.0003553679],"domain_scores_gemma":[0.9980667,0.00037703212,0.00025151385,0.0008156498,0.00036824567,0.00012085146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009951143,0.0002885361,0.00042119573,0.00060943555,0.00012799019,0.00064319896,0.0014729482,0.00016973747,0.0000052096375],"category_scores_gemma":[0.00022674253,0.00027723325,0.000092275564,0.0016087912,0.00029474174,0.0005361752,0.003493907,0.0004615236,0.0000011333536],"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.000003377122,0.00005649955,0.0007905457,0.00009456353,0.000010452905,0.00002913755,0.0044392175,0.5510899,0.0025687688,0.00074915215,0.000010810516,0.44015756],"study_design_scores_gemma":[0.00017664321,0.00008041206,0.006292778,0.00023303044,0.0000050450826,0.000052343094,0.0000023538062,0.9405856,0.023966514,0.02828064,0.000017341497,0.00030726878],"about_ca_topic_score_codex":0.000059430844,"about_ca_topic_score_gemma":0.000057906454,"teacher_disagreement_score":0.4398503,"about_ca_system_score_codex":0.00009112666,"about_ca_system_score_gemma":0.00065430463,"threshold_uncertainty_score":0.999968},"labels":[],"label_agreement":null},{"id":"W3117498257","doi":"10.1145/3427796.3427800","title":"Communication Costs in a Geometric Communication Network","year":2020,"lang":"en","type":"article","venue":"","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":"Simon Fraser University","funders":"","keywords":"Geometric networks; Convex hull; Asynchronous communication; Telecommunications network; Graph; Euclidean space; Euclidean geometry; Spatial network; Random geometric graph","score_opus":0.027297313883440692,"score_gpt":0.2557918706910025,"score_spread":0.2284945568075618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117498257","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.01380574,0.0014310412,0.95811576,0.013964918,0.00005800328,0.0002154994,4.6113382e-7,0.00016954681,0.012239059],"genre_scores_gemma":[0.8750076,0.00015304777,0.1219989,0.0026946005,0.000036639292,0.000015847303,0.000028832068,0.0000035738005,0.0000609199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906474,0.00018155275,0.00023862043,0.000192993,0.00017830198,0.00014379687],"domain_scores_gemma":[0.99904436,0.0002456874,0.00007196714,0.00047943168,0.00008349729,0.00007508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039562644,0.00007458903,0.00009991436,0.00013981415,0.00011159334,0.00011671626,0.00084990874,0.000039390037,0.000031185507],"category_scores_gemma":[0.000108044565,0.00007798492,0.000027388878,0.0029364275,0.0000159158,0.00049793144,0.00034693204,0.00013883717,0.00009555089],"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.00001733086,0.0001496915,0.0054004933,0.000012884571,0.0000151462755,0.0000027712222,0.0011343926,0.13964179,0.0001681559,0.5753168,0.02518227,0.2529583],"study_design_scores_gemma":[0.00062746386,0.00007285425,0.03544342,0.000022891894,0.0000028805596,0.000004473575,0.000040768562,0.9338514,0.0003645686,0.008539176,0.020799281,0.00023081915],"about_ca_topic_score_codex":0.00004957075,"about_ca_topic_score_gemma":0.00005914813,"teacher_disagreement_score":0.8612019,"about_ca_system_score_codex":0.00005795318,"about_ca_system_score_gemma":0.000042857333,"threshold_uncertainty_score":0.31801328},"labels":[],"label_agreement":null},{"id":"W3119986790","doi":"10.1137/1.9781611976496.4","title":"Dispersion for Intervals: A Geometric Approach","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"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; University of Waterloo","keywords":"Mathematics; Interval (graph theory); Polygon (computer graphics); Dispersion (optics); Simple (philosophy); Shortest path problem; Real line; Point (geometry); Line (geometry); Path (computing); Combinatorics; Line segment; Algorithm; Geometry; Computer science; Graph","score_opus":0.08524411548924146,"score_gpt":0.25584287370638403,"score_spread":0.17059875821714257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119986790","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.000047962658,0.00024989297,0.9121074,0.00008372778,0.00032007252,0.00168619,0.00008917912,0.00007839522,0.085337155],"genre_scores_gemma":[0.0005643728,0.000047939815,0.73327154,0.00027360904,0.0015046588,0.00050180254,0.0004349516,0.00007589494,0.26332524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840444,0.000003402965,0.00046449614,0.0005828579,0.00029752444,0.0002473031],"domain_scores_gemma":[0.9986652,0.00044380297,0.00032161054,0.00030983216,0.00015464844,0.00010491553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052687246,0.00033668056,0.0005154433,0.000114294606,0.00029469928,0.00025953012,0.0003422714,0.0005526092,0.000005808594],"category_scores_gemma":[0.000039002367,0.00031376313,0.0006354104,0.00007259222,0.0000639308,0.000049970065,0.0002763244,0.00027350776,0.00000199522],"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.000009036248,0.000036609308,1.2483953e-8,0.00035585192,0.00017934403,1.2601521e-7,0.00048714463,0.00003398336,0.000106947555,0.89654714,0.008513282,0.093730524],"study_design_scores_gemma":[0.0037071845,0.000295061,9.713266e-8,0.00032958228,0.00043898646,0.000022303846,0.00037123836,0.05060139,0.0020114924,0.5408215,0.40021074,0.0011904425],"about_ca_topic_score_codex":3.407429e-7,"about_ca_topic_score_gemma":2.1053002e-7,"teacher_disagreement_score":0.39169747,"about_ca_system_score_codex":0.000062204665,"about_ca_system_score_gemma":0.00016142728,"threshold_uncertainty_score":0.99993145},"labels":[],"label_agreement":null},{"id":"W3120679526","doi":"10.22215/etd/2009-09116","title":"Projection - product and asymptotic constructions of mixed level covering arrays","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Projection (relational algebra); Product (mathematics); Computer science; Mathematics; Art; Combinatorics; Information retrieval; Algorithm; Geometry","score_opus":0.02185959985700674,"score_gpt":0.2548291399090392,"score_spread":0.23296954005203246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120679526","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.28262153,0.0004871912,0.7018887,0.00016287212,0.002804246,0.0006962847,0.000010706664,0.0001853222,0.011143192],"genre_scores_gemma":[0.86576134,0.000071126735,0.12719224,0.000024637808,0.00021094817,0.000024515288,0.00032331282,0.0000123808095,0.0063794665],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887764,0.000036252826,0.00030844015,0.0004042266,0.00025318324,0.00012026891],"domain_scores_gemma":[0.9992269,0.00004075903,0.00021550871,0.00021239683,0.0002631649,0.000041256157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014648157,0.00016267566,0.00020496082,0.0003295642,0.00012646342,0.00008941386,0.00015779238,0.000087577246,0.000007803257],"category_scores_gemma":[0.000061243765,0.00016463292,0.0000513646,0.0004854023,0.000019520374,0.00035362088,0.000021181304,0.00012313445,0.0000034771156],"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.000039516042,0.0001863373,0.0001849296,0.00043076725,0.00014422256,0.0000025848528,0.0010767641,0.004183875,0.037514184,0.12814228,0.0013595758,0.82673496],"study_design_scores_gemma":[0.0019647183,0.0009768864,0.25727236,0.0006950968,0.00030673153,0.0004473094,0.0008287011,0.11435196,0.57373255,0.04301363,0.004178079,0.0022319693],"about_ca_topic_score_codex":0.000040424453,"about_ca_topic_score_gemma":0.00013495515,"teacher_disagreement_score":0.824503,"about_ca_system_score_codex":0.000030252233,"about_ca_system_score_gemma":0.0002268796,"threshold_uncertainty_score":0.6713535},"labels":[],"label_agreement":null},{"id":"W3122288606","doi":"10.4224/16931693","title":"Geodesic Paths On 3D Surfaces: Survey and Open Problems","year":2009,"lang":"en","type":"preprint","venue":"NPARC","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodesic; Computer science; Economic geography; Geography; Mathematics; Geometry","score_opus":0.059259837940910824,"score_gpt":0.29140021328633436,"score_spread":0.23214037534542353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122288606","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.20298871,0.0005359969,0.7467482,0.0031675857,0.0018029994,0.0023558482,0.00009862521,0.00029857698,0.042003464],"genre_scores_gemma":[0.856999,0.00017246402,0.140261,0.0010288636,0.0001225763,0.000057972655,0.00023326807,0.000015190739,0.0011096995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981599,0.00029633427,0.00025638982,0.00074690836,0.0003318827,0.00020859038],"domain_scores_gemma":[0.998818,0.00019275863,0.00015643383,0.000581307,0.0001503099,0.000101189646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001292728,0.00021913178,0.00027334527,0.00012359845,0.00013100245,0.0009036207,0.0012644321,0.00014406157,0.000027019893],"category_scores_gemma":[0.000071631825,0.00020907883,0.000035229186,0.0002453961,0.000022506085,0.00023887734,0.0014978453,0.00031102324,0.000033789347],"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.000046008015,0.00042684964,0.0013108586,0.0001768847,0.000083741754,0.000023191005,0.0010430185,0.2964116,0.0013707413,0.047808927,0.01909479,0.6322034],"study_design_scores_gemma":[0.0006515034,0.0003788954,0.089007266,0.00024622265,0.000011235058,0.000012713443,0.0000032518938,0.58890295,0.0005896847,0.31202224,0.0073393704,0.00083466014],"about_ca_topic_score_codex":0.000081917075,"about_ca_topic_score_gemma":0.00007883703,"teacher_disagreement_score":0.65401024,"about_ca_system_score_codex":0.000045674213,"about_ca_system_score_gemma":0.00024424822,"threshold_uncertainty_score":0.8713635},"labels":[],"label_agreement":null},{"id":"W3125391957","doi":"10.1007/s00454-008-9114-6","title":"Minimizing the Stabbing Number of Matchings, Trees, and Triangulations","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Spanning tree; Linear programming relaxation; Iterated function; Rounding; Conjecture; Minimum spanning tree; Upper and lower bounds; Relaxation (psychology); Integer programming","score_opus":0.020425895085397095,"score_gpt":0.2681112469458681,"score_spread":0.24768535186047097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125391957","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.4301428,0.00026610048,0.56773686,0.000767227,0.00014890126,0.00012441103,0.000012912459,0.000049361195,0.000751467],"genre_scores_gemma":[0.9045215,0.00002008493,0.09485216,0.00023814029,0.000093216746,0.0000099045155,0.00005980232,0.000009066538,0.00019609356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984052,0.00011081733,0.0004206171,0.00032866397,0.0005375514,0.00019711167],"domain_scores_gemma":[0.998544,0.00072088547,0.00020755829,0.00024080688,0.000205674,0.0000811262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037500277,0.00015674028,0.00019805002,0.00022101047,0.0005021174,0.00008397112,0.00036479614,0.000048048216,0.000037530343],"category_scores_gemma":[0.000104318926,0.00012787133,0.00009363021,0.0011105041,0.00013366969,0.0005040295,0.00019696646,0.00013321398,0.000016253853],"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.000042844178,0.0001705474,0.028379567,0.00005011103,0.00018128548,0.000021670889,0.0047654645,0.39968833,0.0005058844,0.5298302,0.0018775602,0.03448651],"study_design_scores_gemma":[0.0010736143,0.000061629304,0.40387794,0.00003983704,0.000025943164,0.00041244744,0.0002076969,0.5418955,0.00027973024,0.0495573,0.0021800047,0.00038836765],"about_ca_topic_score_codex":0.00003081486,"about_ca_topic_score_gemma":0.000002806171,"teacher_disagreement_score":0.48027292,"about_ca_system_score_codex":0.000024724712,"about_ca_system_score_gemma":0.00012671416,"threshold_uncertainty_score":0.52144414},"labels":[],"label_agreement":null},{"id":"W3134867961","doi":"10.48550/arxiv.1907.01617","title":"A Short Proof of the Toughness of Delaunay Triangulations","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","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 Windsor","funders":"","keywords":"Delaunay triangulation; Constrained Delaunay triangulation; Combinatorics; Pitteway triangulation; Mathematics; Chew's second algorithm; Bowyer–Watson algorithm; Vertex (graph theory); Conjecture; Ruppert's algorithm; Graph","score_opus":0.043343146043913976,"score_gpt":0.17733728309832192,"score_spread":0.13399413705440794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134867961","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.6201131,0.0000075760154,0.3785787,0.00003609713,0.00012574486,0.00011568194,0.0000015084543,0.000008515985,0.0010131221],"genre_scores_gemma":[0.9981212,0.000001032396,0.00064964744,0.000015613254,0.000010437049,1.7090349e-7,0.0000014236997,0.0000018517543,0.0011986208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954325,0.00004703177,0.00010527678,0.00016918144,0.000066226174,0.000069006215],"domain_scores_gemma":[0.9993638,0.000066053835,0.00007356673,0.0003430875,0.00013159977,0.000021884389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011067861,0.000048843795,0.00008487624,0.00007937187,0.00004080973,0.000006694173,0.0004244559,0.000028152432,0.0000155772],"category_scores_gemma":[0.00001578094,0.000042104657,0.0000740294,0.00092092325,0.000029390452,0.00022571336,0.000125824,0.000039415358,0.0000047780445],"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.00001161611,0.000068616704,0.013803315,0.000015441341,0.000020313915,0.0000012030623,0.00014915336,0.5138065,0.0016521728,0.46819213,0.000042607277,0.0022369067],"study_design_scores_gemma":[0.00055423845,0.00007972705,0.08372508,0.000027992026,0.000026495769,0.0000032561602,0.000050629358,0.86589676,0.03095219,0.018055826,0.00048445616,0.00014333928],"about_ca_topic_score_codex":0.000007807479,"about_ca_topic_score_gemma":0.0000069764865,"teacher_disagreement_score":0.4501363,"about_ca_system_score_codex":0.000018247361,"about_ca_system_score_gemma":0.00006796211,"threshold_uncertainty_score":0.17169781},"labels":[],"label_agreement":null},{"id":"W3136071702","doi":"10.5555/2722129.2722235","title":"Compatible connectivity-augmentation of planar disconnected graphs","year":2015,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Planar graph; Vertex (graph theory); Upper and lower bounds; Planar; Morphing; Mathematics; Graph; Vertex connectivity; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.027862759519157045,"score_gpt":0.2748712602260167,"score_spread":0.24700850070685967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136071702","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.15140104,0.00013503943,0.83916134,0.002371482,0.0011830931,0.00042439558,0.00004609878,0.00019509447,0.00508242],"genre_scores_gemma":[0.9708434,0.000011475335,0.028531434,0.00019608106,0.00008713598,0.000025693727,0.00013326398,0.000011295739,0.00016022674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983788,0.00015537941,0.00031688588,0.00039776345,0.00053898414,0.00021220294],"domain_scores_gemma":[0.99890643,0.0001629997,0.00018400734,0.00037720118,0.00020591654,0.00016344718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035493152,0.00017393095,0.0002243096,0.0002753568,0.00009549984,0.00008759481,0.0003520888,0.000054297176,0.0000072066164],"category_scores_gemma":[0.000042823045,0.00015950589,0.00007978856,0.0007635683,0.000051171755,0.00055616227,0.000068487665,0.00009737377,0.000032524036],"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.00024427078,0.00073988456,0.0016285006,0.00006960247,0.00020953313,0.000029747145,0.0045640273,0.061387923,0.033811133,0.8684001,0.006413425,0.022501845],"study_design_scores_gemma":[0.005659013,0.0029894374,0.009303186,0.000121410514,0.000057674177,0.000049752467,0.0005210505,0.70980597,0.13413824,0.13406992,0.002218979,0.0010653761],"about_ca_topic_score_codex":0.00007839514,"about_ca_topic_score_gemma":0.000013566258,"teacher_disagreement_score":0.81944233,"about_ca_system_score_codex":0.00005693474,"about_ca_system_score_gemma":0.00010898672,"threshold_uncertainty_score":0.6504461},"labels":[],"label_agreement":null},{"id":"W3138825026","doi":"10.1007/s10998-022-00503-4","title":"Covering families of triangles","year":2023,"lang":"en","type":"article","venue":"Periodica Mathematica Hungarica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Bayreuth; Agence Nationale de la Recherche; Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Combinatorics; Conjecture; Boundary (topology); Regular polygon; Cover (algebra); Mathematics; Bounded function; Algorithm; Geometry; Mathematical analysis","score_opus":0.02237309324742063,"score_gpt":0.25683947868546625,"score_spread":0.23446638543804563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138825026","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.16889314,0.00015487206,0.81120497,0.0019248164,0.00034725197,0.00030193257,0.000008706344,0.0006697249,0.016494583],"genre_scores_gemma":[0.932207,0.00005183087,0.06671155,0.00007260255,0.000055028497,0.000030822226,0.000008718499,0.000009207003,0.00085326424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890673,0.00003905955,0.00030934502,0.00021557763,0.0003454805,0.00018381499],"domain_scores_gemma":[0.99912316,0.000293991,0.00010746192,0.0003472157,0.00007086214,0.0000573121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034351027,0.0001003353,0.00020614866,0.00026823158,0.00013588337,0.00009384765,0.0004444682,0.000037677466,0.000048636182],"category_scores_gemma":[0.00024765544,0.000091315116,0.0000834612,0.0011212094,0.000055049528,0.00020846554,0.00020400523,0.00005891592,0.00023678078],"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.000022537475,0.00037700264,0.00030430764,0.0006541938,0.00014490228,0.00003345581,0.01805828,0.004394535,0.034264144,0.7909295,0.01669331,0.13412385],"study_design_scores_gemma":[0.0012181393,0.00032656238,0.011555827,0.00018076217,0.000045258268,0.000054303895,0.0007828178,0.7741121,0.02893974,0.12507974,0.05692739,0.00077734323],"about_ca_topic_score_codex":0.0000031256957,"about_ca_topic_score_gemma":7.9385643e-7,"teacher_disagreement_score":0.7697176,"about_ca_system_score_codex":0.000014078833,"about_ca_system_score_gemma":0.00007120506,"threshold_uncertainty_score":0.37237224},"labels":[],"label_agreement":null},{"id":"W3147681132","doi":"10.1007/s00454-002-2840-2","title":"On Levels in Arrangements of Curves","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":40,"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":"Mathematics; Combinatorics; Mathematical proof; Upper and lower bounds; Pairwise comparison; Degree (music); Simple (philosophy); Planar; Polynomial; Planar graph; Discrete mathematics; Geometry; Graph; Mathematical analysis; Computer science","score_opus":0.022735473511496646,"score_gpt":0.28101257274923647,"score_spread":0.25827709923773984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147681132","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.19102786,0.00058302534,0.8013251,0.00038492228,0.00035871603,0.00023698807,0.000020948904,0.00004397819,0.0060184672],"genre_scores_gemma":[0.96881217,0.00001327897,0.030132765,0.00081606593,0.000018453302,0.000014067088,0.000046923964,0.000007673546,0.000138579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982042,0.00014236421,0.00042172454,0.00037324292,0.000642182,0.00021632806],"domain_scores_gemma":[0.9989725,0.00040503943,0.00015076304,0.00023915271,0.00016247337,0.000070124814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005048872,0.00015571565,0.00021061301,0.0005880783,0.00006189374,0.000037240145,0.00035531865,0.00004335437,0.00010938665],"category_scores_gemma":[0.00024505792,0.00015826095,0.00008225509,0.0016603067,0.00003581518,0.00033170145,0.000058787424,0.00011972366,0.00004481109],"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.000009028916,0.00021977523,0.0025030433,0.00008217333,0.000030673848,0.000007542821,0.00013258822,0.37356415,0.00015691861,0.61694556,0.000946097,0.0054024267],"study_design_scores_gemma":[0.0028718072,0.0004889582,0.40533063,0.00061907584,0.00001693346,0.000029708724,0.000056437202,0.1678294,0.0039160973,0.41569027,0.0022844833,0.00086621847],"about_ca_topic_score_codex":0.000005430294,"about_ca_topic_score_gemma":0.0000018705075,"teacher_disagreement_score":0.77778435,"about_ca_system_score_codex":0.00004669912,"about_ca_system_score_gemma":0.000120505974,"threshold_uncertainty_score":0.64536947},"labels":[],"label_agreement":null},{"id":"W3155566642","doi":"10.20382/jocg.v13i2a5","title":"Orientation preserving maps of the n × n grid","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Orientation (vector space); Grid; Computer science; Geometry; Mathematics","score_opus":0.00947932411795094,"score_gpt":0.196966089331903,"score_spread":0.18748676521395205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155566642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36304343,0.00015246132,0.6308811,0.0017567646,0.0023773068,0.00016380148,0.000042464122,0.000022212065,0.001560524],"genre_scores_gemma":[0.97867405,0.0000068330655,0.020155724,0.00019970429,0.00015170155,3.648412e-7,0.00001778195,0.000005926548,0.00078788126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796396,0.0002894092,0.0003912425,0.00016431857,0.0010607421,0.00013034545],"domain_scores_gemma":[0.99800855,0.0003031686,0.0007771219,0.00019482282,0.0006469541,0.0000693633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056111277,0.00009849508,0.00017519941,0.0009179539,0.0003951439,0.000041563042,0.0012236888,0.000026292919,0.00007949181],"category_scores_gemma":[0.0000783139,0.000092812836,0.00021007485,0.0030964275,0.000042922613,0.0006828466,0.0005977454,0.0002681938,0.0000015432767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042477564,0.000113953465,0.0015470404,0.000012607382,0.00006018955,0.000019479196,0.0002938518,0.9339084,0.0003120259,0.056737967,0.004200041,0.002751984],"study_design_scores_gemma":[0.007089334,0.0018921918,0.13434984,0.00012532911,0.0002401543,0.001401637,0.0026749272,0.26202625,0.0049097156,0.096961826,0.48731577,0.0010130308],"about_ca_topic_score_codex":0.000008167478,"about_ca_topic_score_gemma":0.0000010415026,"teacher_disagreement_score":0.67188215,"about_ca_system_score_codex":0.0002033949,"about_ca_system_score_gemma":0.00043578504,"threshold_uncertainty_score":0.37847975},"labels":[],"label_agreement":null},{"id":"W3156503367","doi":"10.1017/s089006042100007x","title":"A self-learning finite element extraction system based on reinforcement learning","year":2021,"lang":"en","type":"article","venue":"Artificial intelligence for engineering design analysis and manufacturing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Concordia University","funders":"","keywords":"Polygon mesh; Finite element method; Computer science; Mesh generation; Reinforcement learning; Boundary element method; Boundary (topology); Artificial neural network; Artificial intelligence; Algorithm; Engineering; Structural engineering; Mathematics; Computer graphics (images)","score_opus":0.02308148735674704,"score_gpt":0.2490084731598185,"score_spread":0.22592698580307147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156503367","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.0019224774,0.00004215167,0.9973671,0.000075782715,0.00016427411,0.00016706676,3.385318e-7,0.00022104214,0.000039768038],"genre_scores_gemma":[0.852032,0.000016467155,0.14772694,0.000025227386,0.000069581816,0.00004381997,0.000023631303,0.000008477766,0.000053833854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867785,0.00006508299,0.00036317323,0.00040745636,0.00024587841,0.00024054844],"domain_scores_gemma":[0.99902946,0.00051465747,0.00010890764,0.0001697833,0.00009487661,0.00008231824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006068753,0.0001631076,0.00019724337,0.0004314804,0.00028176288,0.00030702818,0.00011723992,0.000048155773,0.00001040971],"category_scores_gemma":[0.000100271034,0.0001728994,0.00014370715,0.0005120571,0.000004517047,0.00019364046,0.000040041643,0.00015291564,0.0000071178124],"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.000009770553,0.000023017066,0.0000059426634,0.00005176895,0.00013577216,0.0000065517424,0.00012805407,0.9614832,0.0010603638,0.0095946165,0.0000014171575,0.02749952],"study_design_scores_gemma":[0.000027789982,0.00009555898,0.000026121179,0.00002192158,0.000094639385,0.0000016581114,0.000061518374,0.75503707,0.24343406,0.00009692026,0.0009611006,0.00014161924],"about_ca_topic_score_codex":0.000006605986,"about_ca_topic_score_gemma":0.0000023483126,"teacher_disagreement_score":0.8501095,"about_ca_system_score_codex":0.00009866791,"about_ca_system_score_gemma":0.000035510566,"threshold_uncertainty_score":0.7050632},"labels":[],"label_agreement":null},{"id":"W3160106327","doi":"10.1002/nme.6747","title":"Automatic feature‐preserving size field for three‐dimensional mesh generation","year":2021,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"H2020 European Research Council; Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture; European Commission; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon mesh; Mesh generation; Octree; Volume mesh; Computation; Algorithm; Computer science; Surface (topology); Triangulation; Mathematics; Geometry; Finite element method; Engineering","score_opus":0.03567609470866725,"score_gpt":0.37740443178391103,"score_spread":0.3417283370752438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160106327","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.0024882357,0.00027567818,0.9841415,0.005839527,0.0070266346,0.00015396086,0.0000045175275,0.000051749994,0.000018139453],"genre_scores_gemma":[0.0173035,0.00000715902,0.9807146,0.00054355245,0.0011969397,0.000063429296,0.00001468548,0.000014763653,0.00014137466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986519,0.00007919799,0.0003979583,0.000282953,0.00035847878,0.00022947442],"domain_scores_gemma":[0.9966152,0.0024979413,0.00011498679,0.0001439409,0.000534632,0.000093355025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092016585,0.00014140575,0.0001939818,0.00018701897,0.000103302315,0.00028942424,0.0005013894,0.00008292621,0.0000425305],"category_scores_gemma":[0.003983299,0.00014430878,0.00017863444,0.00031871517,0.000004475216,0.00046893032,0.0001388909,0.00023035382,0.0000011605987],"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.000026746413,0.00009919431,0.000076713906,0.000043665044,0.00014384798,0.000029481174,0.00010388399,0.58973104,0.049726646,0.019565046,0.0045672944,0.33588648],"study_design_scores_gemma":[0.00052459864,0.000057060715,0.0003705309,0.00005379069,0.00000729249,0.00020771897,0.0000025356555,0.9636229,0.017201629,0.008306453,0.009488137,0.00015734407],"about_ca_topic_score_codex":0.0000019084687,"about_ca_topic_score_gemma":0.0000026044797,"teacher_disagreement_score":0.3738919,"about_ca_system_score_codex":0.00014327407,"about_ca_system_score_gemma":0.00012153721,"threshold_uncertainty_score":0.58847415},"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":"W3160796411","doi":"10.1007/s00373-023-02632-0","title":"Emanation Graph: A Plane Geometric Spanner with Steiner Points","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 Saskatchewan","funders":"","keywords":"Combinatorics; Spanner; Mathematics; Delaunay triangulation; Bounded function; Graph; Spatial network; Discrete mathematics; Computer science","score_opus":0.011711263359977644,"score_gpt":0.20990743026467532,"score_spread":0.19819616690469766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160796411","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.8485877,0.00040686235,0.14743884,0.0012202186,0.00071290584,0.00022191046,0.0000049862088,0.00045820515,0.0009483485],"genre_scores_gemma":[0.99786663,0.00014603267,0.0012521476,0.00013952222,0.000017812046,0.000017603597,0.00003892799,0.000007737145,0.00051361107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998939,0.00003103449,0.0001409576,0.0003075498,0.00037294795,0.00020855042],"domain_scores_gemma":[0.9994077,0.000089342764,0.00006315406,0.00020909573,0.00013703771,0.00009367123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002613678,0.00012182917,0.00011822492,0.0009800993,0.00018894143,0.00014622009,0.00020575293,0.000047132704,0.0000034619886],"category_scores_gemma":[0.000022099157,0.00010134974,0.00003195593,0.0056437594,0.000023957242,0.00031388318,0.00009154115,0.000085506006,0.00002397278],"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.000009279956,0.000078002646,0.004828973,0.000025624484,0.000034288794,0.00003350131,0.00018840929,0.00074296276,0.000047147547,0.9706227,0.0040964847,0.019292621],"study_design_scores_gemma":[0.0021489197,0.00079748605,0.20645139,0.000034744273,0.000031624306,0.00008126455,0.00008944095,0.044983678,0.0007279623,0.73455226,0.009428968,0.0006722845],"about_ca_topic_score_codex":0.000011823394,"about_ca_topic_score_gemma":0.000003939913,"teacher_disagreement_score":0.23607045,"about_ca_system_score_codex":0.000012160861,"about_ca_system_score_gemma":0.000027055987,"threshold_uncertainty_score":0.41329226},"labels":[],"label_agreement":null},{"id":"W3164099491","doi":"","title":"Covering Points with Pairs of Concentric Disks.","year":2020,"lang":"en","type":"article","venue":"Canadian Conference on 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":"Concentric; Computer science; Geometry; Mathematics","score_opus":0.03095064521175248,"score_gpt":0.224095522346871,"score_spread":0.19314487713511852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164099491","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.09848584,0.0000718142,0.8864763,0.009602983,0.00020243287,0.00025443957,0.000072264105,0.000084606654,0.004749348],"genre_scores_gemma":[0.9750733,0.0000044293497,0.021915393,0.0028087134,0.00007193019,0.000006806131,0.000070342045,0.000009747831,0.000039388786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984214,0.00005605529,0.000283865,0.00043714672,0.0005055448,0.00029599934],"domain_scores_gemma":[0.99848324,0.00019625528,0.00014154975,0.00018733084,0.00041925412,0.000572373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012595694,0.00017966154,0.00022149518,0.0003241365,0.00013183698,0.00012366993,0.0005182355,0.000055610166,0.00015457104],"category_scores_gemma":[0.000108649794,0.00017724787,0.000053465974,0.0016380434,0.00006938841,0.00030457322,0.0000546953,0.0001560406,0.00008674086],"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.000042291733,0.00005298532,0.0036924155,0.000053347532,0.00007345844,0.000063826235,0.0005960164,0.37280163,0.00009551946,0.589647,0.002000629,0.030880898],"study_design_scores_gemma":[0.0012365982,0.00070970866,0.03200374,0.000088472654,0.000014542473,0.000030424306,0.00010655529,0.94972736,0.000837874,0.009002457,0.00566707,0.0005751936],"about_ca_topic_score_codex":0.0005957886,"about_ca_topic_score_gemma":0.00042218665,"teacher_disagreement_score":0.8765874,"about_ca_system_score_codex":0.00010218377,"about_ca_system_score_gemma":0.0013633495,"threshold_uncertainty_score":0.72279584},"labels":[],"label_agreement":null},{"id":"W316429726","doi":"10.1007/978-3-540-24767-8_3","title":"On Local Transformations in Plane Geometric Graphs Embedded on Small Grids","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Computer science; Plane (geometry); Parallel computing; Computational science; Geometry; Mathematics","score_opus":0.015815487866797782,"score_gpt":0.23223586929794654,"score_spread":0.21642038143114875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W316429726","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.0012717466,0.0001460255,0.9917328,0.0006305162,0.001510009,0.0004838134,0.000012061142,0.00011983438,0.0040932335],"genre_scores_gemma":[0.8945533,0.00005323378,0.10233524,0.0025854139,0.00023055129,0.000021775108,0.000056973164,0.000028584127,0.00013492692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99631166,0.000044080436,0.0006458176,0.0012665914,0.0011304857,0.0006013773],"domain_scores_gemma":[0.99791145,0.0007607164,0.00018732609,0.00080003974,0.00016188665,0.00017858164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007576939,0.0005223299,0.0004541071,0.0046815444,0.0002400763,0.00035526554,0.0018419315,0.0003220041,0.000030674368],"category_scores_gemma":[0.00007796088,0.00049536716,0.00014455574,0.002979654,0.0002947231,0.0004488657,0.00021606729,0.00097684,0.000094635514],"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.000010026026,0.00006104444,0.0000035555388,0.000016281412,0.0000040572518,0.000041700445,0.00029796048,0.5741042,0.000010129969,0.14022169,0.000009511539,0.28521982],"study_design_scores_gemma":[0.00095979084,0.00084151106,0.00058157137,0.00052705925,0.0000062170634,0.000059906004,3.2019253e-7,0.39425623,0.0022911425,0.5993873,0.00027457188,0.00081438967],"about_ca_topic_score_codex":0.000026039314,"about_ca_topic_score_gemma":0.00016280745,"teacher_disagreement_score":0.8932816,"about_ca_system_score_codex":0.00064952206,"about_ca_system_score_gemma":0.0006863559,"threshold_uncertainty_score":0.9997498},"labels":[],"label_agreement":null},{"id":"W3164322801","doi":"","title":"External Exploration of a Convex Polygon.","year":2020,"lang":"en","type":"article","venue":"Canadian Conference on 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 British Columbia","funders":"","keywords":"Regular polygon; Polygon (computer graphics); Computer science; Mathematics; Geometry; Telecommunications","score_opus":0.07268516792617138,"score_gpt":0.2614421747228599,"score_spread":0.18875700679668853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164322801","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.020868339,0.00009033081,0.9637237,0.011029761,0.0003039897,0.00019145603,0.000044158336,0.00007066043,0.0036775752],"genre_scores_gemma":[0.9640964,0.00000668543,0.031232616,0.004344117,0.00015275813,0.000011153532,0.00006878954,0.000009201995,0.00007827391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983287,0.000073639574,0.00037498755,0.0004363769,0.0005176972,0.00026860257],"domain_scores_gemma":[0.9984241,0.00014955694,0.00015953522,0.0002014031,0.0004908541,0.0005745367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015884195,0.00017684967,0.00022136843,0.00053384673,0.00013624234,0.00014946132,0.0005879194,0.00007622068,0.0002285755],"category_scores_gemma":[0.00013842253,0.00019749087,0.000078109246,0.0012369052,0.000056142628,0.00072929484,0.000057912126,0.00016523561,0.00020717869],"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.000018444456,0.000038221122,0.00022414542,0.00002406304,0.00002583205,0.000020805202,0.000632855,0.12613566,0.00063032977,0.8283449,0.0017649345,0.042139847],"study_design_scores_gemma":[0.00068259035,0.00041697535,0.006993351,0.000051807838,0.000008328776,0.000014526496,0.000092101865,0.92377675,0.0017785429,0.06196745,0.0038072527,0.00041034498],"about_ca_topic_score_codex":0.00067734584,"about_ca_topic_score_gemma":0.0003146598,"teacher_disagreement_score":0.94322807,"about_ca_system_score_codex":0.00008137078,"about_ca_system_score_gemma":0.0012565206,"threshold_uncertainty_score":0.80534434},"labels":[],"label_agreement":null},{"id":"W3164360850","doi":"","title":"Minimum Ply Covering of Points with Convex Shapes.","year":2020,"lang":"en","type":"article","venue":"Canadian Conference on 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 Windsor","funders":"","keywords":"Regular polygon; Computer science; Combinatorics; Mathematics; Geometry","score_opus":0.032863458709418585,"score_gpt":0.22728231669365648,"score_spread":0.19441885798423789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164360850","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.10447772,0.000066294764,0.87269413,0.01299972,0.00020988449,0.0003052763,0.000093303664,0.00009866298,0.009055007],"genre_scores_gemma":[0.9650211,0.000002873625,0.029557211,0.0051717386,0.00008679102,0.000007761108,0.00006516593,0.000011949038,0.00007544229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998278,0.00005109363,0.00032197856,0.00049287773,0.00054459576,0.00031140982],"domain_scores_gemma":[0.9983643,0.00020858603,0.00015376089,0.00017001027,0.00049849314,0.0006048406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013967058,0.00020372069,0.00026242938,0.0004666894,0.00013416156,0.0001440654,0.0005968647,0.00007011564,0.00022862223],"category_scores_gemma":[0.000101555,0.00020707134,0.000058169764,0.0013102395,0.00007839673,0.00033127202,0.00006342639,0.00017619791,0.00013073803],"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.00006753697,0.000067947745,0.001214801,0.00007789113,0.000107860214,0.00008316995,0.0008345397,0.26902536,0.00032295982,0.6994723,0.0032950088,0.025430601],"study_design_scores_gemma":[0.0009997997,0.0006330269,0.016308408,0.00007663733,0.000011568784,0.000029648005,0.00008437623,0.96603996,0.0006077389,0.009545818,0.005183288,0.0004797474],"about_ca_topic_score_codex":0.00056393776,"about_ca_topic_score_gemma":0.0005107269,"teacher_disagreement_score":0.8605434,"about_ca_system_score_codex":0.000089716385,"about_ca_system_score_gemma":0.0016042558,"threshold_uncertainty_score":0.84441245},"labels":[],"label_agreement":null},{"id":"W3164604964","doi":"10.7155/jgaa.00608","title":"Finding a Maximum Clique in a Grounded 1-Bend String Graph","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","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 Saskatchewan","funders":"","keywords":"Combinatorics; String (physics); Block graph; Mathematics; Clique; Monotone polygon; Graph; Discrete mathematics; Chordal graph; Geometry; 1-planar graph","score_opus":0.018019579993603523,"score_gpt":0.2642648077463178,"score_spread":0.24624522775271426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164604964","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.056853373,0.00066349586,0.94125366,0.0007858829,0.00013054472,0.00016426803,0.0000055036135,0.000013618173,0.00012965144],"genre_scores_gemma":[0.93108237,0.00017602614,0.06827399,0.0001811743,0.00014400342,0.0000931897,0.0000052818673,0.0000060660027,0.00003787632],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902374,0.000057623,0.00035674372,0.0001656006,0.00026403557,0.00013226572],"domain_scores_gemma":[0.9993959,0.000090261194,0.00023440168,0.00012418961,0.00007970196,0.00007550915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005543549,0.000077510755,0.00013071041,0.0006003959,0.00032982609,0.00009685524,0.0003122565,0.000020908466,0.000008294549],"category_scores_gemma":[0.00000737679,0.00007871765,0.00007320015,0.0013300986,0.000019914287,0.0003086383,0.00012812874,0.00025536332,4.6913075e-7],"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.000020140627,0.00046402466,0.0012986811,0.000022873752,0.000062174615,0.000040902945,0.0009712297,0.030811321,0.0016607136,0.46974316,0.0004067728,0.49449798],"study_design_scores_gemma":[0.0021426762,0.0005375129,0.029017333,0.000036183526,0.000031012816,0.0012179029,0.0008491015,0.061046686,0.00050972967,0.86666715,0.0374663,0.0004784203],"about_ca_topic_score_codex":0.000014159069,"about_ca_topic_score_gemma":0.0000063273496,"teacher_disagreement_score":0.874229,"about_ca_system_score_codex":0.000043510652,"about_ca_system_score_gemma":0.00007597359,"threshold_uncertainty_score":0.32100126},"labels":[],"label_agreement":null},{"id":"W3167752317","doi":"10.48550/arxiv.1708.04203","title":"Optimal Algorithms for Separating a Polyhedron from Its Single-Part Mold","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mold; Polyhedron; Casting; Algorithm; Product (mathematics); Orientation (vector space); Object (grammar); Process (computing); Computer science; Engineering drawing; Mathematics; Materials science; Geometry; Composite material; Engineering; Artificial intelligence","score_opus":0.16478238384147184,"score_gpt":0.23585686722514285,"score_spread":0.071074483383671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167752317","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.1857825,0.0001549572,0.81115687,0.00013837252,0.0013866782,0.00035389222,0.000097159835,0.00014534938,0.00078421086],"genre_scores_gemma":[0.9399397,0.00002978844,0.055516705,0.00008084639,0.0006531816,0.000004369032,0.00020258444,0.000017267983,0.0035555975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812,0.000071605806,0.00021806521,0.0011512552,0.00011994292,0.00031912228],"domain_scores_gemma":[0.99807745,0.00018891589,0.00040440616,0.000906926,0.00027227774,0.00015003086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022495547,0.00029343623,0.00030402906,0.00019286362,0.00043708962,0.00041847673,0.0014768819,0.00025150768,0.000018666778],"category_scores_gemma":[0.00008192227,0.0003663478,0.00023066903,0.00018803502,0.000041295414,0.0006173935,0.0011877094,0.00028100953,0.00004771313],"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.000033650864,0.00011375082,0.00006967641,0.00003649159,0.0001135665,0.00006663438,0.00021428596,0.9643718,0.0005653705,0.028232863,0.00095864834,0.0052232356],"study_design_scores_gemma":[0.00047882722,0.0000862165,0.00015369507,0.0000779911,0.000051199993,0.0000027198564,0.000013392181,0.98048294,0.0028435367,0.012360152,0.0030383645,0.0004109398],"about_ca_topic_score_codex":0.00007113835,"about_ca_topic_score_gemma":0.000020153691,"teacher_disagreement_score":0.75564015,"about_ca_system_score_codex":0.00015162848,"about_ca_system_score_gemma":0.00024943362,"threshold_uncertainty_score":0.9998788},"labels":[],"label_agreement":null},{"id":"W3167920770","doi":"10.1093/imrn/rnab119","title":"Erratum: “Breaking the 3/2 barrier for unit distances in three dimensions”","year":2021,"lang":"en","type":"erratum","venue":"International Mathematics Research Notices","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 British Columbia","funders":"","keywords":"Ellipse; Mathematics; Intersection (aeronautics); Lemma (botany); Unit (ring theory); Statement (logic); Plane (geometry); Geometry; Pure mathematics; Mathematics education; Geography; Law; Cartography; Political science","score_opus":0.13075079016475596,"score_gpt":0.4087256387839309,"score_spread":0.277974848619175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167920770","genre_codex":"methods","genre_gemma":"other","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.0028427583,0.009308872,0.7777448,0.024563804,0.058019277,0.0029439696,0.00028326578,0.00019079827,0.12410245],"genre_scores_gemma":[0.15974061,0.0019314197,0.32007566,0.0013511374,0.012169362,0.0027416258,0.0023187895,0.00026973864,0.49940166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595344,0.00022164831,0.0006237277,0.0006305495,0.0020908478,0.00047977126],"domain_scores_gemma":[0.9937343,0.0035644604,0.00027925518,0.00069855794,0.0016333087,0.00009012962],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028605396,0.0002581598,0.00032198045,0.0006864434,0.00043039673,0.0013004817,0.0027091913,0.0002187717,0.000072606636],"category_scores_gemma":[0.0024420517,0.00019469475,0.00015949082,0.0009818287,0.00014962385,0.00052899774,0.00088079413,0.0010794498,0.000035570138],"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.000018742097,0.00036759334,0.0000500131,0.0004567359,0.00022789143,0.00006151715,0.0016736122,0.0042707142,0.00011231942,0.6744735,0.31215698,0.0061303303],"study_design_scores_gemma":[0.0002283502,0.0000456216,0.0002113267,0.00067741284,0.000010696769,0.00001096715,0.00025382743,0.46535048,0.0000697669,0.24347407,0.2894225,0.00024499607],"about_ca_topic_score_codex":0.00004715597,"about_ca_topic_score_gemma":0.0014498462,"teacher_disagreement_score":0.46107975,"about_ca_system_score_codex":0.00017824992,"about_ca_system_score_gemma":0.00082056696,"threshold_uncertainty_score":0.99973625},"labels":[],"label_agreement":null},{"id":"W3167941376","doi":"10.48550/arxiv.2106.01236","title":"Improved Spanning on Theta-5","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Upper and lower bounds; Spanner; Graph; Mathematics; Physics; Computer science; Mathematical analysis","score_opus":0.07955144741230323,"score_gpt":0.1888821289906709,"score_spread":0.10933068157836766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167941376","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.24465872,0.000053700405,0.750872,0.00014058963,0.00086314714,0.00012300992,0.0000030491506,0.00014238969,0.003143367],"genre_scores_gemma":[0.9927674,0.00003804618,0.003991589,0.00023548194,0.00013147945,7.3212925e-7,0.000039854604,0.000009200519,0.0027862363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985253,0.00011281068,0.00013663132,0.0009238968,0.00008904767,0.00021227369],"domain_scores_gemma":[0.99866384,0.00009521884,0.00015016453,0.00080766296,0.00017940962,0.00010367224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017960621,0.00021425472,0.00020526935,0.00022128105,0.00014961437,0.00023191413,0.00088273303,0.00016352156,0.000032158656],"category_scores_gemma":[0.00003549558,0.0002490622,0.00018484089,0.00055715756,0.000026252712,0.0002721543,0.0011319941,0.000406917,0.00004032884],"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.000011278764,0.000084043175,0.00009367255,0.000024338113,0.000064789696,0.000171988,0.00019653859,0.8575032,0.0003025897,0.13850111,0.00017109579,0.0028753602],"study_design_scores_gemma":[0.00024473306,0.00005266678,0.0007293498,0.000053908083,0.000024376877,0.0000042583197,0.00003883647,0.9830891,0.0011487739,0.013731028,0.0005682642,0.00031472466],"about_ca_topic_score_codex":0.000029412273,"about_ca_topic_score_gemma":0.000011362436,"teacher_disagreement_score":0.7481087,"about_ca_system_score_codex":0.00011880433,"about_ca_system_score_gemma":0.00023997245,"threshold_uncertainty_score":0.9999962},"labels":[],"label_agreement":null},{"id":"W3174457827","doi":"","title":"Simultaneous Visibility Representations of Undirected Pairs of Graphs.","year":2020,"lang":"en","type":"article","venue":"Canadian Conference on 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 Toronto; University of British Columbia","funders":"","keywords":"Visibility; Combinatorics; Vertex (graph theory); Visibility graph; Representation (politics); Mathematics; Undirected graph; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Computer science; Geometry; Artificial intelligence; Physics; Optics","score_opus":0.03468051167596801,"score_gpt":0.26695648007855466,"score_spread":0.23227596840258666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174457827","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.27527234,0.00009960861,0.71231014,0.0054735397,0.00034584262,0.00045685194,0.0002701782,0.00012229595,0.0056492044],"genre_scores_gemma":[0.9763187,0.000004707618,0.022653546,0.0008103269,0.000033979974,0.0000060913394,0.00012948227,0.000007716202,0.00003544852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981315,0.00011957377,0.0005204158,0.00048132605,0.000514017,0.00023314173],"domain_scores_gemma":[0.9973307,0.0007411218,0.00023614593,0.00030149744,0.00094370777,0.00044681178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019737284,0.0001638929,0.00027789923,0.0006214299,0.000111675516,0.000054268126,0.00057696074,0.000077593606,0.00017233072],"category_scores_gemma":[0.00070685527,0.00018341109,0.000110757486,0.0023515867,0.00011190799,0.00021181235,0.000060947423,0.00014859319,0.000029253912],"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.000025861547,0.00009645169,0.002102432,0.000061226696,0.000068023444,0.000018410869,0.00063110923,0.584691,0.000591177,0.38794878,0.0009066515,0.022858905],"study_design_scores_gemma":[0.00049532036,0.00033229106,0.02997217,0.000035096917,0.000013085423,0.0000066982807,0.00009337587,0.9264853,0.0016254502,0.040197574,0.00046361482,0.0002800223],"about_ca_topic_score_codex":0.0018360425,"about_ca_topic_score_gemma":0.0009780303,"teacher_disagreement_score":0.70104635,"about_ca_system_score_codex":0.00006705749,"about_ca_system_score_gemma":0.0012847375,"threshold_uncertainty_score":0.74792874},"labels":[],"label_agreement":null},{"id":"W3174843980","doi":"10.1007/s10878-006-8459-0","title":"Construction of the nearest neighbor embracing graph of a point set","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Hong Kong University of Science and Technology; National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Degree (music); Binary logarithm; Bounded function; Omega; Discrete mathematics; Physics","score_opus":0.005909669366623995,"score_gpt":0.21035003031206229,"score_spread":0.2044403609454383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174843980","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.07164978,0.00007365613,0.9235081,0.00036214368,0.0039107082,0.000096884934,0.0000020015761,0.0000075214953,0.00038918923],"genre_scores_gemma":[0.8986458,0.000008369621,0.10106977,0.000014433755,0.00024678037,5.418842e-7,0.0000026611476,0.000003849756,0.00000774633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987025,0.00011634126,0.0006037767,0.00008086213,0.00042272088,0.000073751275],"domain_scores_gemma":[0.9978867,0.00009423156,0.0010518343,0.00014723642,0.0007941878,0.000025796582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003964938,0.00007247589,0.00017453473,0.00019383115,0.00007399609,0.00004306921,0.00027904476,0.00005086514,0.000006667107],"category_scores_gemma":[0.00011332984,0.000056127687,0.000121331046,0.0007757318,0.000046864487,0.0005370079,0.000050387098,0.000094893054,1.879644e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002611825,0.00006490111,0.00038560727,0.000011369949,0.000012782408,5.476789e-7,0.00008108962,0.7937821,0.0015234305,0.20338114,0.0001622017,0.00056872226],"study_design_scores_gemma":[0.0035065955,0.00061060523,0.0070705363,0.00020120839,0.00008121121,0.00017974243,0.00007131445,0.62700313,0.083960325,0.27678517,0.0002916158,0.00023855505],"about_ca_topic_score_codex":0.000013677344,"about_ca_topic_score_gemma":4.9072014e-7,"teacher_disagreement_score":0.8269961,"about_ca_system_score_codex":0.000033397275,"about_ca_system_score_gemma":0.00017330195,"threshold_uncertainty_score":0.22888206},"labels":[],"label_agreement":null},{"id":"W3184390104","doi":"10.1145/3450626.3459840","title":"Bijective and coarse high-order tetrahedral meshes","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":39,"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 Victoria","funders":"National Science Foundation","keywords":"Bijection; Polygon mesh; Robustness (evolution); Tetrahedron; Boundary (topology); Algorithm; Computer science; Mathematics; Surface (topology); Geometry processing; Mesh generation; Geometry; Topology (electrical circuits); Finite element method; Combinatorics; Mathematical analysis","score_opus":0.015492858101561039,"score_gpt":0.24187293397292384,"score_spread":0.2263800758713628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184390104","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.035970498,0.00017118097,0.9593816,0.003787642,0.00041208847,0.00006974749,0.000010301474,0.000096559874,0.00010041814],"genre_scores_gemma":[0.89207816,0.00021380193,0.10644144,0.00096334476,0.000034465993,0.000014565503,0.000011654501,0.000006914524,0.00023566492],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909693,0.00006605799,0.00013458298,0.0003429347,0.00021639012,0.00014311097],"domain_scores_gemma":[0.9990479,0.00022586682,0.00002905129,0.00039778108,0.00022449963,0.000074902964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100913516,0.00011284949,0.000103544575,0.0002070123,0.0002897872,0.00011967586,0.00021069736,0.00006683629,0.000031441254],"category_scores_gemma":[0.000044170636,0.000115865754,0.0000546878,0.0013061854,0.00005104921,0.0003510002,0.0000139901385,0.00018046872,0.00001369787],"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.00003363555,0.00094491197,0.00025973568,0.000045767538,0.00030621456,0.000096316515,0.0017826748,0.036053345,0.004973907,0.40673253,0.000585814,0.54818517],"study_design_scores_gemma":[0.0030962345,0.0008763093,0.037256245,0.000075344724,0.00016661426,0.0004521552,0.00045023175,0.16061853,0.12293768,0.6502496,0.022331305,0.0014897578],"about_ca_topic_score_codex":0.000017422894,"about_ca_topic_score_gemma":0.00008875506,"teacher_disagreement_score":0.85610765,"about_ca_system_score_codex":0.000014261412,"about_ca_system_score_gemma":0.000100607744,"threshold_uncertainty_score":0.47248682},"labels":[],"label_agreement":null},{"id":"W3185758526","doi":"10.22215/etd/2021-14513","title":"Geometric Spanners For Compact Regions","year":2021,"lang":"en","type":"dissertation","venue":"","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":"Combinatorics; Mathematics; Disjoint sets; Shortest path problem; Graph; Discrete mathematics","score_opus":0.03022580416310857,"score_gpt":0.30067050406892754,"score_spread":0.270444699905819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185758526","genre_codex":"methods","genre_gemma":"other","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.0014518606,0.0018336552,0.975698,0.00070222944,0.0027249188,0.0003834575,0.000011435737,0.00016959604,0.017024856],"genre_scores_gemma":[0.13219711,0.0005319935,0.23830391,0.0014880421,0.001572204,0.00021534548,0.01777881,0.000094106486,0.6078185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986137,0.00003165271,0.00028009852,0.00051720574,0.0003223972,0.00023495851],"domain_scores_gemma":[0.9985943,0.00027019164,0.00015937154,0.00038871658,0.00048658368,0.000100835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001730905,0.00020531542,0.0002570902,0.0006959887,0.00019109009,0.0002730444,0.00049979275,0.00016375653,0.000060114777],"category_scores_gemma":[0.00016262155,0.0002068332,0.00022299433,0.0017445058,0.0000062481863,0.00025054117,0.000024724037,0.0001324795,0.000032221236],"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.000028640177,0.00023717106,0.00001810286,0.00027813157,0.00021126005,0.000014875608,0.00058244064,0.0076908004,0.0006931908,0.5164361,0.29858342,0.17522584],"study_design_scores_gemma":[0.0015004806,0.0003930501,0.00615895,0.00021576165,0.000154016,0.000051513583,0.0007775529,0.13022238,0.025755137,0.028912699,0.8039038,0.0019546498],"about_ca_topic_score_codex":0.000022082048,"about_ca_topic_score_gemma":0.00008985854,"teacher_disagreement_score":0.7373941,"about_ca_system_score_codex":0.000058382502,"about_ca_system_score_gemma":0.00039075263,"threshold_uncertainty_score":0.84344125},"labels":[],"label_agreement":null},{"id":"W3186431525","doi":"10.22215/etd/2021-14488","title":"Simple Linear Time Algorithms For Piercing Pairwise Intersecting Disks","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Pairwise comparison; Set (abstract data type); Simple (philosophy); Algorithm; Combinatorics; Mathematics; RADIUS; Point (geometry); Plane (geometry); Subroutine; Computer science; Geometry; Statistics","score_opus":0.02544497226469959,"score_gpt":0.3082693355813735,"score_spread":0.2828243633166739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186431525","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.014126771,0.00021362859,0.9800527,0.00009050005,0.0016551361,0.000371108,0.000012253551,0.0002122584,0.0032656284],"genre_scores_gemma":[0.12139209,0.000043476794,0.69846714,0.0006928492,0.0029122485,0.00032450503,0.015728366,0.000118623226,0.1603207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845135,0.000045122164,0.0003690556,0.0006065609,0.00027354102,0.00025438276],"domain_scores_gemma":[0.9987424,0.00028154653,0.0001756097,0.00030533603,0.0004124573,0.00008264678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031178948,0.00023272348,0.0002685578,0.0002026061,0.00025926938,0.00025750915,0.00040068242,0.00016623,0.00009960171],"category_scores_gemma":[0.00018658963,0.00023884766,0.00020620812,0.00044265724,0.000005250585,0.0003297189,0.00008212091,0.0001778494,0.00004244323],"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.000041567666,0.00017578476,0.000017141085,0.0003843568,0.00019420343,0.000021914067,0.0050431737,0.008591143,0.009089365,0.00785787,0.010233743,0.95834976],"study_design_scores_gemma":[0.0002985577,0.000090195754,0.00012627809,0.000088417015,0.000028228817,0.0000071847603,0.0005402618,0.9744325,0.013347381,0.0020791125,0.0085130455,0.00044881276],"about_ca_topic_score_codex":0.00002916008,"about_ca_topic_score_gemma":0.000088730856,"teacher_disagreement_score":0.96584135,"about_ca_system_score_codex":0.000063936626,"about_ca_system_score_gemma":0.00022800162,"threshold_uncertainty_score":0.97399247},"labels":[],"label_agreement":null},{"id":"W3189289076","doi":"10.28924/2291-8639-19-2021-633","title":"The Maximum Distance Problem and Minimum Spanning Trees","year":2021,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Minimum spanning tree; Spanning tree; Cover (algebra); Lemma (botany); Hausdorff distance; Combinatorics; Minimum distance; Hausdorff space; Lipschitz continuity; RADIUS; Measure (data warehouse); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.007706067556432191,"score_gpt":0.2633791899531915,"score_spread":0.25567312239675927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189289076","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.00929263,0.0017849832,0.98166096,0.0066963914,0.0000649167,0.000031167663,0.0000032940243,0.000005240953,0.00046042504],"genre_scores_gemma":[0.9605367,0.0009822003,0.0377476,0.00017264542,0.00020840383,0.00000924137,0.000008010381,0.0000022358213,0.0003329257],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992277,0.0000307346,0.0002780835,0.00013150873,0.0002694509,0.0000625036],"domain_scores_gemma":[0.9988543,0.00017693185,0.00021570045,0.000110655754,0.00058987463,0.000052575608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025440965,0.00005369468,0.00009776124,0.00013371382,0.00018226104,0.0003842746,0.00028812542,0.000015681731,0.0000039421284],"category_scores_gemma":[0.000026331658,0.000039390874,0.000079485966,0.00053856464,0.000037432612,0.00022268912,0.00009271889,0.000065986365,8.2676456e-7],"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.000011498768,0.00009804088,0.0048254603,0.000003576755,0.0012225008,0.000017435435,0.00030536656,0.005546639,0.0021508588,0.41121158,0.0004090722,0.57419795],"study_design_scores_gemma":[0.0010989858,0.000092676986,0.090321705,0.000050345046,0.0006669812,0.0006055627,0.00064400316,0.19162792,0.0034232733,0.2658471,0.44520563,0.00041584772],"about_ca_topic_score_codex":0.0000029786981,"about_ca_topic_score_gemma":0.000039477407,"teacher_disagreement_score":0.9512441,"about_ca_system_score_codex":0.000015252754,"about_ca_system_score_gemma":0.00005639693,"threshold_uncertainty_score":0.3705569},"labels":[],"label_agreement":null},{"id":"W3193009786","doi":"10.4230/lipics.itc.2021.18","title":"Differentially Private Approximations of a Convex Hull in Low Dimensions","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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 Alberta","funders":"","keywords":"Convex hull; Mathematics; Convex body; Combinatorics; Regular polygon; Minimum bounding box; Kernel (algebra); Bounding overwatch; Euclidean space; Ball (mathematics); Hull; Approximation algorithm; Discrete mathematics; Geometry; Image (mathematics); Computer science; Artificial intelligence","score_opus":0.01235288857539698,"score_gpt":0.24311820232689443,"score_spread":0.23076531375149745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193009786","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.36174387,0.000037625483,0.6362701,0.00027702865,0.0004024466,0.0004261758,0.00009528872,0.000055327855,0.00069214666],"genre_scores_gemma":[0.9045019,0.00002495776,0.094299585,0.00041978338,0.000047022342,0.00006868917,0.00044995616,0.000013059035,0.00017505433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979465,0.00005301918,0.0009979522,0.00023569188,0.0004030866,0.00036373505],"domain_scores_gemma":[0.99849015,0.00017228146,0.00032363486,0.00047135836,0.000430395,0.00011215592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030734614,0.00020931079,0.00034845853,0.00032261634,0.00015537588,0.0001786484,0.0005198662,0.00011526978,0.000025287347],"category_scores_gemma":[0.00014393954,0.00020662526,0.0001630895,0.0007804015,0.000053892552,0.00099966,0.00037926532,0.00020099967,0.00002905365],"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.00012612336,0.0035320844,0.008185934,0.0023619994,0.00041431026,0.000032720545,0.02532207,0.03130643,0.011796321,0.8778052,0.0023304021,0.036786444],"study_design_scores_gemma":[0.004186666,0.0001866867,0.01027671,0.0003695645,0.00003280955,0.00006763954,0.00043006608,0.9333027,0.028668929,0.011749941,0.0101125445,0.00061577087],"about_ca_topic_score_codex":0.0000044748112,"about_ca_topic_score_gemma":0.000023904258,"teacher_disagreement_score":0.90199625,"about_ca_system_score_codex":0.000059265163,"about_ca_system_score_gemma":0.00018881493,"threshold_uncertainty_score":0.8425934},"labels":[],"label_agreement":null},{"id":"W3193265284","doi":"10.1007/978-3-030-83508-8_16","title":"Improved Bounds on the Spanning Ratio of the Theta-5-Graph","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Combinatorics; Spanner; Upper and lower bounds; Graph; Mathematics; Pi; Physics; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.01947050066859001,"score_gpt":0.23687851008290012,"score_spread":0.2174080094143101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193265284","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.0005505302,0.0003733166,0.9904748,0.00343133,0.002109995,0.00033780537,0.0000031528493,0.000035587032,0.0026834423],"genre_scores_gemma":[0.9023873,0.000040530795,0.088082634,0.0058857924,0.0008254622,0.000021717064,0.00000820331,0.00003438686,0.0027139722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733657,0.000086583605,0.00043346648,0.0008576803,0.0009622993,0.00032338177],"domain_scores_gemma":[0.9969932,0.0008197391,0.00035540792,0.001421323,0.0003541199,0.000056253968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009851068,0.00032565065,0.0003065473,0.0003340977,0.0004774303,0.00047373713,0.00281779,0.00015028728,0.000022204162],"category_scores_gemma":[0.00017805365,0.00019316663,0.00021783555,0.001133214,0.0005280918,0.00024957486,0.0010113231,0.0006382308,0.0000049819255],"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.0000064573173,0.00004802544,0.000023863444,0.000025429632,0.000040582752,0.00001019157,0.0011672354,0.26471803,0.0041326964,0.4432316,0.00008728929,0.28650856],"study_design_scores_gemma":[0.00018634403,0.00014992384,0.00044415818,0.0003298176,0.000014930061,0.000035250454,6.2002687e-7,0.7832732,0.024312304,0.18930458,0.0015339686,0.00041487298],"about_ca_topic_score_codex":0.000009527206,"about_ca_topic_score_gemma":0.00003221705,"teacher_disagreement_score":0.9023922,"about_ca_system_score_codex":0.00010172077,"about_ca_system_score_gemma":0.00074122386,"threshold_uncertainty_score":0.78771067},"labels":[],"label_agreement":null},{"id":"W3194363479","doi":"10.1007/s00373-021-02394-7","title":"Bounding the Number of Non-duplicates of the q-Side in Simple Drawings of $$K_{p,q}$$","year":2021,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Integer (computer science); Simple (philosophy); Bipartite graph; Sigma; Crossing number (knot theory); Generating function; Discrete mathematics; Physics; Graph; Mathematical analysis","score_opus":0.007882593795185031,"score_gpt":0.24240336477951416,"score_spread":0.23452077098432914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194363479","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.9920752,0.00025278062,0.006638106,0.00029473743,0.00017835794,0.00005916159,0.0000014452166,0.0000037645525,0.0004964147],"genre_scores_gemma":[0.99935305,0.000046002413,0.0005101966,0.000044301025,0.0000038821768,0.0000031681186,0.0000011351675,0.0000021189944,0.00003614652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993698,0.000040642044,0.00021241372,0.0001190688,0.00017784252,0.00008023557],"domain_scores_gemma":[0.99932206,0.0001582696,0.00012455894,0.00023695196,0.00014226248,0.00001590976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023524663,0.00005354565,0.00011858909,0.00004327364,0.000068631896,0.00002134192,0.00025970052,0.000026310043,0.0000019455988],"category_scores_gemma":[0.000044080887,0.00003633074,0.000053809606,0.0011728052,0.000058469457,0.000082948354,0.00017271307,0.000063410254,1.7580679e-7],"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.0000019305128,0.000092300295,0.08426116,0.000044081928,0.000012223181,8.139857e-7,0.0008219577,0.00026291565,0.005577012,0.9054288,0.00009010649,0.0034066797],"study_design_scores_gemma":[0.00034656317,0.000027185743,0.24048047,0.00003691777,0.000009268581,0.0000104104565,0.00014196428,0.0099658985,0.06996659,0.6785215,0.00041443077,0.00007876908],"about_ca_topic_score_codex":0.000048025864,"about_ca_topic_score_gemma":0.000008819373,"teacher_disagreement_score":0.2269073,"about_ca_system_score_codex":0.0000063011735,"about_ca_system_score_gemma":0.000064278924,"threshold_uncertainty_score":0.14815246},"labels":[],"label_agreement":null},{"id":"W3194599097","doi":"10.4230/lipics.esa.2021.17","title":"Distant Representatives for Rectangles in the Plane","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Plane (geometry); Computer science; Combinatorics; Mathematics; Geometry","score_opus":0.09750730645219172,"score_gpt":0.2196034674778207,"score_spread":0.12209616102562898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194599097","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.23314746,0.00013433673,0.76499075,0.0003484379,0.00038401995,0.00029297397,0.000012287612,0.00003561848,0.00065413],"genre_scores_gemma":[0.9943016,0.00008093619,0.0049129827,0.0001147023,0.000074582524,0.0000044603016,0.00011097145,0.0000045309484,0.00039521235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877524,0.00020367024,0.00013584003,0.0006512045,0.00007730548,0.00015673536],"domain_scores_gemma":[0.9987704,0.00042716484,0.000110365174,0.00055910234,0.0000991525,0.00003378814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003274145,0.00013474582,0.00015376776,0.00013969289,0.00010751752,0.00017353325,0.0009008094,0.000085152285,0.000006341292],"category_scores_gemma":[0.00007199773,0.00012412223,0.00011159992,0.00056492497,0.000035571706,0.00021596452,0.00046012824,0.0002069438,0.0000028223653],"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.0000534926,0.00018559968,0.0009885397,0.00008878436,0.000062663596,0.00035549208,0.0034402008,0.5267665,0.00014979288,0.4646978,0.0009080904,0.0023030734],"study_design_scores_gemma":[0.0007230809,0.00008534485,0.006205931,0.00010335312,0.00003758732,0.000014259817,0.0014535598,0.80541813,0.00072931626,0.18263184,0.0021426994,0.0004549255],"about_ca_topic_score_codex":0.0000557194,"about_ca_topic_score_gemma":0.00015318078,"teacher_disagreement_score":0.7611542,"about_ca_system_score_codex":0.000071326416,"about_ca_system_score_gemma":0.00015561104,"threshold_uncertainty_score":0.5061558},"labels":[],"label_agreement":null},{"id":"W3194730801","doi":"10.4230/lipics.esa.2021.65","title":"The Visibility Center of a Simple Polygon","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":"Simple polygon; Visibility polygon; Visibility; Polygon (computer graphics); Geodesic; Center (category theory); Combinatorics; Star-shaped polygon; Polygon covering; Mathematics; Point (geometry); Set (abstract data type); Rectilinear polygon; Point in polygon; Polygon mesh; Geometry; Computer science; Regular polygon; Physics; Convex set; Optics","score_opus":0.017318214488164826,"score_gpt":0.27752543314692063,"score_spread":0.2602072186587558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194730801","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.25063908,0.00031621888,0.741455,0.0007343726,0.0030786346,0.001525886,0.0006806257,0.00014785193,0.0014223004],"genre_scores_gemma":[0.9595867,0.00013267521,0.03680834,0.00069986907,0.0002827337,0.00017044067,0.002065973,0.000033035634,0.0002202648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616253,0.00012516725,0.0017391123,0.0005069545,0.0008349908,0.00063126296],"domain_scores_gemma":[0.99557513,0.0004141614,0.0010222265,0.0018274975,0.0009856076,0.00017536576],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012327033,0.00047731085,0.00060471764,0.00023070484,0.00047403856,0.001057208,0.0021119174,0.00035103687,0.000018051462],"category_scores_gemma":[0.00025757804,0.00038144918,0.00058912864,0.0004459075,0.00013428365,0.0009358634,0.0027542245,0.00070806255,0.00001882318],"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.00096246233,0.0060779233,0.022624379,0.0138987005,0.004008061,0.000037883074,0.07667487,0.0678694,0.0011010258,0.16229221,0.052021354,0.5924317],"study_design_scores_gemma":[0.0039048034,0.0004328968,0.0065179123,0.0005875791,0.00011243813,0.000088216606,0.001472821,0.82825667,0.008652115,0.01932629,0.12906507,0.0015831925],"about_ca_topic_score_codex":0.00003219129,"about_ca_topic_score_gemma":0.000057370846,"teacher_disagreement_score":0.76038724,"about_ca_system_score_codex":0.0001668103,"about_ca_system_score_gemma":0.000454411,"threshold_uncertainty_score":0.9999798},"labels":[],"label_agreement":null},{"id":"W3196065071","doi":"10.1007/978-3-030-85165-1_15","title":"On the Pseudo-Periodicity of the Integer Hull of Parametric Convex Polygons","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Western University","funders":"","keywords":"Convex hull; Computer science; Regular polygon; Integer (computer science); Hull; Parametric statistics; Algorithm; Combinatorics; Mathematics; Geometry; Programming language; Geology; Statistics","score_opus":0.01877098087548923,"score_gpt":0.2373048214993603,"score_spread":0.21853384062387107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196065071","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.0065050493,0.00033573754,0.9878403,0.0018726828,0.0015730404,0.0003072809,0.0000082554125,0.000020316746,0.0015373242],"genre_scores_gemma":[0.9646669,0.000019666537,0.033053033,0.001796525,0.00013367493,0.0000051158418,0.0000024787983,0.000010919363,0.00031169047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972371,0.000102607606,0.0005240526,0.00073414383,0.001125897,0.00027621404],"domain_scores_gemma":[0.99588734,0.0018177496,0.0004450734,0.001331615,0.00045874075,0.00005950443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008931444,0.00029152905,0.00041191338,0.0005503483,0.0002236183,0.000158525,0.0028014819,0.00016659846,0.000045977846],"category_scores_gemma":[0.00051693636,0.00017725979,0.00021396992,0.0019729116,0.00087382976,0.00015701745,0.0010332648,0.0006254623,0.000006523366],"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.000010491973,0.00011238816,0.00012863653,0.000057450026,0.000038578215,0.000011289964,0.0010094347,0.21182781,0.0011686343,0.61037296,0.00013833198,0.17512402],"study_design_scores_gemma":[0.00031513945,0.00033598518,0.0019492077,0.0007380049,0.00002343978,0.000065656364,0.0000012802954,0.6962733,0.046774697,0.25211948,0.00082680595,0.0005770008],"about_ca_topic_score_codex":0.000023010267,"about_ca_topic_score_gemma":0.000023528646,"teacher_disagreement_score":0.95816183,"about_ca_system_score_codex":0.00010058757,"about_ca_system_score_gemma":0.00080144714,"threshold_uncertainty_score":0.7228444},"labels":[],"label_agreement":null},{"id":"W3196362465","doi":"","title":"Analysis of moving mesh methods based on geometrical variables","year":2001,"lang":"en","type":"article","venue":"Journal of Computational Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.03381673838975824,"score_gpt":0.33869330226319533,"score_spread":0.3048765638734371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196362465","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.022489177,0.000062692285,0.97595656,0.00038902424,0.00019729277,0.00005885829,0.0000028024674,0.000015841568,0.0008277329],"genre_scores_gemma":[0.34642375,0.000004918838,0.6533286,0.00015679517,0.000052666015,8.6033873e-7,0.000004632302,0.000004600763,0.000023187104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976092,0.00017700132,0.00096073345,0.00015199269,0.00096223893,0.00013885915],"domain_scores_gemma":[0.99430275,0.0035028222,0.0009375829,0.00020859501,0.0009454344,0.000102827325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019022672,0.00013410187,0.000490482,0.0022661667,0.00007334958,0.00008575367,0.00050875155,0.000056647175,0.000059204864],"category_scores_gemma":[0.000767947,0.00011446423,0.0003228738,0.00450078,0.000028072043,0.00029166305,0.000055894096,0.0001470905,0.000004254548],"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.000013556322,0.00036168244,0.00022817845,0.000019830486,0.00032327638,0.000009523539,0.00014555143,0.9206609,0.00010006792,0.06261368,0.00010574866,0.015417987],"study_design_scores_gemma":[0.0003335976,0.00018168386,0.004337472,0.000036398138,0.0002181772,0.000043518514,0.000016731234,0.93354654,0.00022071446,0.060735937,0.0002300125,0.00009923744],"about_ca_topic_score_codex":8.950377e-7,"about_ca_topic_score_gemma":1.8665291e-7,"teacher_disagreement_score":0.32393456,"about_ca_system_score_codex":0.00006519625,"about_ca_system_score_gemma":0.00022224644,"threshold_uncertainty_score":0.46677157},"labels":[],"label_agreement":null},{"id":"W3197202594","doi":"10.1142/s0218195922410035","title":"Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set","year":2023,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Saskatchewan; University of Manitoba","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Disjoint sets; Convex hull; Cardinality (data modeling); Parameterized complexity; Convex set; Generalization; Time complexity; Discrete mathematics; Regular polygon; Convex analysis; Convex optimization; Computer science","score_opus":0.024667587464482957,"score_gpt":0.3269574322328215,"score_spread":0.30228984476833853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197202594","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.06256045,0.0003267512,0.9300673,0.004848943,0.0010010483,0.00043816085,0.00012379489,0.0001342439,0.0004993215],"genre_scores_gemma":[0.9639553,0.000110703746,0.03362601,0.0010062659,0.00056896865,0.00011846632,0.0004091226,0.000023935412,0.00018124195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624765,0.00013527315,0.0012350767,0.00044943232,0.0015271094,0.00040545562],"domain_scores_gemma":[0.9963073,0.00095523533,0.00073730433,0.00027900288,0.0015163164,0.00020482087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015161308,0.00025543425,0.00037991663,0.0026083388,0.00018310657,0.00032285336,0.0016379859,0.00011776428,0.000121436395],"category_scores_gemma":[0.00017356363,0.00027370153,0.00023258287,0.0033072785,0.000062527964,0.0011247264,0.000345953,0.000401066,0.00040375258],"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.00010500335,0.0008820187,0.0097372355,0.00006493258,0.0005122269,0.00028819454,0.0013991562,0.5952825,0.00063397066,0.2994229,0.014539006,0.07713286],"study_design_scores_gemma":[0.005080267,0.00021788607,0.09034308,0.00019438953,0.000043218864,0.0010387677,0.00050538173,0.43029612,0.00075224234,0.31049985,0.16007444,0.0009543614],"about_ca_topic_score_codex":0.0000061824285,"about_ca_topic_score_gemma":0.0000061306764,"teacher_disagreement_score":0.90139484,"about_ca_system_score_codex":0.0002807837,"about_ca_system_score_gemma":0.0004734841,"threshold_uncertainty_score":0.9999715},"labels":[],"label_agreement":null},{"id":"W3198367481","doi":"10.4230/lipics.esa.2021.17","title":"Distant Representatives for Rectangles in the Plane","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Plane (geometry); Combinatorics; Approximation algorithm; Set (abstract data type); Constant (computer programming); Time complexity; Mathematics; Point (geometry); Polynomial; Computational geometry; Object (grammar); Polynomial-time approximation scheme; Discrete mathematics; Computer science; Algorithm; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.0225185920211277,"score_gpt":0.2908109689955102,"score_spread":0.26829237697438246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198367481","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.0733056,0.00016999134,0.9192048,0.002414716,0.00092718995,0.0010694207,0.00027342094,0.00007729279,0.0025575757],"genre_scores_gemma":[0.8528331,0.000065295724,0.14109269,0.0028398004,0.00031936294,0.00048111888,0.0017334565,0.000023253497,0.0006119243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983325,0.00007321992,0.0006302524,0.00024805762,0.00035137963,0.0003645755],"domain_scores_gemma":[0.99837977,0.00061502354,0.00019205615,0.0005113006,0.00024170887,0.00006014109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006800677,0.00018233576,0.00021734805,0.00014091017,0.00026043452,0.00043915867,0.0006942589,0.0000750244,0.000008233515],"category_scores_gemma":[0.00024280265,0.00014014936,0.0001430031,0.0005320672,0.00004294854,0.0009424307,0.00016661016,0.00016085964,0.000014117454],"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.00042235389,0.001613451,0.0051202993,0.0012147545,0.00033100919,0.00007413864,0.107962936,0.007404076,0.0014051837,0.7126623,0.047375478,0.11441404],"study_design_scores_gemma":[0.0076116286,0.0006731136,0.006879691,0.00024785197,0.000051798044,0.00037509427,0.010914942,0.43365827,0.017321624,0.06102117,0.46007136,0.0011734586],"about_ca_topic_score_codex":0.0000052753517,"about_ca_topic_score_gemma":0.00004810006,"teacher_disagreement_score":0.7795275,"about_ca_system_score_codex":0.00005653682,"about_ca_system_score_gemma":0.00011735414,"threshold_uncertainty_score":0.5715125},"labels":[],"label_agreement":null},{"id":"W3199722554","doi":"10.4230/lipics.isaac.2021.44","title":"Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Combinatorics; Bipartite graph; Mathematics; Euclidean geometry; Matching (statistics); Planar graph; Planar; Approximation algorithm; Plane (geometry); Cover (algebra); Discrete mathematics; Graph; Geometry; Computer science","score_opus":0.02379987069991624,"score_gpt":0.27714837656340074,"score_spread":0.2533485058634845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199722554","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.11825139,0.00009100526,0.87592655,0.0014014067,0.0010867693,0.0026000182,0.00027954517,0.00008173988,0.00028156384],"genre_scores_gemma":[0.5230787,0.00006465881,0.46840975,0.003027006,0.00045533082,0.0011673293,0.003660395,0.000044026812,0.000092826995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971176,0.00008804589,0.0011522907,0.00051784894,0.0005867489,0.00053746434],"domain_scores_gemma":[0.99789554,0.00040905495,0.00047655284,0.0007855355,0.00029884823,0.000134462],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016691069,0.00044816325,0.000503355,0.0004854574,0.0003259096,0.0016527737,0.0011730472,0.000283201,0.0000046834834],"category_scores_gemma":[0.00012267426,0.00038018118,0.00020733934,0.00038078873,0.00003398394,0.0011777084,0.0010644918,0.00058627885,0.0000104599085],"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.00037193732,0.0016246564,0.00077090994,0.011016025,0.0007282709,0.000047083297,0.33074164,0.15185478,0.0003489015,0.14958954,0.008439923,0.34446633],"study_design_scores_gemma":[0.0017749146,0.00020604924,0.001584434,0.00046581897,0.0000400871,0.00011874277,0.0030169461,0.97156185,0.00043967852,0.013130139,0.006941354,0.00071998156],"about_ca_topic_score_codex":0.000030043804,"about_ca_topic_score_gemma":0.000027484826,"teacher_disagreement_score":0.8197071,"about_ca_system_score_codex":0.000141159,"about_ca_system_score_gemma":0.00015464867,"threshold_uncertainty_score":0.999865},"labels":[],"label_agreement":null},{"id":"W3200815000","doi":"10.14288/1.0402167","title":"On path-greedy geometric spanners","year":2021,"lang":"en","type":"article","venue":"Open Collections","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Path (computing); Combinatorics; Mathematics; Computer science","score_opus":0.022807252260072804,"score_gpt":0.2647398684193226,"score_spread":0.24193261615924982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200815000","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.0007172289,0.00006192789,0.63335633,0.0011904032,0.0010301016,0.00019660131,0.0000075601756,0.00007026782,0.36336958],"genre_scores_gemma":[0.15320666,0.000043991477,0.0845101,0.0021724105,0.00022471455,0.00014399928,0.00004983712,0.000015296484,0.759633],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991049,0.00006797507,0.00013575914,0.00033491882,0.00020950875,0.00014694982],"domain_scores_gemma":[0.9991717,0.00017980435,0.000041113613,0.00032637257,0.00020407767,0.000076970355],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00015886524,0.00007896429,0.0000961062,0.00018271887,0.0014188963,0.0019512938,0.00046242482,0.000034021483,0.00041111518],"category_scores_gemma":[0.00018662133,0.00008361774,0.000048572187,0.0066364375,0.0000094988345,0.00037446266,0.00028699992,0.00009283927,0.0000942447],"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.0000073340366,0.0003196535,0.0000097354605,0.0000030575802,0.000035529323,0.00003902775,0.0000880159,0.023590045,0.00017732198,0.051569257,0.90318316,0.020977877],"study_design_scores_gemma":[0.002069849,0.0006265436,0.002005443,0.000046146088,0.000028333865,0.00029693998,0.00013840641,0.13708633,0.0131957615,0.08396153,0.75974685,0.000797864],"about_ca_topic_score_codex":0.00020119938,"about_ca_topic_score_gemma":0.00013555844,"teacher_disagreement_score":0.54884624,"about_ca_system_score_codex":0.000074182986,"about_ca_system_score_gemma":0.00033036157,"threshold_uncertainty_score":0.99988115},"labels":[],"label_agreement":null},{"id":"W3202544316","doi":"","title":"Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips.","year":2021,"lang":"en","type":"article","venue":"Canadian Conference on 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 Toronto","funders":"","keywords":"Regular polygon; Mathematics; Point (geometry); Combinatorics; Geometry","score_opus":0.021661916448564238,"score_gpt":0.2412595239077216,"score_spread":0.21959760745915735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202544316","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.43127602,0.00013474822,0.5567876,0.0048489086,0.0004946747,0.000323871,0.000081606806,0.00008010115,0.005972492],"genre_scores_gemma":[0.95045793,0.0000034346203,0.047725502,0.0011664119,0.000049840375,0.00001528245,0.00028720015,0.000011979801,0.00028240954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798405,0.00012236595,0.00042418513,0.0005117626,0.00063040823,0.00032722612],"domain_scores_gemma":[0.9975479,0.00037477873,0.00019979363,0.0003632671,0.0011439705,0.00037026955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025133355,0.0002157507,0.00030372947,0.00071638846,0.00018590347,0.00017014534,0.0003758693,0.00009804142,0.0002905791],"category_scores_gemma":[0.0001376312,0.00021919006,0.00007151391,0.0017284177,0.00008854229,0.00034863738,0.00005032169,0.00014879311,0.00009282262],"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.00002915188,0.00020914142,0.0012247311,0.00012186968,0.0001649544,0.00016461368,0.00078509154,0.22888072,0.001100418,0.73671895,0.0023030734,0.028297294],"study_design_scores_gemma":[0.0012880764,0.0004251368,0.07882869,0.00018897594,0.00002682985,0.00018438093,0.00021244127,0.8803938,0.0017017268,0.03490707,0.0012637512,0.0005791302],"about_ca_topic_score_codex":0.0006842962,"about_ca_topic_score_gemma":0.0032410293,"teacher_disagreement_score":0.70181185,"about_ca_system_score_codex":0.00017469146,"about_ca_system_score_gemma":0.0033225617,"threshold_uncertainty_score":0.8938311},"labels":[],"label_agreement":null},{"id":"W3205617095","doi":"10.1145/3638349","title":"Faster Modular Composition","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"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":"Composition (language); Modular design; Computer science; Programming language; Art; Literature","score_opus":0.023844893689522986,"score_gpt":0.2608103621926193,"score_spread":0.23696546850309635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205617095","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.7626821,0.000048580096,0.21549007,0.020128932,0.0014582827,0.000035437493,4.0240073e-7,0.000019915682,0.00013628935],"genre_scores_gemma":[0.98362476,0.000006256735,0.015405038,0.00044241495,0.00022974463,3.264031e-7,4.2431654e-7,0.0000018288349,0.00028919487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947846,0.000046220368,0.00013555257,0.000045576864,0.00023448285,0.000059732803],"domain_scores_gemma":[0.99936527,0.000052874115,0.00011555755,0.00034484483,0.00009767058,0.000023767407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029653538,0.0000311583,0.000049759605,0.00008754057,0.00007190075,0.00005698634,0.0011059776,0.000013388613,0.000003839922],"category_scores_gemma":[0.000097274664,0.000019792384,0.00006833869,0.0004279692,0.0000067629835,0.00025120634,0.00034813967,0.00006962813,0.000039333845],"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.00003350118,0.00013949456,0.0015579343,0.000023543578,0.00012119009,0.00007122051,0.0017732938,0.5094684,0.23107983,0.03622077,0.12689099,0.09261982],"study_design_scores_gemma":[0.0011002391,0.00024352231,0.18949926,0.00010874755,0.000030969582,0.00073892757,0.00004576349,0.33316538,0.05717807,0.38536802,0.032272097,0.00024901956],"about_ca_topic_score_codex":2.7644612e-7,"about_ca_topic_score_gemma":1.2066101e-7,"teacher_disagreement_score":0.34914726,"about_ca_system_score_codex":0.000015691721,"about_ca_system_score_gemma":0.000027633869,"threshold_uncertainty_score":0.20552},"labels":[],"label_agreement":null},{"id":"W3211114752","doi":"10.1016/j.cad.2021.103136","title":"Anisotropic Tetrahedral Mesh Adaptation with Improved Metric Alignment and Orthogonality","year":2021,"lang":"en","type":"article","venue":"Computer-Aided Design","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 British Columbia","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Metric (unit); Orthogonality; Polygon mesh; Transformation (genetics); Mesh generation; Tetrahedron; Computer science; Field (mathematics); Topology (electrical circuits); Mathematics; Algorithm; Finite element method; Orientation (vector space); Geometry; Physics; Engineering; Combinatorics; Pure mathematics","score_opus":0.02947671383938498,"score_gpt":0.23364552728873858,"score_spread":0.20416881344935361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211114752","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.025353884,0.00044888546,0.97289836,0.00044070586,0.00036456127,0.0002689199,0.0000021991063,0.00014640065,0.00007608138],"genre_scores_gemma":[0.47839025,0.000022628366,0.520983,0.00034967854,0.00011226163,0.00001616526,0.000017006909,0.000007741635,0.00010131661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801,0.00031195304,0.0003161552,0.00068158674,0.000399568,0.00028074541],"domain_scores_gemma":[0.99864167,0.0003276724,0.0001324081,0.00041463698,0.000320253,0.0001633474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003772735,0.00021861136,0.00024153595,0.00019347886,0.00021249153,0.0003671037,0.00027609552,0.0000646893,0.000012363667],"category_scores_gemma":[0.000038519534,0.00020047856,0.000053260093,0.0011845181,0.000038281472,0.00055911153,0.00019170412,0.00011455796,0.000010224967],"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.00009454925,0.00055633,0.0008258933,0.00009443171,0.00027861103,0.00029325133,0.001246292,0.11100295,0.010446431,0.12799509,0.001531524,0.7456347],"study_design_scores_gemma":[0.0010801882,0.00055776513,0.013497313,0.00002410528,0.000027624294,0.00019384119,0.000025377434,0.9678204,0.010581851,0.004928761,0.00091726193,0.0003454937],"about_ca_topic_score_codex":0.0000116203555,"about_ca_topic_score_gemma":0.0000085641905,"teacher_disagreement_score":0.8568175,"about_ca_system_score_codex":0.00007223171,"about_ca_system_score_gemma":0.00031112295,"threshold_uncertainty_score":0.8175279},"labels":[],"label_agreement":null},{"id":"W3211907390","doi":"10.7155/jgaa.00576","title":"Angle Covers: Algorithms and Complexity","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Vertex (graph theory); Vertex cover; Degree (music); Algorithm; Physics","score_opus":0.029834612093644887,"score_gpt":0.27346577042968856,"score_spread":0.24363115833604368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211907390","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.007418556,0.002578581,0.98782766,0.0017004671,0.00011981476,0.00007933063,0.000011471889,0.000014703553,0.00024938968],"genre_scores_gemma":[0.17766464,0.0020135152,0.818461,0.0008410865,0.0007065364,0.00002347746,0.000022550481,0.000011015834,0.00025617945],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920017,0.000034623263,0.0002682671,0.00018276315,0.00020685558,0.000107328146],"domain_scores_gemma":[0.99908936,0.00008817556,0.0001704747,0.00014990705,0.0003637327,0.0001383242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022340019,0.00008408563,0.00015082801,0.00012857062,0.00021942315,0.00017518495,0.00015440908,0.00003566607,0.000008330526],"category_scores_gemma":[0.000015243701,0.000077876364,0.000059842936,0.0005579159,0.00007267111,0.0003623547,0.000089062894,0.00011734513,0.000001671135],"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.0000057180873,0.00031225983,0.00044662296,0.000024928278,0.0001027028,0.000034663233,0.00032456822,0.00052882446,0.0026501238,0.29835576,0.0019111087,0.6953027],"study_design_scores_gemma":[0.002661713,0.00046983053,0.045604087,0.000073400326,0.00011658277,0.003807458,0.00050453114,0.12283184,0.006737076,0.54517174,0.2713182,0.00070350856],"about_ca_topic_score_codex":0.000004385966,"about_ca_topic_score_gemma":0.0000028761137,"teacher_disagreement_score":0.6945992,"about_ca_system_score_codex":0.000011666395,"about_ca_system_score_gemma":0.000087881584,"threshold_uncertainty_score":0.3175706},"labels":[],"label_agreement":null},{"id":"W3213542826","doi":"10.32920/ryerson.14648580.v1","title":"Optimization of Reverse Engineering Data for Regeneration of Triangular Mesh","year":2021,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Reverse engineering; Triangle mesh; Computer science; Mesh generation; Object (grammar); Simple (philosophy); Genetic algorithm; Algorithm; Engineering drawing; Polygon mesh; Artificial intelligence; Computer graphics (images); Engineering; Machine learning; Finite element method; Structural engineering","score_opus":0.04788401901859847,"score_gpt":0.27541143519074957,"score_spread":0.2275274161721511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213542826","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.0011449435,0.0003186816,0.997024,0.00024724685,0.00075023883,0.00036686388,0.00006296816,0.00003570399,0.000049343416],"genre_scores_gemma":[0.039911333,0.00007469851,0.95685846,0.00002834359,0.00013727673,0.000020363237,0.0028093269,0.000008148697,0.00015204494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874103,0.000040546045,0.0004563889,0.00044515263,0.0002350675,0.000081811],"domain_scores_gemma":[0.99798405,0.00010356739,0.0002907128,0.001089157,0.0005036667,0.00002884832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053311244,0.00011749458,0.00025774533,0.00018043452,0.000022825592,0.000063459,0.0007198251,0.000121710545,0.000016531298],"category_scores_gemma":[0.0003216507,0.00012828835,0.00008177938,0.00029163322,0.000007261229,0.00035475887,0.0008535661,0.00007193203,1.553483e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041482217,0.000032158958,0.000001182585,0.00020498673,0.00003819275,3.2558103e-7,0.00006737158,0.9806942,0.0038425333,0.0113994405,0.00078025274,0.002935237],"study_design_scores_gemma":[0.00022291116,0.00002293488,0.000010487904,0.00006642723,0.00002535424,0.0000012961098,0.000007784361,0.9549543,0.043998875,0.00022390168,0.0003569448,0.00010873405],"about_ca_topic_score_codex":0.00001612725,"about_ca_topic_score_gemma":0.0000038736257,"teacher_disagreement_score":0.040165544,"about_ca_system_score_codex":0.000022158909,"about_ca_system_score_gemma":0.00028032518,"threshold_uncertainty_score":0.52314466},"labels":[],"label_agreement":null},{"id":"W3214090100","doi":"10.1007/978-3-030-96731-4_11","title":"The Polygon Burning Problem","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 British Columbia","funders":"","keywords":"Voronoi diagram; Geodesic; Combinatorics; Polygon (computer graphics); Vertex (graph theory); Regular polygon; Polygon covering; Approximation algorithm; Monotone polygon; Simple polygon; Mathematics; Computer science; Algorithm; Discrete mathematics; Geometry; Graph","score_opus":0.013597865343706703,"score_gpt":0.23599516161983927,"score_spread":0.22239729627613258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214090100","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.000029226812,0.0011501559,0.9850326,0.0024170305,0.002168308,0.0003269401,0.0000020912937,0.0001250469,0.0087486],"genre_scores_gemma":[0.11912619,0.00037792342,0.8672969,0.0042089187,0.0020414174,0.00009050026,0.000035164932,0.00008277103,0.0067402227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966984,0.00005694057,0.0004331007,0.0010705797,0.0012224304,0.00051855796],"domain_scores_gemma":[0.99774456,0.0007726451,0.0002680443,0.00092918676,0.00017859822,0.00010697068],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014387529,0.0003349372,0.0002471563,0.0005216473,0.0013019947,0.0008537849,0.0031282112,0.00011307299,0.000045384822],"category_scores_gemma":[0.00006945569,0.0002638482,0.000110049274,0.0008846096,0.00030948984,0.00053496216,0.0017925919,0.00082429405,0.000030039622],"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.0000025398112,0.0000082570805,0.0000046981168,0.0000062544373,0.0000056459867,0.00001987251,0.00027587498,0.16785973,0.000059005168,0.15958548,0.000047858986,0.6721248],"study_design_scores_gemma":[0.00015787619,0.00016823747,0.000050733004,0.000064965534,0.000004747181,0.0001008061,1.7929415e-7,0.5671863,0.00040830765,0.3358366,0.095536664,0.00048460462],"about_ca_topic_score_codex":0.000013881937,"about_ca_topic_score_gemma":0.000035693756,"teacher_disagreement_score":0.67164016,"about_ca_system_score_codex":0.0003174434,"about_ca_system_score_gemma":0.0006763831,"threshold_uncertainty_score":0.99999815},"labels":[],"label_agreement":null},{"id":"W3215715196","doi":"10.1007/978-3-030-96731-4_33","title":"On Approximating Shortest Paths in Weighted Triangular Tessellations","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Agencia Estatal de Investigación; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Universidad de Alcalá","keywords":"Combinatorics; Tessellation (computer graphics); Shortest path problem; Vertex (graph theory); Hexagonal tiling; Mathematics; Path (computing); Space (punctuation); Geometry; Grid; Computer science; Graph","score_opus":0.01708299613129252,"score_gpt":0.24380700712824172,"score_spread":0.2267240109969492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215715196","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.00042015244,0.0002488115,0.99067754,0.00066122564,0.0015752445,0.00052081904,0.000007939795,0.000122638,0.005765647],"genre_scores_gemma":[0.391875,0.000037164264,0.60458064,0.0020055997,0.00065882376,0.00006795961,0.000094604926,0.000056316112,0.0006238995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961702,0.00008002936,0.0006954653,0.0013915739,0.001178338,0.0004843943],"domain_scores_gemma":[0.99757797,0.0009747597,0.0002944748,0.0008915278,0.00014757813,0.000113668895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012913723,0.00041427568,0.0004327786,0.0017691138,0.00039607123,0.00037461592,0.0017845978,0.00017759654,0.00012129098],"category_scores_gemma":[0.0001818861,0.00042290115,0.000110666144,0.0018041324,0.00015665659,0.0005318721,0.0007664241,0.00090100284,0.00002650645],"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.0000051677243,0.00006537255,0.000031104646,0.000013321618,0.00000550643,0.00007658592,0.0005361784,0.45971823,0.000074561845,0.16642173,0.000021546846,0.3730307],"study_design_scores_gemma":[0.0002729473,0.00014531307,0.00011653775,0.00011249764,0.0000032225184,0.00002567026,1.8587932e-7,0.7728683,0.00022043163,0.22427131,0.0015635,0.00040007583],"about_ca_topic_score_codex":0.00001481121,"about_ca_topic_score_gemma":0.000044326058,"teacher_disagreement_score":0.39145485,"about_ca_system_score_codex":0.0004671667,"about_ca_system_score_gemma":0.0005815723,"threshold_uncertainty_score":0.99982226},"labels":[],"label_agreement":null},{"id":"W3216262330","doi":"10.1007/s00454-023-00486-0","title":"Acute Tours in the Plane","year":2023,"lang":"en","type":"preprint","venue":"Discrete & 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 Windsor","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Constructive; Constructive proof; Upper and lower bounds; Plane (geometry); Hamiltonian path; Hamiltonian (control theory); Simple (philosophy); Line (geometry); Discrete mathematics; Geometry; Mathematical analysis; Computer science; Mathematical optimization; Graph","score_opus":0.03301147917995095,"score_gpt":0.3027844184221456,"score_spread":0.26977293924219464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216262330","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.07467135,0.00042127652,0.91000926,0.009745523,0.0026107247,0.00078127393,0.00023620257,0.00040060864,0.0011237749],"genre_scores_gemma":[0.94851136,0.000059396967,0.044945043,0.001860876,0.00062474725,0.00019427601,0.0031356567,0.000041231753,0.00062738353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606866,0.0002992259,0.00070060784,0.0010406473,0.0013975811,0.0004932528],"domain_scores_gemma":[0.99750817,0.0010467962,0.00031398883,0.0008089978,0.000213589,0.0001084513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011051545,0.0004361425,0.000414951,0.0011543724,0.00023416194,0.00072481023,0.0024528946,0.00025825572,0.00002619466],"category_scores_gemma":[0.000117752636,0.00036744695,0.00025319224,0.0023526992,0.00007316348,0.00034153115,0.0014073626,0.00096694095,0.00030102345],"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.000015052137,0.00008926944,0.00057095464,0.00005730748,0.00013011075,0.00017468314,0.00096756394,0.9197561,0.000008583172,0.06347335,0.009024963,0.005732017],"study_design_scores_gemma":[0.00063955644,0.000095561096,0.0984467,0.00012994446,0.000048519498,0.00009407411,0.00012876726,0.60727626,0.00002622638,0.28991702,0.0024291622,0.000768177],"about_ca_topic_score_codex":0.000061840954,"about_ca_topic_score_gemma":0.000026899323,"teacher_disagreement_score":0.87384003,"about_ca_system_score_codex":0.0001227134,"about_ca_system_score_gemma":0.0004116557,"threshold_uncertainty_score":0.99987775},"labels":[],"label_agreement":null},{"id":"W3217470394","doi":"10.4230/lipics.isaac.2021.16","title":"Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":"Planar graph; Planar straight-line graph; Outerplanar graph; Book embedding; Edge contraction; Combinatorics; Planar; Graph; Mathematics; Discrete mathematics; Computer science; 1-planar graph; Pathwidth; Line graph; Voltage graph","score_opus":0.012951347721054173,"score_gpt":0.23663351082266498,"score_spread":0.22368216310161082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217470394","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.25124294,0.00030026902,0.7461202,0.00087377214,0.00042714356,0.00039905988,0.00008625608,0.00006205399,0.00048831984],"genre_scores_gemma":[0.957498,0.00006634332,0.040989153,0.0008763828,0.00008747057,0.00007025765,0.00032650406,0.000012422855,0.000073438634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831706,0.000052114305,0.00066436565,0.00023001412,0.00040142002,0.00033501367],"domain_scores_gemma":[0.9985267,0.00025994604,0.00029033804,0.0004477547,0.00036361165,0.00011168214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048364475,0.00020625615,0.0002562003,0.00023954514,0.00047074823,0.00033335152,0.0004808594,0.00008619491,0.0000050861822],"category_scores_gemma":[0.00010700602,0.00016368978,0.00014908859,0.00073503616,0.00012937872,0.0007529464,0.00016708528,0.00017512367,0.000009706685],"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.0002111359,0.0010661649,0.02659022,0.0019486037,0.00076303224,0.00003686962,0.063639015,0.017644493,0.0017412283,0.787094,0.014304073,0.08496118],"study_design_scores_gemma":[0.012622287,0.0019114438,0.04830895,0.0012850369,0.00035349163,0.0011913081,0.009968482,0.55052376,0.049870018,0.19557685,0.12563972,0.002748664],"about_ca_topic_score_codex":0.00001743061,"about_ca_topic_score_gemma":0.00009904891,"teacher_disagreement_score":0.7062551,"about_ca_system_score_codex":0.000024900291,"about_ca_system_score_gemma":0.00010740292,"threshold_uncertainty_score":0.6675076},"labels":[],"label_agreement":null},{"id":"W339444614","doi":"10.1007/978-3-319-09129-7_28","title":"Closest-Point Queries for Complex Objects","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Windsor","funders":"","keywords":"Rectangle; Ellipse; Line segment; Polygon (computer graphics); Regular polygon; Computer science; Heuristic; Boundary (topology); Convex polygon; Convex hull; Line (geometry); Preprocessor; Point (geometry); Object (grammar); Computational geometry; Simple polygon; Algorithm; Set (abstract data type); Combinatorics; Mathematics; Artificial intelligence; Geometry","score_opus":0.0256635057544411,"score_gpt":0.26198613340106813,"score_spread":0.23632262764662704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W339444614","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.000028290046,0.0002077893,0.9925603,0.0012843284,0.0022150895,0.00063299556,0.000010481247,0.0001834873,0.0028772354],"genre_scores_gemma":[0.12189459,0.000019137493,0.8722855,0.0034659684,0.0012718578,0.000036248828,0.000049580245,0.000037230307,0.0009398708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655795,0.000037007485,0.00055207085,0.0014600751,0.00080317754,0.00058970496],"domain_scores_gemma":[0.99708045,0.00092179043,0.00030866652,0.0010233962,0.00049388834,0.00017180269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009764894,0.0004973094,0.00053338934,0.0008145444,0.00040116528,0.0006222854,0.0021184052,0.00024649224,0.000022313827],"category_scores_gemma":[0.0001978416,0.00047867795,0.00018415088,0.00052477047,0.00042833012,0.0004586658,0.00077185396,0.0003743452,0.00004227025],"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.000010772564,0.000023157525,0.000006562245,0.00007450002,0.000013298546,0.000011637212,0.00050104834,0.096761964,0.00039934047,0.23357539,0.00034167297,0.66828066],"study_design_scores_gemma":[0.00030864117,0.00028289767,0.00007799517,0.00012266006,0.000007082643,0.00004797479,1.0813617e-7,0.66043526,0.0014300642,0.31883246,0.017884826,0.000570073],"about_ca_topic_score_codex":0.0000084028725,"about_ca_topic_score_gemma":0.00007991639,"teacher_disagreement_score":0.6677106,"about_ca_system_score_codex":0.00021837228,"about_ca_system_score_gemma":0.0006127663,"threshold_uncertainty_score":0.99976647},"labels":[],"label_agreement":null},{"id":"W34533988","doi":"10.1007/bfb0042805","title":"On the reachability region of a ladder in two convex polygons","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reachability; Regular polygon; Combinatorics; Mathematics; Computer science; Geometry","score_opus":0.014423624374213361,"score_gpt":0.24411599079810667,"score_spread":0.22969236642389332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34533988","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.0026737342,0.0003978512,0.8903563,0.0081378035,0.0002696085,0.00059632276,0.000012852187,0.00002659998,0.0975289],"genre_scores_gemma":[0.99714684,0.000021713591,0.0005740811,0.002006475,0.000035544064,0.000010231958,0.0000074183163,0.0000017479698,0.00019593922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879843,0.000051364863,0.0004543486,0.00019436606,0.00037100285,0.0001304996],"domain_scores_gemma":[0.99823946,0.0011582369,0.0002831485,0.0001957428,0.00010194093,0.000021458416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008452132,0.00014417738,0.00021229379,0.00042554634,0.00010653351,0.00012237515,0.00033132674,0.00008732565,0.000009491338],"category_scores_gemma":[0.0002708466,0.00009385179,0.000046006957,0.0002723771,0.00022522808,0.0008401494,0.000048158643,0.0002132908,0.000004069704],"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.000020464162,0.000013256514,0.00022337592,0.00001815678,0.000004996399,9.1073184e-7,0.00056331063,0.052283183,0.000010996243,0.85602456,0.00014985852,0.09068691],"study_design_scores_gemma":[0.0011290509,0.00023743074,0.0034832882,0.00017165765,0.0000070139263,0.000017725537,0.000007752166,0.45455182,0.00012521358,0.530033,0.00992794,0.00030811952],"about_ca_topic_score_codex":0.00015185632,"about_ca_topic_score_gemma":0.00021020303,"teacher_disagreement_score":0.9944731,"about_ca_system_score_codex":0.000031417556,"about_ca_system_score_gemma":0.0001295755,"threshold_uncertainty_score":0.3827165},"labels":[],"label_agreement":null},{"id":"W35856319","doi":"10.1007/978-3-319-02335-9_6","title":"Inserting a Curve into an Existing Two Dimensional Unstructured Mesh","year":2013,"lang":"en","type":"book-chapter","venue":"","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 British Columbia","funders":"","keywords":"T-vertices; Discretization; Laplacian smoothing; Boundary (topology); Computer science; Mesh generation; Sizing; Triangle mesh; Algorithm; Mathematics; Topology (electrical circuits); Polygon mesh; Computer graphics (images); Finite element method; Engineering; Mathematical analysis; Combinatorics; Structural engineering","score_opus":0.03427344972716035,"score_gpt":0.2768529781757514,"score_spread":0.24257952844859104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35856319","genre_codex":"other","genre_gemma":"methods","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.0041840253,0.0003255898,0.381559,0.0005214854,0.001997125,0.00055985485,0.000005534341,0.0006319968,0.61021537],"genre_scores_gemma":[0.06216904,0.000005060485,0.5478445,0.0016550467,0.001245667,0.000019256331,0.00028601734,0.00005989181,0.3867155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979879,0.0000392073,0.00046868564,0.0007258153,0.00054448855,0.00023388164],"domain_scores_gemma":[0.99854684,0.00013495247,0.0002820383,0.0004913434,0.0003650876,0.0001797674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026442378,0.00034296498,0.00028460857,0.00026620989,0.0002745044,0.00030357766,0.0005935935,0.00017143176,0.00057955383],"category_scores_gemma":[0.000043549975,0.0003144607,0.00010760976,0.00009990367,0.000040939452,0.0006855066,0.00038245044,0.00030268444,0.00026818557],"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.0000025245286,0.000009036469,0.0000030771905,0.000012492372,0.000027360828,0.000009503351,0.0002189781,0.0033323742,0.0005389413,0.8867665,0.0010248285,0.108054414],"study_design_scores_gemma":[0.00040560987,0.00012320877,0.00007340685,0.00010195793,0.00001846293,0.00008094089,0.000004465312,0.41625232,0.0006641482,0.5531462,0.028311582,0.0008177222],"about_ca_topic_score_codex":0.00009382747,"about_ca_topic_score_gemma":0.0000622424,"teacher_disagreement_score":0.41291994,"about_ca_system_score_codex":0.000079145975,"about_ca_system_score_gemma":0.0001993299,"threshold_uncertainty_score":0.99993074},"labels":[],"label_agreement":null},{"id":"W37962542","doi":"10.1023/a:1009942427413","title":"Removing Degeneracies by Perturbing the Problem or Perturbing the World","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","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 British Columbia Hospital","funders":"","keywords":"Delaunay triangulation; Euclidean geometry; Triangulation; Computational geometry; Bowyer–Watson algorithm; Mathematics; Simple (philosophy); Computer science; Algorithm; Geometry","score_opus":0.013498284435411527,"score_gpt":0.24108370185058134,"score_spread":0.2275854174151698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37962542","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.19887409,0.00736642,0.7278823,0.024875185,0.0014558103,0.0011878931,0.0000037606528,0.0010426114,0.0373119],"genre_scores_gemma":[0.8507925,0.000111467794,0.10671086,0.0051574144,0.0009375807,0.000020733763,0.000013960554,0.00003528242,0.03622019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979278,0.00016775745,0.00041573503,0.00050681864,0.00047277368,0.00050910737],"domain_scores_gemma":[0.99816495,0.00095538073,0.00014409186,0.0005419367,0.00011816117,0.00007546662],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010855983,0.00023009954,0.00018110687,0.000092515475,0.001895461,0.0008335821,0.0011916405,0.000047211197,0.00011729787],"category_scores_gemma":[0.000069431655,0.00012874287,0.000094364375,0.0014550342,0.000059227317,0.0004385122,0.00030216304,0.0003508423,0.000068913476],"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.000016378555,0.00005201434,0.0001433649,0.000032511387,0.000039399543,0.000009276724,0.0024754722,0.392636,0.0018686755,0.011520057,0.048663735,0.5425431],"study_design_scores_gemma":[0.00015226421,0.00002676915,0.00013285037,0.00009217391,0.000008729341,0.00007150701,0.00006476276,0.7624544,0.0012784264,0.0006709164,0.23483679,0.00021041605],"about_ca_topic_score_codex":0.00006689489,"about_ca_topic_score_gemma":0.000024094226,"teacher_disagreement_score":0.6519184,"about_ca_system_score_codex":0.00008402392,"about_ca_system_score_gemma":0.00012526358,"threshold_uncertainty_score":0.99940395},"labels":[],"label_agreement":null},{"id":"W41445881","doi":"","title":"Tight Bounds for Point Recolouring.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Sequence (biology); Point (geometry); Set (abstract data type); Upper and lower bounds; Matching (statistics); Mathematics; Combinatorics; Iterative method; Computer science; Algorithm; Geometry; Mathematical analysis; Statistics","score_opus":0.020996723931934257,"score_gpt":0.23916707461103823,"score_spread":0.21817035067910398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41445881","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.017700063,0.00007854349,0.9548146,0.008304976,0.0010076083,0.00043573673,0.00009507935,0.00014531739,0.017418047],"genre_scores_gemma":[0.92642456,0.0000017542926,0.068839066,0.0018968744,0.0003540039,0.00006751647,0.00035257568,0.000014838045,0.002048808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822044,0.000044487046,0.00034065128,0.0005541523,0.0003664384,0.00047380076],"domain_scores_gemma":[0.99839884,0.00033560777,0.000112779046,0.00027619908,0.00055569306,0.00032090774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003232096,0.00021354205,0.0001893944,0.0009357132,0.00044430117,0.00043771273,0.0005541477,0.000105032246,0.0001477973],"category_scores_gemma":[0.00008318921,0.000236453,0.00010605996,0.0008850179,0.00004689963,0.00035916927,0.000041387117,0.0001383448,0.00016896403],"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.0000072536805,0.000047205904,0.00015254093,0.000011281279,0.000015306536,0.000010041799,0.00002879918,0.07989791,0.000034755143,0.8779983,0.024484884,0.017311761],"study_design_scores_gemma":[0.00076626305,0.00023098559,0.018136207,0.000029795809,0.000007881375,0.000032662836,0.000012943847,0.54066974,0.0002752136,0.3693996,0.06991603,0.00052264554],"about_ca_topic_score_codex":0.0021021701,"about_ca_topic_score_gemma":0.0063318494,"teacher_disagreement_score":0.9087245,"about_ca_system_score_codex":0.0003122371,"about_ca_system_score_gemma":0.0014297218,"threshold_uncertainty_score":0.9642274},"labels":[],"label_agreement":null},{"id":"W41584405","doi":"","title":"Diagonal flips of pseudo triangulations on the sphere.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Diagonal; Mathematics; Combinatorics; Geometry; Pure mathematics","score_opus":0.022131219918457592,"score_gpt":0.2472481836692579,"score_spread":0.22511696375080031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41584405","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.96220106,0.00005990743,0.025190985,0.003488236,0.0016478933,0.00018471731,0.000001981062,0.000060096274,0.007165154],"genre_scores_gemma":[0.99768716,0.000008106306,0.0015824887,0.00020662352,0.00002293254,0.000012209239,0.000004876856,0.000004087016,0.00047151372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991573,0.00008387623,0.00018464665,0.00016856533,0.0002854227,0.00012017495],"domain_scores_gemma":[0.99901813,0.0004077634,0.000083268525,0.00034070163,0.000108979686,0.000041164418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002695649,0.0000786367,0.00009094976,0.000062011604,0.00014262063,0.00004759532,0.0004016761,0.000032847358,0.00008286753],"category_scores_gemma":[0.000086545995,0.000059945094,0.000060806906,0.00064827246,0.000027842236,0.00015744312,0.00006622558,0.00008123001,0.00006493782],"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.0000062347194,0.000089551395,0.00033421675,0.0000011941266,0.000010330991,0.0000019709053,0.00012102955,0.0013531515,0.00023028323,0.98669034,0.0026270952,0.008534589],"study_design_scores_gemma":[0.00062083185,0.0001454562,0.019903522,0.0000134287375,0.0000065675426,0.00001549244,0.000021604112,0.039770864,0.002797286,0.93033636,0.006233562,0.0001350166],"about_ca_topic_score_codex":0.0000073453625,"about_ca_topic_score_gemma":0.0000026237792,"teacher_disagreement_score":0.056353983,"about_ca_system_score_codex":0.000021078113,"about_ca_system_score_gemma":0.0000651807,"threshold_uncertainty_score":0.24444899},"labels":[],"label_agreement":null},{"id":"W4200147538","doi":"10.1002/mma.7951","title":"Distance distribution between two random points in arbitrary polygons","year":2021,"lang":"en","type":"article","venue":"Mathematical Methods in the Applied Sciences","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"British Columbia Knowledge Development Fund; Australian Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Foundation for Innovation","keywords":"Disjoint sets; Mathematics; Regular polygon; Polygon (computer graphics); Block (permutation group theory); Measure (data warehouse); Convex polygon; Distribution (mathematics); Simple (philosophy); Function (biology); Mathematical optimization; Computer science; Discrete mathematics; Mathematical analysis; Geometry; Data mining","score_opus":0.05924364329578239,"score_gpt":0.39419942712747363,"score_spread":0.3349557838316912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200147538","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.019656332,0.00010562977,0.97067225,0.0025856853,0.000085328495,0.00020013291,0.0000028477152,0.000028265456,0.006663514],"genre_scores_gemma":[0.390067,0.0000024035844,0.6095211,0.00030528483,0.000040465195,0.000039951512,0.0000049294804,0.000001928434,0.000016945896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769264,0.00073314225,0.0004109159,0.0004155751,0.00046121547,0.0002865041],"domain_scores_gemma":[0.995962,0.0035549386,0.00007837208,0.00032981028,0.000027575175,0.000047303514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066082366,0.00011811724,0.0002448269,0.00009228312,0.00018906782,0.00023801449,0.00090610463,0.000039317314,0.00001647689],"category_scores_gemma":[0.00061463966,0.000081911945,0.000051130515,0.0023493385,0.00018752461,0.00022608603,0.00018041946,0.00020357354,0.00001772446],"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.000003605031,0.00008828257,0.0001434546,0.000013132136,0.0000025631368,0.0000064196543,0.00070665363,0.00054747815,0.0008376356,0.97100544,0.00002796877,0.02661734],"study_design_scores_gemma":[0.00043312192,0.000013044067,0.0021322316,0.000026602827,0.0000040737277,0.000013592494,0.00017706183,0.052313868,0.008542643,0.9359927,0.00023065317,0.000120411925],"about_ca_topic_score_codex":0.0000025533461,"about_ca_topic_score_gemma":0.0000050498334,"teacher_disagreement_score":0.37041068,"about_ca_system_score_codex":0.00003571573,"about_ca_system_score_gemma":0.000108675245,"threshold_uncertainty_score":0.3340272},"labels":[],"label_agreement":null},{"id":"W4206007017","doi":"10.1007/s00224-021-10067-4","title":"Computing Colourful Simplicial Depth and Median in ℝ2","year":2022,"lang":"en","type":"article","venue":"Theory of Computing Systems","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Point (geometry); Monochromatic color; Mathematics; Regular polygon; Convex hull; Geometry; Botany","score_opus":0.01638002623891829,"score_gpt":0.2502388252253005,"score_spread":0.2338587989863822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206007017","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.6095451,0.0002854018,0.3881111,0.000097711105,0.00081452687,0.00019692216,0.0000019738975,0.000065629974,0.00088161277],"genre_scores_gemma":[0.9962035,0.0000010793331,0.0034657344,0.00010996979,0.0001586215,0.0000039060533,0.00000587347,0.000008177873,0.000043149063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788874,0.00071569625,0.00047148496,0.00031938296,0.0003643522,0.0002403153],"domain_scores_gemma":[0.99861825,0.0007848861,0.00025502607,0.00021715632,0.000063220185,0.00006149263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026821422,0.00012295769,0.0002747278,0.000299498,0.00029371338,0.000067607405,0.00048275283,0.00003125704,0.0000050788235],"category_scores_gemma":[0.00006311187,0.0001371767,0.00003825201,0.00066059927,0.000047223333,0.00010201469,0.0005594297,0.00018244964,0.000002128159],"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.00002456321,0.00008759827,0.0029503147,0.00007454102,0.000022191134,0.000017004211,0.006039701,0.4296976,0.0007327655,0.50088626,0.00016784422,0.059299614],"study_design_scores_gemma":[0.0005855445,0.00016670502,0.0152672995,0.000050597748,0.000004693923,0.00011744481,0.00074505206,0.9699735,0.00015388003,0.012173585,0.0005558051,0.00020590633],"about_ca_topic_score_codex":0.000060280356,"about_ca_topic_score_gemma":0.000007897405,"teacher_disagreement_score":0.5402759,"about_ca_system_score_codex":0.00007338878,"about_ca_system_score_gemma":0.00009428689,"threshold_uncertainty_score":0.55939037},"labels":[],"label_agreement":null},{"id":"W4210962357","doi":"10.1016/j.tcs.2010.12.002","title":"Preface","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.0060113087908003175,"score_gpt":0.244440654640883,"score_spread":0.23842934585008269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210962357","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.09491672,0.0000053361878,0.89613575,0.0011899557,0.0015801245,0.00008367153,3.6827305e-7,0.00020005126,0.005888048],"genre_scores_gemma":[0.6774964,4.6376113e-7,0.32188874,0.00040976942,0.0001795089,0.0000028875934,4.3672603e-7,0.000002424746,0.000019392473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834365,0.000033689386,0.00016318305,0.00052993355,0.0005798333,0.00034970863],"domain_scores_gemma":[0.9987332,0.00014370854,0.00003699661,0.00064179144,0.00021045866,0.00023384992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010611793,0.000110648725,0.000093838185,0.00017073963,0.00038944537,0.00046649307,0.0018884123,0.000039141694,0.00007764938],"category_scores_gemma":[0.00009785101,0.00009307211,0.000039075094,0.0012355449,0.0011026209,0.00078691967,0.0006656409,0.00023685087,0.00018691894],"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.0000010949391,0.000026797024,0.000017800126,0.0000010893334,8.58826e-7,0.0000022862419,0.00008727254,0.00027935766,0.010853426,0.9190001,0.00006477943,0.069665164],"study_design_scores_gemma":[0.00011323804,0.000073286334,0.0019116355,0.000002758713,0.0000011996547,0.000055499535,6.442781e-7,0.7214768,0.023295915,0.2512199,0.001690462,0.00015866548],"about_ca_topic_score_codex":8.1469926e-7,"about_ca_topic_score_gemma":6.800322e-7,"teacher_disagreement_score":0.7211974,"about_ca_system_score_codex":0.000014404962,"about_ca_system_score_gemma":0.00015238806,"threshold_uncertainty_score":0.44984034},"labels":[],"label_agreement":null},{"id":"W4213085510","doi":"10.1002/jgt.20435","title":"Crossing numbers of imbalanced graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; City University of New York; National Science Foundation","keywords":"Combinatorics; Mathematics; Crossing number (knot theory); Lemma (botany); Upper and lower bounds; Graph; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.008208351662810852,"score_gpt":0.25423736050602413,"score_spread":0.24602900884321327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213085510","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.44556224,0.0005313191,0.5522228,0.00025893413,0.00038765272,0.00002542113,4.166823e-7,0.000010532695,0.001000665],"genre_scores_gemma":[0.9730292,0.00002339365,0.026587257,0.0002538294,0.000060457463,1.1825432e-7,2.8851716e-7,0.0000018792883,0.000043559503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912655,0.00009238522,0.00034024607,0.000079387166,0.00026131247,0.000100139056],"domain_scores_gemma":[0.9990971,0.00011120188,0.00037550394,0.00013013322,0.00022923648,0.000056821995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008651477,0.000065064734,0.00014931474,0.00029278852,0.000090315785,0.00007585658,0.00034332697,0.000028852484,0.0000072925573],"category_scores_gemma":[0.000057915015,0.00005416437,0.00016054117,0.0005644254,0.00005700551,0.00041772486,0.00001609921,0.00010348375,0.000001059886],"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.00008904433,0.0001328954,0.00042624606,0.00000759133,0.000044287688,0.000018798444,0.0009876747,0.0043441537,0.031852238,0.8388256,0.0005759189,0.12269558],"study_design_scores_gemma":[0.000461707,0.0002824656,0.020561703,0.000044806813,0.000010725154,0.00013154683,0.00003611528,0.0007316565,0.013418184,0.96388716,0.00034743076,0.00008652965],"about_ca_topic_score_codex":4.404729e-7,"about_ca_topic_score_gemma":1.952433e-7,"teacher_disagreement_score":0.52746695,"about_ca_system_score_codex":0.000010418268,"about_ca_system_score_gemma":0.00008455566,"threshold_uncertainty_score":0.2208759},"labels":[],"label_agreement":null},{"id":"W4213149062","doi":"10.1137/1.9781611973068.21","title":"Optimal Halfspace Range Reporting in Three Dimensions","year":2009,"lang":"en","type":"article","venue":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":24,"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":"Range (aeronautics); Half-space; Partition (number theory); Binary logarithm; Time complexity; Mathematics; Data structure; Space (punctuation); Computational geometry; Combinatorics; Mathematical analysis; Discrete mathematics; Computer science; Algorithm","score_opus":0.017481827238139864,"score_gpt":0.26925351065210856,"score_spread":0.2517716834139687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213149062","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.9458971,0.00039844797,0.016807318,0.030404419,0.001497221,0.0010399178,0.000023249235,0.00025509574,0.0036772406],"genre_scores_gemma":[0.937492,0.000032668613,0.061130088,0.00042178505,0.00020547195,0.000024927529,0.0000044956964,0.000015983056,0.0006725438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702877,0.000023242945,0.0009816452,0.0006675734,0.0008104289,0.000488352],"domain_scores_gemma":[0.9978041,0.00008352784,0.0011092101,0.000442553,0.00042228526,0.00013832658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147786,0.0002921705,0.00037047852,0.00028118902,0.00025733703,0.00017515074,0.001392264,0.00011552784,0.0000039295796],"category_scores_gemma":[0.00057703163,0.00022307504,0.00023765398,0.0013256496,0.00007204339,0.0010162586,0.0005870017,0.00035974703,0.000008103904],"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.0010929935,0.0044858893,0.053225063,0.0006989531,0.00051134254,0.00012656876,0.038117856,0.14942846,0.25387082,0.32414493,0.038091652,0.13620546],"study_design_scores_gemma":[0.005069251,0.0034605558,0.2737713,0.0013914634,0.00015764982,0.00033323953,0.0016523708,0.4597019,0.13246258,0.1149552,0.0043352204,0.002709286],"about_ca_topic_score_codex":0.000029218776,"about_ca_topic_score_gemma":0.0000037746224,"teacher_disagreement_score":0.3102734,"about_ca_system_score_codex":0.00007291017,"about_ca_system_score_gemma":0.000071163544,"threshold_uncertainty_score":0.90967363},"labels":[],"label_agreement":null},{"id":"W4214534767","doi":"10.22215/etd/2005-07585","title":"Arbitrary 2-element H-coarsening of a TTH-generated hexahedral FEA mesh","year":2005,"lang":"en","type":"dissertation","venue":"","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; Canadian Heritage","funders":"","keywords":"Hexahedron; Finite element method; Humanities; Engineering; Structural engineering; Art","score_opus":0.01459988561355716,"score_gpt":0.26564496675457916,"score_spread":0.251045081141022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214534767","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.44024315,0.0022148774,0.4252386,0.0008078015,0.0050041093,0.0012277168,0.000033464417,0.0006491145,0.12458113],"genre_scores_gemma":[0.7157734,0.00012547961,0.23509474,0.000638608,0.0008274031,0.00007265884,0.0030226996,0.000046536803,0.044398442],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978072,0.00007471454,0.00065463624,0.0005586718,0.0006272305,0.0002775238],"domain_scores_gemma":[0.9987309,0.00006195925,0.00036134708,0.0003963138,0.0003498577,0.0000996256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025911885,0.00030143812,0.00035797548,0.00043031157,0.000119137236,0.00012944805,0.00059928984,0.00019431811,0.00024494182],"category_scores_gemma":[0.000024165576,0.00030109068,0.00016929918,0.00074837776,0.000012849736,0.000419485,0.00007069198,0.00022237944,0.000042770425],"study_design_candidate":"bench_or_experimental","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.00015543828,0.0007282455,0.00013646463,0.00041526812,0.0004911494,0.000043982644,0.0043700878,0.020993786,0.05324147,0.44067356,0.024474576,0.45427597],"study_design_scores_gemma":[0.0020858839,0.00055996847,0.005626155,0.00037192518,0.00014664134,0.000047044367,0.0006910905,0.4370761,0.5154062,0.006190725,0.029724328,0.002073949],"about_ca_topic_score_codex":0.000035589717,"about_ca_topic_score_gemma":0.00020716245,"teacher_disagreement_score":0.46216473,"about_ca_system_score_codex":0.000062168445,"about_ca_system_score_gemma":0.00043980192,"threshold_uncertainty_score":0.99994415},"labels":[],"label_agreement":null},{"id":"W4214706793","doi":"10.1007/978-0-387-30162-4_158","title":"Fully Dynamic Transitive Closure","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","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 Victoria","funders":"","keywords":"Transitive closure; Transitive relation; Closure (psychology); Mathematics; Computer science; Combinatorics; Political science","score_opus":0.009003476063443532,"score_gpt":0.22086136558508068,"score_spread":0.21185788952163714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214706793","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048758124,0.0024586662,0.3994597,0.00039557114,0.0012984786,0.00030973103,0.00008343534,0.00012273075,0.59582293],"genre_scores_gemma":[0.0018224803,0.012092985,0.15305886,0.00022977042,0.0009444096,0.000021761261,0.00035380968,0.00008049956,0.83139545],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801385,0.00002674319,0.0005057155,0.0005858433,0.0006406875,0.0002271855],"domain_scores_gemma":[0.99868786,0.00012729585,0.0002949953,0.00047124084,0.00030474676,0.000113869755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014404034,0.00035554462,0.00044083863,0.00032989288,0.0001046421,0.000025961792,0.00056212506,0.0002960607,0.000091484806],"category_scores_gemma":[0.00001567652,0.0003718017,0.00026387948,0.0001418184,0.00009621828,0.0002760845,0.00011324852,0.0003477883,0.00011619694],"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.000026605056,0.0001390815,0.0000057583143,0.00012600636,0.00033786177,0.00036104335,0.0030398231,0.0019906138,0.000050910498,0.14447957,0.019558463,0.82988423],"study_design_scores_gemma":[0.0007979496,0.0005080642,0.00056878495,0.00018323581,0.00008144562,0.00023289704,0.000009475972,0.034672648,0.000112985945,0.043582473,0.91809696,0.0011530785],"about_ca_topic_score_codex":0.000005437527,"about_ca_topic_score_gemma":0.00000718769,"teacher_disagreement_score":0.8985385,"about_ca_system_score_codex":0.000064178974,"about_ca_system_score_gemma":0.00035723642,"threshold_uncertainty_score":0.9998734},"labels":[],"label_agreement":null},{"id":"W4220743987","doi":"10.1145/3508372","title":"A Large-Scale Comparison of Tetrahedral and Hexahedral Elements for Solving Elliptic PDEs with the Finite Element Method","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Advanced Micro Devices; National Science Foundation","keywords":"Hexahedron; Finite element method; Tetrahedron; Benchmark (surveying); Solver; Mesh generation; Computer science; Polygon mesh; Applied mathematics; Basis (linear algebra); Partial differential equation; Computational science; Algorithm; Mathematical optimization; Mathematics; Geometry; Mathematical analysis; Structural engineering; Engineering","score_opus":0.028128357443453322,"score_gpt":0.30409571897500487,"score_spread":0.27596736153155155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220743987","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.03896874,0.00010721579,0.95877165,0.0015942601,0.00013554154,0.0003369579,0.000045956505,0.000030334368,0.000009324461],"genre_scores_gemma":[0.7911402,0.000010708527,0.20830625,0.00031546588,0.000013166381,0.0001505354,0.000012489786,0.00000659906,0.00004459149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884796,0.00009606104,0.00024208202,0.00026003612,0.00036205942,0.00019181622],"domain_scores_gemma":[0.99881816,0.00060988707,0.00011575664,0.00033153305,0.000084166386,0.000040496492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006107094,0.00011050031,0.00014169174,0.00019916665,0.0008472208,0.00005402451,0.00040159913,0.00002074102,0.00001704325],"category_scores_gemma":[0.00001121778,0.00008804388,0.000073720395,0.0006891764,0.00003393813,0.0001497167,0.00002998126,0.00018770619,2.7686855e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002627354,0.0019018047,0.0028559654,0.00011939158,0.00038444207,0.0000018282483,0.013691574,0.8360256,0.001789756,0.044329718,0.0005322238,0.098104954],"study_design_scores_gemma":[0.0011393689,0.0013037171,0.0012456774,0.000011311866,0.00007794621,0.000009144009,0.0016498518,0.97555226,0.0044364054,0.005817697,0.008556801,0.00019982165],"about_ca_topic_score_codex":0.0000054925117,"about_ca_topic_score_gemma":0.00008691445,"teacher_disagreement_score":0.75217146,"about_ca_system_score_codex":0.000020892727,"about_ca_system_score_gemma":0.00004807011,"threshold_uncertainty_score":0.65162235},"labels":[],"label_agreement":null},{"id":"W4221136435","doi":"10.1142/9789811254857_0005","title":"Infinite Dimensional Spaces","year":2022,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidad de Valladolid; Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia y Tecnología; Canada Research Chairs","keywords":"Pure mathematics; Mathematics","score_opus":0.02659578999321846,"score_gpt":0.23158650761961427,"score_spread":0.2049907176263958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221136435","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007780569,0.000287239,0.0032004414,0.0005330524,0.00578535,0.00025728214,0.000034282057,0.00020870214,0.98961586],"genre_scores_gemma":[0.0029686715,4.970736e-7,0.006019648,0.00039474005,0.00022747897,0.000019496098,0.00014385149,0.00002296129,0.99020267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971406,0.000040233426,0.0003675207,0.00095462525,0.0012144662,0.00028256196],"domain_scores_gemma":[0.9984281,0.00016012117,0.00025162546,0.0008331544,0.00017855842,0.00014844556],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000701787,0.0002916793,0.00025386788,0.0011128471,0.00093789294,0.00078403746,0.00095915707,0.00007003417,0.0016410587],"category_scores_gemma":[0.00000826416,0.000306318,0.00018776822,0.00020137813,0.0001848941,0.00019857164,0.0008788705,0.00042249495,0.0003522022],"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.0000030656363,0.000009641756,7.919988e-7,0.000008715206,0.000022519893,0.000026167172,0.00014110819,0.00079082185,0.00019839055,0.9139655,0.0764238,0.008409453],"study_design_scores_gemma":[0.000105237414,0.0000235776,0.0000060784514,0.00002901981,0.000011337292,0.00001494052,8.7604894e-7,0.003089783,0.00011947411,0.05913542,0.937143,0.0003212283],"about_ca_topic_score_codex":0.0000018454061,"about_ca_topic_score_gemma":0.00018541704,"teacher_disagreement_score":0.8607192,"about_ca_system_score_codex":0.000106806474,"about_ca_system_score_gemma":0.0003937883,"threshold_uncertainty_score":0.9999389},"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":"W4226530376","doi":"10.4230/lipics.socg.2022.71","title":"Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge)","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Agence Nationale de la Recherche","keywords":"Partition (number theory); Plane (geometry); Combinatorics; Partition problem; Line segment; Mathematics; Set (abstract data type); Computer science; Line (geometry); Geometry","score_opus":0.03651706458180236,"score_gpt":0.2986221419772685,"score_spread":0.2621050773954661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226530376","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.023747183,0.0002113756,0.9664146,0.0014571449,0.0025391316,0.0030041237,0.0014488483,0.00031141556,0.00086621713],"genre_scores_gemma":[0.8782885,0.00011756807,0.09468743,0.0020788522,0.0006181307,0.0026565983,0.021058775,0.00009522233,0.00039892338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570274,0.00012469436,0.0014778951,0.0007422492,0.0010906121,0.0008617851],"domain_scores_gemma":[0.9966777,0.0005058032,0.00064458756,0.0011665992,0.00069594855,0.00030936897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014026995,0.00063569105,0.00068757805,0.0008180172,0.0007645535,0.00068859325,0.0018367463,0.00046818733,0.00008118853],"category_scores_gemma":[0.00006166517,0.0006796911,0.00056506315,0.0004645865,0.00014680006,0.0007902076,0.0013633212,0.00094388786,0.000048266338],"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.001490503,0.002821557,0.00072153605,0.012476081,0.001181874,0.000031289583,0.04079827,0.61844903,0.00018929395,0.1556375,0.031219885,0.13498315],"study_design_scores_gemma":[0.0028913387,0.00076786283,0.000100181336,0.00015018265,0.00005457596,0.000013209329,0.0006084225,0.8386733,0.0016897208,0.003972633,0.15024956,0.0008290451],"about_ca_topic_score_codex":0.000041791824,"about_ca_topic_score_gemma":0.000039582334,"teacher_disagreement_score":0.8717271,"about_ca_system_score_codex":0.00037196913,"about_ca_system_score_gemma":0.0006263644,"threshold_uncertainty_score":0.9995654},"labels":[],"label_agreement":null},{"id":"W4229729166","doi":"10.1007/978-0-387-39940-9_3639","title":"Spatial Access Methods","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","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 Waterloo","funders":"","keywords":"Computer science; Geography","score_opus":0.03498329616674846,"score_gpt":0.3254719961991341,"score_spread":0.29048870003238564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229729166","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.0000019988008,0.0016024215,0.583106,0.000048020043,0.0021137192,0.00030343162,0.00014135518,0.00006929191,0.41261378],"genre_scores_gemma":[0.00077570835,0.0026718478,0.2607659,0.0001933943,0.004084922,0.00004867906,0.002041831,0.00007718445,0.72934055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99756306,0.00013332877,0.0007761826,0.000663841,0.00064391474,0.00021964814],"domain_scores_gemma":[0.99756026,0.0002827573,0.0006351968,0.0011134038,0.0002670519,0.00014131147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081603555,0.00035227067,0.00056589674,0.00042884037,0.00007972735,0.00014782003,0.0014002131,0.00020381271,0.00007816146],"category_scores_gemma":[0.00008444039,0.00034640104,0.00015104604,0.00014353005,0.00003616219,0.00075365236,0.00050619774,0.00027379234,0.00007775815],"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.0000095028545,0.000045800825,0.000005877654,0.00027147878,0.00008671938,0.000042715765,0.000088551635,0.00095112674,0.00008756872,0.49425033,0.023707556,0.48045278],"study_design_scores_gemma":[0.00020949046,0.00008444179,0.00004337725,0.00029454927,0.00004263512,0.00003301747,0.000001573399,0.011921024,0.00015147086,0.00528367,0.9814887,0.000446018],"about_ca_topic_score_codex":0.00013285491,"about_ca_topic_score_gemma":0.000015824613,"teacher_disagreement_score":0.9577812,"about_ca_system_score_codex":0.00005346019,"about_ca_system_score_gemma":0.00032038262,"threshold_uncertainty_score":0.9998988},"labels":[],"label_agreement":null},{"id":"W4230151408","doi":"10.1090/dol/026/13","title":"Section 13. Semi-regular Lattice Polygons","year":2003,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","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 Waterloo","funders":"","keywords":"Section (typography); Geometry; Lattice (music); Materials science; Physics; Mathematics; Computer science; Operating system; Acoustics","score_opus":0.01459336468174718,"score_gpt":0.2351169862756354,"score_spread":0.22052362159388822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230151408","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.00007863339,0.00007058894,0.570339,0.0005049749,0.00023554721,0.00025257605,0.000006797681,0.00021480447,0.42829704],"genre_scores_gemma":[0.0027689976,0.000042924825,0.22889957,0.005499431,0.00074809714,0.00005434609,0.00003574498,0.00010731606,0.76184356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977382,0.000049572533,0.00049281336,0.00067153334,0.0006748214,0.00037307476],"domain_scores_gemma":[0.99821925,0.00031281196,0.00038530622,0.00069544703,0.00016641064,0.00022077005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034795498,0.0004311712,0.00054575765,0.0000773206,0.00027280542,0.00018118497,0.00051714526,0.00024048082,0.00013391841],"category_scores_gemma":[0.000036915753,0.00042344976,0.0005554187,0.000110111694,0.0003492206,0.00011596976,0.00019731472,0.0004999784,0.0002438769],"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.0000019866773,0.000036077745,5.1188135e-7,0.00007299275,0.00018049472,0.0000057750312,0.0005864759,0.00007310847,0.00014212017,0.963543,0.012511391,0.022846071],"study_design_scores_gemma":[0.00026774945,0.00020812516,0.0000071633694,0.0001388021,0.0001426355,0.0001246216,0.000069603055,0.023053084,0.00031035527,0.6732978,0.30144504,0.0009350248],"about_ca_topic_score_codex":0.0000077074,"about_ca_topic_score_gemma":0.0000021640901,"teacher_disagreement_score":0.34143946,"about_ca_system_score_codex":0.0001618449,"about_ca_system_score_gemma":0.0001494905,"threshold_uncertainty_score":0.9998217},"labels":[],"label_agreement":null},{"id":"W4230767120","doi":"10.1090/conm/720/14524","title":"Spectral geometry","year":2018,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","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":"Université Laval","funders":"","keywords":"Mathematics; Geometry; Spectral geometry; Pure mathematics","score_opus":0.02667128914365567,"score_gpt":0.27401317847524126,"score_spread":0.24734188933158557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230767120","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.000037381735,0.0002864589,0.5507163,0.00029933307,0.00023509204,0.00041825965,0.000018352725,0.00076592347,0.44722295],"genre_scores_gemma":[0.0010697742,0.00006308876,0.6177911,0.00058873335,0.00089518586,0.00006589525,0.000057735648,0.00036998276,0.3790985],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966759,0.0000938952,0.0008195683,0.0008844608,0.0009590257,0.00056711526],"domain_scores_gemma":[0.9967633,0.00041184394,0.0009500841,0.0014194561,0.00012133702,0.00033400237],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006330839,0.00067521055,0.0011310161,0.0002602924,0.00015312685,0.00030146545,0.0015596657,0.00029235333,0.0019439204],"category_scores_gemma":[0.0001742027,0.0006016883,0.0006398195,0.001351042,0.00065699813,0.00022737675,0.00053600885,0.00034705663,0.0032404207],"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.0000012931705,0.00034643477,0.0000054863967,0.0004398954,0.00025090558,0.000009789689,0.0005719659,0.0000022106842,0.000024853443,0.11368728,0.88328874,0.001371165],"study_design_scores_gemma":[0.0006918474,0.00041388214,0.00001697037,0.00076281227,0.00009474174,0.00008558702,0.00046251214,0.080654435,0.00021118499,0.16316248,0.75160533,0.0018382319],"about_ca_topic_score_codex":0.000016230886,"about_ca_topic_score_gemma":0.0000016743861,"teacher_disagreement_score":0.13168341,"about_ca_system_score_codex":0.000104832325,"about_ca_system_score_gemma":0.00032363582,"threshold_uncertainty_score":0.99964345},"labels":[],"label_agreement":null},{"id":"W4231366617","doi":"10.22215/etd/2020-14188","title":"Routing on Heavy Path WSPD Spanners","year":2020,"lang":"en","type":"dissertation","venue":"","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":"Combinatorics; Spanner; Bounded function; Vertex (graph theory); Mathematics; Parameterized complexity; Routing (electronic design automation); Graph; Spanning tree; Discrete mathematics; Equal-cost multi-path routing; Static routing; Computer science; Computer network; Distributed computing; Routing protocol","score_opus":0.016889234975027367,"score_gpt":0.25901039460150393,"score_spread":0.24212115962647657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231366617","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.015047182,0.00021392218,0.7106022,0.0033560744,0.006024396,0.0005684796,0.000006826371,0.00085655786,0.26332432],"genre_scores_gemma":[0.90762186,0.000035029483,0.0490195,0.0035013668,0.0009818432,0.000039960658,0.0016884756,0.00004214662,0.0370698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985002,0.00004451065,0.00026399465,0.00055431545,0.00044354142,0.0001933935],"domain_scores_gemma":[0.9992911,0.00008407888,0.00014373774,0.00026053097,0.00011096005,0.00010956696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012557601,0.00021912417,0.00019521419,0.00015404091,0.00014778555,0.00022447441,0.0004809295,0.00012987667,0.00004703888],"category_scores_gemma":[0.00007562039,0.00020958047,0.000107408254,0.0005168874,0.0000043123646,0.00019596312,0.00004370376,0.0002457436,0.00035433],"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.0000645113,0.00010875102,0.000014003856,0.000092474365,0.00006395067,0.00004096876,0.0024214431,0.006463819,0.0008189049,0.7700413,0.023800729,0.19606917],"study_design_scores_gemma":[0.001018522,0.0009890073,0.0037833073,0.00039592464,0.000055053333,0.000016191483,0.0008533616,0.8400685,0.04125718,0.013953965,0.09549842,0.0021105588],"about_ca_topic_score_codex":0.000013114215,"about_ca_topic_score_gemma":0.000016400174,"teacher_disagreement_score":0.89257467,"about_ca_system_score_codex":0.000047596815,"about_ca_system_score_gemma":0.00019658564,"threshold_uncertainty_score":0.85464436},"labels":[],"label_agreement":null},{"id":"W4231412948","doi":"10.2514/6.2013-149","title":"Anisotropic Mesh Adaptation: Recovering Quasi-structured Meshes","year":2013,"lang":"en","type":"article","venue":"51st AIAA Aerospace Sciences Meeting including the New Horizons Forum and Aerospace Exposition","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":"University of British Columbia","funders":"","keywords":"Polygon mesh; Computer science; Adaptation (eye); Anisotropy; Computational science; Computer graphics (images); Physics; Optics","score_opus":0.022546886966462384,"score_gpt":0.24835053153325132,"score_spread":0.22580364456678892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231412948","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.329729,0.00089914986,0.6212548,0.04412694,0.001500977,0.00071179325,0.000004150168,0.00039872722,0.0013745086],"genre_scores_gemma":[0.89247566,0.00014216879,0.10589347,0.0005499191,0.00032977233,0.000046827878,0.000010004624,0.000016821557,0.0005353512],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971318,0.00020764225,0.0004022768,0.0008225389,0.0007573697,0.0006783403],"domain_scores_gemma":[0.99836683,0.00045951636,0.00034817518,0.00042061266,0.00017005777,0.0002348321],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007540387,0.00035062263,0.000278897,0.00019267874,0.0028201903,0.00164048,0.0009045306,0.00011906331,0.000024371551],"category_scores_gemma":[0.00024119072,0.00027410797,0.00010864429,0.0014146663,0.000271269,0.0023323286,0.00044152554,0.00025092988,0.000053901855],"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.000055850513,0.0002062912,0.008141221,0.00009039195,0.00015072359,0.00000914962,0.013956142,0.057669315,0.39773363,0.3503601,0.047666732,0.12396045],"study_design_scores_gemma":[0.0025770662,0.0032904462,0.009867841,0.0007329369,0.00010438612,0.00031444133,0.015528376,0.7889872,0.074195914,0.0901417,0.011716393,0.0025432766],"about_ca_topic_score_codex":0.00051007274,"about_ca_topic_score_gemma":0.0002620733,"teacher_disagreement_score":0.7313179,"about_ca_system_score_codex":0.00011498569,"about_ca_system_score_gemma":0.00018618464,"threshold_uncertainty_score":0.9999711},"labels":[],"label_agreement":null},{"id":"W4231650651","doi":"10.17771/pucrio.acad.34613","title":"UMA METODOLOGIA BASEADA EM OTIMIZAÇÃO QUADRÁTICA PARA GERAÇÃO DE MALHAS GEOMECÂNICAS DE RESERVATÓRIOS","year":2018,"lang":"pt","type":"dissertation","venue":"","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":"Geomechanica (Canada)","funders":"","keywords":"Polygon mesh; Computer science; Regular polygon; Volume mesh; Mathematical optimization; Process (computing); Interpretation (philosophy); Quadratic equation; Mesh generation; Geology; Algorithm; Mathematics; Finite element method; Engineering; Geometry; Computer graphics (images)","score_opus":0.07288871661943273,"score_gpt":0.3430118199027804,"score_spread":0.27012310328334765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231650651","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.2459631,0.00053779705,0.74632293,0.0009953972,0.0021325347,0.0007920198,0.000043612366,0.00035295953,0.0028596567],"genre_scores_gemma":[0.48390624,0.00031971952,0.4374576,0.0042203404,0.001533778,0.00027254142,0.0023268964,0.0001599972,0.06980291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99206567,0.0011681715,0.001514297,0.002072665,0.0014366735,0.0017425118],"domain_scores_gemma":[0.9939756,0.00127544,0.00081959966,0.0016761097,0.0014460525,0.00080722093],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0033840383,0.0010722941,0.0010316637,0.00089315465,0.0010556555,0.0011293972,0.002558793,0.0011289474,0.0031796307],"category_scores_gemma":[0.0014229644,0.0011045174,0.000579999,0.0022061362,0.000133893,0.0009847349,0.0005025411,0.0010419219,0.0014042814],"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.002732074,0.0046273125,0.0048394767,0.0029715844,0.0031177697,0.0015171894,0.064758286,0.13414074,0.025410436,0.10870619,0.1837982,0.46338072],"study_design_scores_gemma":[0.001272564,0.0009177805,0.016137758,0.0003303867,0.0002897001,0.000219904,0.0018968374,0.9505608,0.012929188,0.006658951,0.0068451082,0.0019409906],"about_ca_topic_score_codex":0.00057315856,"about_ca_topic_score_gemma":0.00080522377,"teacher_disagreement_score":0.8164201,"about_ca_system_score_codex":0.00059107697,"about_ca_system_score_gemma":0.0027838869,"threshold_uncertainty_score":0.99990755},"labels":[],"label_agreement":null},{"id":"W4231917931","doi":"10.1142/s021819590500183x","title":"GUEST EDITORS' FOREWORD","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","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":true,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Library science; Computer science","score_opus":0.00928222932080469,"score_gpt":0.2835271118827819,"score_spread":0.2742448825619772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231917931","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.0017478258,0.00049918215,0.9848698,0.007151857,0.0038822733,0.00025193556,0.000021512034,0.00007993704,0.0014957004],"genre_scores_gemma":[0.5799876,0.00006401948,0.38524708,0.0013642252,0.032815468,0.000078303616,0.00010044808,0.000020764197,0.0003221067],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968523,0.00006374121,0.0009947263,0.00032656448,0.0015274507,0.00023525722],"domain_scores_gemma":[0.9955614,0.0004937604,0.00074340956,0.0002694179,0.0027172007,0.00021477282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060962164,0.00021196529,0.00024598197,0.0010893024,0.00017697593,0.00034280258,0.0019110794,0.0000919198,0.000092812465],"category_scores_gemma":[0.000087355176,0.00021372792,0.00024766548,0.0010905054,0.00006895899,0.0015140423,0.00022019072,0.00029724705,0.00023732505],"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.000041937164,0.000730401,0.00041734672,0.000012026177,0.0003472271,0.00001771875,0.00016976448,0.38078824,0.00029172545,0.19331385,0.035687022,0.38818276],"study_design_scores_gemma":[0.00081448315,0.00008903375,0.0018113483,0.000022002452,0.000020765792,0.00045986424,0.000017470033,0.028374197,0.0007497765,0.045130495,0.9222521,0.00025844306],"about_ca_topic_score_codex":0.0000021002174,"about_ca_topic_score_gemma":0.0000015484716,"teacher_disagreement_score":0.8865651,"about_ca_system_score_codex":0.00022909463,"about_ca_system_score_gemma":0.00037443382,"threshold_uncertainty_score":0.8715572},"labels":[],"label_agreement":null},{"id":"W4233122403","doi":"10.22215/etd/2008-07701","title":"Cutting a polygon with a line","year":2008,"lang":"en","type":"dissertation","venue":"","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":"Library and Archives Canada","funders":"","keywords":"Polygon (computer graphics); Line (geometry); Humanities; Computer science; Art; Mathematics; Geometry; Telecommunications","score_opus":0.011657059290522919,"score_gpt":0.24554175615269036,"score_spread":0.23388469686216745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233122403","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.06338398,0.00054569636,0.8567024,0.00028645506,0.00085512747,0.00028705233,0.0000016934936,0.0003903133,0.07754727],"genre_scores_gemma":[0.45079723,0.00016268964,0.35373712,0.00078386307,0.00082847336,0.00007571003,0.0014117335,0.000050164155,0.192153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892557,0.000020120713,0.00018572064,0.00036876867,0.00034310014,0.0001567033],"domain_scores_gemma":[0.99933887,0.000042559943,0.00012689167,0.00024465183,0.00018819298,0.000058862617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006596606,0.0001706901,0.00015215448,0.00021919831,0.00014803094,0.000100935664,0.00032239474,0.00009672,0.000026377218],"category_scores_gemma":[0.000016398193,0.00013831751,0.00004853884,0.0005398954,0.0000061260603,0.0002479314,0.00002370616,0.00014983931,0.00005742065],"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.00020351881,0.00046047693,0.00013062873,0.00029402823,0.00027220426,0.00027490323,0.0075894413,0.01642267,0.0038349798,0.15370259,0.015444895,0.80136967],"study_design_scores_gemma":[0.003671627,0.0025217612,0.011774792,0.0009625255,0.00014611662,0.0011550738,0.00083574955,0.73359585,0.13475019,0.007982354,0.09803419,0.0045697754],"about_ca_topic_score_codex":0.00002753091,"about_ca_topic_score_gemma":0.00008118796,"teacher_disagreement_score":0.7967999,"about_ca_system_score_codex":0.000023908879,"about_ca_system_score_gemma":0.0002671482,"threshold_uncertainty_score":0.56404245},"labels":[],"label_agreement":null},{"id":"W4233545931","doi":"10.1007/978-1-4939-2864-4_167","title":"Geometric Spanners","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","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":"Computer science","score_opus":0.01276372950238561,"score_gpt":0.22776448765994078,"score_spread":0.21500075815755518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233545931","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000043929135,0.0010683914,0.34885925,0.000327641,0.0013973825,0.0001431785,0.000027828888,0.000077779965,0.6480941],"genre_scores_gemma":[0.00023061215,0.0023549243,0.06419917,0.00009350024,0.0011175318,0.000009274956,0.000034748617,0.000036111436,0.9319241],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980392,0.000016589693,0.00048776838,0.0005498085,0.00066222437,0.0002444272],"domain_scores_gemma":[0.99840295,0.00023411686,0.00037432724,0.0005860111,0.00026935103,0.00013322229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002438814,0.00030763977,0.0003819049,0.0008845823,0.0000641059,0.000036154717,0.0007319337,0.00024063182,0.00026415748],"category_scores_gemma":[0.000060246453,0.0002634727,0.0002009065,0.00027094194,0.0000660218,0.00030797144,0.00027161118,0.00019277439,0.00039641495],"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.0000023302287,0.000017206858,0.0000028562058,0.000022457549,0.000053977827,0.00001780846,0.000047089456,0.0000730924,0.0000068941185,0.3778618,0.008424898,0.6134696],"study_design_scores_gemma":[0.00031377887,0.000153148,0.00009647109,0.00009733086,0.000026443498,0.000020248752,0.0000011307567,0.0010608641,0.00012312217,0.10639621,0.8912234,0.00048785016],"about_ca_topic_score_codex":0.000002771711,"about_ca_topic_score_gemma":9.404049e-7,"teacher_disagreement_score":0.8827985,"about_ca_system_score_codex":0.00006758286,"about_ca_system_score_gemma":0.00023888284,"threshold_uncertainty_score":0.99998176},"labels":[],"label_agreement":null},{"id":"W4233860150","doi":"10.1007/0-387-28387-0_3","title":"Metric Spaces","year":2005,"lang":"en","type":"book-chapter","venue":"Universitext","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 Alberta","funders":"","keywords":"Mathematics; Metric space; Space (punctuation); Measure (data warehouse); Euclidean space; Statement (logic); Set (abstract data type); Real-valued function; Metric (unit); Order (exchange); Function (biology); Euclidean distance; Real number; Euclidean geometry; Discrete mathematics; Combinatorics; Computer science; Geometry; Data mining","score_opus":0.013039608450417172,"score_gpt":0.19656998977186638,"score_spread":0.1835303813214492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233860150","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008000853,0.0007545446,0.17196813,0.00041056503,0.00029363116,0.00006610681,0.0000046392583,0.00009158269,0.8264028],"genre_scores_gemma":[0.002058465,0.00016534784,0.016042389,0.00023114501,0.00030122272,1.7006833e-7,0.000028473954,0.000008936526,0.98116386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992048,0.0000075906073,0.00009593339,0.0003120262,0.00026515717,0.00011447172],"domain_scores_gemma":[0.9993786,0.00006718994,0.00009887257,0.00027853154,0.00010399654,0.000072787036],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000058788166,0.0001524353,0.00013363513,0.00069196476,0.000101719896,0.00008944922,0.00049101125,0.00012532278,0.0006419141],"category_scores_gemma":[0.0000054888214,0.00017050604,0.00009655335,0.00017500954,0.000020831341,0.0003227781,0.00019705368,0.00013557609,0.0011620608],"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.000001285255,0.0000050944,4.3942705e-7,0.0000036562383,0.000024530931,0.000021527818,0.0000633038,0.0011031203,0.000003818292,0.8515985,0.014868281,0.13230646],"study_design_scores_gemma":[0.000108896915,0.000029096744,0.000011233598,0.0000135544515,0.000015431953,0.000007691569,0.0000029576981,0.0037446662,0.000014724711,0.0070414785,0.98881686,0.00019343161],"about_ca_topic_score_codex":0.00000228,"about_ca_topic_score_gemma":0.0000043509885,"teacher_disagreement_score":0.97394854,"about_ca_system_score_codex":0.00010742482,"about_ca_system_score_gemma":0.000093939314,"threshold_uncertainty_score":0.99961567},"labels":[],"label_agreement":null},{"id":"W4235350121","doi":"10.1142/9789812773289_0005","title":"I/O-Optimal Algorithms for Outerplanar Graphs","year":2006,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Algorithm; Mathematics; Combinatorics","score_opus":0.02919255905220694,"score_gpt":0.25067436191850984,"score_spread":0.2214818028663029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235350121","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013877303,0.00019094117,0.46554112,0.00015304226,0.0038869793,0.0005247906,0.00010379537,0.00019503108,0.52939045],"genre_scores_gemma":[0.00037957734,2.7014886e-7,0.08674633,0.00016921821,0.00039750242,0.000045355315,0.00034540848,0.000031367555,0.91188496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972435,0.00001754262,0.00049301423,0.0011417203,0.0006949648,0.00040925003],"domain_scores_gemma":[0.99829006,0.0001356806,0.0002764406,0.0008205024,0.0003330803,0.00014424573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006231339,0.00037668645,0.0003378559,0.0011285463,0.000626557,0.0009213954,0.0009932006,0.00014636415,0.000041563202],"category_scores_gemma":[0.0000050258163,0.0003885265,0.00034209597,0.00014145035,0.00019505694,0.00016086962,0.00020866604,0.00022840755,0.0001370744],"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.000004855883,0.000013975694,5.4428716e-7,0.00002531009,0.000032044027,0.000012343098,0.00008546449,0.0012552436,0.00008738349,0.7037213,0.26530397,0.029457573],"study_design_scores_gemma":[0.00021960733,0.00003812934,0.0000040446844,0.00005022918,0.000024407042,0.000010089647,6.082615e-7,0.023834297,0.0003973344,0.08806312,0.88694304,0.00041508462],"about_ca_topic_score_codex":0.0000026359178,"about_ca_topic_score_gemma":0.0002169659,"teacher_disagreement_score":0.6216391,"about_ca_system_score_codex":0.00007537529,"about_ca_system_score_gemma":0.00023029825,"threshold_uncertainty_score":0.99985665},"labels":[],"label_agreement":null},{"id":"W4235786133","doi":"10.1007/s003730200003","title":"Shattering News","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":42,"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":"Mathematics; Mathematical proof; Lemma (botany); Combinatorics; Algebraic number; Order (exchange); Interpretation (philosophy); Discrete mathematics; Combinatorial proof; Computer science","score_opus":0.018612892200936995,"score_gpt":0.19836112661229355,"score_spread":0.17974823441135657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235786133","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.51659423,0.0037369276,0.4593231,0.0030759885,0.0019637246,0.0001756421,0.0000012984436,0.00037790122,0.014751163],"genre_scores_gemma":[0.9970476,0.00019860815,0.0020373329,0.00033036855,0.000014222504,0.0000040907216,8.059981e-7,0.0000025488546,0.0003644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995294,0.000012419638,0.00008219292,0.00015984997,0.00011256113,0.00010356553],"domain_scores_gemma":[0.9997313,0.00002298862,0.000023606715,0.00013500868,0.000030662322,0.000056461056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048747093,0.000059909245,0.000057204492,0.00008514346,0.00011431321,0.00011588722,0.0001475238,0.000022729435,0.000012403837],"category_scores_gemma":[0.0000059895224,0.00005885453,0.00002258014,0.00041156381,0.000009896603,0.00021855214,0.000074493306,0.00004668707,0.000015152492],"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":[2.4566418e-7,0.000033819433,0.0010224293,0.0000047098824,0.0000038986714,0.000003988952,0.00017011048,0.00003771544,0.00007136146,0.9262872,0.0021307017,0.07023387],"study_design_scores_gemma":[0.00065149245,0.0001688595,0.00963151,0.0000115631665,0.000006402652,0.000054682932,0.000027534337,0.20265038,0.00047938683,0.73664516,0.04930889,0.00036415577],"about_ca_topic_score_codex":0.0000036861777,"about_ca_topic_score_gemma":5.616875e-7,"teacher_disagreement_score":0.48045337,"about_ca_system_score_codex":0.0000057288016,"about_ca_system_score_gemma":0.0000029500459,"threshold_uncertainty_score":0.24000181},"labels":[],"label_agreement":null},{"id":"W4238755360","doi":"10.22215/etd/2015-10924","title":"Plane Spanners of Degree Eight","year":2015,"lang":"en","type":"dissertation","venue":"","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":"Delaunay triangulation; Combinatorics; Degree (music); Graph; Mathematics; Triangulation; Plane (geometry); Set (abstract data type); Pitteway triangulation; Discrete mathematics; Computer science; Geometry; Physics","score_opus":0.038426447846968616,"score_gpt":0.28606632834220996,"score_spread":0.24763988049524135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238755360","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.09913189,0.0018868955,0.34285554,0.00040503812,0.0076457644,0.000607102,0.00003715759,0.00029895233,0.54713166],"genre_scores_gemma":[0.6507447,0.00009283982,0.16075099,0.00026842835,0.00068555947,0.000038032264,0.006866716,0.000043089804,0.18050967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891824,0.000026301328,0.00025410485,0.00025994983,0.0004275926,0.00011383017],"domain_scores_gemma":[0.9990879,0.00004515923,0.00017399495,0.0002702438,0.0003513393,0.00007135143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017752683,0.00013523485,0.00018899087,0.00023804334,0.000030508552,0.000040574043,0.00046519484,0.00012690715,0.000059602262],"category_scores_gemma":[0.00003733012,0.0001221968,0.00005842249,0.00036871893,0.000007442053,0.0001819826,0.00003220096,0.00009308577,0.00006571992],"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.00009155618,0.00024035023,0.000060714916,0.00031792093,0.00017553548,0.000017585002,0.0026491971,0.004153774,0.0037781158,0.2716661,0.17225882,0.5445903],"study_design_scores_gemma":[0.0045354157,0.0019120075,0.027425611,0.0007144052,0.0002915129,0.000091888614,0.0017247979,0.15406242,0.28343433,0.23321007,0.28790632,0.004691224],"about_ca_topic_score_codex":0.00003225405,"about_ca_topic_score_gemma":0.00012375438,"teacher_disagreement_score":0.5516128,"about_ca_system_score_codex":0.000025134104,"about_ca_system_score_gemma":0.00031982502,"threshold_uncertainty_score":0.4983041},"labels":[],"label_agreement":null},{"id":"W4238825183","doi":"10.1002/9780470317013.refs","title":"References","year":2008,"lang":"en","type":"book-chapter","venue":"Wiley series in probability and statistics","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":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Library science; Computer science","score_opus":0.031154761517434668,"score_gpt":0.23143855751828513,"score_spread":0.20028379600085044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238825183","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.00020475204,0.0040108724,0.8270904,0.00061431434,0.0010102831,0.0006684253,0.00046929912,0.00014634826,0.1657853],"genre_scores_gemma":[0.0022298046,0.011682185,0.8550556,0.00021361347,0.00015547509,0.000027758575,0.00026485752,0.000019882656,0.13035086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998758,0.000034220302,0.00035999864,0.00045307784,0.00024870835,0.00014596307],"domain_scores_gemma":[0.9991869,0.00018737084,0.00011656423,0.00031148468,0.00013504263,0.00006268402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019472372,0.00020178553,0.00025871999,0.00010575589,0.0001200889,0.000081389815,0.00025560887,0.00015873411,0.000046903817],"category_scores_gemma":[0.00010463808,0.00020359937,0.00002385982,0.00006157686,0.00023114227,0.00026116444,0.00018202074,0.00023864134,0.000012587912],"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.000008847147,0.000013586066,0.000034876062,0.00006760646,0.0000070898736,0.000020524507,0.0003093637,0.00012828213,4.6550682e-7,0.914198,0.0026899797,0.08252137],"study_design_scores_gemma":[0.00009378791,0.0001349837,0.0003611652,0.00008534501,0.0000045524116,0.00004246502,0.0000023969733,0.002694704,0.0000044087633,0.8435867,0.15274964,0.00023989327],"about_ca_topic_score_codex":0.0000090644335,"about_ca_topic_score_gemma":0.00019028186,"teacher_disagreement_score":0.15005966,"about_ca_system_score_codex":0.000048576865,"about_ca_system_score_gemma":0.00018730834,"threshold_uncertainty_score":0.83025414},"labels":[],"label_agreement":null},{"id":"W4240527869","doi":"10.1145/1109557.1109689","title":"A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"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":"Combinatorics; Convex hull; Amortized analysis; Computational geometry; k-nearest neighbors algorithm; Regular polygon; Mathematics; Set (abstract data type); Euclidean geometry; Plane (geometry); Data structure; Point (geometry); Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Geometry","score_opus":0.00865335346951196,"score_gpt":0.2471302054288218,"score_spread":0.23847685195930984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240527869","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.69907016,0.0018867573,0.23355792,0.043387283,0.0030374585,0.006351812,0.010282314,0.0007438758,0.0016824227],"genre_scores_gemma":[0.88673186,0.000051107643,0.10985055,0.00047258858,0.00044960072,0.000060913473,0.00058722636,0.00004893128,0.0017472509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975306,0.000023384951,0.0005110517,0.0008704371,0.00061432406,0.00045021923],"domain_scores_gemma":[0.99823225,0.00014611236,0.00042268806,0.0006217911,0.00045798923,0.000119178134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033742306,0.00036418997,0.00036448683,0.0001650346,0.000413956,0.00034804546,0.0022625225,0.00012735717,0.000005485927],"category_scores_gemma":[0.00013321397,0.00027970114,0.00013044728,0.00052599446,0.00018618323,0.0013743568,0.0014507247,0.00021289673,0.0000039094243],"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.0010496059,0.0024705578,0.012254754,0.0033978382,0.0015063824,0.000016875152,0.010220285,0.0098080225,0.100713685,0.44190428,0.1618329,0.25482482],"study_design_scores_gemma":[0.004233625,0.0014119411,0.028362574,0.00050199387,0.0002753737,0.00017231579,0.001180307,0.7891692,0.04045589,0.069192275,0.06319441,0.0018501017],"about_ca_topic_score_codex":0.000047902427,"about_ca_topic_score_gemma":0.00001267509,"teacher_disagreement_score":0.7793612,"about_ca_system_score_codex":0.000055892822,"about_ca_system_score_gemma":0.000086020744,"threshold_uncertainty_score":0.9999655},"labels":[],"label_agreement":null},{"id":"W4241516031","doi":"10.1090/dol/026/19","title":"Section 19. A Surprising Property of Regular Polygons","year":2003,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","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 Waterloo","funders":"","keywords":"Section (typography); Property (philosophy); Geometry; Computer science; Mathematics; Philosophy; Epistemology","score_opus":0.01932086541834645,"score_gpt":0.23616738113264799,"score_spread":0.21684651571430152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241516031","genre_codex":"methods","genre_gemma":"other","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.00009925858,0.00006030872,0.6479923,0.0002624604,0.00012622544,0.0003042634,0.0000052081723,0.00010479249,0.3510452],"genre_scores_gemma":[0.009734217,0.00004064999,0.42398965,0.0017372968,0.00033422158,0.00003740669,0.000020607213,0.0000853955,0.5640206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812543,0.000048072863,0.00052832306,0.00047975685,0.00057250477,0.00024591628],"domain_scores_gemma":[0.9984272,0.00019547438,0.0004918587,0.0005563759,0.00017874705,0.0001503328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039128456,0.00030263624,0.0005456688,0.000075326425,0.00017320474,0.0000725776,0.00038028858,0.00016435642,0.000045957386],"category_scores_gemma":[0.000048931302,0.0002351393,0.00047267735,0.00010036875,0.00039118208,0.000079481644,0.00015309369,0.00030931705,0.000025511024],"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.000004405395,0.000053525593,6.117409e-7,0.00019080531,0.00019434457,0.0000039613683,0.0011676447,0.00006857022,0.0008774693,0.92991793,0.008501702,0.059019044],"study_design_scores_gemma":[0.00041012574,0.00043637623,0.000008332422,0.0003898959,0.00016620898,0.00015649441,0.00014016652,0.017784307,0.0019281848,0.7231242,0.25437346,0.0010822342],"about_ca_topic_score_codex":0.000024623509,"about_ca_topic_score_gemma":0.0000018583204,"teacher_disagreement_score":0.24587175,"about_ca_system_score_codex":0.00011980784,"about_ca_system_score_gemma":0.00016203863,"threshold_uncertainty_score":0.95887023},"labels":[],"label_agreement":null},{"id":"W4242128187","doi":"10.1007/s00453-010-9392-2","title":"An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions","year":2010,"lang":"en","type":"article","venue":"Algorithmica","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":"Mathematics; Dimension (graph theory); Streaming algorithm; Combinatorics; Algorithm; Computational geometry; Space (punctuation); Theory of computation; Logarithm; Discrete mathematics; Computer science; Mathematical analysis; Upper and lower bounds","score_opus":0.010410805576977796,"score_gpt":0.27327333009197985,"score_spread":0.262862524515002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242128187","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.13309087,0.0000178922,0.8650266,0.0005752896,0.0008148156,0.00028301784,0.000026294354,0.000095258394,0.00006997873],"genre_scores_gemma":[0.29025504,0.0000021670926,0.70905465,0.00014596904,0.00026912248,0.000048416496,0.00008471113,0.000010940103,0.00012900817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871486,0.000039948496,0.00022851775,0.00046477496,0.00022372244,0.00032815096],"domain_scores_gemma":[0.99894303,0.00022874255,0.00006794227,0.0004155629,0.00019459044,0.00015010232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003107652,0.00014938103,0.00015272395,0.00022230305,0.00018721535,0.0001349912,0.00046583178,0.00009583831,0.000016191787],"category_scores_gemma":[0.000079370526,0.0001528321,0.00005536716,0.00048152133,0.000035731005,0.0005469529,0.00010275875,0.00021156669,0.000018333772],"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.0000059457443,0.00025621723,0.00008388483,0.000004066693,0.000012769262,0.00002565086,0.00036661635,0.0033151843,0.024022415,0.011652678,0.0008555161,0.95939904],"study_design_scores_gemma":[0.0005511513,0.00015560212,0.0021081145,0.0000062905456,0.000004354564,0.000036612353,0.000029571542,0.97851956,0.0127375685,0.0011851699,0.0044568027,0.00020920133],"about_ca_topic_score_codex":0.000046449386,"about_ca_topic_score_gemma":0.0000606811,"teacher_disagreement_score":0.97520435,"about_ca_system_score_codex":0.000025250607,"about_ca_system_score_gemma":0.00011754874,"threshold_uncertainty_score":0.62323123},"labels":[],"label_agreement":null},{"id":"W4242227738","doi":"10.1145/777847.777848","title":"The asteroid surveying problem and other puzzles","year":2003,"lang":"en","type":"article","venue":"","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":"Asteroid; Shore; Unit (ring theory); Set (abstract data type); Plane (geometry); Computer science; Mathematics; Computer graphics (images); Geometry; Geodesy; Geology; Physics; Astronomy","score_opus":0.02011364020360685,"score_gpt":0.23651136846794132,"score_spread":0.21639772826433448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242227738","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.01742867,0.0004175138,0.95084894,0.0007199379,0.00013724598,0.00008272438,1.8979068e-7,0.00004456784,0.03032024],"genre_scores_gemma":[0.89854264,0.000016172226,0.09511631,0.0007243146,0.000033541004,0.000009785651,3.8514668e-7,0.0000040944,0.0055527682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957407,0.00007521982,0.00007058671,0.00011241254,0.00008458301,0.000083140185],"domain_scores_gemma":[0.9996953,0.00012992705,0.000018568926,0.00010456845,0.000027804152,0.000023825924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045898304,0.000038405742,0.00002837245,0.000019619198,0.00018154988,0.00020632311,0.00010646776,0.00001064197,0.0000064916057],"category_scores_gemma":[0.000025140302,0.000023965897,0.000009042937,0.00013436722,0.000013614434,0.00013056201,0.00003108679,0.000024432882,0.000012050796],"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":[6.38759e-7,0.000008777995,0.0010774096,0.0000019897898,0.0000051347088,3.0324702e-7,0.00013834653,0.0003754067,0.0003833215,0.9156461,0.00072985166,0.08163276],"study_design_scores_gemma":[0.0005035167,0.00008379537,0.010194127,0.000010417683,0.000003277568,0.000074300115,0.00009435181,0.059725855,0.007781676,0.15018159,0.7710229,0.00032414004],"about_ca_topic_score_codex":0.0000031789332,"about_ca_topic_score_gemma":0.000031153504,"teacher_disagreement_score":0.88111395,"about_ca_system_score_codex":0.0000039051024,"about_ca_system_score_gemma":0.000018649042,"threshold_uncertainty_score":0.19895785},"labels":[],"label_agreement":null},{"id":"W4243115535","doi":"10.22215/etd/2015-11052","title":"Flips and Spanners","year":2015,"lang":"en","type":"dissertation","venue":"","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":"Neighbourhood (mathematics); Computer science; Combinatorics; Line segment; Line graph; Graph; Mathematics; Artificial intelligence","score_opus":0.016186468143557554,"score_gpt":0.27766340224991154,"score_spread":0.261476934106354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243115535","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.13198657,0.00437344,0.30867112,0.0013499401,0.0074928394,0.0005909979,0.00000642984,0.0006686222,0.54486006],"genre_scores_gemma":[0.43758506,0.0002465482,0.17692421,0.0010482405,0.0010054946,0.00006045819,0.0020993028,0.00004682803,0.38098386],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992768,0.000018022829,0.0001176749,0.000265253,0.00022976882,0.00009247653],"domain_scores_gemma":[0.9995208,0.00002416354,0.000054881166,0.00015412542,0.00016355664,0.00008252301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001421044,0.00010749744,0.00010359968,0.00014004765,0.000051663956,0.00013939754,0.00019756041,0.00009079448,0.000016269845],"category_scores_gemma":[0.000028731934,0.00009983325,0.00002240847,0.00020491968,0.0000050732297,0.00021742946,0.000033042525,0.00008102388,0.00005214859],"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.000014995736,0.000040385356,0.000016364875,0.00007392434,0.000041516287,0.000010382032,0.0017609015,0.00055312726,0.00044528052,0.34729436,0.06684143,0.5829073],"study_design_scores_gemma":[0.0015102379,0.0004350175,0.009792822,0.00014414128,0.00007663615,0.000092065406,0.0011693076,0.3034414,0.0061472333,0.28970343,0.38528982,0.002197867],"about_ca_topic_score_codex":0.000012495298,"about_ca_topic_score_gemma":0.00005924482,"teacher_disagreement_score":0.58070946,"about_ca_system_score_codex":0.000017409198,"about_ca_system_score_gemma":0.00015385795,"threshold_uncertainty_score":0.40710816},"labels":[],"label_agreement":null},{"id":"W4243703156","doi":"10.1090/crmp/048","title":"Polyhedral Computation","year":2009,"lang":"en","type":"book","venue":"CRM proceedings & lecture notes","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":"McMaster University; University of New Brunswick; McGill University","funders":"","keywords":"Computation; Computer science; Programming language","score_opus":0.01289996688269291,"score_gpt":0.24183117997180978,"score_spread":0.22893121308911688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243703156","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.00012725705,0.0010334753,0.68622035,0.0020799404,0.0004826133,0.00032227187,0.0000031462093,0.00047597766,0.30925497],"genre_scores_gemma":[0.917187,0.00011251135,0.04761222,0.007827951,0.0077435034,0.000054912598,0.0007160991,0.00015320533,0.018592604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776673,0.0000103474595,0.00039698993,0.0008203932,0.0006325,0.00037305852],"domain_scores_gemma":[0.9986253,0.0001400211,0.00035876947,0.00016512032,0.000569175,0.00014165911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021326958,0.00046732894,0.00039963183,0.00046551297,0.00026110484,0.0006182319,0.0007110656,0.00045657222,0.000017260034],"category_scores_gemma":[0.0001494203,0.00046109594,0.00018291091,0.0004750192,0.00003859918,0.00054898066,0.0001413203,0.0005555107,0.00010945784],"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.00001192481,0.000047544672,0.000009355946,0.00010119377,0.000049976454,0.000008928925,0.000665814,0.0031317093,0.0006066847,0.69555455,0.012296087,0.28751624],"study_design_scores_gemma":[0.00023724145,0.00022187561,0.00021822627,0.00013230623,0.00003846145,0.00007572093,0.000001207193,0.029416377,0.0016351655,0.9183024,0.04911666,0.00060433365],"about_ca_topic_score_codex":0.0000019885204,"about_ca_topic_score_gemma":0.0000015987887,"teacher_disagreement_score":0.9170597,"about_ca_system_score_codex":0.00021602697,"about_ca_system_score_gemma":0.0004601735,"threshold_uncertainty_score":0.99978405},"labels":[],"label_agreement":null},{"id":"W4243779214","doi":"10.1002/jgt.10097","title":"Crossing numbers of sequences of graphs II: Planar tiles","year":2003,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"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; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Tile; Book embedding; Rational number; 1-planar graph; Planar; Graph; Pathwidth; Discrete mathematics; Sequence (biology); Crossing number (knot theory); Indifference graph; Chordal graph; Line graph; Computer science","score_opus":0.013332105020626376,"score_gpt":0.25113203249037913,"score_spread":0.23779992746975276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243779214","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.7844809,0.0011878625,0.21291192,0.000054485517,0.00039390824,0.000026603539,0.0000016921077,0.000005174416,0.00093739433],"genre_scores_gemma":[0.96959066,0.00003956636,0.030257633,0.000046821584,0.000022229302,2.444575e-7,3.1143975e-7,0.0000026403761,0.000039878203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890894,0.00017895366,0.000427589,0.00008331913,0.00030682178,0.00009438284],"domain_scores_gemma":[0.99880964,0.00021022027,0.00055451994,0.00012026587,0.00025572226,0.00004964374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012399299,0.000070771326,0.0001815382,0.00033063415,0.0001278796,0.000035617213,0.00030689023,0.000033733784,0.00001759129],"category_scores_gemma":[0.00009736035,0.000057589445,0.0001565751,0.00051200495,0.00016627701,0.00035922742,0.00001702197,0.000090431575,4.5007366e-7],"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.000035321988,0.000104218496,0.0010380462,0.000024229697,0.00006514331,0.000009951711,0.0016497956,0.004395983,0.0413258,0.9440224,0.00023253128,0.007096586],"study_design_scores_gemma":[0.0003774331,0.00033051253,0.002138794,0.00009703669,0.000021694326,0.00019332227,0.00024290658,0.00020211146,0.11805946,0.87752783,0.00070491526,0.00010399883],"about_ca_topic_score_codex":0.0000023509585,"about_ca_topic_score_gemma":0.0000010952137,"teacher_disagreement_score":0.18510972,"about_ca_system_score_codex":0.000008615012,"about_ca_system_score_gemma":0.00017267835,"threshold_uncertainty_score":0.23484294},"labels":[],"label_agreement":null},{"id":"W4244021806","doi":"10.1142/s0129626401000622","title":"A NOTE ON COMMUNICATION-EFFICIENT DETERMINISTIC PARALLEL ALGORITHMS FOR PLANAR POINT LOCATION AND 2D VORONOÏ DIAGRAM","year":2001,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Planar; Computation; Computer science; Interconnection; Algorithm; Diagram; Point (geometry); Point-to-point; Parallel algorithm; Point location; Parallel computing; Mathematics; Telecommunications; Geometry","score_opus":0.026668098113129653,"score_gpt":0.2859733324838822,"score_spread":0.25930523437075254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244021806","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.018623691,0.0004822173,0.9701761,0.010002475,0.0001226736,0.0003902894,0.0000020753835,0.00011360095,0.00008690023],"genre_scores_gemma":[0.7896292,0.000032494638,0.20710933,0.0028626071,0.00009584266,0.00014797089,0.000045950823,0.0000124853295,0.000064068685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865717,0.000064885346,0.00029845163,0.00045001306,0.0002499033,0.00027957957],"domain_scores_gemma":[0.9989971,0.0002507928,0.00017283973,0.00035784175,0.00012539179,0.00009606158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003378728,0.00018634411,0.00016204063,0.00015528608,0.00047649775,0.00029288253,0.00041453447,0.000053776002,0.0000015017032],"category_scores_gemma":[0.00008479011,0.00018281079,0.000042462747,0.00033280306,0.00007364127,0.00028057673,0.000059312533,0.00011673348,0.000014802488],"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.000105747014,0.00026385687,0.00010309746,0.00012760429,0.000021594862,0.000009936789,0.0026203133,0.49439988,0.00078414625,0.008224898,0.0012377396,0.4921012],"study_design_scores_gemma":[0.00073498307,0.00010048999,0.0023835618,0.00007567583,0.000013319293,0.00003497507,0.00002413905,0.9925597,0.000052648043,0.0018428207,0.0019197514,0.00025795924],"about_ca_topic_score_codex":0.000012921667,"about_ca_topic_score_gemma":0.000006991418,"teacher_disagreement_score":0.7710056,"about_ca_system_score_codex":0.00006986996,"about_ca_system_score_gemma":0.00007568671,"threshold_uncertainty_score":0.7454808},"labels":[],"label_agreement":null},{"id":"W4245125632","doi":"10.22215/etd/2006-08509","title":"Parallel Voronoi diagrams for VLSI design","year":2006,"lang":"en","type":"dissertation","venue":"","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; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Voronoi diagram; Computer science; Very-large-scale integration; Mathematics; Embedded system; Geometry","score_opus":0.025354721252689495,"score_gpt":0.2713623797708942,"score_spread":0.24600765851820472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245125632","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.00033240794,0.00025573705,0.9903164,0.0001454023,0.0013714511,0.0006796956,0.0000036866124,0.00017348092,0.0067217336],"genre_scores_gemma":[0.00993712,0.00002274584,0.8563633,0.00023981628,0.00056822697,0.00045866208,0.0029186723,0.000029055134,0.1294624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986666,0.000042803025,0.00030226208,0.00048539863,0.00026710986,0.00023585223],"domain_scores_gemma":[0.9990398,0.00022863483,0.00015173998,0.0002879455,0.00023316056,0.000058710822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024214413,0.00022401255,0.0002047495,0.00016919085,0.00015782817,0.00023953205,0.00051260984,0.00018431625,0.00002042032],"category_scores_gemma":[0.000036950532,0.00021389218,0.00014299747,0.00026885327,0.0000060209463,0.0002681613,0.000021568483,0.00009042745,0.000051991414],"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.000066596054,0.00021136543,0.0000076185083,0.0001468569,0.000073192,0.0000042298743,0.000323066,0.09762738,0.00060323667,0.34933436,0.15978338,0.39181873],"study_design_scores_gemma":[0.0012369677,0.00038892738,0.0023717284,0.00005800803,0.00006635982,0.000006245458,0.0000430636,0.8208187,0.011478586,0.086213805,0.07606423,0.0012533366],"about_ca_topic_score_codex":0.000027534894,"about_ca_topic_score_gemma":0.00014020615,"teacher_disagreement_score":0.7231914,"about_ca_system_score_codex":0.000041430485,"about_ca_system_score_gemma":0.00020106853,"threshold_uncertainty_score":0.872227},"labels":[],"label_agreement":null},{"id":"W4245170112","doi":"10.1090/s0002-9947-2010-05128-1","title":"Regular polygonal complexes in space, I","year":2010,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Combinatorics; Flag (linear algebra); Vertex (graph theory); Transitive relation; Algebraic number; FLAGS register; Euclidean space; Euclidean geometry; Successor cardinal; Vector space; Group (periodic table); Discrete mathematics; Pure mathematics; Algebra over a field; Geometry; Graph; Computer science","score_opus":0.009369195357701728,"score_gpt":0.24817881843894415,"score_spread":0.23880962308124243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245170112","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.23037606,0.00000520322,0.7665598,0.00249901,0.00007933081,0.00008597298,0.0000027138597,0.000027786835,0.00036413412],"genre_scores_gemma":[0.76720774,0.0000025583952,0.23249108,0.00013890509,0.000016765873,0.0000072934195,3.684342e-7,0.000003488859,0.00013177608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992286,0.00003798948,0.00020309172,0.00014754494,0.00024793646,0.00013485807],"domain_scores_gemma":[0.9992757,0.00017894869,0.00010133934,0.00035776844,0.00004332356,0.00004292222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023081654,0.000078043544,0.00016175663,0.000032416723,0.000102657024,0.000024286315,0.00047774028,0.00002453857,0.000054317778],"category_scores_gemma":[0.00002165846,0.00005777556,0.00020342178,0.0007954025,0.00029289143,0.00012566418,0.00002613589,0.00021798357,0.000008583665],"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.000013582379,0.00094630755,0.00049458654,0.000083294224,0.000093856754,7.1301014e-7,0.00281698,0.009691813,0.17938343,0.7722625,0.0008279786,0.03338498],"study_design_scores_gemma":[0.00066731375,0.00014282859,0.039842773,0.000047396592,0.00003856661,0.00006456428,0.00042630272,0.5057063,0.0482275,0.40290555,0.0015104709,0.00042045262],"about_ca_topic_score_codex":0.00003116809,"about_ca_topic_score_gemma":0.0000101812,"teacher_disagreement_score":0.5368317,"about_ca_system_score_codex":0.000015172559,"about_ca_system_score_gemma":0.000051989064,"threshold_uncertainty_score":0.2356019},"labels":[],"label_agreement":null},{"id":"W4248070134","doi":"10.1142/9789812794741_0014","title":"Fully Dynamic 3-Dimensional Orthogonal Graph Drawing","year":2004,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","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":"Computer science; Graph; Graph drawing; Theoretical computer science","score_opus":0.01509635754815031,"score_gpt":0.22842257378428066,"score_spread":0.21332621623613035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248070134","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006309532,0.0005872512,0.09287755,0.00047755052,0.008378707,0.0005587537,0.000051718955,0.0004574662,0.89598006],"genre_scores_gemma":[0.027486637,4.6551773e-7,0.018103365,0.00033866742,0.00020651623,0.000013357202,0.0001977008,0.00003778085,0.9536155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961716,0.000032185028,0.00058522343,0.0013679984,0.0013814372,0.00046156644],"domain_scores_gemma":[0.9980371,0.00010499912,0.00031295608,0.00092747406,0.0003737857,0.00024368682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073972787,0.00045857998,0.0003635579,0.0015373384,0.0009167371,0.0008720019,0.0010518113,0.00016714985,0.00033502578],"category_scores_gemma":[0.000008423282,0.00047690375,0.00035101673,0.00027376149,0.00033992698,0.00024764772,0.00047968558,0.00050979404,0.000529234],"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.000005674244,0.000018332179,8.883418e-7,0.000022563136,0.00004324377,0.00006710178,0.00012524243,0.0039231186,0.00074472785,0.9726663,0.0045520463,0.017830715],"study_design_scores_gemma":[0.00041685958,0.000044684763,0.0000546327,0.00031347867,0.000036981637,0.00006538426,0.00000123912,0.008601718,0.00034110202,0.6091157,0.38016072,0.0008474809],"about_ca_topic_score_codex":0.000001526861,"about_ca_topic_score_gemma":0.0004937772,"teacher_disagreement_score":0.37560865,"about_ca_system_score_codex":0.00021827883,"about_ca_system_score_gemma":0.0009995035,"threshold_uncertainty_score":0.99976826},"labels":[],"label_agreement":null},{"id":"W4248523629","doi":"10.1007/s10998-006-0014-3","title":"Foreword","year":2006,"lang":"en","type":"article","venue":"Periodica Mathematica Hungarica","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 Calgary","funders":"","keywords":"Mathematics","score_opus":0.007665905198017301,"score_gpt":0.21437969247592648,"score_spread":0.20671378727790918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248523629","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.011640912,0.00012431476,0.9578648,0.0020759632,0.00014633835,0.00014644166,0.0000026389757,0.00028256275,0.027715996],"genre_scores_gemma":[0.7337774,0.0000023057257,0.2628551,0.00024533828,0.00016873969,0.000036128724,0.000009133045,0.0000086623895,0.0028971925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988036,0.000033897373,0.00028484312,0.00029211614,0.00034451275,0.00024098999],"domain_scores_gemma":[0.9992376,0.00012190337,0.00008598339,0.00041599388,0.00007216117,0.000066359455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020698343,0.00012909072,0.00015751501,0.00012498804,0.0002406723,0.0002029627,0.00050177024,0.000047823385,0.00013466692],"category_scores_gemma":[0.000054026736,0.00011575722,0.0000811331,0.00046724634,0.00004542527,0.00028632733,0.00013619584,0.00008635419,0.00039164885],"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.0000020692773,0.00017545387,0.00006327096,0.000028803133,0.000009930254,0.000008602101,0.00030543245,0.0002733552,0.001126655,0.967358,0.01731632,0.013332109],"study_design_scores_gemma":[0.0005098814,0.000115290815,0.0071144304,0.000032270687,0.000020599053,0.00012298512,0.000023541415,0.42307433,0.003534205,0.43647146,0.12841475,0.00056624506],"about_ca_topic_score_codex":0.000008282344,"about_ca_topic_score_gemma":0.0000032180085,"teacher_disagreement_score":0.7221365,"about_ca_system_score_codex":0.00002844988,"about_ca_system_score_gemma":0.00006327568,"threshold_uncertainty_score":0.5033984},"labels":[],"label_agreement":null},{"id":"W4248712306","doi":"10.22215/etd/2016-11683","title":"Low Memory Local Geometric Routing with Guaranteed Delivery in Monotone Subdivisions","year":2016,"lang":"en","type":"dissertation","venue":"","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":"Subdivision; Monotone polygon; Routing (electronic design automation); Regular polygon; Mathematics; Simple (philosophy); Computer science; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Algorithm; Geography; Computer network; Telecommunications; Geometry","score_opus":0.007687015274233537,"score_gpt":0.2298569804522937,"score_spread":0.22216996517806015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248712306","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.24067266,0.00020951254,0.7511583,0.00008048317,0.0005552235,0.00032704338,0.0000045504767,0.0001295903,0.006862636],"genre_scores_gemma":[0.9852235,0.000042849155,0.006794785,0.00015536099,0.00011084498,0.00004421533,0.00018683306,0.000023300543,0.007418331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770945,0.00007816189,0.00048475582,0.00072074024,0.0006241426,0.00038276208],"domain_scores_gemma":[0.99865896,0.0003114705,0.00022415652,0.00042173924,0.00028327067,0.00010040041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037559323,0.00031952243,0.00034839674,0.001559889,0.00016623468,0.00015418271,0.0006463367,0.00021217756,0.0000732202],"category_scores_gemma":[0.00006526875,0.00024068977,0.00009130612,0.0024587545,0.000024899316,0.0005154694,0.0000831168,0.00027058856,0.00012549308],"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.0002542579,0.0005284674,0.0006879762,0.00018406087,0.0001257315,0.0001833977,0.0014990276,0.022825746,0.002982317,0.019304866,0.00090101076,0.95052314],"study_design_scores_gemma":[0.009133437,0.0014387236,0.11487378,0.0035139993,0.0001417614,0.00017258844,0.0022274845,0.71131295,0.14429723,0.0062948703,0.0014108752,0.005182304],"about_ca_topic_score_codex":0.0001586688,"about_ca_topic_score_gemma":0.00051483896,"teacher_disagreement_score":0.9453408,"about_ca_system_score_codex":0.00014744308,"about_ca_system_score_gemma":0.00040332248,"threshold_uncertainty_score":0.9815044},"labels":[],"label_agreement":null},{"id":"W4248936176","doi":"10.1145/2185520.2335447","title":"Efficient geometrically exact continuous collision detection","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"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 British Columbia","funders":"","keywords":"Collision detection; Computer science; Rounding; Collision; Solver; Algorithm; Curvature; Nonlinear system; Mathematics; Geometry; Physics","score_opus":0.018383710757754784,"score_gpt":0.24996401306419552,"score_spread":0.23158030230644075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248936176","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.14686325,0.0001287774,0.85096335,0.00038427062,0.0011394216,0.00017371387,0.000004412466,0.00018521395,0.0001575744],"genre_scores_gemma":[0.9789725,0.00003875001,0.020382307,0.0003828216,0.000092858085,0.000030414785,0.0000037719947,0.000009969242,0.000086584005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985649,0.00009083326,0.00024923834,0.0002911056,0.0004814289,0.00032251154],"domain_scores_gemma":[0.99862665,0.0003830404,0.00007932156,0.0005656851,0.0001665849,0.00017870587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047232248,0.00015398662,0.00013524998,0.00083051866,0.00042385558,0.000099647834,0.00043179278,0.0001103174,0.000025324853],"category_scores_gemma":[0.000096422875,0.00014953269,0.00013676022,0.0029233163,0.00003152518,0.0002743441,0.000014475147,0.00024563467,0.000082080216],"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.00006842187,0.0019168343,0.00029204346,0.000021940457,0.00009555548,0.0000048514553,0.0006837236,0.24056886,0.00556127,0.016749388,0.00024481455,0.7337923],"study_design_scores_gemma":[0.0029733293,0.0018525962,0.06439358,0.00007330195,0.00016456276,0.00026507178,0.00013545903,0.7322654,0.14109641,0.009389528,0.045580216,0.001810508],"about_ca_topic_score_codex":0.000013618844,"about_ca_topic_score_gemma":0.0000060543675,"teacher_disagreement_score":0.8321093,"about_ca_system_score_codex":0.00006375014,"about_ca_system_score_gemma":0.000034809495,"threshold_uncertainty_score":0.6097766},"labels":[],"label_agreement":null},{"id":"W4249211545","doi":"10.1145/1109557.1109583","title":"Morphing orthogonal planar graph drawings","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"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":"Planarity testing; Morphing; Vertex (graph theory); Planar graph; Orthogonality; Computer science; Combinatorics; Planar; Book embedding; Graph drawing; Graph; Mathematics; Line graph; Pathwidth; Geometry; Computer graphics (images)","score_opus":0.006601419581088751,"score_gpt":0.2205228613318167,"score_spread":0.21392144175072794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249211545","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.81575054,0.00071758573,0.13673413,0.027592488,0.0027288238,0.0023607942,0.0006860798,0.0009819086,0.012447622],"genre_scores_gemma":[0.9434463,0.000031514654,0.051813066,0.00076649745,0.0009693163,0.00006644573,0.00010984708,0.000054973367,0.0027420407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963912,0.000037804715,0.0007382656,0.00085545727,0.0013234579,0.0006538278],"domain_scores_gemma":[0.99814564,0.00011738099,0.00057837745,0.00044441884,0.0005398651,0.00017432065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006127068,0.00046034832,0.00040183723,0.00038768843,0.0005597042,0.00031385774,0.0023325165,0.00014624775,0.000009174373],"category_scores_gemma":[0.00008308202,0.00036585197,0.00041576085,0.0012856844,0.00015190018,0.0013694772,0.0007066553,0.00039285727,0.00003370844],"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.00035499275,0.0031515646,0.020970851,0.0008205105,0.0009005388,0.00004864442,0.007488407,0.021957185,0.07087651,0.633946,0.17683503,0.06264977],"study_design_scores_gemma":[0.008390503,0.0028265885,0.1015413,0.0018650495,0.000530135,0.0007492015,0.0021841628,0.18284665,0.2729125,0.3252743,0.095039755,0.005839838],"about_ca_topic_score_codex":0.0000705201,"about_ca_topic_score_gemma":0.000003062748,"teacher_disagreement_score":0.3086717,"about_ca_system_score_codex":0.000096161784,"about_ca_system_score_gemma":0.000086142456,"threshold_uncertainty_score":0.99987936},"labels":[],"label_agreement":null},{"id":"W4249893348","doi":"10.1016/b978-0-444-50616-0.50016-6","title":"Adaptive mesh movement — the MMPDE approach and its applications","year":2001,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","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":"Movement (music); Computer science; Physics; Acoustics","score_opus":0.02411315797564964,"score_gpt":0.23208991344821972,"score_spread":0.20797675547257008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249893348","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018369163,0.0022493203,0.11937126,0.00023354613,0.00009837514,0.00093995023,0.000013927146,0.00006354563,0.8770282],"genre_scores_gemma":[0.000963206,0.00026474657,0.007995754,0.0011992762,0.00042732304,0.00033162636,0.000032122076,0.000024281093,0.98876166],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985804,0.00003183964,0.00028276996,0.0005428817,0.00037796694,0.00018415911],"domain_scores_gemma":[0.9989778,0.00009951673,0.0001822888,0.00049550104,0.00015246421,0.0000924771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002647719,0.0002692019,0.0002172436,0.00011544638,0.00029856624,0.00013746158,0.00056656037,0.00012527268,0.000021024227],"category_scores_gemma":[0.0000048397424,0.0002082603,0.00009288183,0.0000475635,0.000056333614,0.0000825534,0.00031665812,0.00026792617,0.000079243415],"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.0000011623961,0.0000060493626,8.634803e-8,0.000008318474,0.000030866457,0.0000010626358,0.00009390427,0.00006372881,0.000005138497,0.41813153,0.000100982965,0.58155715],"study_design_scores_gemma":[0.000115272334,0.000034804234,0.000006997764,0.000025734362,0.000032998625,0.00001959198,0.0000059005133,0.011499026,0.000030415502,0.096980594,0.89100236,0.0002463026],"about_ca_topic_score_codex":2.1880324e-7,"about_ca_topic_score_gemma":0.0000025638844,"teacher_disagreement_score":0.8909014,"about_ca_system_score_codex":0.00005287525,"about_ca_system_score_gemma":0.000102919425,"threshold_uncertainty_score":0.84926087},"labels":[],"label_agreement":null},{"id":"W4251387955","doi":"10.13052/17797179.2012.702428","title":"Hierarchical elements for the iterative solving of turbulent flow problems on anisotropic meshes","year":2012,"lang":"en","type":"article","venue":"European Journal of Computational Mechanics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon mesh; Mathematical optimization; Computer science; Iterative method; Convergence (economics); Anisotropy; Applied mathematics; Flow (mathematics); Quadratic equation; Algorithm; Computational science; Mathematics; Geometry; Physics","score_opus":0.030706009388480077,"score_gpt":0.2590724698536082,"score_spread":0.22836646046512812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251387955","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.008723045,0.00035852,0.9885011,0.0013305654,0.0007806945,0.00020633286,0.0000054893744,0.00001135218,0.00008292477],"genre_scores_gemma":[0.7330411,0.000013795068,0.26613158,0.000367845,0.0004071656,0.0000026070807,0.0000065906625,0.000010205688,0.000019115396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812126,0.00033368167,0.00063860836,0.00012761551,0.0005850357,0.0001937804],"domain_scores_gemma":[0.99792314,0.0007484992,0.0005481527,0.0001307641,0.00055221823,0.00009725689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016650038,0.00012930926,0.00016754113,0.00015436974,0.00018545074,0.00008145293,0.00051466783,0.000015538157,0.0000097715865],"category_scores_gemma":[0.00015082855,0.00009116487,0.0001442109,0.00023303907,0.000017200817,0.00038032208,0.0000860908,0.0001670985,0.0000073613937],"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.000048304217,0.00020820214,0.000013976682,0.000020665377,0.00011360101,0.000004645199,0.0012882059,0.7353843,0.00040490297,0.21289574,0.0009952574,0.04862221],"study_design_scores_gemma":[0.00090850063,0.0009804738,0.0011829771,0.00008488347,0.00002756126,0.00009538863,0.000035496723,0.959449,0.00091824663,0.030563077,0.005622886,0.0001315005],"about_ca_topic_score_codex":1.0389644e-7,"about_ca_topic_score_gemma":8.0494985e-8,"teacher_disagreement_score":0.724318,"about_ca_system_score_codex":0.00004045493,"about_ca_system_score_gemma":0.00009040028,"threshold_uncertainty_score":0.37175953},"labels":[],"label_agreement":null},{"id":"W4251404645","doi":"10.22215/etd/2013-09970","title":"A New Polygon Nesting Trees Data Structure to Construct a Physical Polyhedral Object","year":2013,"lang":"en","type":"dissertation","venue":"","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":"Nesting (process); Polygon (computer graphics); Polyhedron; Slicing; Data structure; Computer science; Tree (set theory); Object (grammar); Tree structure; Mathematics; Combinatorics; Computer graphics (images); Artificial intelligence; Engineering; Programming language","score_opus":0.021490479615258497,"score_gpt":0.29668986547613546,"score_spread":0.27519938586087694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251404645","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.4472171,0.00025922054,0.54121,0.0018643782,0.00376912,0.0010324697,0.000100706115,0.0005324369,0.0040146057],"genre_scores_gemma":[0.6706637,0.0000026708074,0.29759848,0.0004280308,0.0020542732,0.000013248348,0.0037247534,0.000037008118,0.025477832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773455,0.000059183913,0.00026189833,0.0010265738,0.0005710659,0.00034671143],"domain_scores_gemma":[0.9981168,0.00013850292,0.00018448372,0.0011050286,0.00017413274,0.0002810807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007622934,0.00037937952,0.00036662153,0.00032937396,0.00017162492,0.00088716886,0.0018720194,0.0001640899,0.00009735227],"category_scores_gemma":[0.0001553894,0.00033759596,0.000081080834,0.00086949964,0.000010098861,0.001057315,0.0003687778,0.00027834857,0.00007910044],"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.000027444381,0.00004137076,0.000042651383,0.00005917439,0.00009169743,0.000011008171,0.0024517153,0.0011879078,0.035085507,0.044207864,0.045166075,0.87162757],"study_design_scores_gemma":[0.0017073916,0.00069054426,0.025042843,0.0004289647,0.00022032352,0.00024838123,0.0011542985,0.8673868,0.054702118,0.031252887,0.013535829,0.003629619],"about_ca_topic_score_codex":0.0004318823,"about_ca_topic_score_gemma":0.00071627455,"teacher_disagreement_score":0.86799794,"about_ca_system_score_codex":0.00004140346,"about_ca_system_score_gemma":0.00074250106,"threshold_uncertainty_score":0.9999076},"labels":[],"label_agreement":null},{"id":"W4252243099","doi":"10.1109/imtc.1998.679629","title":"Some aspects of pseudo random binary array based surface characterization","year":2002,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Binary number; Computer science; Algorithm; Random graph; Surface (topology); Graph; Characterization (materials science); Iterative method; Theoretical computer science; Mathematics; Materials science","score_opus":0.01663560880071518,"score_gpt":0.21549380585679884,"score_spread":0.19885819705608365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252243099","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.1703002,0.00006534452,0.8256166,0.0012263993,0.00031839052,0.000121112076,0.000002330913,0.00009007223,0.0022595397],"genre_scores_gemma":[0.9715343,0.000016418984,0.02701955,0.00039164434,0.00009155016,0.0000027311446,0.000024527635,0.000004233017,0.00091503357],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919707,0.000059830854,0.00019657488,0.00020418462,0.00023034087,0.00011197681],"domain_scores_gemma":[0.9994605,0.00008868864,0.00008957563,0.00021854854,0.0000960384,0.00004662093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015563096,0.0000819392,0.00011775008,0.00010297713,0.00006119549,0.00004673062,0.00021857579,0.000033305703,0.00017234194],"category_scores_gemma":[0.000022861745,0.00007560564,0.000047814054,0.00046642433,0.000015087427,0.00055970653,0.000025618581,0.00003943631,0.00006447758],"study_design_candidate":"bench_or_experimental","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.000016810105,0.00024804106,0.00014249266,0.00002420697,0.000013628819,0.0000042487045,0.0001854844,0.033677466,0.87887263,0.07834254,0.0006019127,0.007870542],"study_design_scores_gemma":[0.00090548024,0.00008264746,0.002891439,0.000009451592,0.0000033520723,0.0000031003278,0.0000016116836,0.82486075,0.16888176,0.001307923,0.0009334969,0.00011898329],"about_ca_topic_score_codex":0.0000022165036,"about_ca_topic_score_gemma":4.2295036e-7,"teacher_disagreement_score":0.8012341,"about_ca_system_score_codex":0.00001392774,"about_ca_system_score_gemma":0.000028167278,"threshold_uncertainty_score":0.30831084},"labels":[],"label_agreement":null},{"id":"W4253908531","doi":"10.1137/1.9781611973082.110","title":"Computational Geometry for Non-Geometers: Recent Developments on Some Classical Problems","year":2011,"lang":"en","type":"article","venue":"","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":"Intersection (aeronautics); Computational geometry; Point (geometry); Set (abstract data type); Computer science; Geometry; Line segment; Algorithm; Line (geometry); Mathematics; Theoretical computer science; Engineering","score_opus":0.06369467965695896,"score_gpt":0.2651132272268801,"score_spread":0.2014185475699211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253908531","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.017033044,0.000016412432,0.9769929,0.000854765,0.0007816904,0.000476982,0.000005285373,0.00013490715,0.0037040366],"genre_scores_gemma":[0.37556434,0.000011651848,0.62036836,0.0025122315,0.00012012157,0.00013916426,0.00008543622,0.000014142001,0.0011845542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843544,0.000028564158,0.00033508992,0.00048861396,0.0004070369,0.00030523204],"domain_scores_gemma":[0.99911875,0.00018480122,0.00009567206,0.00021172372,0.00024976273,0.00013931812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032646226,0.00017244871,0.00015729351,0.00036269875,0.00018364146,0.00010222,0.0004618688,0.00007100828,0.000070250324],"category_scores_gemma":[0.00005542735,0.00015450087,0.00007203983,0.0006249474,0.000027052052,0.00055105827,0.0001254729,0.00009236154,0.00016911882],"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.000075114716,0.0009812219,0.00033821637,0.000051724644,0.00012399978,0.0000054732914,0.00097299897,0.022780633,0.00031816447,0.64545405,0.015458936,0.31343946],"study_design_scores_gemma":[0.0030975766,0.0014957731,0.032867372,0.000070188646,0.00001831468,0.000028416847,0.000036473295,0.5877543,0.011464126,0.30139852,0.060672943,0.0010960113],"about_ca_topic_score_codex":0.0000023031298,"about_ca_topic_score_gemma":0.0000012895421,"teacher_disagreement_score":0.56497365,"about_ca_system_score_codex":0.00008328993,"about_ca_system_score_gemma":0.00016552508,"threshold_uncertainty_score":0.6300363},"labels":[],"label_agreement":null},{"id":"W4255103485","doi":"10.1142/s0218195912500057","title":"GHOST CHIMNEYS","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","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":"Mathematics; Combinatorics; Set (abstract data type); Point (geometry); Planar; Value (mathematics); Projection (relational algebra); Geometry; Algorithm; Computer science; Statistics; Computer graphics (images)","score_opus":0.013166922812998352,"score_gpt":0.2918596728452709,"score_spread":0.27869275003227256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255103485","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.004148177,0.0012003684,0.9889257,0.0018648261,0.0014742421,0.0002342772,0.000019098026,0.0000650721,0.0020682693],"genre_scores_gemma":[0.80722183,0.000052941512,0.18915127,0.00087061414,0.0024061613,0.00005014297,0.00006438547,0.000013954498,0.00016871402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99717003,0.000083204584,0.000851144,0.00022850775,0.0013670063,0.00030013503],"domain_scores_gemma":[0.9964141,0.00047500906,0.00069467595,0.00024679775,0.0018741806,0.00029518493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081720244,0.00019862005,0.00023307599,0.0010171297,0.00016887895,0.00024150357,0.0015659819,0.00007792701,0.00011302689],"category_scores_gemma":[0.000089770365,0.00019671547,0.00023138397,0.0011667368,0.000060893894,0.0017725027,0.00022339915,0.00026442792,0.00022220536],"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.000037262584,0.0011326866,0.004627136,0.000017215942,0.00046369244,0.000011602887,0.00036541533,0.10447312,0.0004973813,0.5925189,0.0047980407,0.2910575],"study_design_scores_gemma":[0.0018773533,0.00018074214,0.048921026,0.000051036703,0.00006940583,0.0019293912,0.00009586355,0.019316899,0.0019052783,0.16622718,0.7586906,0.0007352678],"about_ca_topic_score_codex":0.0000022217878,"about_ca_topic_score_gemma":2.6715452e-7,"teacher_disagreement_score":0.80307364,"about_ca_system_score_codex":0.00016986269,"about_ca_system_score_gemma":0.0002633971,"threshold_uncertainty_score":0.8021824},"labels":[],"label_agreement":null},{"id":"W4280507516","doi":"10.3390/mca27030042","title":"Finding the Conjectured Sequence of Largest Small n-Polygons by Numerical Optimization","year":2022,"lang":"en","type":"article","venue":"Mathematical and Computational Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Polygon (computer graphics); Solver; Sequence (biology); Mathematics; Combinatorics; Class (philosophy); Range (aeronautics); Applied mathematics; Mathematical optimization; Algorithm; Computer science; Artificial intelligence","score_opus":0.022077280219003865,"score_gpt":0.2503259929153343,"score_spread":0.22824871269633043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280507516","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.0022093519,0.00013627108,0.99399656,0.0028642868,0.000026239175,0.00034751266,0.00006253562,0.00005306131,0.00030415444],"genre_scores_gemma":[0.7449506,0.0000043697437,0.25363064,0.0005406743,0.000030058882,0.00049973786,0.00018943909,0.0000073262013,0.00014718562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989211,0.00008865573,0.0002944529,0.00024840166,0.0003232474,0.00012412378],"domain_scores_gemma":[0.99890333,0.0006212485,0.00013673273,0.00018241278,0.000098125915,0.000058175352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026482684,0.00009798277,0.0001258593,0.00006464019,0.0006170209,0.00006631532,0.00039518933,0.00002129303,0.000077764234],"category_scores_gemma":[0.000028392207,0.00008055913,0.00004396438,0.00062847097,0.00007217395,0.00008622065,0.00024764013,0.00012642852,0.000006547],"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.0000018424156,0.000113614056,0.000015453703,0.000010940318,0.000010925148,2.0209797e-7,0.00014911045,0.45048276,0.00016734951,0.545686,0.00031423543,0.003047571],"study_design_scores_gemma":[0.0001385495,0.000038136113,0.00008849104,0.000002696892,0.000009341108,0.000047807873,0.000039890812,0.87591445,0.000112719434,0.12075509,0.0027591167,0.00009369658],"about_ca_topic_score_codex":0.0000036450926,"about_ca_topic_score_gemma":1.7517587e-7,"teacher_disagreement_score":0.7427412,"about_ca_system_score_codex":0.000027906766,"about_ca_system_score_gemma":0.00007027757,"threshold_uncertainty_score":0.4745688},"labels":[],"label_agreement":null},{"id":"W4280532293","doi":"10.1002/cnm.3615","title":"<scp>PIMesh</scp>: An automatic point cloud and unstructured mesh generation algorithm for meshless methods and finite element analysis–with applications in surgical simulations","year":2022,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Biomedical Engineering","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Delaunay triangulation; Mesh generation; Point cloud; Polygon mesh; Computer science; Volume mesh; Algorithm; Finite element method; Computational science; Computer graphics; Laplacian smoothing; Computer graphics (images); Computer vision; Engineering; Structural engineering","score_opus":0.021022446033896972,"score_gpt":0.37859839975384757,"score_spread":0.3575759537199506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280532293","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.0045328056,0.00022205924,0.9935299,0.00044264196,0.0007066428,0.00046177092,0.000059233542,0.000042076805,0.0000028603022],"genre_scores_gemma":[0.043824922,0.00001794573,0.9551815,0.000088283174,0.0003336598,0.00030177005,0.00022262498,0.000015795269,0.00001352295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976724,0.00039019185,0.0006966188,0.00045580187,0.00050468807,0.0002803401],"domain_scores_gemma":[0.9963517,0.0028940085,0.00019722134,0.00014824841,0.00017972988,0.00022909939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024260767,0.00019672535,0.00035828838,0.0011426315,0.00022357512,0.0002119648,0.00043630658,0.0000720875,0.000013684621],"category_scores_gemma":[0.0004505918,0.00017890292,0.00010059557,0.0013891625,0.000039935225,0.00033699645,0.00018829652,0.0003325292,5.5484865e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005898266,0.00013843407,0.00007858742,0.000010567044,0.00020617827,0.000009474559,0.00042634612,0.5315525,0.0007049627,0.009289633,0.000016322623,0.45756108],"study_design_scores_gemma":[0.0010974916,0.0002110763,0.00048186135,0.000008424559,0.000055153978,0.00012921794,0.00009354662,0.9788274,0.00027373218,0.004610521,0.014089563,0.00012198236],"about_ca_topic_score_codex":0.000006846625,"about_ca_topic_score_gemma":0.0000021419344,"teacher_disagreement_score":0.4574391,"about_ca_system_score_codex":0.0002147151,"about_ca_system_score_gemma":0.000091911075,"threshold_uncertainty_score":0.72954494},"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":"W4285040234","doi":"10.22215/etd/2022-15130","title":"Variations on Zombies and Survivor in Simple Polygons","year":2022,"lang":"en","type":"dissertation","venue":"","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":"Zombie; Combinatorics; Visibility graph; Vertex (graph theory); Geodesic; Simple polygon; Polygon (computer graphics); Visibility; Graph; Euclidean geometry; Mathematics; Computer science; Regular polygon; Geography; Computer network; Geometry; Computer security","score_opus":0.011029994326042309,"score_gpt":0.27205519382555127,"score_spread":0.261025199499509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285040234","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.52420175,0.0015925607,0.2777917,0.0040618684,0.008252532,0.0019783194,0.00013164907,0.0007799142,0.1812097],"genre_scores_gemma":[0.9592118,0.00008069884,0.0076362463,0.0005660285,0.0001067607,0.0001547761,0.002069075,0.000020012656,0.030154582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989401,0.00007872472,0.00021092505,0.00036740137,0.00026843286,0.00013441862],"domain_scores_gemma":[0.9994037,0.00022125251,0.00007800524,0.00021081668,0.000044908425,0.000041286927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020276195,0.00013474871,0.00014277193,0.0004736955,0.00018744556,0.00013289464,0.00024838306,0.00006837781,0.00026737555],"category_scores_gemma":[0.000055864515,0.00014311977,0.000033869987,0.0006339293,0.000004879477,0.0001878686,0.00006415847,0.0001854555,0.000013754168],"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.000019591582,0.0001714945,0.00021052403,0.00003841672,0.000022872246,0.0000082735205,0.0022246384,0.004973383,0.0001802258,0.9412321,0.0025940405,0.04832444],"study_design_scores_gemma":[0.0019907025,0.000888463,0.3886864,0.00009176258,0.000049601324,0.00002419593,0.002026219,0.3113493,0.0018721997,0.21226825,0.078612275,0.002140648],"about_ca_topic_score_codex":0.0003061455,"about_ca_topic_score_gemma":0.0023159713,"teacher_disagreement_score":0.72896385,"about_ca_system_score_codex":0.000048416692,"about_ca_system_score_gemma":0.00014492524,"threshold_uncertainty_score":0.5836255},"labels":[],"label_agreement":null},{"id":"W4285135707","doi":"10.1007/978-3-031-06678-8_15","title":"An Efficient Algorithm for the Proximity Connected Two Center Problem","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Center (category theory); Context (archaeology); Mathematics; Combinatorics; Algorithm; Cutting stock problem; Discrete mathematics; Computer science; Optimization problem; Geography","score_opus":0.016819547470137097,"score_gpt":0.26198397635610154,"score_spread":0.24516442888596446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285135707","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.000040421,0.00024803594,0.994218,0.0010554212,0.0022984508,0.0014944047,0.000037177888,0.00016136095,0.00044671076],"genre_scores_gemma":[0.033229347,0.0000140463035,0.9634276,0.0019523366,0.0008701675,0.00016728722,0.000077905286,0.00003686663,0.0002244535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633706,0.000073047435,0.00048134784,0.0014711034,0.0010746577,0.0005627691],"domain_scores_gemma":[0.9971463,0.000873545,0.00028695705,0.0011408016,0.00041297966,0.00013943516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015189062,0.0004167314,0.00034108816,0.00051682856,0.0009328378,0.0006433019,0.003108821,0.00011368908,0.000046689485],"category_scores_gemma":[0.00004634949,0.0003236352,0.00014855996,0.0007896077,0.000312882,0.0005052548,0.00093910843,0.00059395155,0.0000076162837],"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.0000036761483,0.00005632695,0.0000022345314,0.000008427794,0.00000845543,0.0000058016954,0.00028291697,0.41192776,0.000028590548,0.03322112,0.000015996648,0.5544387],"study_design_scores_gemma":[0.0004945916,0.00026926928,0.00002950626,0.000035754987,0.000009029814,0.000055582175,2.2171524e-7,0.9427136,0.00032594,0.047065713,0.008605837,0.0003949601],"about_ca_topic_score_codex":0.000018068318,"about_ca_topic_score_gemma":0.000036991754,"teacher_disagreement_score":0.5540437,"about_ca_system_score_codex":0.00030953978,"about_ca_system_score_gemma":0.00064745726,"threshold_uncertainty_score":0.99992156},"labels":[],"label_agreement":null},{"id":"W4287777345","doi":"","title":"The Inverse Voronoi Problem in Graphs I: Hardness","year":2020,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Simon Fraser University","funders":"","keywords":"Voronoi diagram; Combinatorics; Mathematics; Inverse; Computer science; Geometry","score_opus":0.014377300472191112,"score_gpt":0.20941114643244868,"score_spread":0.19503384596025758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287777345","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.034534443,0.00039561163,0.87706167,0.07169659,0.00017820373,0.00030603973,0.0000029996697,0.00018479458,0.015639685],"genre_scores_gemma":[0.87589675,0.00018114659,0.12032015,0.0008966147,0.000021939548,0.000052520165,0.000036195655,0.000013669389,0.0025810406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997017,0.0017891795,0.00029233392,0.0003946138,0.00028309683,0.00022376768],"domain_scores_gemma":[0.9978074,0.0006876676,0.0001350334,0.0006348301,0.0006025158,0.00013257317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024779332,0.00012112258,0.00011356589,0.00008160889,0.0003584449,0.00038846146,0.0011369312,0.000048512386,0.000014846477],"category_scores_gemma":[0.00058352767,0.00010648277,0.000067459325,0.0011025819,0.00008527437,0.00036561236,0.00038935995,0.00018093492,0.000051468585],"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.0000074854943,0.0001487944,0.0013838286,0.000021578728,0.000015079347,0.000004366977,0.009716307,0.0008651949,0.002028004,0.84250486,0.0043840995,0.13892038],"study_design_scores_gemma":[0.0011224876,0.0000015693556,0.010704816,0.00019135438,0.000008740311,0.00001044656,0.00017406674,0.76688737,0.02849579,0.035035595,0.15689999,0.00046780606],"about_ca_topic_score_codex":0.000115989045,"about_ca_topic_score_gemma":0.0010660555,"teacher_disagreement_score":0.8413623,"about_ca_system_score_codex":0.000035202844,"about_ca_system_score_gemma":0.00014520687,"threshold_uncertainty_score":0.43422413},"labels":[],"label_agreement":null},{"id":"W4287888643","doi":"10.1109/acie55485.2022.00024","title":"A Comprehensive Study on Pathfinding Algorithm for Static 2D Square Grid","year":2022,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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 Alberta","funders":"","keywords":"Pathfinding; Square tiling; Computer science; Square (algebra); Grid; Algorithm; Theoretical computer science; Mathematics; Shortest path problem; Geometry","score_opus":0.04357923652522951,"score_gpt":0.2989261305727744,"score_spread":0.2553468940475449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287888643","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.063342825,0.000019520583,0.9343792,0.00034403996,0.0008877533,0.0007398939,0.00002811459,0.000101293735,0.00015734516],"genre_scores_gemma":[0.8462141,6.8764547e-7,0.15073152,0.0015809765,0.00018075448,0.0005107135,0.000071007504,0.000011090074,0.0006991353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988648,0.00010670144,0.00016672145,0.00032809158,0.00037254707,0.00016112227],"domain_scores_gemma":[0.9993037,0.00028949484,0.000057139772,0.00020729107,0.00009754362,0.000044817793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016872134,0.00009466556,0.00010783951,0.00016735423,0.00048717653,0.000089814355,0.00030937153,0.000008718826,0.00004463199],"category_scores_gemma":[0.000011176991,0.00009283172,0.00004935069,0.00045428707,0.0000051966226,0.00013659259,0.00021283967,0.00008346649,0.0000136653425],"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.000030640585,0.0018056427,0.00020270907,0.00002361189,0.000095693715,0.00004974959,0.0075148824,0.15377077,0.0004228562,0.03624585,0.016753424,0.78308415],"study_design_scores_gemma":[0.0011658802,0.0024120514,0.003247205,0.0000028045963,0.000007748237,0.000012509587,0.00285362,0.9683465,0.00025184517,0.0027986325,0.018686116,0.00021512006],"about_ca_topic_score_codex":0.0000071675836,"about_ca_topic_score_gemma":0.000001268966,"teacher_disagreement_score":0.8145757,"about_ca_system_score_codex":0.00006797239,"about_ca_system_score_gemma":0.00005741397,"threshold_uncertainty_score":0.37855673},"labels":[],"label_agreement":null},{"id":"W4289389740","doi":"10.1145/3239561","title":"Windrose Planarity","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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":"Combinatorics; Planar graph; Planarity testing; Mathematics; Planar; Graph drawing; Vertex (graph theory); Monotone polygon; Embedding; Partition (number theory); Planar straight-line graph; Graph; Discrete mathematics; Geometry; Line graph; Pathwidth; Computer science","score_opus":0.02577832039923237,"score_gpt":0.27611472930724423,"score_spread":0.25033640890801184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289389740","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.003360214,0.00001632381,0.99186635,0.0024981834,0.0010342244,0.00008679668,0.000007987364,0.00018908425,0.00094084954],"genre_scores_gemma":[0.7043523,0.0000084969115,0.29338714,0.0009879277,0.00026807893,0.000015797685,0.0000048855572,0.0000070152896,0.0009683257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909055,0.000037348127,0.00015156149,0.00030356896,0.00024364432,0.00017333424],"domain_scores_gemma":[0.99911445,0.00009153498,0.0000333218,0.0005649582,0.000108433196,0.00008727649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001574394,0.000101194906,0.00008531668,0.000156486,0.00033662896,0.000095879615,0.0004925448,0.000053670035,0.00012383658],"category_scores_gemma":[0.000020127034,0.0001003369,0.00005591249,0.00055931165,0.000049342736,0.00035472604,0.000011286258,0.00012583139,0.0004716535],"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.000010419868,0.00019445735,0.000008403278,0.0000027987594,0.000026683925,0.0000068191594,0.00032761417,0.0019245762,0.00035486682,0.0054395595,0.00078790763,0.9909159],"study_design_scores_gemma":[0.002130843,0.0019770842,0.01275781,0.000044245826,0.0000430783,0.00026233098,0.00006901952,0.6837581,0.092396714,0.10846218,0.09695443,0.0011441902],"about_ca_topic_score_codex":0.00001935185,"about_ca_topic_score_gemma":0.000017770824,"teacher_disagreement_score":0.9897717,"about_ca_system_score_codex":0.000033231452,"about_ca_system_score_gemma":0.000056888537,"threshold_uncertainty_score":0.6062309},"labels":[],"label_agreement":null},{"id":"W4291108983","doi":"10.1007/978-3-319-03841-4_13","title":"On Balanced -Contact Representations","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar; Planar graph; Vertex (graph theory); Graph; Physics; Representation (politics); Mathematics; Computer science; Computer graphics (images)","score_opus":0.01714351726157777,"score_gpt":0.26131635969327727,"score_spread":0.2441728424316995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291108983","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.00019847047,0.00012220813,0.9789205,0.0010993154,0.0019279445,0.00040951115,0.0000039209895,0.0001468992,0.017171236],"genre_scores_gemma":[0.4360488,0.000045843008,0.55299556,0.0051894877,0.0010566926,0.00004881923,0.000042645162,0.00004691312,0.0045252303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681455,0.00003366675,0.00043133274,0.0013443696,0.00094245595,0.0004336278],"domain_scores_gemma":[0.99745417,0.00071097765,0.00022836652,0.0011548665,0.00029285793,0.00015875888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041249464,0.0003852823,0.0003395198,0.00091027777,0.0002713002,0.0006125399,0.0018495125,0.00019634502,0.00013044581],"category_scores_gemma":[0.00013480977,0.00035937663,0.00011632182,0.00067356107,0.00016526124,0.00069422944,0.000519209,0.00053445454,0.00042679714],"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.0000039722395,0.000035102,0.000009679866,0.000011186626,0.000009996588,0.000028244269,0.00023034634,0.17826186,0.0002743188,0.31704074,0.00035698374,0.50373757],"study_design_scores_gemma":[0.00025124958,0.00020359675,0.00048220655,0.00014196707,0.000003860663,0.000029332848,5.4426877e-8,0.5595749,0.0012023213,0.43625706,0.001388862,0.00046456163],"about_ca_topic_score_codex":0.000017128086,"about_ca_topic_score_gemma":0.000018162178,"teacher_disagreement_score":0.503273,"about_ca_system_score_codex":0.00023309565,"about_ca_system_score_gemma":0.00041504911,"threshold_uncertainty_score":0.9998858},"labels":[],"label_agreement":null},{"id":"W4293390043","doi":"10.18452/28478","title":"Combinatorial Properties and Recognition of Unit Square Visibility Graphs","year":2017,"lang":"en","type":"preprint","venue":"edoc Publication server (Humboldt University of Berlin)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Visibility; Square tiling; Square (algebra); Unit (ring theory); Grid; Combinatorics; Visibility graph; Unit square; Graph; Integer (computer science); Mathematics; Computer science; Unit disk graph; Plane (geometry); Discrete mathematics; Geometry; Telecommunications; Physics; Optics","score_opus":0.06072508625142518,"score_gpt":0.24332427593908146,"score_spread":0.1825991896876563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293390043","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.9622893,0.00025554962,0.032800056,0.0014867904,0.001007555,0.00062473165,0.00009840999,0.00011021451,0.0013273975],"genre_scores_gemma":[0.99355596,0.00012669312,0.0054270127,0.000024628986,0.00006385895,0.0000015782522,0.00042845792,0.000006952708,0.0003648722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982267,0.00021115733,0.0003562183,0.0006058012,0.00045537262,0.0001447767],"domain_scores_gemma":[0.9957415,0.00007135125,0.0009235515,0.0010091887,0.0021498345,0.000104606865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072926626,0.00019062999,0.00036250622,0.00038966586,0.00028382242,0.00021384821,0.0011131426,0.00025323042,0.00003723117],"category_scores_gemma":[0.0001683451,0.00023124706,0.00014563189,0.00030588868,0.00021525321,0.0013652479,0.0011447138,0.0002588309,0.000008178992],"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.0007445832,0.0037340978,0.035438277,0.0064222193,0.0012644205,0.000013801256,0.0194165,0.0029939676,0.003691076,0.6224031,0.008825713,0.29505226],"study_design_scores_gemma":[0.00552905,0.000673769,0.41042104,0.0011301321,0.0003755847,0.000015149802,0.0007305747,0.05565891,0.012255377,0.49279413,0.018481223,0.001935074],"about_ca_topic_score_codex":0.00053633004,"about_ca_topic_score_gemma":0.000067580884,"teacher_disagreement_score":0.37498277,"about_ca_system_score_codex":0.00004726675,"about_ca_system_score_gemma":0.0004614683,"threshold_uncertainty_score":0.9429982},"labels":[],"label_agreement":null},{"id":"W4297444930","doi":"10.48550/arxiv.1504.00084","title":"Stochastic domain decomposition for time dependent adaptive mesh\\n generation","year":2015,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Österreichischen Akademie der Wissenschaften","keywords":"Polygon mesh; Domain decomposition methods; Mesh generation; Laplacian smoothing; T-vertices; Partial differential equation; Computer science; Domain (mathematical analysis); Measure (data warehouse); Applied mathematics; Representation (politics); Context (archaeology); Generator (circuit theory); Boundary (topology); Mathematical optimization; Algorithm; Mathematics; Topology (electrical circuits); Finite element method; Mathematical analysis; Physics; Power (physics)","score_opus":0.09373326004970324,"score_gpt":0.22048676418064267,"score_spread":0.12675350413093944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297444930","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.12233983,0.00012844263,0.87309,0.00016094043,0.0018880705,0.001716239,0.00015177703,0.00014024861,0.00038444577],"genre_scores_gemma":[0.9721793,0.00003180729,0.022933923,0.00013109054,0.0010249682,0.00001810692,0.000769807,0.000040709492,0.0028703015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995512,0.0005445628,0.00062623085,0.0022962552,0.00036304057,0.00065792544],"domain_scores_gemma":[0.99570936,0.0003340534,0.0007457284,0.0009924204,0.0017107547,0.0005077046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013152373,0.0007091725,0.0006400165,0.0006683227,0.0007401395,0.0004173332,0.0012928249,0.0005364695,0.00009096379],"category_scores_gemma":[0.000082007304,0.0009239361,0.000423804,0.0009900576,0.00013645792,0.0011168103,0.0010617805,0.00048705755,0.00043457068],"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.00030987355,0.00025517942,0.000004105944,0.000032097185,0.0001970009,0.000039047638,0.00046589447,0.88377917,0.0013208961,0.11021623,0.0011669225,0.002213569],"study_design_scores_gemma":[0.0018559829,0.00056854135,0.0000348122,0.00008000929,0.0002391227,0.000025872196,0.000074306474,0.90403265,0.00052059087,0.09147691,0.00023589807,0.00085532694],"about_ca_topic_score_codex":0.000038799186,"about_ca_topic_score_gemma":0.000054907774,"teacher_disagreement_score":0.85015607,"about_ca_system_score_codex":0.0012365002,"about_ca_system_score_gemma":0.0011775714,"threshold_uncertainty_score":0.9993211},"labels":[],"label_agreement":null},{"id":"W4298439955","doi":"10.1007/978-3-031-14788-3_14","title":"Computing the Integer Hull of Convex Polyhedral Sets","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Western University","funders":"","keywords":"Convex hull; Integer (computer science); Integer programming; Hull; Polyhedron; Computer science; Set (abstract data type); Maple; Regular polygon; Mathematical optimization; Algorithm; Combinatorics; Mathematics; Programming language; Geometry","score_opus":0.017855201496251517,"score_gpt":0.2560381028199989,"score_spread":0.23818290132374736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298439955","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.0004933118,0.00057290186,0.99174094,0.0015036039,0.0025584707,0.00033893593,0.0000074280274,0.00007901197,0.0027054136],"genre_scores_gemma":[0.80648184,0.000028203829,0.19008791,0.0025504672,0.0004958714,0.000007331774,0.000020937207,0.000030556588,0.00029685334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965491,0.000088235276,0.0006312536,0.0010202538,0.0012599739,0.00045116048],"domain_scores_gemma":[0.99717915,0.0009509909,0.00045450567,0.0010391767,0.0002818666,0.000094321374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001394748,0.0003796668,0.00044895447,0.0006946407,0.00046557962,0.00026316525,0.0032947934,0.00013949933,0.00010663358],"category_scores_gemma":[0.000095641364,0.0003036748,0.00016876712,0.0010178126,0.0005865165,0.00041509297,0.0022282607,0.00086191634,0.000015555248],"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.0000065846953,0.0000329934,0.000043315165,0.00002973489,0.000019566973,0.000027884586,0.0014830303,0.30702212,0.0001497037,0.10873199,0.000075224656,0.58237785],"study_design_scores_gemma":[0.00021414102,0.00018233898,0.00026290817,0.0001031896,0.000008757505,0.00010543801,6.365491e-7,0.9150147,0.00096444646,0.07826328,0.0044554826,0.00042471787],"about_ca_topic_score_codex":0.000033178956,"about_ca_topic_score_gemma":0.000020909998,"teacher_disagreement_score":0.80598855,"about_ca_system_score_codex":0.0002065393,"about_ca_system_score_gemma":0.0007009337,"threshold_uncertainty_score":0.9999415},"labels":[],"label_agreement":null},{"id":"W4299433101","doi":"","title":"Permutations sortable by two stacks in parallel and quarter plane walks (conference version)","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Plane (geometry); Combinatorics; Computer science; Mathematics; Parallel computing; Geometry; History","score_opus":0.011105624304725543,"score_gpt":0.22685140843927773,"score_spread":0.2157457841345522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299433101","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.082726516,0.00048698456,0.8985322,0.009019464,0.00019612357,0.0003007197,0.000046074856,0.00012322629,0.008568654],"genre_scores_gemma":[0.9131744,0.00020814025,0.082603484,0.00016393393,0.0000183344,0.00006039782,0.0008531973,0.000014476778,0.002903674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958807,0.002149735,0.00045067634,0.0008333503,0.00038311866,0.00030238187],"domain_scores_gemma":[0.9966504,0.00088805787,0.00029395308,0.001114327,0.00088854105,0.00016471338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024442966,0.00026919277,0.000295413,0.0002597382,0.00027394405,0.00068213296,0.0010103425,0.00017448032,0.00007331839],"category_scores_gemma":[0.00029206846,0.00030152526,0.00007259657,0.00034603357,0.0000985608,0.00034354144,0.0009215736,0.00046298816,0.000042251275],"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.00003787114,0.001462116,0.00691221,0.00040251808,0.00014860003,0.000020225049,0.02910459,0.028379684,0.006094292,0.7862108,0.026778378,0.11444874],"study_design_scores_gemma":[0.0014782813,0.0000018843684,0.008235578,0.0007445256,0.00002255704,0.00001827225,0.00011021962,0.92733324,0.0033924596,0.04047197,0.01742054,0.0007704673],"about_ca_topic_score_codex":0.00075248204,"about_ca_topic_score_gemma":0.0012858388,"teacher_disagreement_score":0.89895356,"about_ca_system_score_codex":0.00007675365,"about_ca_system_score_gemma":0.0002604874,"threshold_uncertainty_score":0.9999437},"labels":[],"label_agreement":null},{"id":"W4299557869","doi":"10.4153/cmb-2009-048-x","title":"Indecomposable Coverings","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Mathematical Society; Hungarian Scientific Research Fund; City University of New York; National Science Foundation","keywords":"Mathematics; Quadrilateral; Combinatorics; Indecomposable module; Plane (geometry); Set (abstract data type); Geometry; Pure mathematics; Physics","score_opus":0.007073528162268919,"score_gpt":0.20493989111597233,"score_spread":0.1978663629537034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299557869","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.019306032,0.000069909634,0.83829206,0.036574785,0.00014509234,0.00018124717,0.0000026197067,0.00013807476,0.105290174],"genre_scores_gemma":[0.9321016,0.0000017278743,0.05821274,0.006669418,0.00007649595,0.0000047786625,0.000005023721,0.000004336954,0.0029238684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924016,0.000018413662,0.00014944213,0.00018671923,0.0001503631,0.0002549219],"domain_scores_gemma":[0.99929094,0.000059445712,0.00002427541,0.00022505123,0.000046972204,0.00035328305],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001776605,0.00008325211,0.00009960705,0.0001227065,0.0001066758,0.00015088709,0.0003425885,0.00004451696,0.0019047783],"category_scores_gemma":[0.0000904927,0.00008279887,0.000036865713,0.00023075796,0.000013031735,0.00007756212,0.00002021217,0.00007780932,0.007505441],"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":[8.877537e-7,0.00002763556,0.0000047024578,0.000006352971,0.0000035918774,0.00002430005,0.0001018513,0.0003533719,0.00012075176,0.93693215,0.045343664,0.017080726],"study_design_scores_gemma":[0.0002541795,0.00010089688,0.0009817691,0.000028326785,0.0000037783072,0.000083104795,0.0000075870125,0.0357921,0.00073103706,0.42748582,0.5342338,0.00029757374],"about_ca_topic_score_codex":0.00007234547,"about_ca_topic_score_gemma":0.000045420788,"teacher_disagreement_score":0.9127956,"about_ca_system_score_codex":0.00007400044,"about_ca_system_score_gemma":0.00014289848,"threshold_uncertainty_score":0.99900764},"labels":[],"label_agreement":null},{"id":"W4300064357","doi":"","title":"An extension of the advancing front method to composite geometry","year":2007,"lang":"en","type":"book-chapter","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Trois-Rivières","funders":"","keywords":"Intersection (aeronautics); Geometry; Parametric statistics; Point (geometry); Front (military); Extension (predicate logic); Parametric surface; Domain (mathematical analysis); Composite number; Mesh generation; Computer science; Complex geometry; Mathematics; Algorithm; Structural engineering; Mathematical analysis; Engineering; Finite element method; Mechanical engineering","score_opus":0.01614703653016896,"score_gpt":0.26050753446815594,"score_spread":0.24436049793798698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300064357","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.0009362379,0.0004526177,0.8985048,0.0018923864,0.0002778048,0.00033203166,0.00001639207,0.00010093478,0.097486794],"genre_scores_gemma":[0.02494848,0.000059819937,0.8765328,0.0006003056,0.000054043565,0.000008542569,0.00010209016,0.000042517207,0.09765144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99631184,0.0013541981,0.000584695,0.0007485021,0.0007231366,0.00027759912],"domain_scores_gemma":[0.993497,0.0011731777,0.00052351994,0.0022747817,0.0023138032,0.00021770825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0061121034,0.0002893751,0.0003489059,0.00043246208,0.00035192893,0.00017262614,0.0018231962,0.00019900787,0.00007956773],"category_scores_gemma":[0.00032823673,0.00026190712,0.00020671757,0.00039082018,0.000078758654,0.00027203132,0.0008157363,0.00035659425,0.00004089398],"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.000009777321,0.00015525786,0.000045655048,0.000041852036,0.000038894294,0.0000033104627,0.0020236408,0.002388103,0.01911961,0.6297329,0.0007355631,0.34570545],"study_design_scores_gemma":[0.0010852655,0.000008904488,0.008154662,0.003943949,0.00013937254,0.00010883699,0.000051223167,0.22866741,0.3546745,0.06470716,0.33666143,0.0017973012],"about_ca_topic_score_codex":0.00012695561,"about_ca_topic_score_gemma":0.00037751131,"teacher_disagreement_score":0.56502575,"about_ca_system_score_codex":0.00011706444,"about_ca_system_score_gemma":0.0001965539,"threshold_uncertainty_score":0.9999833},"labels":[],"label_agreement":null},{"id":"W4301413600","doi":"10.20382/jocg.v5i1a1","title":"Unions of onions: preprocessing imprecise points for fast onion decomposition","year":2014,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Decomposition; Combinatorics; Mathematics; Matching (statistics); Disjoint union (topology); Binary logarithm; Time complexity; Regular polygon; Set (abstract data type); Point (geometry); Data structure; Discrete mathematics; Unit disk; Computer science; Chemistry; Statistics; Geometry","score_opus":0.015156682061775414,"score_gpt":0.2662926280989182,"score_spread":0.2511359460371428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301413600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074428976,0.0002366387,0.9221187,0.0010234411,0.0013195823,0.00034198392,0.00009001214,0.000043026674,0.0003976133],"genre_scores_gemma":[0.7167227,0.000059991577,0.28228855,0.0001543855,0.00038650527,0.000001539108,0.00018687885,0.000020416723,0.00017897204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699664,0.00028251825,0.00101832,0.00052390766,0.0009060115,0.0002725967],"domain_scores_gemma":[0.9929143,0.0010067194,0.0023472048,0.00037426729,0.0030860882,0.00027139907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001043256,0.0003382529,0.0006898478,0.0028814853,0.0002704721,0.00019052658,0.0013289058,0.0002922415,0.000013845573],"category_scores_gemma":[0.00030937063,0.00038364463,0.00059828034,0.0014190801,0.00009077283,0.00086793484,0.00050064485,0.00053365045,0.0000032247574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015391575,0.00028839812,0.00010536198,0.00029681678,0.00024107765,0.000011819839,0.00022220841,0.9487428,0.0005309502,0.026906045,0.00097395596,0.021526655],"study_design_scores_gemma":[0.004977685,0.0013929086,0.005505126,0.0018351268,0.0004984897,0.00031819026,0.00022047762,0.774337,0.0053544557,0.18493235,0.019401876,0.0012263008],"about_ca_topic_score_codex":0.0000068039367,"about_ca_topic_score_gemma":0.0000023069442,"teacher_disagreement_score":0.64229375,"about_ca_system_score_codex":0.00035933062,"about_ca_system_score_gemma":0.0013994138,"threshold_uncertainty_score":0.99986154},"labels":[],"label_agreement":null},{"id":"W4302403691","doi":"10.48550/arxiv.1402.0266","title":"A stochastic domain decomposition method for time dependent mesh generation","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon mesh; Domain decomposition methods; Generator (circuit theory); Mesh generation; Domain (mathematical analysis); Grid; Decomposition; Computer science; Boundary (topology); Probabilistic logic; Algorithm; Time domain; Mathematical optimization; Applied mathematics; Topology (electrical circuits); Mathematics; Power (physics); Mathematical analysis; Geometry; Finite element method; Artificial intelligence; Engineering; Physics; Combinatorics; Computer graphics (images)","score_opus":0.049901856115296725,"score_gpt":0.23088398407146593,"score_spread":0.1809821279561692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302403691","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.030095423,0.000026877402,0.9679287,0.00017887779,0.0007564465,0.0006475963,0.000025322508,0.00016822558,0.00017253676],"genre_scores_gemma":[0.7935332,0.000005125587,0.204683,0.00017746164,0.00040658758,0.000010220572,0.00031909937,0.000015694091,0.0008496055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799955,0.0002960717,0.00024940915,0.0010567516,0.00013519362,0.00026301562],"domain_scores_gemma":[0.9983998,0.0002577313,0.0002803421,0.00061976875,0.00030692195,0.0001354553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007218234,0.0002772283,0.00029409517,0.0003436072,0.0002690177,0.00020326063,0.00076615956,0.00024104334,0.000020728141],"category_scores_gemma":[0.00003919215,0.00033891544,0.00021161053,0.00032233607,0.00002213098,0.000304355,0.000560095,0.00022062773,0.00007810485],"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.000022023212,0.00005139551,0.0000019591614,0.000026059628,0.0000529981,0.0000068164486,0.00007487862,0.88437706,0.00181535,0.11080748,0.0005488685,0.002215099],"study_design_scores_gemma":[0.00051986694,0.000082277096,0.000023460774,0.000023758728,0.00006133038,0.000008856796,0.0000039973756,0.89806193,0.00070090365,0.099978186,0.0002102833,0.00032513638],"about_ca_topic_score_codex":0.000016740447,"about_ca_topic_score_gemma":0.00001706057,"teacher_disagreement_score":0.76343775,"about_ca_system_score_codex":0.00024264968,"about_ca_system_score_gemma":0.00019144938,"threshold_uncertainty_score":0.9999063},"labels":[],"label_agreement":null},{"id":"W4302856080","doi":"10.48550/arxiv.1507.08923","title":"On the Displacement for Covering a Unit Interval with Randomly Placed\\n Sensors","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Displacement (psychology); RADIUS; Energy (signal processing); Range (aeronautics); Power (physics); Interval (graph theory); Energy consumption; Line (geometry); Focus (optics); Unit interval; Function (biology); Mathematics; Electrical engineering; Computer science; Geometry; Mathematical analysis; Engineering; Physics; Combinatorics; Statistics; Optics","score_opus":0.09625869643822474,"score_gpt":0.20643140528651768,"score_spread":0.11017270884829294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302856080","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.37615967,0.000007930076,0.62194854,0.0002862237,0.00026681117,0.00051538675,0.000012356077,0.000055204888,0.00074784184],"genre_scores_gemma":[0.99554324,0.000008249016,0.0011730138,0.00016547018,0.0000726906,0.000007796573,0.00003161979,0.000011098041,0.0029868062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877495,0.00013340663,0.00013094443,0.00062014937,0.00013542315,0.00020511432],"domain_scores_gemma":[0.9984342,0.0004725645,0.00017225936,0.000576671,0.0002483413,0.0000959841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005118991,0.00022388257,0.00020803073,0.00015126675,0.000180166,0.00015119114,0.00077581464,0.00008568132,0.000011159413],"category_scores_gemma":[0.000066813496,0.00017339033,0.00011194011,0.00034182108,0.000045437413,0.000164273,0.0005676897,0.00025525803,0.000023179431],"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.00040842145,0.0000385648,0.00008617705,0.00002187529,0.000089638714,0.000016473901,0.00016552549,0.80728245,0.000005586772,0.19069326,0.0010905789,0.000101430785],"study_design_scores_gemma":[0.0019000517,0.00023685094,0.00013829746,0.00009799903,0.000057237186,0.0000041204976,0.00006994523,0.9674744,0.00016301768,0.027772723,0.0018073941,0.00027798102],"about_ca_topic_score_codex":0.000020387633,"about_ca_topic_score_gemma":0.000025368543,"teacher_disagreement_score":0.6207755,"about_ca_system_score_codex":0.00016157102,"about_ca_system_score_gemma":0.0002269184,"threshold_uncertainty_score":0.7070652},"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":"W4307814556","doi":"10.1016/j.neunet.2022.10.022","title":"Reinforcement learning for automatic quadrilateral mesh generation: A soft actor–critic approach","year":2022,"lang":"en","type":"article","venue":"Neural Networks","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":52,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reinforcement learning; Mesh generation; Scalability; Artificial intelligence; Markov decision process; Software; Machine learning; Finite element method; Markov process","score_opus":0.028663286105954974,"score_gpt":0.2520052945808472,"score_spread":0.22334200847489222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307814556","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.017506374,0.0001474449,0.9798288,0.00057159155,0.0011569798,0.0004182976,6.661714e-7,0.00020280456,0.00016707159],"genre_scores_gemma":[0.9818912,0.0000024200247,0.0149140945,0.0009919098,0.00067650893,0.00035353177,0.00021035265,0.0000123712225,0.0009475896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985162,0.00014937532,0.0002965744,0.00037205915,0.00035102403,0.00031479032],"domain_scores_gemma":[0.99940807,0.00011805511,0.00010446176,0.00022049298,0.00007228845,0.00007663904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034676545,0.00014574094,0.00014930159,0.00009832487,0.0008496837,0.00022407866,0.00038677652,0.00003607736,0.000061264625],"category_scores_gemma":[0.00002647969,0.00015274774,0.000100410994,0.0004228229,0.000013282479,0.00035303397,0.0002414696,0.0002490299,0.0000022236736],"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.0000055862424,0.000026964304,0.00002557789,0.000010430803,0.000011436436,0.000001994866,0.00021971304,0.95979553,0.00012349374,0.006466084,0.0030669637,0.030246226],"study_design_scores_gemma":[0.00035236584,0.0002316714,0.00008910177,0.0000019774654,0.000008492107,0.00003728814,0.000016583797,0.99448967,0.00003391313,0.00021715475,0.004347051,0.00017474164],"about_ca_topic_score_codex":0.0000029219102,"about_ca_topic_score_gemma":8.5801645e-7,"teacher_disagreement_score":0.9649147,"about_ca_system_score_codex":0.00008315845,"about_ca_system_score_gemma":0.000044015414,"threshold_uncertainty_score":0.6535166},"labels":[],"label_agreement":null},{"id":"W4308284817","doi":"10.48550/arxiv.2211.01439","title":"Inter model sets in $\\mathbb R^d$ are model sets","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"MacEwan University","funders":"","keywords":"Set (abstract data type); Countable set; Class (philosophy); Scheme (mathematics); Window (computing); Measure (data warehouse); Space (punctuation); Euclidean space; Mathematics; Computer science; Euclidean geometry; Topology (electrical circuits); Discrete mathematics; Algorithm; Combinatorics; Artificial intelligence; Data mining; Mathematical analysis; Geometry","score_opus":0.1054079881340358,"score_gpt":0.2131892233247284,"score_spread":0.10778123519069259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308284817","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.28261667,0.000034055145,0.7149552,0.0001853176,0.00033479108,0.00019962546,0.000036295638,0.00012013337,0.0015179155],"genre_scores_gemma":[0.9868024,0.000050168313,0.0101744905,0.00034422465,0.000024293066,0.0000043174427,0.000076399774,0.000016184564,0.0025075048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799216,0.00013589373,0.00025013485,0.0011455915,0.00016352769,0.00031272354],"domain_scores_gemma":[0.9985831,0.000060410377,0.00023362052,0.0008744524,0.00012406279,0.0001243594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030812438,0.00029277275,0.00029714403,0.0006079226,0.00015613493,0.00011263263,0.0015298391,0.00018443067,0.00004219133],"category_scores_gemma":[0.00002223224,0.00037755154,0.00017542414,0.0007864352,0.000034326025,0.00047679656,0.0031785066,0.00070754765,0.000034196735],"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.000015582855,0.00009650514,0.00043220617,0.000033384087,0.000019859372,0.00012559458,0.00039887585,0.9381569,0.000010132388,0.059556175,0.00063216325,0.0005226481],"study_design_scores_gemma":[0.00030116035,0.000015366715,0.00031835985,0.000035638714,0.000013025701,0.0000030658266,0.000040602816,0.8704076,0.00001690134,0.12841074,0.00010428912,0.00033329058],"about_ca_topic_score_codex":0.00003629884,"about_ca_topic_score_gemma":0.00007561347,"teacher_disagreement_score":0.7047807,"about_ca_system_score_codex":0.0004181518,"about_ca_system_score_gemma":0.00037697155,"threshold_uncertainty_score":0.9998676},"labels":[],"label_agreement":null},{"id":"W4308764175","doi":"10.48550/arxiv.0909.1062","title":"New Approximation Algorithms for Minimum Enclosing Convex Shapes","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 Alberta","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Ball (mathematics); Regular polygon; Convex polytope; Unit sphere; Euclidean space; Convex body; Euclidean geometry; Convex hull; Convex set; Geometry; Convex optimization","score_opus":0.0907015003728285,"score_gpt":0.2150623176553298,"score_spread":0.1243608172825013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308764175","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.009702532,0.000105937004,0.98758835,0.0002664407,0.0006147391,0.00049323635,0.000009923311,0.00019566753,0.0010231942],"genre_scores_gemma":[0.74524534,0.00005539873,0.25074384,0.00024975635,0.00049398013,0.0000021555284,0.00012488225,0.000013682994,0.003070998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849814,0.000064968866,0.0002118166,0.00086727325,0.00010810092,0.0002496812],"domain_scores_gemma":[0.99886215,0.00013418509,0.00024057955,0.00038903064,0.00022660398,0.00014747721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023879558,0.00024242548,0.00024832506,0.00029719342,0.00018273758,0.00021506124,0.0008565453,0.00021638078,0.000017477292],"category_scores_gemma":[0.000036262198,0.00029985188,0.00018559939,0.00048396213,0.000021985232,0.0004814499,0.00040707967,0.00020853577,0.000023000972],"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.000026164289,0.0000725496,0.000024558252,0.00007484686,0.00005733669,0.000018891136,0.00024267004,0.58774716,0.00022146612,0.34536454,0.0028499211,0.06329989],"study_design_scores_gemma":[0.00038665548,0.00005805817,0.00020118961,0.000040093775,0.000032539254,0.000002805696,0.000011789899,0.7971547,0.00047475245,0.19994968,0.0014176819,0.00027003232],"about_ca_topic_score_codex":0.000022529426,"about_ca_topic_score_gemma":0.000004464935,"teacher_disagreement_score":0.7368445,"about_ca_system_score_codex":0.00014013078,"about_ca_system_score_gemma":0.00036057903,"threshold_uncertainty_score":0.99994534},"labels":[],"label_agreement":null},{"id":"W4311138667","doi":"10.1145/2462356.2462362","title":"Complexity analysis of random geometric structures made simpler","year":2013,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Mathematics; Computer science; Statistical physics; Algorithm; Theoretical computer science; Physics","score_opus":0.03076773950206519,"score_gpt":0.2670630615171161,"score_spread":0.23629532201505093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311138667","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.23767097,0.00004540385,0.7603483,0.00024024559,0.00007857567,0.00010051646,0.000002625505,0.000040123847,0.0014731942],"genre_scores_gemma":[0.92894566,0.0000029994223,0.07041672,0.00023467581,0.00002427834,0.0000059888157,0.000024031042,0.0000018286739,0.00034381394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906534,0.000051271716,0.0002516847,0.00021254626,0.00028668044,0.0001325068],"domain_scores_gemma":[0.9991465,0.00020363378,0.000092147406,0.00028594286,0.00020942956,0.00006232527],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015331442,0.00008098673,0.00022180048,0.0010151579,0.00006011585,0.00008817004,0.0003612254,0.00003010666,0.0012249143],"category_scores_gemma":[0.00005544559,0.00006439021,0.00013049676,0.004641885,0.00003147913,0.00032407785,0.00010905339,0.000042341086,0.00003092536],"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.000017744018,0.00018226118,0.010377055,0.000026234351,0.0015831236,0.0000015210296,0.00040330144,0.21424922,0.0074937595,0.57512254,0.011674488,0.17886876],"study_design_scores_gemma":[0.00037910457,0.000024205783,0.4346199,5.3425356e-7,0.00006657936,0.0000011921447,0.000008645473,0.53495157,0.0035846552,0.025878496,0.00038269183,0.00010243816],"about_ca_topic_score_codex":0.00024715802,"about_ca_topic_score_gemma":0.000019247002,"teacher_disagreement_score":0.6912747,"about_ca_system_score_codex":0.000012759638,"about_ca_system_score_gemma":0.000023903436,"threshold_uncertainty_score":0.9996881},"labels":[],"label_agreement":null},{"id":"W4311838665","doi":"10.1007/978-3-031-20624-5_42","title":"Local Routing Algorithms on Euclidean Spanners with Small Diameter","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Agence Nationale de la Recherche","keywords":"Combinatorics; Delaunay triangulation; Vertex (graph theory); Mathematics; Path (computing); Routing (electronic design automation); Euclidean geometry; Triangulation; Discrete mathematics; Algorithm; Graph; Computer science; Geometry","score_opus":0.022383886416188988,"score_gpt":0.23250546014862314,"score_spread":0.21012157373243415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311838665","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.00012976598,0.00014209618,0.9939687,0.0008829475,0.0015235671,0.00034956855,0.000005990605,0.00016326325,0.0028340598],"genre_scores_gemma":[0.1674973,0.000027923646,0.8269061,0.004167161,0.0006584417,0.00002573909,0.000034613866,0.00006117219,0.00062156137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571717,0.00006380611,0.00045103393,0.0017411022,0.0013239576,0.00070292846],"domain_scores_gemma":[0.9976893,0.00064923766,0.0002852152,0.0009952805,0.00019227967,0.00018866207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010302089,0.00053617154,0.0004333248,0.0010152924,0.00052697724,0.0004986553,0.002201342,0.00016048457,0.0000591345],"category_scores_gemma":[0.00005237946,0.0004696516,0.00012267487,0.0010146467,0.0004104052,0.00044469818,0.0011862625,0.0009847546,0.000034822755],"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.000007572042,0.000020491343,0.0000075011035,0.0000069490675,0.000008940197,0.00008709739,0.00024529896,0.40933752,0.000009315174,0.022912333,0.000008571272,0.5673484],"study_design_scores_gemma":[0.00042228418,0.00088557403,0.00010627115,0.0002006223,0.000011133953,0.00014418924,6.638285e-7,0.95907676,0.00086001237,0.030598154,0.0067988103,0.00089552766],"about_ca_topic_score_codex":0.000032342,"about_ca_topic_score_gemma":0.00006991497,"teacher_disagreement_score":0.56645286,"about_ca_system_score_codex":0.00048314524,"about_ca_system_score_gemma":0.00061184354,"threshold_uncertainty_score":0.9997755},"labels":[],"label_agreement":null},{"id":"W4312727954","doi":"10.1007/978-3-031-20624-5_41","title":"Piercing Pairwise Intersecting Convex Shapes in the Plane","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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; University of Windsor; University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Regular polygon; Convex body; Pairwise comparison; RADIUS; Euclidean geometry; Geometry; Convex hull; Computer science","score_opus":0.021423640429588553,"score_gpt":0.24414056668890252,"score_spread":0.22271692625931397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312727954","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.0008007158,0.00039244557,0.991724,0.00154389,0.0015161069,0.00035965574,0.0000033234091,0.000080998696,0.003578876],"genre_scores_gemma":[0.90240633,0.00003651551,0.091629885,0.0048991973,0.0006806582,0.000032032516,0.000021494601,0.000026490034,0.00026742028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967588,0.00011207149,0.0004921925,0.0011011548,0.0010675109,0.00046825083],"domain_scores_gemma":[0.99780434,0.0011867693,0.00022800839,0.00062066835,0.00009311898,0.00006711694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020850296,0.00035215073,0.0003364048,0.0009794277,0.00041031864,0.00053194864,0.002508457,0.00012508858,0.000088163826],"category_scores_gemma":[0.00012450026,0.00029245054,0.00009763325,0.001084033,0.00020920072,0.00059576955,0.0011491913,0.0010667723,0.000015570951],"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.0000073099413,0.000036296136,0.00006684457,0.000028663262,0.000007497611,0.00024536773,0.0057293978,0.37815166,0.000093149494,0.035366647,0.00005114363,0.580216],"study_design_scores_gemma":[0.00028292762,0.00020119417,0.0004062391,0.00017545685,0.000005387772,0.00028310547,0.0000040406003,0.9215596,0.0001879398,0.0695428,0.0068037836,0.0005475319],"about_ca_topic_score_codex":0.000047678954,"about_ca_topic_score_gemma":0.00017888079,"teacher_disagreement_score":0.9016056,"about_ca_system_score_codex":0.00030543364,"about_ca_system_score_gemma":0.00038661459,"threshold_uncertainty_score":0.99995273},"labels":[],"label_agreement":null},{"id":"W4313404159","doi":"10.1142/s0218195922410011","title":"Ruler Wrapping","year":2022,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","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":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ruler; Mathematics; Clockwise; Hinge; Combinatorics; Interval (graph theory); Session (web analytics); Computer science; Geometry; Rotation (mathematics); Engineering; Physics","score_opus":0.012747428891085781,"score_gpt":0.27660298234753367,"score_spread":0.2638555534564479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313404159","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.0049446044,0.0006258454,0.9881606,0.0033302489,0.0012069705,0.0002609737,0.000036693018,0.000065624154,0.0013684535],"genre_scores_gemma":[0.84437364,0.000029159515,0.15228488,0.0016356751,0.0010165534,0.00019264604,0.0001151,0.000017023736,0.00033533043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99662584,0.00013311979,0.00084624666,0.00030985163,0.0018814398,0.00020347927],"domain_scores_gemma":[0.99686736,0.0004247672,0.00077075185,0.0002411045,0.0015536994,0.0001423195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008481563,0.00016703396,0.00021389264,0.0013136618,0.00044158756,0.00023948688,0.002194798,0.000034899214,0.0003042186],"category_scores_gemma":[0.000046864694,0.0001860204,0.00023531054,0.001573209,0.000045996978,0.00075738714,0.0005532825,0.00038755438,0.000052563344],"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.000027392745,0.00037375887,0.0002562972,0.000005262473,0.00020798469,0.000026165178,0.00014517209,0.68189335,0.00026661123,0.19372377,0.0031013722,0.11997285],"study_design_scores_gemma":[0.0012461474,0.00019565443,0.0036999085,0.000011652944,0.000026818156,0.0015673117,0.00013129758,0.057457466,0.00023997038,0.19544423,0.73960614,0.0003734004],"about_ca_topic_score_codex":0.000002862509,"about_ca_topic_score_gemma":2.7372863e-7,"teacher_disagreement_score":0.839429,"about_ca_system_score_codex":0.00029812477,"about_ca_system_score_gemma":0.0004661063,"threshold_uncertainty_score":0.75856924},"labels":[],"label_agreement":null},{"id":"W4313429548","doi":"10.1007/978-3-031-23101-8_6","title":"Morphing Planar Graph Drawings Through 3D","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 British Columbia","funders":"","keywords":"Morphing; Planar graph; Piecewise linear function; Vertex (graph theory); Planar; Computer science; Graph; Planar straight-line graph; Book embedding; Combinatorics; Line drawings; Line (geometry); Crossing number (knot theory); Line graph; Mathematics; Computer graphics (images); Geometry; Theoretical computer science; Engineering drawing; 1-planar graph","score_opus":0.019048153541340613,"score_gpt":0.24400070596534432,"score_spread":0.2249525524240037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313429548","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.00008785164,0.00061639014,0.9886277,0.0012210822,0.002956609,0.00030466277,0.000008063153,0.00020795922,0.0059697246],"genre_scores_gemma":[0.050957646,0.00010799529,0.94169676,0.005431259,0.0009607977,0.000024835957,0.000048658276,0.00004910945,0.0007229206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957289,0.000049032074,0.0005242774,0.0016141149,0.0014923789,0.00059129647],"domain_scores_gemma":[0.99788976,0.00046589633,0.00030017315,0.0010397873,0.00017781489,0.00012659363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087069185,0.00048452607,0.0004332434,0.0009823998,0.0007196231,0.00060563005,0.0029714527,0.00018702897,0.00015196222],"category_scores_gemma":[0.00006566525,0.0004975627,0.00015879181,0.0012757065,0.0003210884,0.0013361278,0.0012518835,0.0009310699,0.00003977584],"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.0000065657614,0.000038796763,0.000022130847,0.00003203209,0.000020944204,0.0001859948,0.0017048906,0.40404236,0.00027820637,0.221682,0.00016942064,0.37181666],"study_design_scores_gemma":[0.00029791097,0.0002142828,0.000076952885,0.00013000873,0.000010962844,0.0001998507,2.4346045e-7,0.3860259,0.0007900006,0.57867694,0.03265907,0.000917854],"about_ca_topic_score_codex":0.000047409492,"about_ca_topic_score_gemma":0.00002557722,"teacher_disagreement_score":0.3708988,"about_ca_system_score_codex":0.00032375377,"about_ca_system_score_gemma":0.0005839828,"threshold_uncertainty_score":0.9997476},"labels":[],"label_agreement":null},{"id":"W4313598201","doi":"10.48550/arxiv.2301.01394","title":"Large Matchings in Maximal 1-planar graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Mathematics; Planar; Graph; Matching (statistics); Discrete mathematics; Computer science","score_opus":0.06873277572545392,"score_gpt":0.19666313494310006,"score_spread":0.12793035921764614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313598201","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.39064386,0.000027526896,0.6074012,0.00023218231,0.00071639573,0.0001584354,0.000020779065,0.00024803853,0.0005515593],"genre_scores_gemma":[0.99534315,0.00007276653,0.0024063468,0.00013970835,0.000052837728,0.000001234529,0.00007918598,0.000012896071,0.0018918536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839306,0.00010961659,0.00018698917,0.0008767209,0.00011153009,0.00032207544],"domain_scores_gemma":[0.99904895,0.00009263291,0.00012939391,0.0005536107,0.00007797985,0.00009745788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004059527,0.00021033516,0.00021843334,0.0006953443,0.00011003327,0.000110622284,0.0010751537,0.00018823371,0.000015515447],"category_scores_gemma":[0.000022699161,0.00026492128,0.00013376796,0.0012437943,0.000024073384,0.00032612332,0.0009706705,0.00044712375,0.00022177487],"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.0000122651645,0.00007668877,0.0032940563,0.000042013053,0.000027185812,0.0004785052,0.00030805462,0.2579109,0.000022625522,0.7367747,0.00078985386,0.0002631806],"study_design_scores_gemma":[0.00039022107,0.000022453283,0.014072366,0.000051340794,0.000011110328,0.000004145358,0.000044843393,0.5125368,0.00002992062,0.47167298,0.00084749045,0.00031630092],"about_ca_topic_score_codex":0.00014899705,"about_ca_topic_score_gemma":0.0002337829,"teacher_disagreement_score":0.6049949,"about_ca_system_score_codex":0.000114572416,"about_ca_system_score_gemma":0.00014305074,"threshold_uncertainty_score":0.9999803},"labels":[],"label_agreement":null},{"id":"W4313893546","doi":"10.22541/essoar.167327971.14203219/v1","title":"A discontinuous Galerkin level set formulation applied to the modelling of deformation patterns in multi-material viscous geological flow","year":2023,"lang":"en","type":"preprint","venue":"","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":"Finite element method; Level set method; Solver; Computer science; Flow (mathematics); Level set (data structures); Computational science; Discontinuous Galerkin method; Deformation (meteorology); Discretization; Boundary (topology); Algorithm; Geometry; Mathematical optimization; Geology; Mathematics; Mathematical analysis; Structural engineering; Engineering; Artificial intelligence","score_opus":0.15843584225165921,"score_gpt":0.2975671359655189,"score_spread":0.1391312937138597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313893546","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.29068074,0.000003067481,0.7076281,0.00032620857,0.0005517788,0.0006440655,0.00007117905,0.000067564695,0.000027294713],"genre_scores_gemma":[0.8844285,0.0000057137527,0.11458163,0.00008921425,0.00012148294,0.00015024764,0.0005330006,0.000009508182,0.00008067592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982196,0.00008196686,0.0006221081,0.00046030863,0.00038886318,0.00022717209],"domain_scores_gemma":[0.9991234,0.000079633006,0.00021359467,0.00042828356,0.00010969098,0.000045389304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007253529,0.00020682582,0.00026491043,0.00030816253,0.000076488905,0.00017673196,0.00064216164,0.00017092921,0.000008990497],"category_scores_gemma":[0.000028035836,0.00015158615,0.000078075784,0.0003297506,0.000009605544,0.00015506033,0.0010213742,0.00020235154,0.000024797544],"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.0000209894,0.00003806933,0.00013660836,0.00004139111,0.000009143802,9.674208e-7,0.001286215,0.9907359,0.00015771491,0.001765856,0.000047767477,0.0057593994],"study_design_scores_gemma":[0.00024238942,0.000030306799,0.0105996085,0.000048666963,0.000005030252,0.0000020851862,0.00004393032,0.98500663,0.0010058432,0.0028144843,0.000018552268,0.00018249323],"about_ca_topic_score_codex":0.0002908151,"about_ca_topic_score_gemma":0.00055084133,"teacher_disagreement_score":0.5937478,"about_ca_system_score_codex":0.00006759784,"about_ca_system_score_gemma":0.000080058264,"threshold_uncertainty_score":0.6181504},"labels":[],"label_agreement":null},{"id":"W4319840215","doi":"10.1177/00375497221141463","title":"DP in ice environments—development of a dynamic positioning in ice validation platform (DPIVP)","year":2023,"lang":"en","type":"article","venue":"SIMULATION","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Implementation; Computer science; Modular design; Unit testing; Software; Component (thermodynamics); Integration testing; Modularity (biology); Systems engineering; Simulation; Software engineering; Engineering; Operating system","score_opus":0.023940011158114803,"score_gpt":0.28692455532137495,"score_spread":0.26298454416326017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319840215","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.63506246,0.00001008169,0.3644947,0.00005492119,0.00007989991,0.00012806393,7.4315386e-7,0.000027094506,0.00014204042],"genre_scores_gemma":[0.9892581,0.0000030814213,0.0104193445,0.00002121645,0.000010077236,0.000013937719,0.00016077138,0.000004316724,0.000109172885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898165,0.000037374382,0.0003551096,0.00021831733,0.00027270513,0.00013484246],"domain_scores_gemma":[0.99958324,0.00014168494,0.00010670135,0.00012431419,0.000022831715,0.00002123503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045903312,0.00007557301,0.000088604866,0.00048201333,0.00006238926,0.00003083027,0.00012575643,0.00004649413,0.000006871715],"category_scores_gemma":[0.00003708919,0.00008936474,0.000018433893,0.0010751493,0.0000071927116,0.0006230304,0.00006885969,0.00006158588,0.000046507463],"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.000006643408,0.000035316072,0.00088127895,0.000009873762,0.0000026275231,0.0000013499413,0.0012922137,0.9572637,0.005476213,0.001105575,0.0000019628749,0.03392321],"study_design_scores_gemma":[0.00032333593,0.000014327743,0.17345421,0.000028022594,0.000001032106,3.8004896e-7,0.00003161168,0.82112885,0.0029088035,0.0019273519,0.00010502794,0.0000770436],"about_ca_topic_score_codex":0.000009596766,"about_ca_topic_score_gemma":0.000033864915,"teacher_disagreement_score":0.35419562,"about_ca_system_score_codex":0.00017273801,"about_ca_system_score_gemma":0.00005227298,"threshold_uncertainty_score":0.36441883},"labels":[],"label_agreement":null},{"id":"W4319996125","doi":"10.1007/978-3-031-22203-0_29","title":"Visibility Representations of Toroidal and Klein-bottle Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Klein bottle; Torus; Visibility; Rectangle; Bounded function; Parallelogram; Representation (politics); Graph; Toroid; Bottle; Combinatorics; Computer science; Mathematics; Physics; Geometry; Mathematical analysis; Artificial intelligence; Optics","score_opus":0.021051156255928592,"score_gpt":0.2765452614974752,"score_spread":0.25549410524154664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319996125","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.0013885612,0.00021912623,0.9951046,0.00040720106,0.0011066012,0.00025428567,0.000009435203,0.00009827508,0.0014119215],"genre_scores_gemma":[0.50401574,0.00014243516,0.49321258,0.0004875328,0.0003790247,0.00001526838,0.000027902903,0.000036562196,0.0016829798],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749047,0.00003375392,0.00045481432,0.0010453076,0.0007057739,0.00026987877],"domain_scores_gemma":[0.9979209,0.0006734493,0.00021514368,0.00079394697,0.00028986137,0.00010670819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077956973,0.00024487826,0.00031812713,0.0007675267,0.00016710504,0.00019253633,0.0010006777,0.00014477367,0.000014103903],"category_scores_gemma":[0.00016202172,0.00024068654,0.000087037166,0.0009121265,0.0004625348,0.00043063442,0.0008130707,0.00028386936,0.000012046813],"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.0000067165065,0.000041481093,0.00039768638,0.0000744364,0.000019473588,0.000024843444,0.000933342,0.08618454,0.0006584306,0.20467329,0.000050091643,0.70693564],"study_design_scores_gemma":[0.000210585,0.00013821208,0.0047456753,0.00011275202,0.000007694557,0.00002591767,3.4004682e-7,0.35018554,0.0015900908,0.6424047,0.0002297397,0.0003487819],"about_ca_topic_score_codex":0.00003417965,"about_ca_topic_score_gemma":0.000087058215,"teacher_disagreement_score":0.7065869,"about_ca_system_score_codex":0.00006692889,"about_ca_system_score_gemma":0.0003133867,"threshold_uncertainty_score":0.9814912},"labels":[],"label_agreement":null},{"id":"W4320083902","doi":"10.4203/ccc.4.3.1","title":"Efficient mesh deformation based on randomized RBF solvers","year":2023,"lang":"en","type":"article","venue":"Civil-comp conferences","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":"Safran Electronics (Canada)","funders":"","keywords":"Polygon mesh; Computer science; Solver; Preconditioner; Radial basis function; Aerodynamics; Interpolation (computer graphics); Computational science; Mesh generation; Mathematical optimization; T-vertices; Algorithm; Applied mathematics; Finite element method; Artificial intelligence; Iterative method; Mathematics; Computer graphics (images); Aerospace engineering; Image (mathematics); Structural engineering","score_opus":0.021979954498089486,"score_gpt":0.2503064348592351,"score_spread":0.2283264803611456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320083902","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.055896815,0.00003759702,0.9151215,0.0017230414,0.0013349723,0.0004991147,0.000005886161,0.00056955434,0.02481154],"genre_scores_gemma":[0.99668455,0.00001293013,0.0024803646,0.00040621666,0.00007843547,0.000062674735,0.00006547898,0.0000048768648,0.00020446382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982965,0.00022382262,0.0003315906,0.00034373082,0.0005429444,0.0002614213],"domain_scores_gemma":[0.9985868,0.00073444966,0.00013974782,0.00028760108,0.00016205109,0.00008939819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010606721,0.00016425933,0.00028097688,0.0003568097,0.00023195877,0.00026062047,0.00046549374,0.000055110046,0.00006130331],"category_scores_gemma":[0.00016507883,0.00013419749,0.00013675643,0.0007825149,0.000069944916,0.0001498061,0.0000758096,0.00010022004,0.00035584607],"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.00059042964,0.0000900804,0.000040247047,0.000026969854,0.000029576377,0.0000061895043,0.00083408674,0.6559894,0.00012724525,0.31668687,0.003417962,0.022160945],"study_design_scores_gemma":[0.009266798,0.000054618315,0.0005525459,0.000028976965,0.000007834978,0.0000012791244,0.000036080048,0.98378605,0.00066708,0.003492723,0.0019363275,0.0001697004],"about_ca_topic_score_codex":0.000022282056,"about_ca_topic_score_gemma":0.000013028298,"teacher_disagreement_score":0.94078773,"about_ca_system_score_codex":0.00003403044,"about_ca_system_score_gemma":0.00021507111,"threshold_uncertainty_score":0.5472415},"labels":[],"label_agreement":null},{"id":"W4321377464","doi":"10.3390/app13042597","title":"Lower Bound for Sculpture Garden Problem: Localization of IoT Devices","year":2023,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University Canada West","funders":"","keywords":"Monotone polygon; Conjecture; Polygon (computer graphics); Vertex (graph theory); Guard (computer science); Sculpture; Combinatorics; Computer science; Upper and lower bounds; Mathematics; Theoretical computer science; Art; Geometry; Visual arts","score_opus":0.02609842024207973,"score_gpt":0.2757502606391312,"score_spread":0.2496518403970515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321377464","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.021351308,0.000059229762,0.9719328,0.0006638561,0.0003078103,0.00035549724,0.0000028144502,0.0001225171,0.005204114],"genre_scores_gemma":[0.95906657,0.000003885744,0.04027525,0.0002467675,0.00007767616,0.000047829606,0.000011175007,0.0000030985373,0.00026776074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998991,0.000013040572,0.00017257656,0.00030189435,0.0003485375,0.00017295081],"domain_scores_gemma":[0.99951917,0.0001272978,0.00009255205,0.00012365577,0.00010315767,0.000034138517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006436356,0.000071094044,0.000091197246,0.00017583984,0.00029977565,0.00013447834,0.0004719725,0.00003465959,0.000006496148],"category_scores_gemma":[0.000022524577,0.000059494716,0.000033593755,0.0016565714,0.00012826003,0.00015595084,0.000086180466,0.00002529855,0.000024700581],"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.000009317623,0.000055565946,0.00024838373,0.00008381699,0.000014273999,5.888217e-7,0.0011588035,0.33725467,0.0067849527,0.6124321,0.008144741,0.033812758],"study_design_scores_gemma":[0.000424681,0.00023330841,0.0013152852,0.00003117943,0.000011175009,0.000002626996,0.00025818511,0.819128,0.01989117,0.112548456,0.04585191,0.00030406343],"about_ca_topic_score_codex":0.0000024135552,"about_ca_topic_score_gemma":0.000011219996,"teacher_disagreement_score":0.93771523,"about_ca_system_score_codex":0.000009339951,"about_ca_system_score_gemma":0.00011697434,"threshold_uncertainty_score":0.2426124},"labels":[],"label_agreement":null},{"id":"W4322630531","doi":"10.3390/fluids8030086","title":"A Highly Scalable Direction-Splitting Solver on Regular Cartesian Grid to Compute Flows in Complex Geometries Described by STL Files","year":2023,"lang":"en","type":"article","venue":"Fluids","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"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":"Grid; Computational science; Solver; Scalability; Triangulation; Computer science; Computation; Regular grid; Cartesian coordinate system; Supercomputer; Parallel computing; Flow (mathematics); Algorithm; Mesh generation; Computer graphics (images); Tracing; Ray tracing (physics); Geometry; Mathematics; Physics; Programming language","score_opus":0.02457150693270149,"score_gpt":0.25243551637665357,"score_spread":0.22786400944395208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322630531","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.59252393,0.00016762057,0.39979872,0.0037684708,0.0015461846,0.0004977936,0.00006362144,0.0007418401,0.0008917966],"genre_scores_gemma":[0.9404465,0.000023535897,0.053694665,0.0014561487,0.0006167375,0.00010581752,0.0005183107,0.00003457484,0.0031037277],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980065,0.00009897542,0.00036588765,0.0005937974,0.0004888146,0.0004460275],"domain_scores_gemma":[0.9990021,0.0002718323,0.00004798174,0.0003928179,0.00013032486,0.00015492563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058828935,0.00020230845,0.00025032106,0.0008094198,0.00029484314,0.0002805591,0.0004706604,0.00007158414,0.000035283974],"category_scores_gemma":[0.00012526658,0.00021406794,0.00007097019,0.0040737726,0.000023643544,0.00036259246,0.00023751197,0.00013163096,0.00037073897],"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.00004577978,0.00023816798,0.0015916417,0.00005436412,0.00005332755,0.000048132057,0.0016177332,0.13421664,0.07444094,0.013039283,0.660146,0.11450798],"study_design_scores_gemma":[0.00076754176,0.00034593025,0.049021803,0.00009295376,0.0000068206386,0.000009240413,0.00006146633,0.76361114,0.017947672,0.0013341943,0.16624874,0.0005525318],"about_ca_topic_score_codex":0.00012399776,"about_ca_topic_score_gemma":0.00005163982,"teacher_disagreement_score":0.6293945,"about_ca_system_score_codex":0.00012676504,"about_ca_system_score_gemma":0.000066057975,"threshold_uncertainty_score":0.87294376},"labels":[],"label_agreement":null},{"id":"W4323708282","doi":"10.4230/lipics.socg.2023.19","title":"Improved Bounds for Covering Paths and Trees in the Plane","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Polygon (computer graphics); Simple polygon; Path (computing); Vertex (graph theory); Plane (geometry); Boundary (topology); Context (archaeology); Geometry; Monotone polygon; Mathematical analysis; Graph","score_opus":0.08583637104248937,"score_gpt":0.20082700306434448,"score_spread":0.11499063202185511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323708282","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.33019885,0.00003879619,0.6687799,0.0001997792,0.0003381908,0.00027021058,0.000016483496,0.00006084481,0.00009692936],"genre_scores_gemma":[0.9978625,0.000069411726,0.0012844198,0.00008754938,0.000072227434,0.0000036333024,0.00003879843,0.000005714478,0.00057570706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916357,0.000052720647,0.00010372604,0.0004807412,0.000047295765,0.00015193196],"domain_scores_gemma":[0.9992476,0.00027965242,0.00007764092,0.00031867818,0.00004310891,0.00003328415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032446042,0.00012126841,0.00012347211,0.00017655843,0.00011569305,0.0001599014,0.0005740974,0.00008961332,9.383014e-7],"category_scores_gemma":[0.000034447377,0.00011610333,0.00005557418,0.00035458698,0.000026754085,0.00016557373,0.00047621233,0.00016503662,0.000003126083],"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.000057038487,0.00007794141,0.0015301434,0.00011303315,0.000057241174,0.000110409164,0.0014754771,0.7401393,0.00037240813,0.25009006,0.00055342825,0.0054235016],"study_design_scores_gemma":[0.00037259885,0.00005253334,0.00621098,0.000023798535,0.0000125974475,0.0000028498587,0.00007774856,0.93905765,0.00005251468,0.05325957,0.0007175037,0.00015963],"about_ca_topic_score_codex":0.000088714085,"about_ca_topic_score_gemma":0.00027951747,"teacher_disagreement_score":0.6676637,"about_ca_system_score_codex":0.000045220593,"about_ca_system_score_gemma":0.0000818061,"threshold_uncertainty_score":0.47345564},"labels":[],"label_agreement":null},{"id":"W4324009296","doi":"10.1007/978-3-031-27051-2_3","title":"Minimum Ply Covering of Points with Unit Squares","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Saskatchewan; University of Manitoba","funders":"","keywords":"Combinatorics; Cover (algebra); Mathematics; Intersection (aeronautics); Set cover problem; Approximation algorithm; Polynomial; Unit (ring theory); Time complexity; Plane (geometry); Set (abstract data type); Constant (computer programming); Square (algebra); Euclidean geometry; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.02263665253275696,"score_gpt":0.24667151914694765,"score_spread":0.2240348666141907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324009296","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.0011857335,0.00009721325,0.9954872,0.00040558682,0.0009575036,0.00024221673,0.000008257891,0.00012734471,0.0014889009],"genre_scores_gemma":[0.38115752,0.000042189724,0.61564887,0.0008536254,0.0005194888,0.000012097893,0.000025065221,0.000061117746,0.0016800266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971756,0.000025686913,0.0004263747,0.00094858935,0.0010441493,0.00037960408],"domain_scores_gemma":[0.99791396,0.0005711537,0.00028590817,0.00076305424,0.00035788518,0.00010801353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005916664,0.00034015198,0.00039182344,0.0010311826,0.00014818257,0.0002277189,0.0016866883,0.0001525769,0.000011026735],"category_scores_gemma":[0.00007347753,0.00029978695,0.00007706372,0.001203227,0.0003505295,0.00046573495,0.0007343046,0.00035624532,0.000034321958],"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.000024686005,0.00004097162,0.00015478863,0.00012319957,0.000033607223,0.00011820926,0.0010157444,0.49577686,0.0004597556,0.0850475,0.000035669706,0.417169],"study_design_scores_gemma":[0.00055261893,0.0006125324,0.0011202917,0.0008479338,0.00001383292,0.00008170129,5.3174506e-7,0.7951556,0.006418858,0.19335249,0.0010239814,0.0008196605],"about_ca_topic_score_codex":0.000016515723,"about_ca_topic_score_gemma":0.000067494904,"teacher_disagreement_score":0.41634935,"about_ca_system_score_codex":0.000084178435,"about_ca_system_score_gemma":0.0005922497,"threshold_uncertainty_score":0.9999454},"labels":[],"label_agreement":null},{"id":"W4324011378","doi":"10.1007/978-3-031-27051-2_9","title":"Improved and Generalized Algorithms for Burning a Planar Point Set","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Saskatchewan","funders":"","keywords":"Combinatorics; Dimension (graph theory); Point (geometry); Integer (computer science); Set (abstract data type); Process (computing); Mathematics; Planar; Computer science; Discrete mathematics; Algorithm; Geometry; Computer graphics (images)","score_opus":0.032431223475990166,"score_gpt":0.27442082206658397,"score_spread":0.2419895985905938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324011378","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.00010645238,0.00028939501,0.9958442,0.0011187458,0.0017239492,0.0005657437,0.000022599685,0.00019148736,0.00013747092],"genre_scores_gemma":[0.00710908,0.00006830939,0.9890975,0.0014538672,0.00090881065,0.00004521008,0.00006360372,0.00004294189,0.0012106956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723434,0.000024886194,0.0004299805,0.0013114454,0.0005086326,0.0004907352],"domain_scores_gemma":[0.99817675,0.0006501835,0.0002202385,0.00054709415,0.00024966733,0.00015608128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010167578,0.00038695082,0.0004096973,0.0008120607,0.00033512822,0.00056324096,0.0010922248,0.00021520203,0.000003619686],"category_scores_gemma":[0.00012295655,0.00036704575,0.000103515296,0.00054137246,0.0002040389,0.0004276884,0.00055478566,0.00033871442,0.000008511964],"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.000015282998,0.000013619003,0.000005473028,0.00007488306,0.000027961689,0.000037235135,0.0010101928,0.056373063,0.0011684545,0.053708326,0.00013026441,0.88743526],"study_design_scores_gemma":[0.00039892644,0.00016407673,0.000025960826,0.00009195777,0.0000067631986,0.000047267466,1.6931543e-7,0.8157662,0.00070736586,0.18120858,0.0012031592,0.00037954046],"about_ca_topic_score_codex":0.000016972588,"about_ca_topic_score_gemma":0.000038720376,"teacher_disagreement_score":0.8870557,"about_ca_system_score_codex":0.00012004622,"about_ca_system_score_gemma":0.00034362526,"threshold_uncertainty_score":0.99987817},"labels":[],"label_agreement":null},{"id":"W4327571516","doi":"10.1016/j.laa.2023.03.010","title":"Classification of maps sending lines into translates of a curve","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","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 British Columbia","funders":"","keywords":"Mathematics; Line (geometry); Planar; Jordan curve theorem; Plane (geometry); Combinatorics; Plane curve; Geometry; Mathematical analysis; Computer science","score_opus":0.028189281658629,"score_gpt":0.29017215067176844,"score_spread":0.26198286901313944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327571516","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.22915806,0.00044114704,0.76797324,0.0016675473,0.00006038903,0.0003167589,0.000021482612,0.00011228613,0.00024911057],"genre_scores_gemma":[0.9848204,0.00015639559,0.014672311,0.000019527848,0.00006755394,0.000057092006,0.00008507457,0.000004516087,0.000117104355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935424,0.000020688856,0.00024297622,0.00018406809,0.00012238145,0.00007565868],"domain_scores_gemma":[0.9994189,0.00013743844,0.000099141456,0.00016494787,0.00014330904,0.00003625599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016364688,0.000061530416,0.00009991145,0.00018034498,0.00008329965,0.00001482726,0.0001702017,0.000037640013,0.000003187556],"category_scores_gemma":[0.000023078326,0.000060091657,0.00003264957,0.0010600466,0.000025231137,0.00015945823,0.000042359166,0.00003983314,0.0000177311],"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.0000037297614,0.000073901414,0.00046615672,0.0001340951,0.000022949738,1.6589807e-7,0.0012364466,0.0011274976,0.114693284,0.7793793,0.00019620545,0.10266628],"study_design_scores_gemma":[0.0003472472,0.00007575023,0.014628994,0.000034268778,0.000022512007,0.000004481562,0.000111105815,0.7997662,0.10016558,0.06657991,0.018061232,0.00020276112],"about_ca_topic_score_codex":0.000004439893,"about_ca_topic_score_gemma":0.0000027608592,"teacher_disagreement_score":0.79863864,"about_ca_system_score_codex":0.000003800876,"about_ca_system_score_gemma":0.000031395346,"threshold_uncertainty_score":0.24504668},"labels":[],"label_agreement":null},{"id":"W4327990090","doi":"10.4230/lipics.socg.2023.49","title":"The Geodesic Edge Center of a Simple Polygon","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple polygon; Geodesic; Voronoi diagram; Polygon (computer graphics); Mathematics; Polygon covering; Weighted Voronoi diagram; Geodesic map; Combinatorics; Rectilinear polygon; Star-shaped polygon; Geometry; Algorithm; Computer science; Regular polygon; Convex set","score_opus":0.0984638630626501,"score_gpt":0.2012208075165219,"score_spread":0.1027569444538718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327990090","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.21016717,0.00006293345,0.787444,0.00026790236,0.000966737,0.00019361061,0.000019667388,0.00013862533,0.00073933456],"genre_scores_gemma":[0.9963771,0.00011969724,0.00045453792,0.00004493075,0.00008184037,7.8971243e-7,0.000032070046,0.000008513985,0.002880514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989278,0.00010158817,0.00016902488,0.0004987087,0.00009740518,0.00020548396],"domain_scores_gemma":[0.9986615,0.00022055423,0.00018794225,0.00070765096,0.00015773837,0.00006459731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002706969,0.00014414967,0.00014970156,0.00017172805,0.00018893035,0.000083545834,0.0011768936,0.00009976392,0.0000056839735],"category_scores_gemma":[0.000036486792,0.00013387574,0.0001523255,0.0006312326,0.00006280739,0.0001477559,0.0013515236,0.00021340966,0.00006530865],"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.000026593329,0.00008301512,0.0015982628,0.000058165413,0.000108929016,0.000048171274,0.00020629518,0.5707745,0.000105599625,0.4186519,0.003726291,0.0046122456],"study_design_scores_gemma":[0.00032647524,0.00004411874,0.0054213135,0.00003690871,0.000024958392,0.0000024025244,0.00003594903,0.8365922,0.0005137604,0.15209626,0.004656531,0.0002491008],"about_ca_topic_score_codex":0.00007440014,"about_ca_topic_score_gemma":0.000058497022,"teacher_disagreement_score":0.7869895,"about_ca_system_score_codex":0.0000662557,"about_ca_system_score_gemma":0.00016344873,"threshold_uncertainty_score":0.54592943},"labels":[],"label_agreement":null},{"id":"W4362576471","doi":"10.22215/etd/2023-15445","title":"Constrained Geometric Optimization Problems","year":2023,"lang":"en","type":"dissertation","venue":"","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geodesic; Simple polygon; Mathematics; Steiner tree problem; Polygon (computer graphics); Combinatorics; Line segment; Voronoi diagram; Monotone polygon; Geometry; Computer science","score_opus":0.01907804000065656,"score_gpt":0.25629095031447263,"score_spread":0.23721291031381608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362576471","genre_codex":"methods","genre_gemma":"other","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.00062184234,0.00017565972,0.9694904,0.00016058549,0.002586857,0.00038716066,0.00000431678,0.00079281523,0.025780376],"genre_scores_gemma":[0.07347263,0.0006187463,0.45238844,0.00049999426,0.00092914223,0.0003981725,0.014343582,0.00015251285,0.45719677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983328,0.00003902158,0.0003761341,0.0005293768,0.00048869575,0.00023397736],"domain_scores_gemma":[0.9989123,0.00013658433,0.0002030506,0.00031667037,0.00034730148,0.000084131796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002698043,0.00022444819,0.00021373433,0.0012177165,0.00014918028,0.00029847896,0.0005288652,0.00021259603,0.00014594822],"category_scores_gemma":[0.00013307089,0.00022503572,0.00009841182,0.0034125482,0.000009334276,0.0003455685,0.000050201616,0.00016580286,0.00034925653],"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.0000052173687,0.00006539698,0.0000068549302,0.00014976945,0.00006362382,0.000008791818,0.00039437765,0.8547877,0.000121501376,0.030048097,0.009384662,0.10496401],"study_design_scores_gemma":[0.0003878101,0.000100123056,0.0007468624,0.00007621366,0.00002485307,0.000009572574,0.000098921104,0.9899828,0.0009635592,0.0038598045,0.0031621023,0.000587397],"about_ca_topic_score_codex":0.000020085385,"about_ca_topic_score_gemma":0.00004116332,"teacher_disagreement_score":0.51710194,"about_ca_system_score_codex":0.000049061986,"about_ca_system_score_gemma":0.00027276712,"threshold_uncertainty_score":0.91766906},"labels":[],"label_agreement":null},{"id":"W4364356989","doi":"10.1142/13439","title":"Point-Set Topology with Topics","year":2023,"lang":"en","type":"book","venue":"WORLD SCIENTIFIC eBooks","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":"Computer science; Set (abstract data type); Topology (electrical circuits); Point (geometry); Mathematics; Combinatorics; Programming language; Geometry","score_opus":0.028678950516652292,"score_gpt":0.2532931963181159,"score_spread":0.22461424580146364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364356989","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006126699,0.00008222963,0.06879416,0.0010104399,0.0063219005,0.00037694583,0.000024372175,0.0004740456,0.92285466],"genre_scores_gemma":[0.00015682535,3.175516e-7,0.006668737,0.00032554404,0.0005290756,0.000026092936,0.00016490767,0.00002494455,0.9921036],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976716,0.000058208905,0.0003165131,0.00093189254,0.00064724835,0.0003745055],"domain_scores_gemma":[0.99837625,0.00013312609,0.00018599936,0.00094329397,0.00022821168,0.00013312364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005832645,0.0002631353,0.00028370044,0.0009095941,0.00043661377,0.0006326538,0.0010213379,0.00011855804,0.0000681229],"category_scores_gemma":[0.000012023527,0.00023540432,0.00010280943,0.0004600408,0.00027206982,0.0001329324,0.00038012306,0.000324549,0.00068228226],"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.0000037641912,0.000007892118,0.0000022911036,0.00002812424,0.000028772916,0.000061972016,0.00032904194,0.00018984205,0.000030343816,0.48702106,0.49832758,0.013969317],"study_design_scores_gemma":[0.00014998033,0.000047838606,0.000017369695,0.00006353553,0.000013936869,0.000022475379,0.0000040946634,0.001758638,0.00020836512,0.06778542,0.92963356,0.00029479773],"about_ca_topic_score_codex":0.0000018271851,"about_ca_topic_score_gemma":0.0014677581,"teacher_disagreement_score":0.43130594,"about_ca_system_score_codex":0.00012860652,"about_ca_system_score_gemma":0.00088742794,"threshold_uncertainty_score":0.9599509},"labels":[],"label_agreement":null},{"id":"W4376639589","doi":"10.1145/3564246.3585168","title":"Streaming Euclidean MST to a Constant Factor","year":2023,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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":"National Science Foundation","keywords":"Sublinear function; Approximation algorithm; Combinatorics; Euclidean space; Logarithm; Constant (computer programming); Space (punctuation); Euclidean geometry; Mathematics; Euclidean distance; Upper and lower bounds; Tree (set theory); Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.03198217631700446,"score_gpt":0.281853405459045,"score_spread":0.24987122914204057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376639589","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.17322409,0.0000054503266,0.81718,0.001953335,0.00034206806,0.00009767696,0.0000037712923,0.00040341116,0.0067902505],"genre_scores_gemma":[0.9674497,0.0000016893537,0.028899163,0.00063951866,0.00006065488,0.000006102637,0.000006206317,0.0000029921657,0.0029339246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993687,0.000015833939,0.000104291415,0.00019753346,0.0001691596,0.00014443407],"domain_scores_gemma":[0.9995969,0.000091912865,0.00001561615,0.00015882398,0.00005068253,0.000086068656],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010020406,0.000055451448,0.000055150216,0.00017323163,0.000079719604,0.000110277935,0.00021007276,0.00001475106,0.000052086456],"category_scores_gemma":[0.000045394965,0.00004973414,0.000023178764,0.0009634757,0.0000051164366,0.00016377564,0.00013950489,0.000027834561,0.00080944225],"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.0000036247654,0.000036861773,0.00075714453,0.000008686013,0.000017849869,0.000035384288,0.0013876889,0.010964024,0.017479945,0.5028946,0.021541102,0.44487312],"study_design_scores_gemma":[0.00067448505,0.00030615786,0.05871089,0.000036952526,0.000004828193,0.000029440122,0.0003111101,0.75847137,0.03399601,0.019302512,0.12737238,0.0007838481],"about_ca_topic_score_codex":0.000009938226,"about_ca_topic_score_gemma":0.000014859429,"teacher_disagreement_score":0.79422563,"about_ca_system_score_codex":0.000016517088,"about_ca_system_score_gemma":0.000043579,"threshold_uncertainty_score":0.9999685},"labels":[],"label_agreement":null},{"id":"W4378499144","doi":"10.48550/arxiv.2305.15721","title":"An exponential bound for simultaneous embeddings of planar graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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 British Columbia","funders":"","keywords":"Planar; Planar graph; Combinatorics; Embedding; Plane (geometry); Mathematics; Point (geometry); Exponential function; Set (abstract data type); Line (geometry); Upper and lower bounds; Planar straight-line graph; Book embedding; Discrete mathematics; 1-planar graph; Graph; Geometry; Computer science; Chordal graph; Mathematical analysis; Artificial intelligence","score_opus":0.07935045504840894,"score_gpt":0.22266892957855236,"score_spread":0.1433184745301434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378499144","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.35616484,0.000012245455,0.64270496,0.000027389357,0.00065080216,0.00021872827,0.00004603395,0.00013382308,0.000041163683],"genre_scores_gemma":[0.9895816,0.000027449125,0.009413356,0.000030009141,0.000096830096,0.0000017318196,0.0001596758,0.000014343929,0.0006750142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986364,0.000061972074,0.00020513845,0.0007744375,0.000106364634,0.00021565943],"domain_scores_gemma":[0.9985027,0.00030238004,0.00023657431,0.00058702903,0.00026178025,0.00010956303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022828359,0.00018918017,0.00023779583,0.00040797796,0.00014610802,0.00009557931,0.0010436411,0.00017429932,0.0000058419146],"category_scores_gemma":[0.00005235361,0.0002377294,0.00018842629,0.00054788723,0.000055943205,0.000278311,0.0003220576,0.00016040138,0.000013015688],"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.000044886732,0.00007442844,0.00008507903,0.000069270835,0.000058287962,0.000056005396,0.00020874187,0.7702878,0.00057083525,0.22768712,0.00024014933,0.00061736966],"study_design_scores_gemma":[0.00029813082,0.0001212688,0.0001469459,0.000026463113,0.000035901878,0.000002002115,0.000032350843,0.8047488,0.00071432366,0.19344802,0.0002079872,0.00021781056],"about_ca_topic_score_codex":0.0000721953,"about_ca_topic_score_gemma":0.00003940671,"teacher_disagreement_score":0.6334168,"about_ca_system_score_codex":0.000055587338,"about_ca_system_score_gemma":0.00016114423,"threshold_uncertainty_score":0.96943235},"labels":[],"label_agreement":null},{"id":"W4379880378","doi":"10.28924/2291-8639-21-2023-51","title":"New Computer Experiment Designs Using Continuum Random Cluster Point Process","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Markov chain Monte Carlo; Markov chain; Random walk; Markov process; Point (geometry); Computer experiment; Computer science; Process (computing); Point process; Mathematics; Convergence (economics); Algorithm; Mathematical optimization; Monte Carlo method; Metropolis–Hastings algorithm; Theoretical computer science; Machine learning; Simulation; Statistics; Programming language","score_opus":0.02659132094802072,"score_gpt":0.33358255937538067,"score_spread":0.30699123842736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379880378","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.032184336,0.00009546677,0.9657098,0.0016504112,0.00018405866,0.00009772568,0.0000029918074,0.000021989259,0.00005323254],"genre_scores_gemma":[0.8886897,0.000062623585,0.10975947,0.00032881225,0.00089576637,0.000012334974,0.000019930354,0.000005719373,0.00022561959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988227,0.000041110896,0.00043230617,0.00018058186,0.0004237569,0.000099535406],"domain_scores_gemma":[0.9987777,0.0001224203,0.00031135188,0.000121767116,0.00055799965,0.00010879825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039409113,0.000088986686,0.00019049385,0.00072148116,0.0000925944,0.00025313784,0.0004556584,0.000028174118,0.000023071334],"category_scores_gemma":[0.000012496719,0.00007730535,0.0001665249,0.0011401243,0.000016729098,0.0003874272,0.00009946968,0.00006979118,0.000008309059],"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.00014258287,0.00036257462,0.0034563509,0.00001595176,0.0049960264,0.000039477916,0.0030006284,0.6379758,0.015405495,0.030212352,0.012238476,0.29215425],"study_design_scores_gemma":[0.0018223267,0.000070503855,0.004422507,0.000024658888,0.00030788837,0.00011201802,0.00011416514,0.96642756,0.006529643,0.0116105415,0.008328095,0.00023006997],"about_ca_topic_score_codex":0.000012104042,"about_ca_topic_score_gemma":0.000006470605,"teacher_disagreement_score":0.8565054,"about_ca_system_score_codex":0.00003585886,"about_ca_system_score_gemma":0.00010073095,"threshold_uncertainty_score":0.31524205},"labels":[],"label_agreement":null},{"id":"W4380990053","doi":"10.37236/11623","title":"Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs","year":2023,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Tree (set theory); Pyramid (geometry); Diamond; Discrete mathematics; Geometry; Chemistry","score_opus":0.010780389594643301,"score_gpt":0.2390661114478326,"score_spread":0.2282857218531893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380990053","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.9070511,0.0019483074,0.08480999,0.0048962673,0.0007978048,0.00014186066,0.0000014893327,0.00007869084,0.00027451775],"genre_scores_gemma":[0.9985607,0.0009576833,0.00018218605,0.00010814869,0.00007515452,0.000004856884,0.0000029115959,0.0000102728645,0.000098074284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984521,0.00014932649,0.00034846817,0.00015976623,0.00047567888,0.0004146037],"domain_scores_gemma":[0.9986906,0.0003294119,0.000260331,0.00037181764,0.00024481193,0.00010302858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008973725,0.00013836438,0.0001919888,0.00044988247,0.00031729726,0.00014423617,0.0010312296,0.00005773112,0.0000015145677],"category_scores_gemma":[0.00009265266,0.00010719163,0.0001184405,0.002194134,0.000046660014,0.00041784492,0.00020208223,0.00047724292,0.0000074292448],"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.000013024455,0.000068080124,0.00018542733,0.000004648574,0.000068314395,0.000011336009,0.00031744278,0.0005899629,0.0022675984,0.98886573,0.0013813229,0.0062271254],"study_design_scores_gemma":[0.00086218666,0.0004962066,0.0069045937,0.000013233598,0.000031427397,0.00014673242,0.00004099382,0.0052733915,0.0017275694,0.98333836,0.0010292172,0.00013611035],"about_ca_topic_score_codex":0.0000043623577,"about_ca_topic_score_gemma":0.000011587913,"teacher_disagreement_score":0.09150964,"about_ca_system_score_codex":0.0000867091,"about_ca_system_score_gemma":0.0002993287,"threshold_uncertainty_score":0.43711478},"labels":[],"label_agreement":null},{"id":"W4381280127","doi":"10.1115/1.4062634","title":"A Novel Approach to Line Clipping Against a Rectangular Window","year":2023,"lang":"en","type":"article","venue":"Journal of Computing and Information Science in Engineering","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 Saskatchewan","funders":"","keywords":"Clipping (morphology); Robustness (evolution); Computer science; Computer graphics; Graphics; Window (computing); Algorithm; Computer graphics (images); Artificial intelligence","score_opus":0.015651834247647788,"score_gpt":0.2512028541408282,"score_spread":0.23555101989318042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381280127","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.34870538,0.000009218704,0.6505551,0.00016625952,0.00031258044,0.00004066839,1.5877252e-7,0.00003085467,0.00017978669],"genre_scores_gemma":[0.8311055,0.00000989079,0.16863959,0.00016539586,0.000074853175,5.815083e-7,7.1088004e-7,0.0000015784533,0.0000019210731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883336,0.000007369542,0.00045247242,0.00008916398,0.00042801604,0.00018961033],"domain_scores_gemma":[0.99927694,0.00008363013,0.00015092279,0.00008518505,0.00030054792,0.0001028034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023155368,0.00006916415,0.00011582335,0.0016229388,0.00009929092,0.0002891162,0.0003604767,0.000021137732,8.600931e-8],"category_scores_gemma":[0.00058137206,0.000064939406,0.000022042046,0.004383031,0.000014714683,0.0035450787,0.00014614486,0.00013294708,0.0000030198978],"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.0000011461418,0.000006616267,0.000047630812,0.000014570889,0.0000012946853,6.4659025e-7,0.0021256825,0.96079105,0.0051634824,0.0023860806,0.000015488455,0.02944629],"study_design_scores_gemma":[0.00019825362,0.000035209367,0.010316701,0.00008090166,5.8146065e-7,0.00006495884,0.00010967143,0.98776674,0.0005794654,0.000019255864,0.0007527282,0.000075542506],"about_ca_topic_score_codex":0.0000010893148,"about_ca_topic_score_gemma":5.2639816e-8,"teacher_disagreement_score":0.48240012,"about_ca_system_score_codex":0.000056484936,"about_ca_system_score_gemma":0.000121732395,"threshold_uncertainty_score":0.27879542},"labels":[],"label_agreement":null},{"id":"W4385320774","doi":"10.1145/3592112","title":"Beyond Chainmail: Computational Modeling of Discrete Interlocking Materials","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Canada Foundation for Innovation","keywords":"Interlocking; Deformation (meteorology); Computer science; Finite element method; Macro; Discrete modelling; Scale (ratio); Discrete element method; Plane (geometry); Structural engineering; Geometry; Materials science; Engineering; Algorithm; Physics; Mathematics; Mechanics; Discrete system; Composite material","score_opus":0.030424105316883766,"score_gpt":0.27627280363237905,"score_spread":0.24584869831549527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385320774","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.089294285,0.000013748515,0.90866596,0.0011119928,0.0005257818,0.00010601162,0.000035010406,0.00018402068,0.0000632212],"genre_scores_gemma":[0.968165,0.00003084693,0.031434424,0.00020367723,0.000037874408,0.000018684716,0.000053633572,0.000010217471,0.00004564135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988022,0.000061851904,0.00032819738,0.0002775702,0.000357256,0.00017294996],"domain_scores_gemma":[0.9991366,0.00021682862,0.00007760775,0.00036367585,0.00015268415,0.00005255274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034288282,0.00012038961,0.00014707005,0.0006291874,0.0002161659,0.00007261101,0.00047767113,0.000060098053,0.000018498098],"category_scores_gemma":[0.000025803278,0.00012443557,0.00009381615,0.0014692686,0.000033633503,0.00031517047,0.000023587816,0.0001144471,0.000022501632],"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.000009684534,0.000037513037,0.0000057844345,0.00001881914,0.00003405351,0.00000198528,0.00037304038,0.94317204,0.0012263953,0.04771712,0.000038669463,0.007364886],"study_design_scores_gemma":[0.00020404196,0.000069454356,0.00017273736,0.000028833134,0.000009111888,0.000006022148,0.000036335485,0.85733145,0.003670954,0.13829805,0.000048974023,0.0001240471],"about_ca_topic_score_codex":0.000011757663,"about_ca_topic_score_gemma":0.0000069344023,"teacher_disagreement_score":0.8788707,"about_ca_system_score_codex":0.000015461648,"about_ca_system_score_gemma":0.000050924198,"threshold_uncertainty_score":0.5074335},"labels":[],"label_agreement":null},{"id":"W4385362959","doi":"10.1007/978-3-031-38906-1_13","title":"Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba; Carleton University","funders":"","keywords":"Geodesic; Computer science; Polygon (computer graphics); Simple (philosophy); Simple polygon; Computer graphics (images); Combinatorics; Algorithm; Geometry; Regular polygon; Mathematics; Computer network","score_opus":0.02836051449477484,"score_gpt":0.25727160308283387,"score_spread":0.22891108858805903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385362959","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.0010950412,0.00021161092,0.99422324,0.0012963136,0.0011426396,0.0004405673,0.000003269427,0.00014167128,0.0014456357],"genre_scores_gemma":[0.71463406,0.000039014434,0.28179884,0.0017546188,0.0009133871,0.00003914264,0.000029168123,0.000056920882,0.0007348417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651283,0.00006488039,0.00063321827,0.0012160274,0.00094457524,0.0006284414],"domain_scores_gemma":[0.99753976,0.0010384781,0.0002820836,0.0009125073,0.00013257437,0.000094605835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001721667,0.00040580053,0.0003746872,0.00094579416,0.00043818977,0.00076941063,0.0024509965,0.00018426382,0.000010077916],"category_scores_gemma":[0.00020404426,0.00032032613,0.00010792016,0.0016837183,0.00031859666,0.00044882618,0.0013441736,0.00077045156,0.0000420859],"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.0000029628377,0.000017734044,0.00010435096,0.000029404584,0.00000613582,0.000049460057,0.001099221,0.42062274,0.00017045623,0.04769746,0.00002134291,0.5301787],"study_design_scores_gemma":[0.00013517514,0.00004572525,0.000557161,0.00019558129,0.000003137232,0.000030007783,6.1795447e-7,0.7635109,0.0002990492,0.23469783,0.00018809835,0.0003367322],"about_ca_topic_score_codex":0.000065837405,"about_ca_topic_score_gemma":0.00036864207,"teacher_disagreement_score":0.71353906,"about_ca_system_score_codex":0.00025638044,"about_ca_system_score_gemma":0.00049308426,"threshold_uncertainty_score":0.9999249},"labels":[],"label_agreement":null},{"id":"W4385953094","doi":"10.1007/s00373-023-02699-9","title":"An Exponential Bound for Simultaneous Embeddings of Planar Graphs","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 British Columbia","funders":"University of British Columbia Graduate School","keywords":"Combinatorics; Mathematics; Planar graph; Embedding; Planar; Plane (geometry); Upper and lower bounds; Exponential function; Planar straight-line graph; Book embedding; Point (geometry); Set (abstract data type); Discrete mathematics; 1-planar graph; Graph; Chordal graph; Geometry; Mathematical analysis; Computer science","score_opus":0.014387758586334556,"score_gpt":0.26162944264807203,"score_spread":0.24724168406173747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385953094","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.855787,0.00015048563,0.1428227,0.00010161242,0.0007327045,0.00017796466,0.000014058554,0.00015185171,0.0000616181],"genre_scores_gemma":[0.9970764,0.00006480831,0.0026590452,0.00004544429,0.00001601961,0.000016228907,0.000041605876,0.0000064157753,0.000074027936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991739,0.000021870943,0.00017671776,0.00025341168,0.0002006257,0.00017348665],"domain_scores_gemma":[0.99931806,0.00019807577,0.000073661504,0.00018912321,0.00013906363,0.00008202536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021909976,0.00009477194,0.00012845862,0.0002693657,0.0001865684,0.00009220371,0.0002520743,0.00005119601,0.000001045368],"category_scores_gemma":[0.000031592135,0.000096653814,0.000058620753,0.00096301985,0.00003225521,0.00021984612,0.000039205715,0.000044558925,0.0000015582502],"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.0000126372615,0.00007654481,0.00028071794,0.00003095572,0.000015866719,0.0000056913395,0.0003878611,0.0008203315,0.0019172786,0.98658663,0.0006828051,0.009182698],"study_design_scores_gemma":[0.0005318357,0.00041624025,0.0011096363,0.000007035839,0.000010006696,0.000006843071,0.00005364194,0.19722733,0.0019407442,0.79707503,0.0014675932,0.00015404318],"about_ca_topic_score_codex":0.000008788286,"about_ca_topic_score_gemma":0.0000018264633,"teacher_disagreement_score":0.19640699,"about_ca_system_score_codex":0.0000060567295,"about_ca_system_score_gemma":0.000028680215,"threshold_uncertainty_score":0.3941428},"labels":[],"label_agreement":null},{"id":"W4386136968","doi":"10.1145/3606939","title":"A Multilevel Active-Set Preconditioner for Box-Constrained Pressure Poisson Solvers","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Computer Graphics and Interactive Techniques","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"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":"Preconditioner; Multigrid method; Computer science; Quadratic equation; Reuse; Mathematical optimization; Applied mathematics; Poisson's equation; Set (abstract data type); Mathematics; Algorithm; Iterative method; Partial differential equation; Mathematical analysis","score_opus":0.027585346216615327,"score_gpt":0.29160217134333366,"score_spread":0.2640168251267183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386136968","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.37318364,0.00004014738,0.6115882,0.009550881,0.0009970173,0.002581676,0.00024507937,0.0010921586,0.000721232],"genre_scores_gemma":[0.9207046,0.000034052326,0.07813805,0.0006389665,0.00013605335,0.00016617966,0.000014949282,0.000014045124,0.00015312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989858,0.000012291091,0.00022346251,0.00039069317,0.00020989549,0.00017780765],"domain_scores_gemma":[0.9986607,0.00031625584,0.00024878135,0.0002404716,0.00048724137,0.00004653817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028659467,0.00016880159,0.00018884186,0.00036143226,0.00019686202,0.00013759681,0.0009827103,0.00007800036,0.0000021277942],"category_scores_gemma":[0.00019565978,0.00013015229,0.00013356988,0.00047176355,0.0000827712,0.0006433446,0.00065555976,0.00017459581,8.032017e-7],"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.00027651023,0.00028550538,0.00047216148,0.0003093374,0.00040931275,7.3963e-7,0.003980037,0.00008978127,0.033634488,0.63505256,0.06827285,0.25721675],"study_design_scores_gemma":[0.000640336,0.00091331825,0.012263494,0.00036165997,0.00004232066,0.000019089443,0.00008409262,0.28171042,0.46219015,0.2238429,0.017518895,0.00041330644],"about_ca_topic_score_codex":0.000006741567,"about_ca_topic_score_gemma":5.788545e-7,"teacher_disagreement_score":0.54752094,"about_ca_system_score_codex":0.000016107575,"about_ca_system_score_gemma":0.00002378674,"threshold_uncertainty_score":0.5307456},"labels":[],"label_agreement":null},{"id":"W4386930279","doi":"10.26493/2590-9770.1595.d70","title":"Realizations of higher rank toroids","year":2023,"lang":"en","type":"article","venue":"The Art of Discrete and Applied Mathematics","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 New Brunswick","funders":"","keywords":"Rank (graph theory); Publication; Toroid; Quality (philosophy); Mathematics; Computer science; Combinatorics; Physics; Political science; Quantum mechanics; Law","score_opus":0.01925899448455702,"score_gpt":0.2613041446528924,"score_spread":0.2420451501683354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386930279","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.09675732,0.00008238511,0.8608645,0.0017161472,0.00009755536,0.00029236678,0.000009894528,0.000107403546,0.0400724],"genre_scores_gemma":[0.9647453,0.00004287917,0.034023907,0.000050230276,0.000024220944,0.000010250541,0.000011620019,0.000004588517,0.0010870169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995287,0.0000075959847,0.00017306572,0.00007540382,0.00014905968,0.00006619228],"domain_scores_gemma":[0.9995291,0.00012869225,0.000082642524,0.00021099496,0.00002970123,0.00001884744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020318544,0.000049014994,0.00009889294,0.000044768403,0.000059379192,0.000014585237,0.00017821572,0.0000169309,0.000006713336],"category_scores_gemma":[0.00000959885,0.000033282195,0.00002224368,0.00036717515,0.000042209966,0.000051632273,0.000107133834,0.00002291537,0.000008156896],"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.0000013571663,0.000016789312,0.0000029338528,0.000047510122,0.000011350402,7.840852e-8,0.0009214005,0.0015607552,0.007120652,0.9864054,0.0019928196,0.0019189819],"study_design_scores_gemma":[0.0007900963,0.000114383576,0.0019741238,0.00007973479,0.0000643065,0.000005721898,0.0005452982,0.16074629,0.06179518,0.7606958,0.012889364,0.00029966707],"about_ca_topic_score_codex":6.019161e-7,"about_ca_topic_score_gemma":5.04649e-7,"teacher_disagreement_score":0.867988,"about_ca_system_score_codex":0.0000018966906,"about_ca_system_score_gemma":0.000009790859,"threshold_uncertainty_score":0.13572085},"labels":[],"label_agreement":null},{"id":"W4386974107","doi":"10.1007/978-3-031-43380-1_7","title":"Nonplanar Graph Drawings with k Vertices per Face","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Engineering and Physical Sciences Research Council","keywords":"Planar graph; Combinatorics; Book embedding; Outerplanar graph; Symmetric graph; Wheel graph; Mathematics; Path graph; Discrete mathematics; Polyhedral graph; Multiple edges; Graph; Computer science; Graph power; 1-planar graph; Pathwidth; Line graph; Voltage graph","score_opus":0.015204831075908814,"score_gpt":0.2343688975154989,"score_spread":0.21916406643959008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386974107","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.0003333863,0.00018930912,0.9942599,0.0013683335,0.001377821,0.00029500906,0.0000046780115,0.0002857582,0.0018857922],"genre_scores_gemma":[0.27214718,0.000106063744,0.7176151,0.0038670488,0.0011648887,0.000033224198,0.000047690315,0.00010874155,0.0049100164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637765,0.000026376449,0.0003696571,0.0014271028,0.0012463856,0.0005528086],"domain_scores_gemma":[0.9980337,0.00045186828,0.00020363694,0.0008642402,0.0002770185,0.00016952032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006042992,0.00045596602,0.00038123273,0.0011254622,0.00035126385,0.00069784233,0.0021408265,0.00020208699,0.000016327054],"category_scores_gemma":[0.000042896867,0.0003838595,0.00009688507,0.001216387,0.0003995621,0.000798354,0.0006603196,0.00054149993,0.00017482939],"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.000016427302,0.000035197794,0.000080317885,0.00006310669,0.00003760355,0.00018308459,0.0017053061,0.5293467,0.00024951767,0.052909598,0.00011892945,0.4152542],"study_design_scores_gemma":[0.0005541304,0.00054175657,0.0008161101,0.00052070955,0.000024796671,0.00017370214,8.2617856e-7,0.774473,0.0018094027,0.21515712,0.004509073,0.001419381],"about_ca_topic_score_codex":0.000019969739,"about_ca_topic_score_gemma":0.00010782761,"teacher_disagreement_score":0.4138348,"about_ca_system_score_codex":0.0001294574,"about_ca_system_score_gemma":0.00052371883,"threshold_uncertainty_score":0.99986136},"labels":[],"label_agreement":null},{"id":"W4386988462","doi":"10.1016/j.ejc.2023.103837","title":"On tangencies among planar curves with an application to coloring L-shapes","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"National Research, Development and Innovation Office; Nemzeti Kutatási, Fejlesztési és Innovaciós Alap; Innovációs és Technológiai Minisztérium; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Magyar Tudományos Akadémia; Nemzeti Kutatási és Technológiai Hivatal; Mount Allison University","keywords":"Mathematics; Combinatorics; Disjoint sets; Upper and lower bounds; Context (archaeology); String (physics); Planar; Set (abstract data type); Mathematical analysis; Computer science","score_opus":0.017623599024066555,"score_gpt":0.2380684267204793,"score_spread":0.22044482769641274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386988462","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.48558578,0.00007516956,0.51167667,0.00065487076,0.00032110082,0.00010388949,8.760492e-7,0.000080515885,0.0015010973],"genre_scores_gemma":[0.9967074,0.000041917458,0.0026874521,0.00030063474,0.00010616429,0.0000020651582,0.0000032625378,0.000011529491,0.00013957922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988741,0.00016690746,0.00023823051,0.00014865625,0.00044200313,0.00013005071],"domain_scores_gemma":[0.99913067,0.00009959853,0.00019371428,0.00015765877,0.00027215062,0.0001462295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093400927,0.000090204434,0.00011097976,0.00028482155,0.00011861068,0.00009556795,0.00053019373,0.000009106821,0.0000015026848],"category_scores_gemma":[0.00007273587,0.00007524238,0.000028657236,0.001153982,0.000013081478,0.00041924897,0.00004846478,0.00011816461,0.000057633868],"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.00019869478,0.000560497,0.005018701,0.00012927612,0.00012054091,0.0008505055,0.003496251,0.22877443,0.0032920442,0.6671957,0.024325376,0.06603799],"study_design_scores_gemma":[0.0034611318,0.018783279,0.7296151,0.0013108636,0.00008286211,0.0004286345,0.00043231368,0.13438639,0.0054666563,0.036533322,0.067958854,0.0015406157],"about_ca_topic_score_codex":6.0862146e-7,"about_ca_topic_score_gemma":0.0000010181362,"teacher_disagreement_score":0.7245964,"about_ca_system_score_codex":0.00003468715,"about_ca_system_score_gemma":0.000042064985,"threshold_uncertainty_score":0.30682954},"labels":[],"label_agreement":null},{"id":"W4387121580","doi":"10.1007/s10898-023-01329-1","title":"Small polygons with large area","year":2023,"lang":"en","type":"article","venue":"Journal of Global Optimization","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":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Polygon (computer graphics); Combinatorics; Upper and lower bounds; Regular polygon; Unit (ring theory); Rectilinear polygon; Term (time); Geometry; Simple polygon; Mathematical analysis; Computer science","score_opus":0.018819072385228588,"score_gpt":0.23867149863511988,"score_spread":0.2198524262498913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387121580","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.018190317,0.00005585726,0.9791628,0.0014399609,0.00033170742,0.000046092602,0.0000037382842,0.000050884206,0.0007186259],"genre_scores_gemma":[0.6687601,0.00004979907,0.33051723,0.0003307852,0.00016772142,0.0000013263738,0.000015116635,0.0000050522494,0.0001528516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923694,0.000035083456,0.00021916252,0.00009857222,0.00027344332,0.0001367747],"domain_scores_gemma":[0.99923456,0.00003087268,0.00021104868,0.00010197207,0.00034591818,0.00007565377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002830761,0.000068697555,0.00009832712,0.00011137045,0.000083885025,0.000106130756,0.00024061876,0.000030978517,0.000010331544],"category_scores_gemma":[0.000051341536,0.000054368506,0.000044478158,0.0014441934,0.000007889034,0.0004476507,0.000048430436,0.00005569098,0.00001156485],"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.00001544872,0.000035045377,0.0010039872,0.0000022382344,0.000016807939,0.000025411939,0.000039665745,0.9829437,0.00001606323,0.011722238,0.0017364532,0.0024429166],"study_design_scores_gemma":[0.0006268796,0.00022549291,0.006896271,0.000024273415,0.000012525458,0.00020537566,0.000024208743,0.9889992,0.00006575241,0.0010671766,0.0017588597,0.00009400921],"about_ca_topic_score_codex":0.000001232163,"about_ca_topic_score_gemma":0.0000055755886,"teacher_disagreement_score":0.6505698,"about_ca_system_score_codex":0.000064721906,"about_ca_system_score_gemma":0.00015512922,"threshold_uncertainty_score":0.22170833},"labels":[],"label_agreement":null},{"id":"W4388718092","doi":"10.48550/arxiv.2311.07907","title":"Curve Stabbing Depth: Data Depth for Plane Curves","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Point (geometry); Data set; Mathematics; Set (abstract data type); Cluster analysis; Plane (geometry); Geometry; Physics; Graph; Computer science; Statistics","score_opus":0.29730825115244736,"score_gpt":0.25422339701188335,"score_spread":0.04308485414056401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388718092","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.010302048,0.00025194022,0.98605406,0.000357749,0.0014307089,0.0005030967,0.00027448812,0.00038640495,0.00043952008],"genre_scores_gemma":[0.9757126,0.0007774206,0.016048178,0.00026574623,0.00034352354,0.0000043275923,0.0031259328,0.00003164202,0.0036906074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978073,0.00010906417,0.00022573372,0.001396072,0.00013747996,0.00032430212],"domain_scores_gemma":[0.9973505,0.0004437126,0.00023194416,0.0016383696,0.00020471007,0.00013075686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059340143,0.000257339,0.0002753498,0.0003025468,0.00020587322,0.00015872277,0.0028270995,0.00015977459,0.000008336937],"category_scores_gemma":[0.00016773015,0.000312547,0.00011621397,0.00069516664,0.00003899839,0.0006246124,0.0036194525,0.00029945097,0.000077385215],"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.000050273058,0.00014733002,0.003379003,0.0008586112,0.00028740065,0.00019730753,0.00016233775,0.8256168,0.000045585606,0.12027552,0.042296264,0.0066835894],"study_design_scores_gemma":[0.00039415326,0.00004500707,0.0024582895,0.00023540224,0.00007092763,0.000004189542,0.000021398479,0.96031266,0.00011826302,0.030746957,0.005145382,0.0004473435],"about_ca_topic_score_codex":0.00009655612,"about_ca_topic_score_gemma":0.00046816582,"teacher_disagreement_score":0.97000587,"about_ca_system_score_codex":0.00009329831,"about_ca_system_score_gemma":0.00032968927,"threshold_uncertainty_score":0.99993265},"labels":[],"label_agreement":null},{"id":"W4388827630","doi":"10.1088/1742-6596/2634/1/012006","title":"Convex optimization and the smallest ball problem","year":2023,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ball (mathematics); Regular polygon; Mathematics; Mathematical optimization; Optimization problem; Existential quantification; Mathematical problem; Computer science; Combinatorics; Mathematical analysis","score_opus":0.020587429959658884,"score_gpt":0.22803500127130016,"score_spread":0.20744757131164127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388827630","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.0064125364,0.000056131565,0.98780435,0.004887737,0.00021612075,0.000072514835,8.0539456e-7,0.000021253629,0.0005285291],"genre_scores_gemma":[0.96473897,0.00027358063,0.034347087,0.00013544486,0.00018451155,0.0000031671407,0.000003164112,0.0000032647329,0.00031081802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936545,0.0000615786,0.00020062583,0.000081323844,0.0002067993,0.00008420569],"domain_scores_gemma":[0.9991728,0.000111045396,0.00020397954,0.00009090724,0.00038594494,0.00003534122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038021777,0.00006515879,0.00012608881,0.000051543924,0.000117935575,0.00023449173,0.0002466135,0.00001862492,0.0000063652],"category_scores_gemma":[0.000034367436,0.000043356187,0.000037254045,0.00037138016,0.00008695144,0.0006295227,0.0000887171,0.0000890917,0.0000043021623],"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.000025478763,0.000011021852,0.00005202172,0.000011120978,0.00002400413,0.0000038351886,0.0014350509,0.118969485,0.00035043116,0.83456117,0.00041198148,0.044144418],"study_design_scores_gemma":[0.0017118108,0.00027136283,0.0016593693,0.000070474765,0.000027761193,0.00012529567,0.00043025895,0.5954406,0.010163894,0.38784844,0.0020310134,0.00021967133],"about_ca_topic_score_codex":0.0000016076947,"about_ca_topic_score_gemma":0.000001439387,"teacher_disagreement_score":0.9583264,"about_ca_system_score_codex":0.000006790862,"about_ca_system_score_gemma":0.00013273612,"threshold_uncertainty_score":0.2261209},"labels":[],"label_agreement":null},{"id":"W4389264682","doi":"10.1007/978-3-031-48882-5_1","title":"Segment Visibility for k-Transmitters","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Toronto Metropolitan University","funders":"","keywords":"Visible spectrum; Disjoint sets; Combinatorics; Polygon (computer graphics); Visibility; Boundary (topology); Physics; Mathematics; Computer science; Optics; Mathematical analysis; Telecommunications","score_opus":0.025203102241937916,"score_gpt":0.2684939364107193,"score_spread":0.24329083416878136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389264682","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.00006548629,0.00010449431,0.9937625,0.001724335,0.002893398,0.00070277293,0.000013691188,0.00023451023,0.0004988467],"genre_scores_gemma":[0.04982485,0.000039717404,0.94401914,0.0028542944,0.0010453593,0.00006744072,0.000048762773,0.00005595357,0.0020445099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966405,0.000022426577,0.00048229823,0.0015056522,0.0008335274,0.00051558035],"domain_scores_gemma":[0.99772316,0.00075947534,0.00017214609,0.00091016584,0.0002927063,0.00014232981],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012392824,0.0003789586,0.00036639086,0.000767067,0.00026903668,0.00040598388,0.0018395616,0.00020073912,0.000008582763],"category_scores_gemma":[0.00008695233,0.00036512772,0.00018080446,0.00071091304,0.00023921319,0.00042711638,0.00050996366,0.00033395563,0.00005098496],"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.0000071497716,0.000022694336,0.000010109556,0.00006062841,0.000012155978,0.000013427888,0.00035039912,0.15425949,0.00018612394,0.036542136,0.00009236556,0.8084433],"study_design_scores_gemma":[0.00027530568,0.00016176293,0.0001732525,0.00011668433,0.000006555048,0.000011338751,6.544332e-8,0.6441999,0.0014276722,0.35100225,0.0021812401,0.0004439479],"about_ca_topic_score_codex":0.0000064282085,"about_ca_topic_score_gemma":0.00003925361,"teacher_disagreement_score":0.8079994,"about_ca_system_score_codex":0.0003055749,"about_ca_system_score_gemma":0.0005793872,"threshold_uncertainty_score":0.9998801},"labels":[],"label_agreement":null},{"id":"W4389315177","doi":"10.1109/cog57401.2023.10333156","title":"Procedural generation of rollercoasters","year":2023,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec","keywords":"Computer science","score_opus":0.052949499166191016,"score_gpt":0.2704849124526156,"score_spread":0.21753541328642456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389315177","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.22614062,0.000009762869,0.769538,0.0014074054,0.00030214415,0.00007510595,4.4568603e-7,0.00015753962,0.0023690104],"genre_scores_gemma":[0.97811115,0.0000034118304,0.019820241,0.00019190852,0.00006794571,0.0000059585227,0.000013015255,0.0000016752681,0.001784703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995619,0.0000130887975,0.00010700438,0.00011006405,0.0001388919,0.00006902433],"domain_scores_gemma":[0.99976856,0.00001976371,0.000027493237,0.000099691984,0.000063737745,0.00002073089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121151104,0.00003438738,0.000043937005,0.00012878928,0.00003506407,0.000024919536,0.00013224932,0.000014077329,0.000012459597],"category_scores_gemma":[0.00001786667,0.000030413188,0.000021660575,0.00071736594,0.0000059196464,0.00022935854,0.00005192281,0.000015231245,0.000070329275],"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.0000054770812,0.00006158844,0.00044988235,0.00003305072,0.000025231075,0.0000040064488,0.0011044401,0.14074568,0.19700426,0.39339215,0.08070207,0.18647216],"study_design_scores_gemma":[0.00012271546,0.00003304742,0.0025421244,0.0000018556134,8.548713e-7,0.0000025845848,0.000012544825,0.95484287,0.039540358,0.0015913956,0.0012574234,0.0000522495],"about_ca_topic_score_codex":0.0000028031936,"about_ca_topic_score_gemma":0.000003539343,"teacher_disagreement_score":0.81409717,"about_ca_system_score_codex":0.000005152903,"about_ca_system_score_gemma":0.000035537658,"threshold_uncertainty_score":0.12402138},"labels":[],"label_agreement":null},{"id":"W4389914592","doi":"10.1142/s021819592350005x","title":"Maximum Bipartite Subgraphs of Geometric Intersection Graphs","year":2023,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","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":"Combinatorics; Bipartite graph; Mathematics; Intersection graph; Intersection (aeronautics); Complete bipartite graph; Unit (ring theory); Unit disk graph; Set (abstract data type); Graph; Discrete mathematics; Line graph; Computer science","score_opus":0.015685794196199566,"score_gpt":0.2849872331532422,"score_spread":0.2693014389570426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389914592","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.06246186,0.00036963506,0.9338477,0.0010754011,0.0012701845,0.00029834718,0.000042950953,0.00011962024,0.00051425886],"genre_scores_gemma":[0.95340204,0.0001730952,0.045404226,0.00020355143,0.00045992134,0.00006761039,0.00014552427,0.00001883032,0.00012520589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635947,0.00009944257,0.0012642728,0.000361863,0.0016507269,0.00026421165],"domain_scores_gemma":[0.99463123,0.00072937476,0.0011155524,0.00029873863,0.003051715,0.00017336749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010547345,0.00021985883,0.00033604144,0.0055656726,0.00014593416,0.00017768396,0.001612295,0.000097595934,0.00005959331],"category_scores_gemma":[0.00015267229,0.00022653151,0.00038269054,0.0077853403,0.00010832116,0.00096630136,0.0002662967,0.0002655241,0.00012281918],"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.000091547314,0.00064985803,0.003633115,0.000057833196,0.000731493,0.00003429872,0.00030003427,0.47321096,0.002033402,0.21162875,0.005054611,0.3025741],"study_design_scores_gemma":[0.002706886,0.0005698204,0.073888026,0.00013339164,0.00010469981,0.00078167836,0.00022709297,0.070718005,0.0061601726,0.750403,0.0935284,0.00077887194],"about_ca_topic_score_codex":0.000008173115,"about_ca_topic_score_gemma":0.0000016980673,"teacher_disagreement_score":0.8909402,"about_ca_system_score_codex":0.00012789537,"about_ca_system_score_gemma":0.0002953381,"threshold_uncertainty_score":0.9237687},"labels":[],"label_agreement":null},{"id":"W4390681211","doi":"10.1007/978-3-031-49275-4_15","title":"On Minimizing the Energy of a Spherical Graph Representation","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Adjacency matrix; Graph energy; Distance-regular graph; Eigenvalues and eigenvectors; Graph; Mathematics; Lambda; Regular graph; Geometric graph theory; Discrete mathematics; Graph power; Line graph; Physics; Quantum mechanics","score_opus":0.027743593379815256,"score_gpt":0.26531944868097446,"score_spread":0.2375758553011592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390681211","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.00009303674,0.00012574958,0.9956038,0.0008239299,0.0014579485,0.0001452931,0.0000021340832,0.00008103389,0.0016670857],"genre_scores_gemma":[0.5112431,0.00020618213,0.4810702,0.0039318707,0.001169912,0.000037895916,0.000032305306,0.00007076034,0.0022378035],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973722,0.000053657397,0.00042840693,0.0008589749,0.0010062824,0.000280468],"domain_scores_gemma":[0.9971958,0.0014188837,0.00027620507,0.00083365623,0.000210211,0.00006526845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057858374,0.0002538945,0.00028433438,0.0005753608,0.00019427773,0.00014145664,0.0016248521,0.00013685327,0.000008353339],"category_scores_gemma":[0.00015677972,0.00019327454,0.00013242643,0.0014243311,0.0003384418,0.0002313127,0.0005618516,0.00030618298,0.000015043005],"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.0000071559225,0.000018127033,0.0000050975536,0.000008942819,0.000010036942,0.000017003511,0.00031673544,0.31634006,0.00023123476,0.2363474,0.00011488179,0.44658333],"study_design_scores_gemma":[0.00012857257,0.00014627201,0.00013848621,0.00012119372,0.0000048339484,0.000015011036,2.2248078e-7,0.460338,0.0034231732,0.53520274,0.0002621542,0.0002193244],"about_ca_topic_score_codex":0.00002715983,"about_ca_topic_score_gemma":0.00003531649,"teacher_disagreement_score":0.5145336,"about_ca_system_score_codex":0.00007575388,"about_ca_system_score_gemma":0.00026147152,"threshold_uncertainty_score":0.7881507},"labels":[],"label_agreement":null},{"id":"W4390761416","doi":"10.1007/978-3-031-49272-3_3","title":"Min-k-planar Drawings of Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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; University of Ottawa","funders":"","keywords":"Planar graph; Planar; Combinatorics; Book embedding; Graph drawing; Outerplanar graph; Planar straight-line graph; Graph; Enhanced Data Rates for GSM Evolution; Mathematics; Upper and lower bounds; Crossing number (knot theory); Computer science; 1-planar graph; Pathwidth; Discrete mathematics; Geometry; Computer graphics (images); Chordal graph; Line graph; Artificial intelligence; Materials science","score_opus":0.018247476838354103,"score_gpt":0.24332454901570885,"score_spread":0.22507707217735476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390761416","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.00018735835,0.00019249182,0.9940499,0.00059935957,0.002079794,0.00022345515,0.0000075284615,0.0001501414,0.002509971],"genre_scores_gemma":[0.24261773,0.00012441086,0.7513873,0.001451144,0.00074975356,0.000015165043,0.000046712095,0.000074217554,0.0035335806],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690247,0.000024042663,0.0005360748,0.0010692932,0.0010564427,0.00041167013],"domain_scores_gemma":[0.99786484,0.0005443911,0.00030338074,0.0008491937,0.0003178025,0.000120377714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007767882,0.00034848382,0.00042799284,0.0015091298,0.00016677738,0.00021389395,0.0021603147,0.00021679323,0.000011257523],"category_scores_gemma":[0.00009244145,0.0003399288,0.00014954951,0.0014054234,0.0003971398,0.00042387185,0.0005626628,0.00040178664,0.000060808354],"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.0000053551807,0.000034323108,0.000038700535,0.00007126264,0.000020690313,0.00007556867,0.0007361842,0.072771855,0.0007065087,0.29985285,0.00015188333,0.62553483],"study_design_scores_gemma":[0.00020228674,0.00019590156,0.00022425059,0.00026790163,0.00000825827,0.000033181535,1.0745353e-7,0.2535683,0.0030619977,0.74062026,0.0013211626,0.0004964309],"about_ca_topic_score_codex":0.000018700139,"about_ca_topic_score_gemma":0.000039829836,"teacher_disagreement_score":0.6250384,"about_ca_system_score_codex":0.00009060263,"about_ca_system_score_gemma":0.0004793154,"threshold_uncertainty_score":0.9999053},"labels":[],"label_agreement":null},{"id":"W4390826444","doi":"10.14733/cadaps.2024.807-818","title":"An Experimental Evaluation of Offset Computation for Polygons","year":2024,"lang":"en","type":"article","venue":"Computer-Aided Design and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Offset (computer science); Computation; Computer science; Computer graphics (images); Algorithm; Operating system","score_opus":0.07218539903363975,"score_gpt":0.3668479734838346,"score_spread":0.29466257445019484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390826444","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.0066337027,0.001187506,0.9901909,0.0002640822,0.00021251317,0.0012722546,0.000013134683,0.00017804584,0.000047855472],"genre_scores_gemma":[0.6458817,0.000005589047,0.35329828,0.000079333724,0.00017744175,0.00044940165,0.00009205387,0.000007654739,0.000008559592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987154,0.00013829174,0.00028731488,0.0004422059,0.00028996848,0.0001268268],"domain_scores_gemma":[0.99889857,0.00040995728,0.00007104391,0.00024448216,0.00029020436,0.00008572458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007950545,0.00012371578,0.0001293009,0.00022729671,0.00018039513,0.00022883444,0.00023402007,0.000050676077,0.000004196236],"category_scores_gemma":[0.000008713436,0.00012744637,0.00005276303,0.00048617073,0.000039902632,0.00048849755,0.000047617697,0.000048666705,0.0000063681914],"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.000007523686,0.00021231601,0.0000027096387,0.0000416663,0.000027724762,2.5300534e-7,0.0004001869,0.14043427,0.020819949,0.24140269,0.0019053777,0.59474534],"study_design_scores_gemma":[0.00031451226,0.0002156109,0.00014285796,0.000018776433,0.000028218774,0.000010595875,0.000015386742,0.95745623,0.01075536,0.028932646,0.001980251,0.00012954032],"about_ca_topic_score_codex":0.0000026403563,"about_ca_topic_score_gemma":3.6734716e-7,"teacher_disagreement_score":0.81702197,"about_ca_system_score_codex":0.00004280921,"about_ca_system_score_gemma":0.00017204437,"threshold_uncertainty_score":0.5197112},"labels":[],"label_agreement":null},{"id":"W4390849073","doi":"","title":"Homotopic classes and Triangle Clusters in Minimal Planar Region Coverings.","year":2023,"lang":"en","type":"preprint","venue":"","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 Manitoba","funders":"","keywords":"Planar; Combinatorics; Mathematics; Geometry; Pure mathematics; Computer science; Computer graphics (images)","score_opus":0.05187372850374435,"score_gpt":0.27129771268198033,"score_spread":0.21942398417823597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390849073","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.21539803,0.0003013477,0.7760506,0.004206551,0.0016140663,0.00046740018,0.000004831169,0.00028306377,0.0016740712],"genre_scores_gemma":[0.9324666,0.0004299317,0.058727685,0.0007449705,0.00036891983,0.00008973437,0.00009459455,0.000022246053,0.007055281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988399,0.000059361024,0.00025454364,0.0005065533,0.00018129728,0.00015834392],"domain_scores_gemma":[0.9994058,0.00014517283,0.000089659705,0.00026998357,0.000034915745,0.00005443822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021240037,0.00014552579,0.0002098447,0.0003480435,0.000044000193,0.00021833011,0.0003327546,0.00013973644,0.000002699173],"category_scores_gemma":[0.000052256913,0.00014644353,0.000047988844,0.0002936434,0.000018974935,0.00017457322,0.00056570745,0.00020077538,0.000015334512],"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.00025967933,0.0006703991,0.029970506,0.0021482268,0.00033465147,0.0015123892,0.008050099,0.20097628,0.00068931415,0.29955474,0.1416581,0.31417564],"study_design_scores_gemma":[0.0019472293,0.0002527075,0.11355191,0.0003519592,0.00001969848,0.000083206716,0.00013452586,0.8205885,0.00044574658,0.04585173,0.015770754,0.001002017],"about_ca_topic_score_codex":0.00010399169,"about_ca_topic_score_gemma":0.00017025536,"teacher_disagreement_score":0.71732295,"about_ca_system_score_codex":0.00005468717,"about_ca_system_score_gemma":0.0001173357,"threshold_uncertainty_score":0.5971794},"labels":[],"label_agreement":null},{"id":"W4391247836","doi":"10.1016/j.tcs.2024.114416","title":"Edge searching and fast searching with constraints","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; City University of Hong Kong; Glaucoma Research Foundation","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Combinatorics; Algorithm; Artificial intelligence","score_opus":0.009893848445170378,"score_gpt":0.2657364047234484,"score_spread":0.255842556278278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391247836","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.056750905,0.000092774055,0.9381527,0.0013863313,0.00031139876,0.000109682594,0.00000124291,0.00021389322,0.0029810895],"genre_scores_gemma":[0.81551576,0.0000037781401,0.1841266,0.0002044154,0.00012470885,0.0000028122013,7.706099e-7,0.000004834618,0.000016305094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980766,0.000087890694,0.00014056094,0.0006650281,0.000636028,0.00039385],"domain_scores_gemma":[0.9989703,0.00038957092,0.000015635062,0.00027109685,0.000103512684,0.0002498315],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014493541,0.00012995042,0.00010914972,0.00029875172,0.0004464048,0.0016203342,0.0007224897,0.000022758564,0.000021845119],"category_scores_gemma":[0.000034802804,0.0000957964,0.000023593846,0.0012425411,0.0023913367,0.0009251528,0.00063035596,0.00024456214,0.000034398803],"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.0000020454208,0.000008291531,0.000011747696,0.0000126180685,0.0000033461936,0.000027062595,0.0005650379,0.0005855492,0.00051547086,0.7076454,0.000011783776,0.2906116],"study_design_scores_gemma":[0.00009140938,0.00015407287,0.0005818488,0.00008148813,0.0000025726888,0.00028652474,0.000008915379,0.9148318,0.0013631348,0.0822822,0.00016748322,0.00014855292],"about_ca_topic_score_codex":0.0000013593665,"about_ca_topic_score_gemma":3.6319074e-7,"teacher_disagreement_score":0.91424626,"about_ca_system_score_codex":0.0000340759,"about_ca_system_score_gemma":0.00026519634,"threshold_uncertainty_score":0.99941605},"labels":[],"label_agreement":null},{"id":"W4391505491","doi":"10.48550/arxiv.2402.00336","title":"Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geodesic; Polygon (computer graphics); Simple (philosophy); Simple polygon; Combinatorics; Mathematics; Computer graphics (images); Geometry; Computer science; Regular polygon; Telecommunications; Philosophy","score_opus":0.07456550130575683,"score_gpt":0.19560904506513732,"score_spread":0.12104354375938049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391505491","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.4809915,0.00017848135,0.51585877,0.00032065823,0.00041905136,0.0002387844,0.0000050883555,0.00011165666,0.0018760065],"genre_scores_gemma":[0.9964824,0.000026032112,0.0025958982,0.00010495388,0.00012517037,0.0000023746,0.000023352579,0.0000116426845,0.0006282131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984196,0.00014570511,0.00023588359,0.0008128029,0.000109103676,0.0002769189],"domain_scores_gemma":[0.99892396,0.00018470411,0.00014417987,0.0006212557,0.00006128337,0.00006463188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004712461,0.00022436859,0.00019454928,0.00032438422,0.00019086858,0.00032759237,0.0010910037,0.000129857,0.000013251199],"category_scores_gemma":[0.000042722022,0.00020455205,0.00013463204,0.0011336558,0.000051752184,0.00017149451,0.0023602112,0.0006445371,0.000048313654],"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.0000050735352,0.00003249003,0.0004931676,0.00007201724,0.000025192005,0.00009992224,0.00051138934,0.7108323,0.00006732274,0.28456017,0.00013050549,0.003170421],"study_design_scores_gemma":[0.0001050083,0.000011881693,0.0007672961,0.00008571666,0.000018561333,0.0000050232575,0.00007907351,0.77935994,0.00008518552,0.21916069,0.00012668462,0.00019492465],"about_ca_topic_score_codex":0.00021336728,"about_ca_topic_score_gemma":0.00015668,"teacher_disagreement_score":0.51549083,"about_ca_system_score_codex":0.00019269352,"about_ca_system_score_gemma":0.00023585647,"threshold_uncertainty_score":0.8341391},"labels":[],"label_agreement":null},{"id":"W4391939349","doi":"10.15376/frc.2013.1.41","title":"Revisiting the Random Disk Model: Decomposition of Paper Structure Using Randomly Deposited Disks with Arbitrary Size Distributions","year":2013,"lang":"en","type":"article","venue":"","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 Toronto","funders":"","keywords":"Decomposition; Computer science; Chemistry","score_opus":0.008646725922548653,"score_gpt":0.2412172883167811,"score_spread":0.23257056239423246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391939349","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.36616102,0.0000652763,0.6324243,0.0008386558,0.00003157078,0.00027007636,0.000008870989,0.00003903926,0.00016122474],"genre_scores_gemma":[0.8790518,0.0000038971875,0.12056541,0.00021861745,0.000075681346,0.000014255616,0.000037199523,0.0000057358484,0.000027384047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890625,0.00011508408,0.00029959428,0.00023898418,0.00026990788,0.00017015944],"domain_scores_gemma":[0.9988741,0.0004069428,0.00014601588,0.0002880067,0.0002264549,0.000058422953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014696526,0.00013656725,0.00017793871,0.00004392772,0.00034022945,0.00019267108,0.0002837619,0.000042224314,0.000044556407],"category_scores_gemma":[0.00003590879,0.0000803056,0.00007423514,0.00049981655,0.000048766058,0.000865019,0.00007974709,0.00011676036,0.0000017240671],"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.00022784417,0.00007723146,0.0013990784,0.00005482532,0.00015321924,0.0000032292953,0.0004987389,0.6654349,0.23555805,0.07753891,0.00018447975,0.018869525],"study_design_scores_gemma":[0.0015929855,0.000020976795,0.0047830204,0.00003696719,0.000033988046,0.000037843696,0.00001560536,0.9715202,0.014856772,0.006954948,0.000011922676,0.00013478153],"about_ca_topic_score_codex":0.00006438359,"about_ca_topic_score_gemma":0.000007880155,"teacher_disagreement_score":0.5128908,"about_ca_system_score_codex":0.00002589841,"about_ca_system_score_gemma":0.00006690136,"threshold_uncertainty_score":0.32747677},"labels":[],"label_agreement":null},{"id":"W4392181922","doi":"10.4230/lipics.gd.2024.37","title":"Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Combinatorics; Crossing number (knot theory); Mathematics; 1-planar graph; Indifference graph; Chordal graph; Computer science; Graph; Geography; Cartography; Intersection (aeronautics)","score_opus":0.08897764900743185,"score_gpt":0.2393944676154222,"score_spread":0.15041681860799036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392181922","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.7993145,0.00020207491,0.19486818,0.000043189222,0.0016648542,0.00016325853,0.000009775077,0.00022962902,0.003504551],"genre_scores_gemma":[0.9889991,0.00002269306,0.009293401,0.00006404215,0.00009845655,7.204909e-7,0.000017856662,0.000024735482,0.0014789589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769485,0.00013430903,0.00038909147,0.001219006,0.00020487797,0.00035787813],"domain_scores_gemma":[0.9982464,0.00018832886,0.0003530377,0.00073561014,0.0003279153,0.00014875384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003948275,0.00035800942,0.00037977728,0.0006296561,0.00051788136,0.0010199423,0.00093456,0.000284029,0.000034844645],"category_scores_gemma":[0.00007589168,0.00043135317,0.0004019843,0.0020706009,0.00032933315,0.00042619416,0.0017705676,0.0006081571,0.00008514193],"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.00007686093,0.00031679115,0.0045321314,0.0006776862,0.00036468153,0.00054950983,0.0028879575,0.39895257,0.0044741128,0.5708022,0.0004275976,0.015937911],"study_design_scores_gemma":[0.0003828035,0.00006298511,0.00058703154,0.0005402145,0.00012844255,0.0000603732,0.000108667504,0.41437125,0.008323742,0.5739003,0.00084442785,0.0006898045],"about_ca_topic_score_codex":0.00020533521,"about_ca_topic_score_gemma":0.000025743664,"teacher_disagreement_score":0.18968464,"about_ca_system_score_codex":0.0001761932,"about_ca_system_score_gemma":0.00056308304,"threshold_uncertainty_score":0.99981385},"labels":[],"label_agreement":null},{"id":"W4392506338","doi":"10.1061/9780784485330.014","title":"A Heuristic Search Method for Critical Slip Surfaces with Weak Layers","year":2024,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Rocscience (Canada); University of Waterloo","funders":"","keywords":"Computer science; Heuristic; Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.032449846139754136,"score_gpt":0.35972909498164435,"score_spread":0.3272792488418902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392506338","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.0012125137,0.00021067371,0.9905434,0.005024416,0.00031047125,0.00013688642,0.000003590045,0.00018343337,0.002374584],"genre_scores_gemma":[0.31261346,0.0000019421836,0.68516356,0.00016471978,0.00008329318,0.000018707082,0.0000038216754,0.0000050457647,0.0019454542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991366,0.000053934098,0.00009865376,0.0003121745,0.00022273579,0.00017587458],"domain_scores_gemma":[0.99849415,0.0011795725,0.000004946547,0.00012832833,0.00012203933,0.00007096546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046528096,0.000073564916,0.00007681668,0.00010604413,0.00009364827,0.00035409155,0.00018743647,0.000024668836,0.000033517765],"category_scores_gemma":[0.000068805595,0.000054226606,0.000035039047,0.0004504772,0.000020809142,0.00026793432,0.000049585786,0.00006582608,0.000040525654],"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.000009428235,0.000022611053,0.000009090077,0.000078487494,0.000019052208,0.0000080143045,0.00018544943,0.015570232,0.00071565196,0.94139224,0.0036301422,0.03835961],"study_design_scores_gemma":[0.00009018647,0.00015606207,0.00009581608,0.00001667099,0.0000070702517,0.000030948002,0.000028072587,0.9719076,0.0023264727,0.013087766,0.012158443,0.00009488001],"about_ca_topic_score_codex":0.00001394557,"about_ca_topic_score_gemma":0.000008375386,"teacher_disagreement_score":0.9563374,"about_ca_system_score_codex":0.000018435474,"about_ca_system_score_gemma":0.00014926531,"threshold_uncertainty_score":0.3414513},"labels":[],"label_agreement":null},{"id":"W4392900090","doi":"","title":"Maximum Independent Set when excluding an induced minor: K_1 + tK_2 and tC_3 cup C_4","year":2023,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Minor (academic); Set (abstract data type); Combinatorics; Mathematics; Statistics; Computer science; Art; Humanities; Programming language","score_opus":0.03535015961779403,"score_gpt":0.2563082110793923,"score_spread":0.22095805146159825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392900090","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.66709614,0.00011480554,0.3183851,0.0067608124,0.00025008453,0.00021817797,0.000009104293,0.0004045095,0.006761266],"genre_scores_gemma":[0.95670813,0.00007190023,0.039928816,0.00019623528,0.000036022655,0.0000290357,0.00016893621,0.000017394585,0.002843533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965756,0.0016522654,0.0003242514,0.0006527985,0.0004680502,0.00032704065],"domain_scores_gemma":[0.99722344,0.0006498814,0.00017238992,0.0010181288,0.0007167268,0.00021942817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036477966,0.00018830941,0.00017558395,0.00034217443,0.0004952256,0.0006070481,0.0009195236,0.00010649647,0.00005496773],"category_scores_gemma":[0.00042916657,0.00020429006,0.000060204315,0.0009324674,0.00006068849,0.00074288534,0.00073571026,0.000208297,0.00008141747],"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.00001651624,0.0005138981,0.00498686,0.000090187066,0.00008706741,0.00003391906,0.04264717,0.00060470443,0.07174018,0.27962872,0.00541323,0.59423757],"study_design_scores_gemma":[0.0021925569,0.00000781333,0.0782909,0.000427591,0.00004074045,0.00010655326,0.0007326693,0.6467122,0.1616394,0.07144938,0.037023123,0.0013771183],"about_ca_topic_score_codex":0.00023300851,"about_ca_topic_score_gemma":0.00038086847,"teacher_disagreement_score":0.64610744,"about_ca_system_score_codex":0.00005493095,"about_ca_system_score_gemma":0.00013074996,"threshold_uncertainty_score":0.8330707},"labels":[],"label_agreement":null},{"id":"W4396212932","doi":"10.61091/jcmcc119-22","title":"Some Excluded Minors for the Spindle Surface","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Surface (topology); Combinatorics; Space (punctuation); Mathematics; Topology (electrical circuits); Computer science; Geometry","score_opus":0.022030201128293767,"score_gpt":0.2781439167719661,"score_spread":0.2561137156436723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396212932","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.16941343,0.0073713996,0.76382536,0.0018674271,0.056757238,0.0005326627,0.000002671011,0.00010368371,0.00012610562],"genre_scores_gemma":[0.9625767,0.00009662036,0.033210307,0.000057707286,0.0040005576,0.0000029140688,0.0000010548464,0.000021867378,0.000032309094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980531,0.00006613016,0.00079051725,0.00023862116,0.0005812346,0.00027040206],"domain_scores_gemma":[0.9964011,0.0023923367,0.000392861,0.00024598782,0.00044668265,0.00012108869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021383294,0.00021601631,0.0003897298,0.00015270797,0.00039308323,0.0009043579,0.0007287643,0.00009761345,0.0000019695742],"category_scores_gemma":[0.00030972113,0.00015438495,0.00022869141,0.0004735281,0.00005255096,0.00057182217,0.00023416775,0.0003137463,0.000003120855],"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.00001682536,0.00011745593,0.000003373633,0.00014677309,0.00010691427,0.000009270463,0.00075074506,0.0010515518,0.0005212222,0.9879865,0.0014626882,0.007826696],"study_design_scores_gemma":[0.0010840826,0.000412377,0.00002360057,0.00016473416,0.0000632739,0.000101957965,0.00006714666,0.3054398,0.0013032138,0.683846,0.007317703,0.00017609747],"about_ca_topic_score_codex":0.00000270176,"about_ca_topic_score_gemma":1.1175181e-7,"teacher_disagreement_score":0.79316324,"about_ca_system_score_codex":0.00006375238,"about_ca_system_score_gemma":0.00024535594,"threshold_uncertainty_score":0.87207437},"labels":[],"label_agreement":null},{"id":"W4396646704","doi":"10.1007/s00454-024-00647-9","title":"Convex Bodies of Constant Width with Exponential Illumination Number","year":2024,"lang":"en","type":"article","venue":"Discrete & 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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Constant (computer programming); Regular polygon; Exponential function; Mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.009586110527460747,"score_gpt":0.25663253319542656,"score_spread":0.2470464226679658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396646704","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.09868853,0.00049188617,0.8956712,0.00062440144,0.0005917773,0.00019477142,0.000045623703,0.00019939589,0.0034924052],"genre_scores_gemma":[0.9295425,0.000012762076,0.06957312,0.00012401672,0.00013217462,0.000019017025,0.00022099429,0.000016004064,0.00035942375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978544,0.00007667713,0.00044797192,0.0005211519,0.0008562069,0.00024357639],"domain_scores_gemma":[0.99870133,0.000423423,0.00013923143,0.00022391317,0.0004138348,0.00009823403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033148835,0.00022109762,0.00025271357,0.0004714932,0.00014200287,0.0002580893,0.00033961632,0.00006641759,0.00016365702],"category_scores_gemma":[0.00004224087,0.00019246862,0.00011483028,0.0012604459,0.0001791969,0.00084992027,0.00013167385,0.00014951249,0.00010290378],"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.000058681042,0.00013293668,0.0013369166,0.00022756324,0.00027325982,0.00009290015,0.0013058713,0.118718855,0.00071712525,0.8336001,0.0017294413,0.04180635],"study_design_scores_gemma":[0.0009306972,0.00031068633,0.019891603,0.0002724237,0.00006557475,0.0002666155,0.00017556791,0.89120454,0.0024786876,0.0777656,0.005968257,0.0006697766],"about_ca_topic_score_codex":0.00001323081,"about_ca_topic_score_gemma":0.0000029240102,"teacher_disagreement_score":0.83085394,"about_ca_system_score_codex":0.000058432262,"about_ca_system_score_gemma":0.0002943204,"threshold_uncertainty_score":0.78486425},"labels":[],"label_agreement":null},{"id":"W4398220186","doi":"10.2139/ssrn.4837080","title":"The Phase Transitions of Diameters in Random Axis-Parallel Hyperrectangle Intersection Graphs","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","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":"Okanagan College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Intersection (aeronautics); Mathematics; Phase (matter); Combinatorics; Intersection graph; Physics; Graph; Engineering; Line graph; Quantum mechanics","score_opus":0.010343470959642975,"score_gpt":0.26486048875575047,"score_spread":0.25451701779610747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398220186","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.17143105,0.009410696,0.8141428,0.0019937851,0.002352082,0.0003050735,0.0000063521616,0.000045289045,0.00031284214],"genre_scores_gemma":[0.9952111,0.0030633735,0.0012842882,0.000031659358,0.00016381472,0.00003638506,0.000013836464,0.000013039437,0.00018249566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977255,0.00025125203,0.0005429228,0.00032794027,0.0003310586,0.000821323],"domain_scores_gemma":[0.99918014,0.00017078777,0.00021954215,0.00026183706,0.00011695831,0.000050709485],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002125686,0.00019457683,0.000249106,0.00054027385,0.00018669275,0.0002253311,0.0006546564,0.00011231765,0.0000027018775],"category_scores_gemma":[0.000049674625,0.00015137531,0.0003297934,0.0006322522,0.00005231972,0.00015611183,0.00017815919,0.0026861015,0.000005284751],"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.00037303395,0.00036550895,0.000012265993,0.00005841327,0.00055688864,0.000015443356,0.002701244,0.07150561,0.0016526061,0.6513548,0.0002773204,0.27112687],"study_design_scores_gemma":[0.001716807,0.00031511683,0.000023549293,0.0001106653,0.000045362136,0.00027153332,0.0003796863,0.08397875,0.00022606032,0.91238636,0.00036317267,0.000182918],"about_ca_topic_score_codex":0.00005257407,"about_ca_topic_score_gemma":0.0011901557,"teacher_disagreement_score":0.82378006,"about_ca_system_score_codex":0.00057568436,"about_ca_system_score_gemma":0.0024711916,"threshold_uncertainty_score":0.9996147},"labels":[],"label_agreement":null},{"id":"W4399371052","doi":"10.7155/jgaa.v28i2.2925","title":"Min-$k$-planar Drawings of Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Planar; Combinatorics; Planar graph; Outerplanar graph; Computer science; Mathematics; Pathwidth; Graph; Computer graphics (images); Line graph","score_opus":0.009399194379631248,"score_gpt":0.25290598610333714,"score_spread":0.2435067917237059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399371052","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.0064386195,0.0040474967,0.9879117,0.0010710765,0.00017491111,0.00007830811,0.000006359784,0.000018222854,0.00025331927],"genre_scores_gemma":[0.77576613,0.0010498082,0.22248577,0.0001340385,0.00035772577,0.000018994837,0.00000598478,0.000009051848,0.00017249775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992983,0.0000137195675,0.00030072435,0.00011943466,0.00019349634,0.00007433395],"domain_scores_gemma":[0.99943465,0.00009472003,0.0001233861,0.00010673201,0.0001693734,0.00007114659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024459022,0.000063748055,0.000114983755,0.00036581242,0.00007501679,0.00009353631,0.00020631996,0.000028176119,0.0000034854245],"category_scores_gemma":[0.0000055706705,0.000052705338,0.000093383016,0.0008186364,0.000041299823,0.00029641835,0.000021144431,0.0000945628,0.0000019188328],"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.0000021991093,0.00007856644,0.00006498132,0.000044781053,0.000066525536,0.000007651134,0.00025781716,0.00022745403,0.0033383796,0.6068977,0.0018845069,0.38712943],"study_design_scores_gemma":[0.00045410355,0.00041727646,0.003589377,0.0001403691,0.00009143779,0.00061071507,0.000091546885,0.04302519,0.004717084,0.7584658,0.1881123,0.00028476436],"about_ca_topic_score_codex":0.0000034890913,"about_ca_topic_score_gemma":5.659882e-7,"teacher_disagreement_score":0.7693275,"about_ca_system_score_codex":0.000006120028,"about_ca_system_score_gemma":0.00006362892,"threshold_uncertainty_score":0.21492612},"labels":[],"label_agreement":null},{"id":"W4399602855","doi":"10.37236/11712","title":"Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematics; Treewidth; Bounded function; Degree (music); Planar graph; Discrete mathematics; Graph; Vertex (graph theory); 1-planar graph; Structured program theorem; Pathwidth; Chordal graph; Line graph; Physics; Mathematical analysis","score_opus":0.019278106987865237,"score_gpt":0.25198456432584804,"score_spread":0.23270645733798279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399602855","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.3348988,0.04934962,0.5856625,0.0168619,0.010299027,0.0006258236,0.000012805087,0.0002612997,0.0020282525],"genre_scores_gemma":[0.9976955,0.00049681857,0.0004906772,0.00021076163,0.0004881545,0.0000025491643,0.0000038184176,0.000021303706,0.00059039023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973061,0.00019237139,0.0005425604,0.00033746686,0.00100561,0.00061590935],"domain_scores_gemma":[0.99840623,0.00026713635,0.00029235272,0.00051105244,0.0004075141,0.00011570742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014052398,0.00025898305,0.00028973457,0.00039301213,0.0003523276,0.00076184596,0.0014622755,0.00008423001,0.0000145822405],"category_scores_gemma":[0.000095013806,0.00017928462,0.00021425606,0.0012518214,0.00007671502,0.0007576046,0.00010798355,0.0011862242,0.000013828637],"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.000025536707,0.00005083563,0.000024254212,0.000024125144,0.00015718375,0.00003983337,0.0005310932,0.00038483017,0.00070550496,0.97793555,0.0031248792,0.016996345],"study_design_scores_gemma":[0.00040316515,0.0005047946,0.00039870705,0.000044963053,0.00005937747,0.0012113287,0.000033201093,0.003969052,0.0037886072,0.957471,0.03189346,0.0002223197],"about_ca_topic_score_codex":0.0000063886864,"about_ca_topic_score_gemma":0.000016248146,"teacher_disagreement_score":0.66279674,"about_ca_system_score_codex":0.00041134385,"about_ca_system_score_gemma":0.0014741577,"threshold_uncertainty_score":0.7346498},"labels":[],"label_agreement":null},{"id":"W4400248777","doi":"10.23967/isc.2024.293","title":"Impact of evolving fabric anisotropy on CPT simulations for subsurface characterization","year":2024,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Characterization (materials science); Anisotropy; Materials science; Computer science; Nanotechnology; Optics; Physics","score_opus":0.020929251806202157,"score_gpt":0.3147028245702108,"score_spread":0.2937735727640087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400248777","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.25382444,0.000029072953,0.74538237,0.00012830771,0.0002225461,0.00014435923,0.000021735472,0.00008948144,0.00015767089],"genre_scores_gemma":[0.97565687,0.0000028538955,0.023549346,0.000031119853,0.000074157135,0.0000056193467,0.0001004492,0.0000058283154,0.00057373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937797,0.000018606559,0.00016057021,0.00020416132,0.00013824155,0.00010046691],"domain_scores_gemma":[0.9994271,0.0002159703,0.00003725601,0.00014332672,0.00014429413,0.000032090386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009547213,0.00007516028,0.00007721859,0.00018316878,0.00006444841,0.00014202057,0.00012884355,0.00002783144,0.00006700504],"category_scores_gemma":[0.000041099607,0.00006336671,0.00008773556,0.0005992003,0.000006174951,0.00049865356,0.00002359101,0.000031456166,0.000015482088],"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.000017125942,0.00013824982,0.00065692974,0.00006321658,0.00007706978,0.0000012388285,0.00053869875,0.39003816,0.3462013,0.19891745,0.0012416331,0.062108908],"study_design_scores_gemma":[0.00009034756,0.00019078868,0.021856721,0.00001581466,0.0000043018986,0.0000012891079,0.0000010681405,0.9696792,0.005501335,0.0022920095,0.00029641326,0.00007073711],"about_ca_topic_score_codex":0.0000068607105,"about_ca_topic_score_gemma":0.0000010141331,"teacher_disagreement_score":0.72183305,"about_ca_system_score_codex":0.000053360916,"about_ca_system_score_gemma":0.000099868674,"threshold_uncertainty_score":0.25840193},"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":"W4400485116","doi":"10.61091/jcmcc120-28","title":"A Generalisation of Maximal (k,b)-Linear-Free Sets of Integers","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.019620522895396893,"score_gpt":0.27160621481383024,"score_spread":0.25198569191843334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400485116","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.5636016,0.00086770364,0.4207863,0.00026416645,0.013950418,0.00016111869,0.000003949512,0.00003681451,0.0003279477],"genre_scores_gemma":[0.9367123,0.000030827046,0.062579416,0.000010024108,0.00064628053,7.321929e-7,0.0000017323327,0.000014001006,0.0000046851787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750096,0.00010415524,0.0012564387,0.00019952963,0.00075799075,0.00018094045],"domain_scores_gemma":[0.99730355,0.00069790136,0.0008391947,0.00028993265,0.0007640412,0.000105375875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017190147,0.00019264255,0.000554994,0.00041651764,0.00008211965,0.00013902843,0.00066838774,0.00010852497,0.0000044209773],"category_scores_gemma":[0.00046270204,0.00017141871,0.00020641283,0.00069959543,0.000071435905,0.00044955715,0.00031668166,0.00027362065,8.1401146e-7],"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.000031638603,0.00022837686,0.00002744479,0.00040077663,0.00011071871,0.000013440929,0.0014260662,0.0011596343,0.0039019263,0.9846529,0.0002912589,0.0077558276],"study_design_scores_gemma":[0.0015815902,0.00075894233,0.00007323569,0.0005212621,0.00006463317,0.00011554861,0.00008633206,0.27513286,0.011721631,0.70941204,0.00034901183,0.00018286957],"about_ca_topic_score_codex":0.00000687914,"about_ca_topic_score_gemma":1.7210905e-7,"teacher_disagreement_score":0.3731107,"about_ca_system_score_codex":0.00005270415,"about_ca_system_score_gemma":0.0002802009,"threshold_uncertainty_score":0.6990252},"labels":[],"label_agreement":null},{"id":"W4400491840","doi":"10.1007/s12220-024-01734-2","title":"Boundary Rigidity, and Non-Rigidity, of Projective Structures","year":2024,"lang":"en","type":"article","venue":"Journal of Geometric Analysis","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":"McGill University","funders":"","keywords":"Rigidity (electromagnetism); Projective test; Geometry; Mathematics; Materials science; Pure mathematics; Composite material","score_opus":0.011046083552749856,"score_gpt":0.27536846460731607,"score_spread":0.26432238105456624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400491840","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.31604412,0.0032935282,0.6798254,0.00018994545,0.0003187413,0.00004038924,0.000004790741,0.000009920381,0.0002731162],"genre_scores_gemma":[0.977025,0.0002498282,0.022328574,0.000028435432,0.0001968269,6.743581e-7,0.0000026707253,0.0000038150893,0.00016421989],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99843323,0.00006529801,0.0005109561,0.00021195726,0.00065276463,0.00012578152],"domain_scores_gemma":[0.99858826,0.00034666818,0.00032789394,0.00016348861,0.00048338217,0.0000902775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008927396,0.000113190574,0.00037888845,0.005392713,0.000082561965,0.00028477414,0.0003531114,0.000054672677,0.00003391163],"category_scores_gemma":[0.00016960458,0.0000874828,0.00030869158,0.012752908,0.000052789408,0.0006728591,0.00013638762,0.00019490691,0.0000020119292],"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.00011131976,0.0006016481,0.04684516,0.000620044,0.018769128,0.00042676151,0.0038154572,0.11606483,0.006186102,0.03242417,0.019799463,0.75433594],"study_design_scores_gemma":[0.0007633581,0.0011146091,0.57448196,0.000087699926,0.0030688457,0.00044635747,0.00015201306,0.3500008,0.0069318605,0.05388137,0.008539404,0.00053176045],"about_ca_topic_score_codex":0.000036424437,"about_ca_topic_score_gemma":0.000005086881,"teacher_disagreement_score":0.75380415,"about_ca_system_score_codex":0.00006017425,"about_ca_system_score_gemma":0.00026605497,"threshold_uncertainty_score":0.612735},"labels":[],"label_agreement":null},{"id":"W4400596734","doi":"10.55016/ojs/cdm.v13i2.62728","title":"Some remarks on the lonely runner conjecture","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Conjecture; Combinatorics; Mathematics; Constant (computer programming); Lonely runner conjecture; Upper and lower bounds; Unit (ring theory); Binary logarithm; Collatz conjecture; Mathematical analysis; Computer science","score_opus":0.013893580866742798,"score_gpt":0.2813669509504867,"score_spread":0.2674733700837439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596734","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.00853345,0.000059061873,0.9627217,0.02543776,0.00045645263,0.00043139438,0.00005707555,0.00012512805,0.0021779628],"genre_scores_gemma":[0.9617672,0.0000046165496,0.032302972,0.0037044922,0.00091562193,0.00007007589,0.000025214387,0.000011780039,0.0011980333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882025,0.00006764238,0.00025776826,0.0002659004,0.00031863086,0.00026981052],"domain_scores_gemma":[0.9983632,0.00041771686,0.00008925954,0.0006766288,0.0003377733,0.00011541585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005051569,0.00015182463,0.00015240378,0.000107731816,0.0005368611,0.0002509736,0.000627981,0.00006327779,0.000059390408],"category_scores_gemma":[0.0007301504,0.00009867658,0.00007893159,0.00059348653,0.00007904555,0.00019630723,0.00018975022,0.00013403122,0.0007579222],"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.0000030591125,0.000041049192,0.0000012389476,0.000004072833,0.000017816708,0.0000014806224,0.0004048736,0.00037721213,0.0006658069,0.98078877,0.01690997,0.00078464486],"study_design_scores_gemma":[0.000586181,0.00055297633,0.0005931438,0.00013145323,0.00003933839,0.00004621569,0.0000978162,0.23042421,0.020549828,0.6762604,0.0701659,0.00055248645],"about_ca_topic_score_codex":0.0000016585994,"about_ca_topic_score_gemma":0.0000037714399,"teacher_disagreement_score":0.9532337,"about_ca_system_score_codex":0.00007219953,"about_ca_system_score_gemma":0.00008587887,"threshold_uncertainty_score":0.9741809},"labels":[],"label_agreement":null},{"id":"W4400777855","doi":"10.1007/s44146-024-00153-7","title":"On the geometry of the Birkhoff polytope II: the Schatten p-norms","year":2024,"lang":"en","type":"article","venue":"Acta Scientiarum Mathematicarum","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":"Université TÉLUQ; Université Laval","funders":"Fulbright U.S. Scholar Program","keywords":"Mathematics; Polytope; Geometry; Combinatorics","score_opus":0.011726245887738625,"score_gpt":0.22741506193549624,"score_spread":0.2156888160477576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400777855","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.631184,0.0007109918,0.16600977,0.1848395,0.0047667366,0.0010609581,0.000021358668,0.00027810188,0.011128618],"genre_scores_gemma":[0.99405354,0.0000053531726,0.0014414618,0.0010962915,0.00009340451,0.000023661769,0.0000013493952,0.000011099368,0.003273833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795014,0.00011583538,0.00032510413,0.0003732351,0.0009296201,0.00030607425],"domain_scores_gemma":[0.9976412,0.0009051197,0.00012226892,0.0011912473,0.00009144414,0.000048742804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016623082,0.00016326585,0.00014215225,0.0001946041,0.0008368531,0.00055810454,0.002265775,0.000046336452,0.00011311143],"category_scores_gemma":[0.00033803753,0.00006675768,0.00019742224,0.0026330203,0.00023352185,0.00036050213,0.00093037233,0.00025065304,0.00012731344],"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.000001445864,0.00007140787,0.000011301146,0.000039810948,0.000047769685,0.0000011059569,0.0011985338,0.00029025335,0.0037448,0.96513826,0.024109429,0.0053458875],"study_design_scores_gemma":[0.00022257687,0.00018058227,0.0020258604,0.0004754558,0.00008278165,0.00009096548,0.0002727695,0.43804258,0.04213888,0.47569454,0.040342923,0.0004300918],"about_ca_topic_score_codex":0.0000042326405,"about_ca_topic_score_gemma":0.0000026199332,"teacher_disagreement_score":0.48944372,"about_ca_system_score_codex":0.000029742416,"about_ca_system_score_gemma":0.00013981492,"threshold_uncertainty_score":0.6436482},"labels":[],"label_agreement":null},{"id":"W4400869481","doi":"10.1002/jgt.23154","title":"Defective acyclic colorings of planar graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; Dawson College","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Planar graph; Planar; Discrete mathematics; Graph; Computer science","score_opus":0.009394072168464702,"score_gpt":0.24578520217700098,"score_spread":0.2363911300085363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400869481","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.39075842,0.0032811982,0.60269654,0.0002786152,0.00094501383,0.00005430796,0.000002186574,0.000027983117,0.001955738],"genre_scores_gemma":[0.9927137,0.00009325842,0.00697497,0.000076709744,0.00006363152,9.972812e-7,4.3190488e-7,0.0000041241583,0.000072181196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915665,0.00011338018,0.00028513663,0.000103257305,0.00025206487,0.00008953437],"domain_scores_gemma":[0.99911886,0.00042016886,0.00015735584,0.00010117962,0.00014929782,0.000053154254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009804576,0.000069381866,0.00013786906,0.0005927915,0.00004349775,0.00005556474,0.0003066561,0.000031592193,0.000009842928],"category_scores_gemma":[0.00005722494,0.000055169454,0.00019199598,0.0007947593,0.000043991753,0.00043223894,0.000028217311,0.00014877063,0.0000046740483],"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.000032737174,0.000034922297,0.000103614824,0.00002171084,0.00010058562,0.00003273573,0.00051285344,0.00045063355,0.004470615,0.978492,0.00047229847,0.015275282],"study_design_scores_gemma":[0.00016820866,0.00030129778,0.003534891,0.000086929766,0.000026948283,0.00019880457,0.000052495136,0.0005889844,0.007597705,0.98494345,0.0024263784,0.00007387905],"about_ca_topic_score_codex":9.812193e-7,"about_ca_topic_score_gemma":5.242466e-7,"teacher_disagreement_score":0.60195524,"about_ca_system_score_codex":0.000017391265,"about_ca_system_score_gemma":0.00008930041,"threshold_uncertainty_score":0.22497451},"labels":[],"label_agreement":null},{"id":"W4400879021","doi":"10.1016/j.aam.2024.102741","title":"Global positioning: The uniqueness question and a new solution method","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Mathematics; Uniqueness; Calculus (dental); Applied mathematics; Mathematical analysis","score_opus":0.01537942158127803,"score_gpt":0.32879612699322314,"score_spread":0.3134167054119451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400879021","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.0004240738,0.0024605747,0.99211586,0.00083486916,0.00019043348,0.00015685808,8.5677806e-7,0.00010764428,0.003708842],"genre_scores_gemma":[0.16322987,0.00013229888,0.8363806,0.000107809195,0.00006663175,0.000024598208,0.0000037776388,0.0000036070844,0.000050828134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993719,0.00002483248,0.00016089581,0.00019387437,0.0001473449,0.00010119141],"domain_scores_gemma":[0.99951744,0.0002625993,0.00003699033,0.00013736435,0.0000159701,0.000029623234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042089546,0.000079715086,0.000077558885,0.000053977787,0.00007633998,0.00016962398,0.00015973714,0.000031608237,0.0000014613986],"category_scores_gemma":[0.000024956995,0.00006082576,0.000015233436,0.0005843304,0.000020600735,0.00032132596,0.00007328768,0.00006204293,0.0000062940344],"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.0000010321286,0.000009779979,0.000004457395,0.000044452074,0.00000204357,0.0000010859458,0.00027705287,0.0076616937,0.00013444545,0.80107737,0.000049282255,0.1907373],"study_design_scores_gemma":[0.000055699755,0.0000092385835,0.000077011035,0.000046287758,0.0000043768873,0.00003261448,0.00002091495,0.36098242,0.00031421377,0.6355915,0.002806637,0.00005905437],"about_ca_topic_score_codex":0.0000054744905,"about_ca_topic_score_gemma":0.000016427319,"teacher_disagreement_score":0.35332075,"about_ca_system_score_codex":0.000057454014,"about_ca_system_score_gemma":0.000058935486,"threshold_uncertainty_score":0.24804026},"labels":[],"label_agreement":null},{"id":"W4400893749","doi":"10.1137/23m1587713","title":"Optimal Adjacency Labels for Subgraphs of Cartesian Products","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"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; Agence Nationale de la Recherche","keywords":"Adjacency list; Combinatorics; Mathematics; Cartesian product; Cartesian coordinate system; Discrete mathematics; Geometry","score_opus":0.02111613834027702,"score_gpt":0.28205777932941584,"score_spread":0.2609416409891388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400893749","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.031072604,0.0009453941,0.9639755,0.0020102572,0.00085424946,0.00027791935,0.000013490123,0.0000657571,0.0007848606],"genre_scores_gemma":[0.5705583,0.000057905043,0.42832196,0.000058058627,0.00030316133,0.000013196208,0.0000057770885,0.000018204842,0.00066345086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877566,0.000032437154,0.00040991363,0.00020901396,0.00037821097,0.00019473782],"domain_scores_gemma":[0.99908656,0.00021699574,0.00014651325,0.00023934504,0.00022650683,0.000084075706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061191875,0.00013408701,0.00019547508,0.00025728962,0.000110709865,0.00025237,0.00037099727,0.000039955503,0.000011840068],"category_scores_gemma":[0.00013975383,0.000103753206,0.00014032664,0.0005618482,0.000025803689,0.00034833324,0.000042654177,0.00015075742,0.000013350212],"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.000013216248,0.00019867618,0.000005878432,0.000822464,0.00013312069,0.000029845669,0.0031320637,0.0104628205,0.008186547,0.95438963,0.0047893017,0.017836431],"study_design_scores_gemma":[0.00081491016,0.0016715174,0.00012962506,0.0011855348,0.00010719019,0.0006650542,0.0002522385,0.6840688,0.065873325,0.2272231,0.017393203,0.0006155219],"about_ca_topic_score_codex":2.2742182e-7,"about_ca_topic_score_gemma":2.4531622e-7,"teacher_disagreement_score":0.72716653,"about_ca_system_score_codex":0.000028047141,"about_ca_system_score_gemma":0.00016469034,"threshold_uncertainty_score":0.4230933},"labels":[],"label_agreement":null},{"id":"W4401015395","doi":"10.5206/mt.v4i1.17137","title":"Arc Midpoint Computation: New Symbolic and Numeric Algorithms for Maple, CS, and Math","year":2024,"lang":"en","type":"article","venue":"Maple Transactions","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":true,"route_about_ca":true,"ca_institutions":"University of Regina","funders":"","keywords":"Midpoint; Algorithm; Flowchart; Computation; Flow chart; Maple; Midpoint method; Arc (geometry); Mathematics; Cartesian coordinate system; Invariant (physics); Computer science; Geometry; Applied mathematics; Engineering drawing; Programming language","score_opus":0.02505380778754764,"score_gpt":0.2742383563059599,"score_spread":0.24918454851841224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401015395","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.0026327015,0.0016015153,0.98841596,0.006109416,0.00063466106,0.00025277497,0.000024981635,0.00021117656,0.00011684516],"genre_scores_gemma":[0.54199284,0.00028847525,0.4529283,0.00040500352,0.00035781384,0.000086877495,0.000049514798,0.00002426628,0.003866865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991407,0.000021622272,0.00017703677,0.00036124562,0.00013914326,0.00016024282],"domain_scores_gemma":[0.99953437,0.00016203345,0.000021559797,0.00011096868,0.00004774884,0.00012334107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012565673,0.0001231815,0.00011996279,0.00017884384,0.0002246713,0.00036313134,0.00009643376,0.0000416692,0.00001675316],"category_scores_gemma":[0.0000039916317,0.00012334037,0.000054172593,0.00037808923,0.000029174966,0.00037821304,0.000012345193,0.000084820116,0.00001239002],"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.0000066051048,0.000041410436,0.000003840188,0.00012496822,0.000060075257,0.000006439492,0.0013237351,0.009277267,0.00043798581,0.057453196,0.0022099754,0.9290545],"study_design_scores_gemma":[0.00032333942,0.00009499029,0.000635344,0.000026146907,0.000030692318,0.00012491304,0.00004674552,0.9225678,0.00029332217,0.020180257,0.05550478,0.00017165596],"about_ca_topic_score_codex":0.00003812074,"about_ca_topic_score_gemma":0.000015970398,"teacher_disagreement_score":0.92888284,"about_ca_system_score_codex":0.000022993783,"about_ca_system_score_gemma":0.00009868135,"threshold_uncertainty_score":0.5029674},"labels":[],"label_agreement":null},{"id":"W4401173869","doi":"10.1111/cgf.15133","title":"Optimized Dual‐Volumes for Tetrahedral Meshes","year":2024,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Polygon mesh; Computer science; Tetrahedron; Dual (grammatical number); Computer graphics (images); Volume mesh; Computational science; Geometry; Mesh generation; Mathematics; Finite element method; Physics","score_opus":0.01661633442274298,"score_gpt":0.26015312911052363,"score_spread":0.24353679468778064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401173869","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.0014115407,0.0015580612,0.9881207,0.0040917234,0.0036676794,0.0003416967,0.000013706936,0.00061060366,0.00018432847],"genre_scores_gemma":[0.32998013,0.000098033095,0.66609204,0.0018815328,0.0010122978,0.00011719264,0.00009675443,0.00003671771,0.0006853203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983945,0.000042792322,0.00030180658,0.00058287085,0.00028291356,0.00039514457],"domain_scores_gemma":[0.99896896,0.0003629023,0.00004314107,0.0003572517,0.00015389435,0.00011387309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035027214,0.00020738102,0.00020250601,0.0004404898,0.00025072586,0.0007384287,0.0005019013,0.000091622045,0.000007028185],"category_scores_gemma":[0.00001609618,0.00019525204,0.00027601767,0.00094459316,0.000049012422,0.0007168848,0.00022556185,0.00014617092,0.000028794011],"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.0000073561346,0.00004128425,0.00002668812,0.000059080136,0.00007694462,0.000014647899,0.00017417486,0.0064468705,0.00005610297,0.8519673,0.042540602,0.098588996],"study_design_scores_gemma":[0.000305295,0.00014377861,0.000118680946,0.000034856905,0.000012050372,0.00004094346,0.0000041401554,0.83719987,0.0003677121,0.05478017,0.10677119,0.00022130983],"about_ca_topic_score_codex":0.0000034584239,"about_ca_topic_score_gemma":0.0000033078782,"teacher_disagreement_score":0.83075297,"about_ca_system_score_codex":0.000025618228,"about_ca_system_score_gemma":0.00012258108,"threshold_uncertainty_score":0.79621476},"labels":[],"label_agreement":null},{"id":"W4402401738","doi":"10.1007/s00022-024-00734-5","title":"Vertex classification of planar C-polygons","year":2024,"lang":"en","type":"article","venue":"Journal of 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 Calgary","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Planar; Pure mathematics; Graph; Computer science","score_opus":0.020971871506828964,"score_gpt":0.2745771737074514,"score_spread":0.25360530220062244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402401738","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.17771155,0.002587612,0.8157718,0.0014533203,0.0016840118,0.000033084383,0.0000030130116,0.000022735952,0.00073282985],"genre_scores_gemma":[0.9821307,0.000065158434,0.017335562,0.00006097839,0.00019549027,4.6452857e-7,0.0000019769618,0.0000040198365,0.00020561459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990139,0.0000364582,0.00038652113,0.00010645347,0.00036727378,0.00008942217],"domain_scores_gemma":[0.99922264,0.00020545066,0.00017489053,0.00014124048,0.00019347675,0.000062279294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005120816,0.00006314802,0.00013125474,0.00071436376,0.000032989883,0.000082334744,0.00033849973,0.00004202467,0.000023853356],"category_scores_gemma":[0.00009496137,0.000052940333,0.000108503526,0.0011713516,0.000018638977,0.0005234597,0.000026732314,0.00014373478,0.000022260669],"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.00003114842,0.00024131607,0.0009150326,0.00017272272,0.00025267137,0.00010000096,0.0009896649,0.0026391672,0.1059836,0.37409627,0.03765989,0.47691852],"study_design_scores_gemma":[0.0016310143,0.002269917,0.28323978,0.0010220358,0.0002153927,0.0025634298,0.00046186036,0.35431322,0.06811276,0.11359075,0.17167261,0.0009072241],"about_ca_topic_score_codex":0.0000014211475,"about_ca_topic_score_gemma":4.6299672e-7,"teacher_disagreement_score":0.80441916,"about_ca_system_score_codex":0.000038705348,"about_ca_system_score_gemma":0.00018507121,"threshold_uncertainty_score":0.21588442},"labels":[],"label_agreement":null},{"id":"W4403345237","doi":"10.48550/arxiv.2410.06529","title":"Quasi-stationary Subdivision Schemes in Arbitrary Dimensions","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Subdivision; Mathematics; Computer science; Geography; Archaeology","score_opus":0.06297361122894922,"score_gpt":0.2053426862983716,"score_spread":0.14236907506942237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403345237","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.4872473,0.0004975615,0.5094449,0.00030138038,0.0008963572,0.00021357452,0.000015333777,0.00021419162,0.0011694084],"genre_scores_gemma":[0.9911448,0.00016071298,0.0071833935,0.00014185948,0.000079782876,0.0000017643747,0.00009425659,0.000012694157,0.0011807842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982967,0.00012313803,0.00022947133,0.0009889513,0.0001337343,0.00022802407],"domain_scores_gemma":[0.99895334,0.00016840249,0.00010084142,0.000556402,0.0001138367,0.00010719333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025049417,0.00023435896,0.00021116686,0.0007179579,0.00010481957,0.00012631113,0.000698242,0.00019394312,0.000023035154],"category_scores_gemma":[0.00003154132,0.00027480384,0.00014211198,0.0012289541,0.00004182786,0.00033519027,0.0018689572,0.0006291349,0.00019668983],"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.000010598787,0.00018228979,0.00037473236,0.000070348746,0.000029031657,0.0003878288,0.00017745796,0.3063714,0.000052898657,0.6905035,0.0005931599,0.0012467942],"study_design_scores_gemma":[0.00014821917,0.000034633213,0.00096133986,0.00010809732,0.000014139039,0.0000042091096,0.000019871813,0.6921381,0.00010868879,0.3055485,0.00068716524,0.0002270741],"about_ca_topic_score_codex":0.00004724426,"about_ca_topic_score_gemma":0.000027847824,"teacher_disagreement_score":0.5038975,"about_ca_system_score_codex":0.00016920712,"about_ca_system_score_gemma":0.00040101388,"threshold_uncertainty_score":0.99997044},"labels":[],"label_agreement":null},{"id":"W4403346558","doi":"10.1007/s00373-025-02985-8","title":"Noncrossing Longest Paths and Cycles","year":2025,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","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; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; National Science Foundation","keywords":"Computer science","score_opus":0.013885332897482968,"score_gpt":0.25185364523867687,"score_spread":0.2379683123411939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403346558","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.6628662,0.018508926,0.3077697,0.0016416888,0.0048707873,0.00047563107,0.00003848403,0.000359347,0.0034692637],"genre_scores_gemma":[0.99212474,0.0012777444,0.0059997845,0.0001863182,0.000033416716,0.000018517498,0.000021260492,0.000005081699,0.00033313857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891394,0.000043271306,0.0001934659,0.0005002853,0.00018900719,0.0001600039],"domain_scores_gemma":[0.9992898,0.0000970151,0.0000970932,0.00030866565,0.0001207779,0.00008660864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020382981,0.00019092979,0.00020735085,0.00023099432,0.00027778433,0.0006188261,0.00029521887,0.00016139096,6.651819e-7],"category_scores_gemma":[0.000021375728,0.00019611967,0.000051678133,0.00037515926,0.000054956483,0.00013865478,0.0010700959,0.00027171566,6.507426e-7],"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.0000021289557,0.00005039801,0.002618063,0.00016842778,0.000025896068,0.0000095941095,0.0003759866,0.00025172785,0.000014379006,0.90140855,0.00037449214,0.094700344],"study_design_scores_gemma":[0.00030984107,0.000049313665,0.021049513,0.00012701543,0.000022890907,0.00001357377,0.000016698757,0.04015957,0.0001572355,0.93498486,0.00277132,0.00033818628],"about_ca_topic_score_codex":0.00002242096,"about_ca_topic_score_gemma":0.0000035379962,"teacher_disagreement_score":0.32925853,"about_ca_system_score_codex":0.000018131554,"about_ca_system_score_gemma":0.00012215432,"threshold_uncertainty_score":0.7997528},"labels":[],"label_agreement":null},{"id":"W4403432281","doi":"10.1016/j.tcs.2024.114906","title":"Approximation algorithms for minimum ply covering of points with unit squares and unit disks","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unit (ring theory); Algorithm; Mathematics; Least-squares function approximation; Computer science; Combinatorics; Statistics","score_opus":0.02129523637690096,"score_gpt":0.2817064068411324,"score_spread":0.26041117046423146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403432281","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.12179797,0.00006630913,0.8768698,0.00052556995,0.0002484539,0.00020597938,0.000005880884,0.000084238556,0.00019578313],"genre_scores_gemma":[0.70069706,0.0000024129233,0.29915586,0.000058819187,0.000060179806,0.000008678297,0.000003185033,0.000004351046,0.000009424081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986374,0.000039887524,0.00020189527,0.000468396,0.00041995858,0.00023247744],"domain_scores_gemma":[0.998952,0.0004397359,0.000043009444,0.00024018486,0.00021494956,0.0001101396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008301413,0.000121229044,0.00013551972,0.00024521074,0.00019124073,0.00041580078,0.0005183662,0.000029187808,0.000004584407],"category_scores_gemma":[0.00004404835,0.00009310657,0.00002899283,0.0010949619,0.0007745905,0.0007184296,0.00026145618,0.00007609603,0.0000030824428],"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.000011653197,0.000020974865,0.000022326887,0.000059988914,0.000005905064,0.0000019909194,0.0004450147,0.0015274641,0.00078291894,0.9217259,0.00000780919,0.075388044],"study_design_scores_gemma":[0.0001731655,0.00034366656,0.0007992644,0.0000790952,0.0000066056605,0.000027527938,0.000010043611,0.8675437,0.007251891,0.1235427,0.0001034909,0.0001188696],"about_ca_topic_score_codex":0.0000017535097,"about_ca_topic_score_gemma":3.8849714e-7,"teacher_disagreement_score":0.8660162,"about_ca_system_score_codex":0.000015850102,"about_ca_system_score_gemma":0.00013528804,"threshold_uncertainty_score":0.40095764},"labels":[],"label_agreement":null},{"id":"W4403488354","doi":"10.2140/agt.2024.24.3401","title":"Dynamics of veering triangulations: infinitesimal components of their flow graphs and applications","year":2024,"lang":"en","type":"article","venue":"Algebraic & Geometric Topology","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":"Université du Québec à Montréal","funders":"","keywords":"Infinitesimal; Mathematics; Flow (mathematics); Dynamics (music); Pure mathematics; Combinatorics; Geometry; Mathematical analysis; Physics","score_opus":0.014518989412906386,"score_gpt":0.24630094471532674,"score_spread":0.23178195530242035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403488354","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.18361004,0.0027062616,0.81246245,0.0004631946,0.00024715092,0.00018327507,0.000025221512,0.000069819216,0.00023259853],"genre_scores_gemma":[0.9822168,0.000098148244,0.017475463,0.000035407742,0.00003687752,0.000025781372,0.000070716196,0.0000062329987,0.000034602053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990159,0.000054648783,0.0003652467,0.00027147136,0.0001488535,0.00014383439],"domain_scores_gemma":[0.9987296,0.0007733023,0.00009727648,0.00024235876,0.00010875095,0.000048726895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029592967,0.00010454744,0.00020653261,0.0015174478,0.00006377664,0.00003184297,0.00026307703,0.00007323835,0.000020035051],"category_scores_gemma":[0.00007661631,0.00010059743,0.00006691956,0.0037284424,0.000108000975,0.00018981438,0.00014468876,0.00008987862,0.0000046738287],"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.0000042323404,0.00006125121,0.0006956756,0.000074184034,0.0000670321,0.0000013881504,0.00019708432,0.0033555694,0.00070046645,0.6724344,0.000023178976,0.32238558],"study_design_scores_gemma":[0.00045812677,0.0002050445,0.03144443,0.00002882582,0.000033416745,0.000057657293,0.00004558166,0.6798404,0.0014387757,0.28465798,0.0015839747,0.00020578856],"about_ca_topic_score_codex":0.00002893344,"about_ca_topic_score_gemma":0.000007380104,"teacher_disagreement_score":0.79860675,"about_ca_system_score_codex":0.000023374023,"about_ca_system_score_gemma":0.00005567975,"threshold_uncertainty_score":0.41022444},"labels":[],"label_agreement":null},{"id":"W4403498089","doi":"10.1111/cgf.15186","title":"A Multi‐layer Solver for XPBD","year":2024,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer graphics (images); Layer (electronics); Solver; Computational science; Parallel computing; Programming language; Materials science","score_opus":0.03378688875819116,"score_gpt":0.28803435990575305,"score_spread":0.2542474711475619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403498089","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.0011279051,0.000940533,0.99121314,0.0025553985,0.0033336165,0.00029813874,0.000009487721,0.00045493848,0.000066831904],"genre_scores_gemma":[0.4236613,0.0000361438,0.5717338,0.0030631071,0.0007050434,0.000095829884,0.000052175463,0.00002861406,0.0006240084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864984,0.000026363972,0.0002313206,0.0005294606,0.00021931269,0.0003437008],"domain_scores_gemma":[0.999185,0.0002011946,0.000032890304,0.00033749416,0.00014607122,0.00009735085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026687118,0.00016895511,0.00013543718,0.0003783488,0.00020114846,0.00051595457,0.0005272147,0.0000816336,0.0000051525653],"category_scores_gemma":[0.000009953991,0.00015907017,0.00021305981,0.0008189391,0.000030095203,0.00054823735,0.00022722498,0.00013363056,0.000053074782],"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.0000044720277,0.00006949472,0.000056959554,0.00006504933,0.00006780121,0.000013137667,0.00024927373,0.0017165347,0.00046001165,0.853948,0.05006446,0.09328482],"study_design_scores_gemma":[0.00023072425,0.00008919136,0.00032456891,0.000027264863,0.0000070561564,0.00001989126,0.0000018093067,0.8121321,0.00042899023,0.02126487,0.16529655,0.0001769797],"about_ca_topic_score_codex":0.0000029044802,"about_ca_topic_score_gemma":0.000008457494,"teacher_disagreement_score":0.8326831,"about_ca_system_score_codex":0.000022947508,"about_ca_system_score_gemma":0.00009568544,"threshold_uncertainty_score":0.6486693},"labels":[],"label_agreement":null},{"id":"W4403561831","doi":"10.1007/s00453-024-01279-4","title":"Euclidean Maximum Matchings in the Plane—Local to Global","year":2024,"lang":"en","type":"article","venue":"Algorithmica","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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Euclidean geometry; Theory of computation; Plane (geometry); Mathematics; Computer science; Geometry; Algorithm","score_opus":0.008881235263888216,"score_gpt":0.26339442644881206,"score_spread":0.2545131911849238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403561831","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.013813778,0.0001654217,0.9713942,0.011589591,0.0006770134,0.00012449174,0.000008114481,0.000112021706,0.002115371],"genre_scores_gemma":[0.94968444,0.0000025915542,0.04683242,0.0030482847,0.0002643011,0.000018124374,0.000013089269,0.000004305676,0.00013245833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990879,0.000052513642,0.00014085846,0.00027732528,0.0002641346,0.00017726286],"domain_scores_gemma":[0.9996129,0.00011063539,0.0000103798875,0.00019711464,0.00001876196,0.00005015124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000331139,0.00008396977,0.000066630826,0.000081295264,0.000059428017,0.0002923884,0.00053931255,0.00003015132,0.000011065929],"category_scores_gemma":[0.000013162484,0.000062698724,0.000034420365,0.0009161231,0.000013035196,0.00020131127,0.000112430236,0.00010386763,0.00034285328],"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.0000028240388,0.000028577124,0.000020430034,0.000008783215,0.000007747251,0.000126635,0.0010471627,0.0029769775,0.000042196647,0.16723052,0.011836504,0.81667167],"study_design_scores_gemma":[0.00020253043,0.00014827866,0.0058887526,0.000052829,0.0000069023645,0.0003653749,0.00013956793,0.5949027,0.00036105153,0.18439084,0.21322797,0.0003132043],"about_ca_topic_score_codex":0.00006978605,"about_ca_topic_score_gemma":0.000026746424,"teacher_disagreement_score":0.93587065,"about_ca_system_score_codex":0.000056386005,"about_ca_system_score_gemma":0.00006251724,"threshold_uncertainty_score":0.44067997},"labels":[],"label_agreement":null},{"id":"W4403586280","doi":"10.4230/lipics.gd.2024.40","title":"Morphing Planar Graph Drawings via Orthogonal Box Drawings","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphing; Graph; Computer science; Planar graph; Graph drawing; Computer graphics (images); Planar; Engineering drawing; Theoretical computer science; Engineering","score_opus":0.03994164281364907,"score_gpt":0.18379599559109283,"score_spread":0.14385435277744377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403586280","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.25399497,0.00017297614,0.74183,0.00037462468,0.0015271734,0.0001869234,0.000016164015,0.00040864904,0.0014885212],"genre_scores_gemma":[0.99074864,0.000049136357,0.006478289,0.00031284915,0.00030328473,0.0000015948765,0.000077800905,0.00002440498,0.0020039827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756026,0.000099960664,0.00028273222,0.0014312543,0.00022184323,0.00040396512],"domain_scores_gemma":[0.99853647,0.00012631035,0.00020029664,0.000739549,0.00018115884,0.0002162388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003760872,0.00039098423,0.0003190547,0.0007692594,0.00029250555,0.00041918177,0.0013929767,0.00028527973,0.00003451152],"category_scores_gemma":[0.000024488354,0.00046549202,0.00034341,0.0013338177,0.00008103802,0.00046655,0.0018675543,0.0008759804,0.00026077917],"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.000020766123,0.00007625678,0.00055409403,0.00016838574,0.00019741165,0.00091529865,0.0005409027,0.4268888,0.00059733825,0.5658639,0.0019199116,0.0022569008],"study_design_scores_gemma":[0.00020740824,0.000037295355,0.0005666004,0.00012414614,0.000077688295,0.000030899842,0.000017125752,0.52608633,0.0003403747,0.47043878,0.0015496473,0.0005237105],"about_ca_topic_score_codex":0.00010294378,"about_ca_topic_score_gemma":0.000024444458,"teacher_disagreement_score":0.7367537,"about_ca_system_score_codex":0.00017640024,"about_ca_system_score_gemma":0.00033524825,"threshold_uncertainty_score":0.9997797},"labels":[],"label_agreement":null},{"id":"W4403637363","doi":"10.3390/ijgi13110373","title":"Constructing Efficient Mesh-Based Global Grid Systems with Reduced Distortions","year":2024,"lang":"en","type":"article","venue":"ISPRS International Journal of Geo-Information","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Mitacs","keywords":"Polyhedron; Computer science; Octree; Grid; Polygon mesh; Geospatial analysis; Algorithm; Distributed computing; Computational science; Theoretical computer science; Topology (electrical circuits); Computer graphics (images); Mathematics; Geometry; Geography","score_opus":0.005816641938454819,"score_gpt":0.24727643390054016,"score_spread":0.24145979196208534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403637363","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.031791978,0.0001619111,0.9555773,0.0020530517,0.008692865,0.00012377027,0.000061313134,0.00008146345,0.0014563547],"genre_scores_gemma":[0.9823352,0.0000057670877,0.016893122,0.0001824086,0.0004756567,0.0000062718595,0.00008230564,0.0000033356416,0.000015897765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979469,0.000047030586,0.0006985904,0.00011006804,0.0010520563,0.00014535291],"domain_scores_gemma":[0.9979543,0.000100184276,0.000450605,0.00012532657,0.0012743082,0.00009529411],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00048609765,0.00013090107,0.0001388498,0.0004711742,0.00010890484,0.0010568479,0.0005334019,0.00004831999,0.000013696421],"category_scores_gemma":[0.00010176747,0.000106601874,0.00010638225,0.0005358544,0.000038352773,0.002861743,0.000052298332,0.00016501479,0.000047368583],"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.000101091486,0.00006033412,0.0002997182,0.00006207103,0.00023298664,0.000053526204,0.0005491113,0.637423,0.00009912243,0.26120868,0.0035268718,0.096383534],"study_design_scores_gemma":[0.00071128155,0.00015701263,0.0008615696,0.00033489097,0.000030818275,0.0013567305,0.0002863878,0.97471404,0.0006211174,0.00044974688,0.020282751,0.0001936521],"about_ca_topic_score_codex":0.00001845747,"about_ca_topic_score_gemma":0.000002226166,"teacher_disagreement_score":0.9505432,"about_ca_system_score_codex":0.0005806852,"about_ca_system_score_gemma":0.00057275227,"threshold_uncertainty_score":0.99998015},"labels":[],"label_agreement":null},{"id":"W4403637605","doi":"10.1007/s00373-024-02845-x","title":"Packing and Covering Triangles in Bilaterally-Complete Tripartite Graphs","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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, Okanagan Campus; University of British Columbia","funders":"Mitacs","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.01602689210105394,"score_gpt":0.23156828375907143,"score_spread":0.2155413916580175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403637605","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.96724325,0.0066884253,0.02415911,0.00044018863,0.0008870158,0.00013303015,0.0000032917105,0.00014158423,0.00030411806],"genre_scores_gemma":[0.99850875,0.0005304729,0.0007749365,0.00009194967,0.00001263374,0.0000100290645,0.0000038384137,0.0000057370694,0.000061669845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914974,0.000037340644,0.00018504725,0.00031248553,0.00014487247,0.00017050093],"domain_scores_gemma":[0.9996495,0.00011456094,0.000025253,0.00011614153,0.000027454087,0.0000670735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026300663,0.00011082382,0.0001297121,0.0003766734,0.000101244295,0.0004203248,0.000117707896,0.000042557032,0.0000017750027],"category_scores_gemma":[0.000010922699,0.0001037071,0.000037497815,0.0010542606,0.000024757788,0.0004130108,0.000097635624,0.00011054492,0.0000019157737],"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.0000038635058,0.000023492104,0.0019773412,0.000051139916,0.000011673713,0.00003379213,0.00053688127,0.00012639217,0.0003971553,0.9657188,0.00009712179,0.031022366],"study_design_scores_gemma":[0.00065250514,0.0001131218,0.018114137,0.00009093417,0.000008092997,0.000036606863,0.000024701174,0.120251276,0.00022210235,0.8526798,0.007559132,0.00024757927],"about_ca_topic_score_codex":0.00001705753,"about_ca_topic_score_gemma":0.000007494646,"teacher_disagreement_score":0.120124884,"about_ca_system_score_codex":0.000014084298,"about_ca_system_score_gemma":0.000023820745,"threshold_uncertainty_score":0.42290527},"labels":[],"label_agreement":null},{"id":"W4403856814","doi":"10.1130/abs/2024am-405176","title":"SURFICIAL MAPPING WITH A TWIST","year":2024,"lang":"en","type":"article","venue":"Abstracts with programs - Geological Society of America","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":"Geological Survey of Canada; Carleton University","funders":"","keywords":"Computer science; Twist; Geology; Geometry; Mathematics","score_opus":0.02457658755518254,"score_gpt":0.2534784767001454,"score_spread":0.22890188914496284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403856814","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.20461592,0.00036862268,0.78929377,0.0033190947,0.00009985006,0.00032136298,0.0000015526581,0.0004260302,0.001553798],"genre_scores_gemma":[0.70219105,0.00001717622,0.29719952,0.00035489738,0.000078335164,0.000023218074,0.000017500508,0.00000568055,0.000112662136],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853516,0.000030886666,0.00025540305,0.0004491434,0.00041577962,0.00031364258],"domain_scores_gemma":[0.99929756,0.00015343702,0.000119217504,0.0001912901,0.00014038506,0.000098140576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021845894,0.00016884097,0.00021347945,0.00003444601,0.00012032815,0.00018419861,0.0003098,0.00007749791,0.000022948992],"category_scores_gemma":[0.000010653606,0.00010759625,0.00011721374,0.0010965834,0.00033485173,0.00029466912,0.00008968507,0.00023081953,0.000022194361],"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.000038572936,0.00046271482,0.0015025535,0.00015380327,0.00024386044,0.00007450048,0.0021059625,0.017961187,0.0003543712,0.003929822,0.0016111034,0.97156155],"study_design_scores_gemma":[0.0015392102,0.00920105,0.101645954,0.00071028894,0.000111531495,0.0004504963,0.0017144437,0.37280485,0.0017482716,0.0068316027,0.5014442,0.0017980968],"about_ca_topic_score_codex":0.00009509069,"about_ca_topic_score_gemma":0.0000035389592,"teacher_disagreement_score":0.96976346,"about_ca_system_score_codex":0.000025394818,"about_ca_system_score_gemma":0.00014169849,"threshold_uncertainty_score":0.43876478},"labels":[],"label_agreement":null},{"id":"W4403915979","doi":"10.1093/9780198925330.003.0011","title":"Assembly and Partitioning Problems","year":2024,"lang":"en","type":"book-chapter","venue":"","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 Toronto","funders":"","keywords":"Computer science","score_opus":0.022383062037063643,"score_gpt":0.22966149634866428,"score_spread":0.20727843431160065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403915979","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000068296667,0.0011509045,0.28113198,0.0006835648,0.00032793527,0.00008427868,0.0000015931081,0.00015376747,0.71645916],"genre_scores_gemma":[0.0035268469,0.00010114902,0.012534464,0.00022612672,0.00019923954,0.0000073348738,0.000020691046,0.000011490254,0.9833726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992876,0.0000029722657,0.00014098483,0.00032121787,0.00016582684,0.00008138641],"domain_scores_gemma":[0.999685,0.00003637921,0.00003741854,0.0001407558,0.00005242145,0.00004801424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001027577,0.00011907745,0.00009666682,0.00012947884,0.00006228348,0.00030340266,0.00011960454,0.000080604535,0.000064991626],"category_scores_gemma":[0.0000029941398,0.0001087058,0.000036917343,0.000039576753,0.000013755992,0.00017946716,0.00015120764,0.00011900941,0.0002958236],"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":[1.3690644e-7,0.0000014972552,3.0783443e-7,0.00002671441,0.000013627414,0.0000052857945,0.000031723794,0.00020168105,0.000021220367,0.9815183,0.0026984916,0.015481005],"study_design_scores_gemma":[0.00003428114,0.000031442625,0.000008748764,0.000088671455,0.000009878906,0.000030455021,4.9133433e-7,0.041065253,0.000050030252,0.53602755,0.4224943,0.00015893432],"about_ca_topic_score_codex":0.0000014927903,"about_ca_topic_score_gemma":0.0000058948567,"teacher_disagreement_score":0.44549078,"about_ca_system_score_codex":0.0000163709,"about_ca_system_score_gemma":0.000042130603,"threshold_uncertainty_score":0.4432894},"labels":[],"label_agreement":null},{"id":"W4403915986","doi":"10.1093/9780198925330.003.0008","title":"River Crossing Problems","year":2024,"lang":"en","type":"book-chapter","venue":"","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 Toronto","funders":"","keywords":"Geography; Environmental science; Computer science","score_opus":0.02562700782247768,"score_gpt":0.24201388430634593,"score_spread":0.21638687648386826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403915986","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021167475,0.0007338206,0.3705496,0.00030894385,0.00069629104,0.000080647085,0.0000020899406,0.0001963351,0.62743014],"genre_scores_gemma":[0.00078864355,0.000019121055,0.024569279,0.00025464073,0.0003094596,0.0000032777148,0.000018496823,0.000015464271,0.9740216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902695,0.0000028345105,0.00018213692,0.00041073989,0.00026308923,0.00011423721],"domain_scores_gemma":[0.99952346,0.000030743417,0.00005076642,0.00025946784,0.000084536994,0.000051032268],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000097854834,0.00016545312,0.00012191177,0.00018333511,0.00012115814,0.00071534695,0.0003087493,0.00011902147,0.00020191993],"category_scores_gemma":[0.0000025355334,0.00014630625,0.00009569503,0.00006212565,0.00005298271,0.00021522192,0.00023064297,0.00017502977,0.0017736411],"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":[2.181216e-7,0.000002454329,1.0815837e-7,0.00002637448,0.000017725488,0.000011922112,0.00012285,0.00076876156,0.000017627335,0.95671916,0.0058348025,0.03647797],"study_design_scores_gemma":[0.00002619594,0.000013736613,0.0000023460034,0.000057120415,0.0000059639765,0.000015090876,1.5251106e-7,0.021442603,0.000032457385,0.41905463,0.55921197,0.00013774111],"about_ca_topic_score_codex":0.0000034516343,"about_ca_topic_score_gemma":0.00000430476,"teacher_disagreement_score":0.55337715,"about_ca_system_score_codex":0.00004295647,"about_ca_system_score_gemma":0.00013355618,"threshold_uncertainty_score":0.9990036},"labels":[],"label_agreement":null},{"id":"W4404570765","doi":"10.48550/arxiv.2411.11274","title":"Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Combinatorics; Mathematics; Parallel computing","score_opus":0.05669936661270895,"score_gpt":0.211766025275867,"score_spread":0.15506665866315805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404570765","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.22385927,0.000029566803,0.77316934,0.00014183456,0.00065581937,0.0003178288,0.00002943629,0.00025811233,0.0015387982],"genre_scores_gemma":[0.97591436,0.000011216892,0.022376386,0.00009054065,0.00021179664,0.0000026334897,0.000070128815,0.00001805333,0.0013048706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985788,0.000044602446,0.00019422526,0.00079459854,0.00009149059,0.000296303],"domain_scores_gemma":[0.998815,0.00021663679,0.0001510695,0.0004379144,0.00026322217,0.00011617973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023793848,0.00023143874,0.00021714663,0.00021000953,0.00032001972,0.00027316916,0.00050110935,0.00013136846,0.000014992177],"category_scores_gemma":[0.00002716537,0.000251101,0.00014992076,0.00069643103,0.00004915568,0.00025037024,0.00083845865,0.0003935896,0.00006322605],"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.000018454335,0.000041497744,0.00015598472,0.00015514014,0.000095389616,0.000049297683,0.00030952238,0.7438424,0.00002841283,0.253022,0.00038893745,0.0018929731],"study_design_scores_gemma":[0.00029578904,0.000042521107,0.00007098865,0.00023326598,0.00006786065,0.000016338548,0.00007794672,0.9540681,0.00044958203,0.04325958,0.0010963625,0.00032166726],"about_ca_topic_score_codex":0.000041095824,"about_ca_topic_score_gemma":0.000044889537,"teacher_disagreement_score":0.7520551,"about_ca_system_score_codex":0.00014181374,"about_ca_system_score_gemma":0.00041384206,"threshold_uncertainty_score":0.9999941},"labels":[],"label_agreement":null},{"id":"W4404635566","doi":"10.1016/j.tcs.2024.114976","title":"Finer-grained reductions in fine-grained hardness of approximation","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"European Research Council; Environment Canada; Israel Science Foundation; European Commission","keywords":"Mathematics","score_opus":0.010950510299227204,"score_gpt":0.26394702072766935,"score_spread":0.2529965104284421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404635566","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.054525875,0.000076061755,0.9403619,0.0023398136,0.0012747082,0.00016857477,0.000002419226,0.00016192254,0.0010887184],"genre_scores_gemma":[0.8592429,0.0000024625426,0.1404829,0.000072966846,0.00013261502,0.000012417187,0.0000049811742,0.000004772184,0.000043981516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980895,0.00009012068,0.00037766807,0.0005854365,0.0005590424,0.00029825684],"domain_scores_gemma":[0.9990142,0.0002185602,0.00004675888,0.00041364724,0.00020126495,0.00010559825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014039114,0.00013525492,0.00017084474,0.00067922636,0.0001375945,0.00030178617,0.00092742115,0.00004357919,0.000028110664],"category_scores_gemma":[0.00013642333,0.00011806496,0.00006625081,0.0039301594,0.0008114848,0.0008475919,0.00032915577,0.00015269712,0.000026235744],"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.000003907484,0.000054079,0.00000998311,0.000025929541,0.0000029170221,0.0000056050767,0.0004886287,0.0053692795,0.0029229433,0.9306983,0.000116166164,0.060302295],"study_design_scores_gemma":[0.00012117955,0.00008325304,0.0008422777,0.000058909198,0.0000027754754,0.000026125044,0.0000041213834,0.8160162,0.005554226,0.1769537,0.0002172542,0.000120001125],"about_ca_topic_score_codex":0.0000041017765,"about_ca_topic_score_gemma":0.0000015092667,"teacher_disagreement_score":0.8106469,"about_ca_system_score_codex":0.00007022592,"about_ca_system_score_gemma":0.00028392964,"threshold_uncertainty_score":0.48145497},"labels":[],"label_agreement":null},{"id":"W4405432552","doi":"10.48550/arxiv.2412.09673","title":"Spread complexity for the planar limit of holography","year":2024,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"High Energy Physics; HORIZON EUROPE Framework Programme; Azrieli Foundation; Israel Science Foundation; Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst; European Commission","keywords":"Limit (mathematics); Planar; Holography; Computer science; Physics; Optics; Mathematics; Computer graphics (images); Mathematical analysis","score_opus":0.17208544883193455,"score_gpt":0.2184820500804052,"score_spread":0.04639660124847064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405432552","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.09856667,0.0008954431,0.89453423,0.00091269915,0.0026034086,0.0010094313,0.00023225833,0.00009732204,0.0011485415],"genre_scores_gemma":[0.99323845,0.00047926747,0.004491966,0.00014536321,0.00027533295,0.0000042530346,0.00006415212,0.000018793096,0.0012824235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737155,0.00018929005,0.00045231477,0.0013980351,0.00017718533,0.00041163815],"domain_scores_gemma":[0.99657136,0.0011097257,0.0004418178,0.0012098772,0.00051961996,0.00014760814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000730488,0.0004234991,0.00047375538,0.0005529384,0.00044649676,0.00018226162,0.0021425586,0.00028912208,0.00004581249],"category_scores_gemma":[0.00006144304,0.00039727616,0.00078080496,0.0019686914,0.0005775045,0.00020161632,0.0015218449,0.0006125191,0.00006330195],"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.00011336395,0.00013785383,0.0002198977,0.00027315164,0.0004030042,0.000029648741,0.0003356521,0.344996,0.000079499594,0.64802206,0.0013721979,0.0040176874],"study_design_scores_gemma":[0.00037238532,0.00019056836,0.002235563,0.000111583846,0.00032598528,0.0000071806826,0.000084323634,0.68238896,0.00031593576,0.30990502,0.0037392573,0.00032324335],"about_ca_topic_score_codex":0.00013553422,"about_ca_topic_score_gemma":0.00008392178,"teacher_disagreement_score":0.8946718,"about_ca_system_score_codex":0.00009263586,"about_ca_system_score_gemma":0.00037806277,"threshold_uncertainty_score":0.9998479},"labels":[],"label_agreement":null},{"id":"W4405612061","doi":"10.1016/j.orl.2024.107235","title":"Extended formulations for the integer hull of strictly Δ-modular cographic polyhedral cones","year":2024,"lang":"en","type":"article","venue":"Operations Research Letters","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":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":"Modular design; Integer (computer science); Hull; Integer programming; Combinatorics; Mathematics; Computer science; Mathematical optimization; Engineering; Programming language","score_opus":0.06754138262976656,"score_gpt":0.3832531888124953,"score_spread":0.31571180618272876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405612061","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.0482544,0.00063522946,0.92415434,0.025828421,0.00034679126,0.0006134267,0.000023765839,0.000054941447,0.00008867092],"genre_scores_gemma":[0.9797291,0.00003929932,0.019038823,0.000422939,0.00017713338,0.0002445286,0.000046293422,0.000008800517,0.00029307528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985846,0.00013841233,0.00024738774,0.00028433552,0.00049215415,0.0002530659],"domain_scores_gemma":[0.9981962,0.0009278026,0.000013074199,0.00036057323,0.00045013233,0.000052262803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010284329,0.00008673853,0.0000885716,0.00059589633,0.00063207897,0.0005589438,0.0005108707,0.000034052922,0.000023421238],"category_scores_gemma":[0.00019757688,0.00006307749,0.00010595856,0.0018036043,0.00013869874,0.0006375123,0.000108611195,0.00020080672,0.000016350139],"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.000009350305,0.000064651766,0.000020264833,0.000038317285,0.000100439356,0.0000034301058,0.00083000894,0.16084172,0.074073024,0.7320148,0.007817005,0.02418703],"study_design_scores_gemma":[0.0001478597,0.00008331161,0.0012061123,0.000021415526,0.000008591206,0.0000063315397,0.000050373303,0.98023367,0.0041312845,0.0023592112,0.011668756,0.000083076724],"about_ca_topic_score_codex":0.00007203146,"about_ca_topic_score_gemma":0.000050819304,"teacher_disagreement_score":0.9314747,"about_ca_system_score_codex":0.000038916995,"about_ca_system_score_gemma":0.00020483445,"threshold_uncertainty_score":0.5389908},"labels":[],"label_agreement":null},{"id":"W4405644971","doi":"10.4230/lipics.socg.2025.20","title":"Contiguous Boundary Guarding","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Ottawa; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Trafikverket; Vetenskapsrådet; National Science Foundation","keywords":"Boundary (topology); Geography; Mathematics; Mathematical analysis","score_opus":0.06183518571393905,"score_gpt":0.1909521734211407,"score_spread":0.12911698770720165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405644971","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.13141559,0.00055071653,0.8561463,0.00027284236,0.0026299749,0.00017258618,0.000011708911,0.00042180478,0.008378507],"genre_scores_gemma":[0.9911076,0.00007167635,0.0033141386,0.00013409562,0.00024307313,7.821723e-7,0.000026748847,0.000012446524,0.0050894367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985109,0.00007670943,0.00015728493,0.0009262139,0.000101269216,0.00022762649],"domain_scores_gemma":[0.9989637,0.00006756671,0.00009890286,0.0006255571,0.0001373223,0.00010693253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022997045,0.00022038615,0.00020925887,0.0003523501,0.00016234202,0.0004026354,0.00093482557,0.0001768467,0.000024167204],"category_scores_gemma":[0.000020548438,0.00026310288,0.00020138017,0.0006767983,0.00005023073,0.00022616732,0.0023594764,0.0005143177,0.00033823005],"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.000008210559,0.000034851266,0.00006785515,0.00010100142,0.00010846704,0.00051333633,0.00017325781,0.39422536,0.000077922865,0.5952011,0.004191986,0.005296673],"study_design_scores_gemma":[0.0001586216,0.00002452917,0.00017002,0.00007789691,0.000044333785,0.000012178832,0.000016360604,0.69900686,0.000168209,0.29084542,0.009164121,0.0003114221],"about_ca_topic_score_codex":0.000030756717,"about_ca_topic_score_gemma":0.000009723863,"teacher_disagreement_score":0.859692,"about_ca_system_score_codex":0.00017274379,"about_ca_system_score_gemma":0.00036497987,"threshold_uncertainty_score":0.9999821},"labels":[],"label_agreement":null},{"id":"W4405792749","doi":"10.48550/arxiv.2412.18595","title":"The basis number of 1-planar graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Basis (linear algebra); Planar; Planar graph; Combinatorics; Mathematics; Computer science; Geometry; Graph; Computer graphics (images)","score_opus":0.044997306438785016,"score_gpt":0.19693737164101396,"score_spread":0.15194006520222894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405792749","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.34281135,0.00044139553,0.6365147,0.0007097807,0.0025923457,0.00028154347,0.000032517124,0.0002240645,0.016392259],"genre_scores_gemma":[0.9950338,0.00020341454,0.0018912768,0.000042351297,0.000052997555,6.4668654e-7,0.000010974244,0.000006650597,0.0027579085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989954,0.00008518621,0.00015614028,0.0005081728,0.00010159591,0.0001534536],"domain_scores_gemma":[0.99885654,0.00018433412,0.00012628552,0.0006204661,0.00015229892,0.000060090882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025234558,0.000146907,0.00014292523,0.00014101216,0.00014237844,0.00011021947,0.001025207,0.0001104669,0.000015445294],"category_scores_gemma":[0.000019023952,0.00012962817,0.00018394711,0.0007988545,0.00007121386,0.00009660756,0.0009293368,0.00030176737,0.00012500801],"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.000006124177,0.000018996712,0.00031300905,0.000040157083,0.000074331256,0.000035338875,0.00007299602,0.040242583,0.000015269483,0.9554618,0.0015570256,0.0021623455],"study_design_scores_gemma":[0.00008294354,0.000012272476,0.00052861584,0.00003934762,0.000040203115,0.000005630856,0.000019088064,0.22079423,0.00024531846,0.7759833,0.0020956032,0.00015344952],"about_ca_topic_score_codex":0.00005133592,"about_ca_topic_score_gemma":0.00002060478,"teacher_disagreement_score":0.65222245,"about_ca_system_score_codex":0.00004846329,"about_ca_system_score_gemma":0.00017543783,"threshold_uncertainty_score":0.5286083},"labels":[],"label_agreement":null},{"id":"W4405801301","doi":"10.1007/978-3-031-74580-5_11","title":"The Exact Spanning Ratio of the Parallelogram Delaunay Graph","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Ottawa; Carleton University","funders":"","keywords":"Parallelogram; Delaunay triangulation; Computer science; Algorithm; Artificial intelligence; Robot","score_opus":0.014804406126563101,"score_gpt":0.246834619603715,"score_spread":0.2320302134771519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405801301","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.00031784156,0.0020151334,0.98977417,0.001985,0.00329281,0.00033919627,0.0000028732798,0.000068755704,0.0022042305],"genre_scores_gemma":[0.845467,0.0002682956,0.14190722,0.0017534755,0.0011056043,0.000037329428,0.000012394177,0.000058993606,0.009389729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972618,0.000044024666,0.00048586386,0.00083679013,0.0009911122,0.0003803713],"domain_scores_gemma":[0.997381,0.0009537022,0.00027646325,0.0010907311,0.00022742926,0.000070678245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009678802,0.00031626655,0.00025461847,0.00036309627,0.0006533299,0.0005082244,0.0029041918,0.0001536358,0.0000067958727],"category_scores_gemma":[0.00010882624,0.00018718386,0.00020862385,0.0011033469,0.00069521746,0.00025490337,0.0016639011,0.0005556895,0.000021171763],"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.0000046555833,0.000012285083,0.00003202485,0.000023164255,0.000029243576,0.000012318775,0.0006266087,0.447242,0.00040442264,0.20363794,0.00013990616,0.34783542],"study_design_scores_gemma":[0.0000907475,0.00007264173,0.0003554819,0.0002463649,0.000013470542,0.00005453653,1.7796792e-7,0.61584437,0.0024636495,0.3744386,0.0061338036,0.0002861297],"about_ca_topic_score_codex":0.000009489223,"about_ca_topic_score_gemma":0.00009884724,"teacher_disagreement_score":0.84786695,"about_ca_system_score_codex":0.0001617802,"about_ca_system_score_gemma":0.00042442163,"threshold_uncertainty_score":0.76331365},"labels":[],"label_agreement":null},{"id":"W4405978915","doi":"10.1007/978-3-031-77357-0_276","title":"Correction of Windswept Rotational Deformity with Fixator Assisted Plating Technique","year":2024,"lang":"en","type":"book-chapter","venue":"","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":"Shriners Hospitals for Children - Canada","funders":"","keywords":"Orthodontics; External fixator; Plating (geology); Computer science; Medicine; Physics","score_opus":0.015171025569019279,"score_gpt":0.2311071382766837,"score_spread":0.2159361127076644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405978915","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.000035909736,0.000043079304,0.6171561,0.000060751303,0.0005311108,0.00024309263,0.000008238457,0.00014764807,0.3817741],"genre_scores_gemma":[0.044566594,0.000005451994,0.15701975,0.0000997501,0.00030018462,0.000059677048,0.00019776245,0.00003882655,0.797712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998678,0.000009443311,0.0003464292,0.00039194492,0.00046894632,0.00010522226],"domain_scores_gemma":[0.9990315,0.00013789911,0.00024319891,0.00022824133,0.0003095932,0.000049592363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019441955,0.0002081839,0.00021017743,0.0003385552,0.00008035552,0.00007836175,0.00022184923,0.00017542088,0.00012007859],"category_scores_gemma":[0.000016964206,0.00017255245,0.00009315575,0.00018506752,0.00003507473,0.00026386758,0.000101231366,0.00026728597,0.000039553892],"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.00001621983,0.0000237672,0.000012313886,0.00008807816,0.00010278767,0.000012056648,0.0000784146,0.005497418,0.0004545756,0.89355505,0.0025471335,0.09761219],"study_design_scores_gemma":[0.00086598546,0.0013826205,0.0015628065,0.0026115165,0.0002221862,0.0013797664,0.00002791288,0.6092134,0.037664093,0.24323837,0.09970847,0.0021228748],"about_ca_topic_score_codex":0.000010236356,"about_ca_topic_score_gemma":0.00003080911,"teacher_disagreement_score":0.65031666,"about_ca_system_score_codex":0.00009607132,"about_ca_system_score_gemma":0.0002883827,"threshold_uncertainty_score":0.70364845},"labels":[],"label_agreement":null},{"id":"W4406428957","doi":"10.1016/0967-0653(95)97931-x","title":"10.1016/0967-0653(95)97931-x","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Surface (topology); Geology; Scattering; Geometry; Mathematics; Physics; Optics","score_opus":0.007332809807590811,"score_gpt":0.18020423140881323,"score_spread":0.1728714216012224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406428957","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020676505,0.00007539308,0.004143532,0.0005990343,0.0000061874603,0.00011957514,0.0000028568752,0.00018395038,0.9946627],"genre_scores_gemma":[0.00023864344,2.0344477e-7,0.0058802185,0.00013487757,0.00017727853,0.000011800291,0.000015754822,0.0000064676533,0.99353474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911535,0.00003873537,0.00014694483,0.00027859045,0.00022945402,0.00019089771],"domain_scores_gemma":[0.99944067,0.000049626964,0.000022742957,0.00030096964,0.00006324006,0.00012274954],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015546741,0.00010025535,0.000094315204,0.00007879751,0.000105977684,0.00012586474,0.0004278539,0.000035311692,0.9700913],"category_scores_gemma":[0.00001994621,0.00010184284,0.000043751563,0.0005262221,0.000010864824,0.00028415446,0.00007488054,0.00006112883,0.99240494],"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.0000068597956,0.000027893751,1.7767313e-8,0.0000014028182,0.000004709168,0.0000025673203,0.00001917496,0.0045688315,0.000030601295,0.00007392494,0.16070339,0.83456063],"study_design_scores_gemma":[0.00011587526,0.00008520422,0.000027017391,0.000004664397,0.0000026602333,0.000011489469,1.3740336e-7,0.03366512,0.00021104314,0.00014424504,0.96560013,0.00013241071],"about_ca_topic_score_codex":0.0000054332922,"about_ca_topic_score_gemma":1.018301e-7,"teacher_disagreement_score":0.8344282,"about_ca_system_score_codex":0.000024590881,"about_ca_system_score_gemma":0.000043640342,"threshold_uncertainty_score":0.41530305},"labels":[],"label_agreement":null},{"id":"W4406493268","doi":"10.1016/0967-0653(95)99939-o","title":"10.1016/0967-0653(95)99939-o","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Inclined plane; Computation; Plane (geometry); Geometry; Set (abstract data type); Geology; Mathematics; Computer science; Physics; Algorithm","score_opus":0.007310093224275955,"score_gpt":0.18009853112105192,"score_spread":0.17278843789677598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406493268","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019507301,0.000076168406,0.0045073098,0.0005658443,0.0000076224687,0.00011911346,0.0000029433834,0.00018490292,0.994341],"genre_scores_gemma":[0.00021799601,1.8073752e-7,0.0059730527,0.00014251005,0.00017074801,0.0000110921055,0.0000145896,0.0000065348663,0.9934633],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991217,0.000040258583,0.00014498256,0.00027686797,0.00022773411,0.00018841222],"domain_scores_gemma":[0.9994475,0.00005187922,0.000022439574,0.0002947913,0.00006205944,0.000121276644],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015061622,0.000099340796,0.00009204538,0.00007779437,0.000104108396,0.00012414895,0.0004222462,0.000033326738,0.9691749],"category_scores_gemma":[0.000020942905,0.00010115355,0.000043005322,0.00052223634,0.000010682751,0.00027607963,0.00007192003,0.00006104066,0.99228835],"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.0000067859096,0.000027747119,1.5008043e-8,0.0000013642189,0.000004521749,0.0000028917996,0.000017951947,0.004834639,0.000034464763,0.000069752896,0.1592232,0.8357767],"study_design_scores_gemma":[0.000112918846,0.000087222434,0.00002521528,0.000004356642,0.000002627341,0.000011967263,1.2068273e-7,0.0338542,0.00021672217,0.00012181435,0.9654328,0.00013003619],"about_ca_topic_score_codex":0.0000046783957,"about_ca_topic_score_gemma":8.3590955e-8,"teacher_disagreement_score":0.8356466,"about_ca_system_score_codex":0.000023163366,"about_ca_system_score_gemma":0.00004308379,"threshold_uncertainty_score":0.4124922},"labels":[],"label_agreement":null},{"id":"W4406528110","doi":"10.1016/0967-0653(96)84908-8","title":"10.1016/0967-0653(96)84908-8","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Laminar flow; Compressibility; Algorithm; Computer science; Mathematics; Mechanics; Physics","score_opus":0.007246781012809904,"score_gpt":0.17925412295923177,"score_spread":0.17200734194642187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406528110","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022540022,0.000045922305,0.0052937884,0.00081081584,0.0000061504375,0.00011769891,0.000002988055,0.00018186378,0.9933154],"genre_scores_gemma":[0.00029238503,1.1489917e-7,0.00619959,0.00013976652,0.00017617893,0.000011765751,0.000015607611,0.0000064467154,0.99315816],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999115,0.000039449027,0.00014688614,0.00027718977,0.00023038413,0.00019110195],"domain_scores_gemma":[0.9994448,0.000050559844,0.000022717151,0.0002959308,0.000063278945,0.00012273525],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015661074,0.000100243786,0.00009426001,0.00010022867,0.00010658154,0.00012542232,0.0004233322,0.00003542047,0.9705457],"category_scores_gemma":[0.000019934814,0.000101830716,0.000043860236,0.0005260433,0.000010938541,0.00028153954,0.000068789916,0.00006123769,0.99227846],"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.0000071826507,0.000029198027,2.2743695e-8,0.0000014905801,0.0000048646816,0.0000027019178,0.000021517253,0.0049069957,0.000031742573,0.00007740267,0.12119954,0.87371737],"study_design_scores_gemma":[0.000119441,0.000085202795,0.000028780812,0.0000047816006,0.0000026712366,0.00001119209,1.3531397e-7,0.029001236,0.00030144493,0.00013845076,0.9701737,0.00013294083],"about_ca_topic_score_codex":0.000004869821,"about_ca_topic_score_gemma":9.2242225e-8,"teacher_disagreement_score":0.8735844,"about_ca_system_score_codex":0.000025074005,"about_ca_system_score_gemma":0.00004385216,"threshold_uncertainty_score":0.4152536},"labels":[],"label_agreement":null},{"id":"W4406597533","doi":"10.1007/s12532-024-00266-8","title":"On the B-differential of the componentwise minimum of two affine vector functions","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming Computation","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":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Hyperplane; Affine transformation; Matroid; Discrete mathematics; Reachability; Affine space; Applied mathematics; Combinatorics; Pure mathematics","score_opus":0.018751767744418665,"score_gpt":0.27574009878120187,"score_spread":0.2569883310367832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406597533","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.19648819,0.000014699407,0.8004023,0.0017593334,0.00034862236,0.00039065495,0.0000015485876,0.000042131003,0.000552548],"genre_scores_gemma":[0.98088986,2.2033153e-7,0.018793793,0.00007573121,0.000029788253,0.000028850593,0.0000064300266,0.000004238824,0.00017107156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987387,0.0001524008,0.00041845467,0.00019090282,0.000369362,0.00013017509],"domain_scores_gemma":[0.99826425,0.0010174164,0.00019858318,0.0003166205,0.00017886885,0.00002427441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031283216,0.00011289835,0.00017471313,0.000115711904,0.00017405597,0.000065727734,0.000429429,0.000033601344,0.000017159708],"category_scores_gemma":[0.0002220118,0.00006807509,0.00013123396,0.00083841215,0.00010613868,0.00007252956,0.0001671273,0.00011487392,0.00001000685],"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.000014596151,0.0004778632,0.000027580445,0.00010300188,0.00004939103,2.1568242e-7,0.00031921052,0.014935051,0.0036160727,0.9313906,0.0005743192,0.048492122],"study_design_scores_gemma":[0.0005404862,0.000114347415,0.0014409265,0.00017785038,0.00004335517,0.0000028203783,0.000034923905,0.78043693,0.007710994,0.20918633,0.00021138885,0.000099671954],"about_ca_topic_score_codex":0.0000038468047,"about_ca_topic_score_gemma":0.0000016778849,"teacher_disagreement_score":0.78440166,"about_ca_system_score_codex":0.000026412416,"about_ca_system_score_gemma":0.000060362112,"threshold_uncertainty_score":0.27760217},"labels":[],"label_agreement":null},{"id":"W4407154822","doi":"10.1007/978-3-031-83438-7_11","title":"Partial Domination in Some Geometric Intersection Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Computer science; Intersection (aeronautics); Cartography","score_opus":0.012138250007856694,"score_gpt":0.24623611314331187,"score_spread":0.23409786313545516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407154822","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.00076208054,0.00043469795,0.9922871,0.0006038756,0.0038333787,0.00037897067,0.000002768367,0.00009860208,0.001598549],"genre_scores_gemma":[0.84317344,0.00011086094,0.15338933,0.0015273349,0.0006901588,0.00003492071,0.000034337725,0.00002243314,0.0010171916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680376,0.000055905,0.0005957679,0.0012775918,0.0008200381,0.00044691455],"domain_scores_gemma":[0.99831194,0.0004832411,0.00023537996,0.0006365993,0.00024208818,0.000090767404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011066041,0.0003712526,0.00038207657,0.005462237,0.00017550665,0.00042023734,0.0014504081,0.00027883184,0.000014391089],"category_scores_gemma":[0.0001887291,0.00038599834,0.00012269491,0.0032260201,0.00019681762,0.0011139583,0.0007034736,0.0006231111,0.00002259044],"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.0000082688775,0.00003986178,0.0000494175,0.00002795094,0.000006371131,0.000025252815,0.00022161618,0.10556306,0.00010660151,0.10416671,0.000040623006,0.78974426],"study_design_scores_gemma":[0.00041562904,0.00013456668,0.00066500454,0.0002483776,0.0000057880843,0.000020964011,1.5152327e-7,0.683148,0.0025582528,0.31142902,0.0009316561,0.00044258076],"about_ca_topic_score_codex":0.000032316795,"about_ca_topic_score_gemma":0.000100608835,"teacher_disagreement_score":0.84241134,"about_ca_system_score_codex":0.0005565355,"about_ca_system_score_gemma":0.000562864,"threshold_uncertainty_score":0.9998592},"labels":[],"label_agreement":null},{"id":"W4407189123","doi":"10.1007/978-3-031-82670-2_22","title":"Forest Covers and Bounded Forest Covers","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"","keywords":"Computer science; Bounded function; Forestry; Mathematics; Geography","score_opus":0.010735096830525388,"score_gpt":0.2349479379335112,"score_spread":0.2242128411029858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407189123","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.00052742014,0.00048758736,0.98984253,0.00097615406,0.0019672494,0.0003687562,0.000008365081,0.00010894049,0.0057130004],"genre_scores_gemma":[0.47356433,0.00021388014,0.51557714,0.005722879,0.0007630939,0.000020908887,0.000054291675,0.00003839352,0.004045111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969455,0.000028095968,0.00041152575,0.0013304986,0.0008036788,0.00048071795],"domain_scores_gemma":[0.99797094,0.00064813934,0.00020395823,0.00076510594,0.00024590752,0.00016593639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005602855,0.00043644954,0.00040386795,0.0009631345,0.00037615653,0.0008414542,0.0014994376,0.0002569349,0.000009235456],"category_scores_gemma":[0.0001333382,0.0004332415,0.00010100364,0.00076943473,0.0005173689,0.0007118852,0.0010772144,0.00048114063,0.000015976993],"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.000013410589,0.00002571128,0.00035781378,0.000050942905,0.000023615765,0.000056090168,0.00029742374,0.2455867,0.000057470155,0.33758068,0.00028523116,0.4156649],"study_design_scores_gemma":[0.00032507975,0.00013492529,0.0005957389,0.00019947966,0.000010531767,0.000043344724,1.3675813e-7,0.6406532,0.00024923304,0.34774455,0.009564112,0.00047966785],"about_ca_topic_score_codex":0.00003323066,"about_ca_topic_score_gemma":0.00035222253,"teacher_disagreement_score":0.47426543,"about_ca_system_score_codex":0.00027431466,"about_ca_system_score_gemma":0.0009531067,"threshold_uncertainty_score":0.99981195},"labels":[],"label_agreement":null},{"id":"W4407294025","doi":"10.1137/23m1545938","title":"An Approximate Generalization of the Okamura–Seymour Theorem","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","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 Waterloo","funders":"","keywords":"Generalization; Mathematics; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.010563725240247072,"score_gpt":0.27351737281580957,"score_spread":0.2629536475755625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407294025","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.12874392,0.000084103805,0.8670991,0.000777642,0.0012246505,0.000083519255,4.396809e-7,0.000036069512,0.001950558],"genre_scores_gemma":[0.9673806,0.000006121378,0.031471718,0.00078348105,0.00023689805,5.382487e-7,0.0000014895026,0.000004614437,0.00011453846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986971,0.00026737287,0.00035962166,0.00019012351,0.0003214673,0.00016429361],"domain_scores_gemma":[0.99902034,0.00010655556,0.00027863978,0.00031119457,0.00023467993,0.000048608737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000817143,0.00010547672,0.00012678723,0.00019322518,0.00043103838,0.00020784559,0.00077932095,0.000039646962,0.000004695893],"category_scores_gemma":[0.00007035481,0.000074249656,0.0000923059,0.00083663926,0.000034191984,0.00024735296,0.00013089129,0.00020138505,0.0000021543642],"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.0000063243115,0.00007091327,0.00062175014,0.0000108580825,0.00001713679,0.0000015991222,0.00023808928,0.36871296,0.0034709855,0.5661362,0.00027556907,0.060437627],"study_design_scores_gemma":[0.0002805874,0.00007132719,0.0051271254,0.000102146034,0.000006505839,0.000040966333,0.000023841149,0.939963,0.011169024,0.042566344,0.0005590938,0.00009003724],"about_ca_topic_score_codex":0.0000012420531,"about_ca_topic_score_gemma":5.401404e-7,"teacher_disagreement_score":0.8386367,"about_ca_system_score_codex":0.00004686549,"about_ca_system_score_gemma":0.00014595361,"threshold_uncertainty_score":0.33152425},"labels":[],"label_agreement":null},{"id":"W4407347250","doi":"10.1112/mtk.70013","title":"A new construction of forests with low visibility","year":2025,"lang":"en","type":"article","venue":"Mathematika","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Visibility; Statistics; Geography; Meteorology","score_opus":0.0053668124803888965,"score_gpt":0.237317777912971,"score_spread":0.23195096543258212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407347250","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.11690993,0.000027277649,0.8802536,0.00025083695,0.00008746889,0.00009397801,4.3101437e-7,0.00003773849,0.0023387005],"genre_scores_gemma":[0.60720354,6.6323304e-7,0.392223,0.000035398112,0.000013877525,0.000003669526,0.000001259322,0.000001333095,0.0005172793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995188,0.00001479329,0.0001391793,0.00014186009,0.00012411959,0.00006123987],"domain_scores_gemma":[0.9995472,0.00006177307,0.00006174772,0.00022658877,0.00007952969,0.000023166918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011405605,0.000051656116,0.00008971814,0.00008763238,0.000032694104,0.000030343159,0.00015840131,0.00001972272,0.000016152035],"category_scores_gemma":[0.000027728844,0.000041310665,0.000023205173,0.00045586194,0.000018512466,0.00016021682,0.00004485428,0.000028552566,0.0000057754132],"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.000010759547,0.00004971034,0.0012307797,0.00010253149,0.000017350969,7.0988625e-7,0.00025410412,0.0012756222,0.00043900794,0.89205813,0.0008105731,0.10375071],"study_design_scores_gemma":[0.000881817,0.00011765419,0.025971623,0.00022364895,0.000015399031,0.00003119558,0.000036058635,0.10879092,0.051041428,0.811908,0.0008030885,0.00017915264],"about_ca_topic_score_codex":0.000007731416,"about_ca_topic_score_gemma":0.000014682822,"teacher_disagreement_score":0.4902936,"about_ca_system_score_codex":0.0000139091235,"about_ca_system_score_gemma":0.00013892094,"threshold_uncertainty_score":0.16846},"labels":[],"label_agreement":null},{"id":"W4407762323","doi":"10.13001/ela.2025.8827","title":"The non-symmetric strong multiplicity property for sign patterns","year":2025,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Multiplicity (mathematics); Property (philosophy); Sign (mathematics); Pure mathematics; Mathematical analysis","score_opus":0.010567342672131752,"score_gpt":0.2640629811688472,"score_spread":0.2534956384967154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407762323","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.034641284,0.0009542272,0.9608786,0.002718284,0.00044411927,0.00022762678,0.0000010492137,0.00001345359,0.000121360004],"genre_scores_gemma":[0.99201447,0.00013486022,0.0063011018,0.00023855102,0.00032163845,0.000010415351,0.0000016621341,0.0000055584896,0.0009717593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876827,0.00006721645,0.00039242266,0.0001524784,0.00024988837,0.0003697336],"domain_scores_gemma":[0.9986453,0.00044484253,0.00022926436,0.0001907715,0.00044322672,0.00004659012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001150673,0.00010305753,0.00015053635,0.0002131373,0.00032415302,0.00012832058,0.00069701154,0.000039822677,0.0000018545419],"category_scores_gemma":[0.00023138813,0.000058497484,0.00014436948,0.00066882756,0.000015614136,0.00026345084,0.000074551965,0.00029361178,0.0000029008627],"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.0001465855,0.00023216692,0.0006459241,0.000040550607,0.00033515636,0.0000037461057,0.00020224447,0.010663112,0.0020463036,0.36618608,0.0038383799,0.6156598],"study_design_scores_gemma":[0.0028716745,0.0015967911,0.0059654485,0.000084971485,0.000071527305,0.00007063399,0.00007726863,0.8333451,0.025795015,0.049722593,0.08006442,0.00033453424],"about_ca_topic_score_codex":0.0000055858986,"about_ca_topic_score_gemma":0.00001552009,"teacher_disagreement_score":0.95737314,"about_ca_system_score_codex":0.0001393101,"about_ca_system_score_gemma":0.0007346069,"threshold_uncertainty_score":0.24931557},"labels":[],"label_agreement":null},{"id":"W4407768346","doi":"10.1007/978-981-96-2845-2_3","title":"Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Brock University; University of Saskatchewan; University of Manitoba; University of Waterloo","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.014160367945302359,"score_gpt":0.2663060143876933,"score_spread":0.25214564644239096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407768346","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.00022499668,0.00010353469,0.9928939,0.0006552378,0.0013669308,0.0006404097,0.000016425742,0.00017849827,0.003920077],"genre_scores_gemma":[0.13273922,0.000011590158,0.8639279,0.0014357205,0.00061575905,0.000023609544,0.000042817504,0.000027214814,0.0011761718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970369,0.000024133436,0.0005223297,0.0011900946,0.00063128566,0.0005952609],"domain_scores_gemma":[0.997256,0.0010587181,0.00027733523,0.0007045408,0.0005671651,0.00013626352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007279747,0.00042626951,0.00043321945,0.0006591936,0.00067433016,0.0006135528,0.0012508066,0.00019394729,0.000014008196],"category_scores_gemma":[0.00012626806,0.0003981333,0.00012423414,0.0009372569,0.0002802555,0.000605982,0.00053708936,0.00048798978,0.00001369755],"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.000015750044,0.000037450554,0.000048728136,0.00010320978,0.000028971854,0.000017659735,0.00052936387,0.32027656,0.00007173735,0.081561096,0.00010735968,0.5972021],"study_design_scores_gemma":[0.0004276429,0.00013261147,0.00003772898,0.00073577784,0.000015994721,0.000064632724,5.40922e-7,0.94607943,0.0021003957,0.046291705,0.0035642434,0.00054927886],"about_ca_topic_score_codex":0.000014199738,"about_ca_topic_score_gemma":0.000081385915,"teacher_disagreement_score":0.6258029,"about_ca_system_score_codex":0.00024366993,"about_ca_system_score_gemma":0.0012518967,"threshold_uncertainty_score":0.99984705},"labels":[],"label_agreement":null},{"id":"W4408393303","doi":"10.1016/j.tcs.2025.115152","title":"The exact spanning ratio of the parallelogram Delaunay graph","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"Delaunay triangulation; Parallelogram; Combinatorics; Mathematics; Graph; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.006757272174536745,"score_gpt":0.2535937312630897,"score_spread":0.24683645908855295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408393303","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.048917778,0.00011339761,0.94372153,0.0035507057,0.0010953071,0.00017529713,4.0782996e-7,0.00005130006,0.0023742947],"genre_scores_gemma":[0.9737691,0.000007648723,0.02545916,0.0005851393,0.000042511692,0.000008221025,3.7318367e-7,0.000002099976,0.00012569208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982694,0.00016452529,0.0002873018,0.00038394696,0.00057518017,0.0003196651],"domain_scores_gemma":[0.99799263,0.00081801665,0.00009444219,0.0007826461,0.00024489977,0.00006735479],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015115427,0.000113836955,0.00011419056,0.000120412464,0.0014062444,0.00030016951,0.0026650222,0.00003153388,0.000005548638],"category_scores_gemma":[0.00021861357,0.00006242736,0.00009441321,0.002467415,0.0022262044,0.00025536207,0.001451883,0.00013553006,0.000006907603],"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.0000046866785,0.000018247798,0.00011509898,0.000002164972,0.000006023914,3.8412318e-7,0.00012078264,0.008933587,0.0010423014,0.9551939,0.00019849102,0.034364328],"study_design_scores_gemma":[0.00012995405,0.000049395578,0.011064718,0.000028653489,0.0000059379295,0.000008116094,0.000004205567,0.6884579,0.014828745,0.28461066,0.0007197768,0.0000919567],"about_ca_topic_score_codex":0.0000021987164,"about_ca_topic_score_gemma":0.0000020515836,"teacher_disagreement_score":0.92485136,"about_ca_system_score_codex":0.00004692228,"about_ca_system_score_gemma":0.00021652502,"threshold_uncertainty_score":0.9998938},"labels":[],"label_agreement":null},{"id":"W4408736690","doi":"10.61091/ars162-08","title":"Enumeration of rooted biloopless nonseparable planar near-triangulations","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chongqing Municipal Education Commission; Chongqing University of Arts and Sciences; Chongqing University; National Natural Science Foundation of China","keywords":"Enumeration; Mathematics; Combinatorics; Planar; Computer science; Computer graphics (images)","score_opus":0.009915929746068594,"score_gpt":0.2551366332711311,"score_spread":0.24522070352506253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408736690","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.63835037,0.0003074663,0.35181326,0.0014560482,0.002738494,0.00032991177,0.0000064861565,0.00014432508,0.0048536505],"genre_scores_gemma":[0.98830503,0.0000046839336,0.01083549,0.000105613166,0.000005754816,0.000014802215,0.000031723855,0.0000034239422,0.00069346133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991095,0.00007589383,0.00027060002,0.0002225066,0.00019316579,0.00012834885],"domain_scores_gemma":[0.9991547,0.0001707872,0.00009514513,0.0003290928,0.00021357804,0.000036722293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023111672,0.00008896901,0.00013871487,0.00018244605,0.00020604554,0.00010112303,0.0003091072,0.00005847493,0.000011281559],"category_scores_gemma":[0.000086602544,0.00009596902,0.00004959017,0.0012371318,0.000027531787,0.00031444765,0.000057947338,0.00007048797,0.00001783116],"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.0000072104544,0.00009263163,0.001053086,0.000011429825,0.000021707696,0.0000010483664,0.0001509673,0.0052334084,0.0022055646,0.98479456,0.0021287247,0.0042996844],"study_design_scores_gemma":[0.0012158776,0.00009178367,0.033819012,0.000047160494,0.00002187113,0.0000032964358,0.000014643955,0.23030603,0.019518815,0.7091038,0.005651946,0.0002057274],"about_ca_topic_score_codex":0.00004173594,"about_ca_topic_score_gemma":0.000008212846,"teacher_disagreement_score":0.3499547,"about_ca_system_score_codex":0.00003666873,"about_ca_system_score_gemma":0.00025075846,"threshold_uncertainty_score":0.39135033},"labels":[],"label_agreement":null},{"id":"W4409177077","doi":"10.4153/s0008439525000384","title":"On Hadwiger’s covering problem in small dimensions","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.010472592410530727,"score_gpt":0.21871997545527033,"score_spread":0.2082473830447396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409177077","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.08714784,0.000094290896,0.7428132,0.03292883,0.0002971613,0.0005532541,0.0000044520284,0.0001078117,0.13605313],"genre_scores_gemma":[0.9229217,0.0000029193031,0.06555027,0.005676121,0.00002352871,0.000053186537,0.0000054299157,0.0000074943905,0.005759324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919915,0.000037707574,0.00019617444,0.0002356903,0.00008438303,0.00024690476],"domain_scores_gemma":[0.99926776,0.0002764821,0.000020040732,0.00023092865,0.00003551395,0.00016925414],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023923107,0.00009147033,0.00011776937,0.00033887228,0.00009061393,0.000089961955,0.00027097898,0.00005050327,0.0003726647],"category_scores_gemma":[0.00020682119,0.00009058605,0.000032395852,0.00044051942,0.00001686334,0.000027130587,0.000052726733,0.00012014817,0.0015912879],"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.0000012900799,0.000031168125,0.000013664157,0.000021537997,0.000003767166,0.000021113578,0.00007466873,0.0027813846,0.000035842146,0.98581165,0.007903293,0.0033006354],"study_design_scores_gemma":[0.00043638912,0.000052015395,0.0006846308,0.0003355751,0.0000046219016,0.000010329541,0.000017498338,0.06483354,0.00042327974,0.8413998,0.09153531,0.00026704665],"about_ca_topic_score_codex":0.00036727783,"about_ca_topic_score_gemma":0.0014558984,"teacher_disagreement_score":0.8357739,"about_ca_system_score_codex":0.00015237364,"about_ca_system_score_gemma":0.00026272231,"threshold_uncertainty_score":0.9991861},"labels":[],"label_agreement":null},{"id":"W4409477976","doi":"10.1145/3729532","title":"Intersection of Tetrahedra","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","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":"McMaster University","funders":"","keywords":"Intersection (aeronautics); Tetrahedron; Computer science; Mathematics; Geometry; Engineering","score_opus":0.014172567485257494,"score_gpt":0.2701240396092887,"score_spread":0.25595147212403124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409477976","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.005119902,0.000017820252,0.993307,0.00062776124,0.00025708336,0.000112379304,0.000002772945,0.00014524968,0.00041006322],"genre_scores_gemma":[0.45397076,0.0000026180992,0.5451771,0.00015646384,0.000008652222,0.000019274557,0.0000015247808,0.0000032097053,0.0006603575],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927616,0.000030451833,0.00023472184,0.00018552068,0.00017350088,0.00009966602],"domain_scores_gemma":[0.9989857,0.00042594367,0.000038970138,0.00042496913,0.000089684996,0.000034724613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012543584,0.00008354136,0.00012510644,0.00022099027,0.000095619005,0.000033034492,0.0003865036,0.00005296548,0.00009297572],"category_scores_gemma":[0.00018125246,0.00007638348,0.00009090494,0.00065547385,0.000029717976,0.00018004162,0.000013244989,0.00010771786,0.000045891527],"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.0000133913545,0.0004007984,0.000017183413,0.00012720574,0.000052023934,0.0000011077631,0.00025021858,0.006709256,0.00047657004,0.07212465,0.00007907608,0.9197485],"study_design_scores_gemma":[0.0002614979,0.00010822125,0.0004432171,0.00011378794,0.000019697287,0.0000072646153,0.000033169523,0.008400252,0.019028185,0.9708926,0.00058625,0.00010586027],"about_ca_topic_score_codex":0.0000017994467,"about_ca_topic_score_gemma":0.0000014552141,"teacher_disagreement_score":0.9196426,"about_ca_system_score_codex":0.00003910158,"about_ca_system_score_gemma":0.00004976886,"threshold_uncertainty_score":0.31148282},"labels":[],"label_agreement":null},{"id":"W4410077677","doi":"10.1007/978-981-96-4445-2_4","title":"Faster Algorithms for Grid and Layered Drawings of Plane 3-Trees","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Saskatchewan","funders":"","keywords":"Computer science; Grid; Plane (geometry); Algorithm; Computer graphics (images); Geometry; Mathematics","score_opus":0.016711050329856036,"score_gpt":0.25371778819145013,"score_spread":0.2370067378615941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410077677","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.00010385678,0.0005214191,0.99569476,0.00061824016,0.0019421888,0.00038591615,0.000029118186,0.000045529712,0.00065896905],"genre_scores_gemma":[0.044778455,0.000050468803,0.9518985,0.0010600695,0.00085262425,0.000017063954,0.000037285397,0.000016710157,0.0012887871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978862,0.00001568554,0.0004169778,0.0009109718,0.0004732012,0.00029698206],"domain_scores_gemma":[0.99824834,0.000687657,0.00021239159,0.00048341588,0.00028909964,0.00007911547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049209065,0.00029490187,0.0003992138,0.0007635587,0.00015255078,0.00023042392,0.0010552045,0.00017701177,0.0000045212782],"category_scores_gemma":[0.0000762122,0.00027640574,0.0000832299,0.00040669768,0.00027102485,0.00034473088,0.0006200664,0.0002222784,0.0000016591043],"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.000012076275,0.000022980717,0.000030188023,0.00011331343,0.000019468232,0.000007696308,0.00047080813,0.03618506,0.00040520515,0.026805025,0.00018349712,0.9357447],"study_design_scores_gemma":[0.0005224175,0.00028976504,0.00027880742,0.00039440193,0.000013277709,0.000033782486,2.1354833e-7,0.8714268,0.005286905,0.115545705,0.0057333387,0.0004745791],"about_ca_topic_score_codex":0.000009537716,"about_ca_topic_score_gemma":0.000030312542,"teacher_disagreement_score":0.93527013,"about_ca_system_score_codex":0.00005965132,"about_ca_system_score_gemma":0.000356935,"threshold_uncertainty_score":0.9999688},"labels":[],"label_agreement":null},{"id":"W4410486463","doi":"10.61091/jcmcc126-11","title":"Super point graph and point completion number","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Point (geometry); Graph; Mathematics; Combinatorics; Computer science; Geometry","score_opus":0.010960619556611676,"score_gpt":0.25721672107083293,"score_spread":0.24625610151422125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410486463","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.4696483,0.00044323984,0.51276475,0.0012202637,0.01350372,0.0002606431,0.0000010177591,0.00006011081,0.0020979482],"genre_scores_gemma":[0.9629983,0.00005239766,0.036276266,0.00013273048,0.00050810794,0.0000015560508,0.0000013580437,0.000010871829,0.000018412342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978796,0.00013133828,0.00094520685,0.00026919742,0.00051963294,0.0002550267],"domain_scores_gemma":[0.9976287,0.0007748126,0.0005335059,0.00023912083,0.00067175407,0.00015214655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001634602,0.00024228355,0.00056164054,0.00031689194,0.00034525257,0.00046992846,0.00042483184,0.000121031524,0.00000558172],"category_scores_gemma":[0.00036644866,0.00022294183,0.00013400157,0.0006155796,0.00007592294,0.00052032794,0.00040436967,0.00034440652,0.0000029481187],"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.000025946185,0.00024575755,0.00022388181,0.000099169934,0.00007167221,0.000009588426,0.00062999147,0.00007338374,0.0004181726,0.9931835,0.00082871504,0.0041902396],"study_design_scores_gemma":[0.002991135,0.00027608144,0.00066094473,0.00025841277,0.000052833097,0.00019192426,0.00013072671,0.026581319,0.00072725647,0.9661799,0.0017082958,0.00024115888],"about_ca_topic_score_codex":0.000005523623,"about_ca_topic_score_gemma":2.6205322e-7,"teacher_disagreement_score":0.49335,"about_ca_system_score_codex":0.00006374674,"about_ca_system_score_gemma":0.00014584322,"threshold_uncertainty_score":0.9091304},"labels":[],"label_agreement":null},{"id":"W4411081592","doi":"10.1016/j.compstruc.2025.107843","title":"Massively parallel tandem traversal of bounding volume hierarchies for geometric queries on distributed meshes","year":2025,"lang":"en","type":"article","venue":"Computers & Structures","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":"Safran Electronics (Canada)","funders":"","keywords":"Polygon mesh; Tree traversal; Bounding overwatch; Computer science; Parallel computing; Massively parallel; Volume (thermodynamics); Computational science; Tandem; Bounding volume; Theoretical computer science; Distributed computing; Computer graphics (images); Collision detection; Algorithm; Collision; Physics; Aerospace engineering; Artificial intelligence; Engineering","score_opus":0.012981882314364384,"score_gpt":0.26017646910237674,"score_spread":0.24719458678801234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411081592","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.05301375,0.0003379406,0.9437542,0.000872591,0.0014462124,0.0002987334,0.000046221383,0.000102981765,0.00012737168],"genre_scores_gemma":[0.86467814,0.000015820628,0.13465647,0.0002632339,0.00011536413,0.000019463138,0.000085192056,0.0000068055756,0.00015949136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855363,0.00006871938,0.00036476878,0.00043831248,0.00028909766,0.00028549632],"domain_scores_gemma":[0.99874526,0.0005301636,0.00017553929,0.00030069667,0.00018265465,0.000065710534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016891514,0.00021745032,0.00031806648,0.0006878717,0.00030545422,0.00021594326,0.000671486,0.00007994391,0.0000054352977],"category_scores_gemma":[0.00014860566,0.00020230965,0.000153721,0.0012746614,0.00011306239,0.0002501931,0.00016956392,0.000116660085,0.0000011093041],"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.00011922627,0.0000705216,0.0014833119,0.00013987001,0.00021934704,0.000005230324,0.0005959239,0.12752914,0.0005976722,0.7209829,0.022681626,0.12557518],"study_design_scores_gemma":[0.002784828,0.0008707271,0.2700429,0.00015810612,0.00008374132,0.00001688617,0.00012764843,0.38810197,0.012714927,0.28059167,0.04368241,0.00082418305],"about_ca_topic_score_codex":0.00000947776,"about_ca_topic_score_gemma":0.0000031851796,"teacher_disagreement_score":0.8116644,"about_ca_system_score_codex":0.00007549127,"about_ca_system_score_gemma":0.00015701076,"threshold_uncertainty_score":0.82499474},"labels":[],"label_agreement":null},{"id":"W4411151176","doi":"10.1103/physreve.111.065406","title":"Relative knot probabilities in confined lattice polygons","year":2025,"lang":"en","type":"article","venue":"Physical review. E","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per l'Analisi Matematica, la Probabilità e le loro Applicazioni","keywords":"Knot (papermaking); Lattice (music); Mathematics; Combinatorics; Statistical physics; Physics; Materials science","score_opus":0.016961057595165495,"score_gpt":0.3355458624128611,"score_spread":0.31858480481769563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411151176","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.09588979,0.025261879,0.7186438,0.049451496,0.0007674315,0.0019581537,0.0000076122355,0.00029467072,0.107725196],"genre_scores_gemma":[0.9863852,0.00054436276,0.008104142,0.0029645374,0.00007942499,0.00009914623,0.000008056884,0.000003612876,0.0018114684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920446,0.000116009556,0.00018605599,0.00023657511,0.00013309011,0.00012381621],"domain_scores_gemma":[0.9992389,0.00038994805,0.00004189092,0.00022059116,0.00007831277,0.000030375048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020016558,0.000083762585,0.00018983494,0.00006566766,0.000043880118,0.000030142039,0.00023946022,0.000013921124,0.000007602638],"category_scores_gemma":[0.00034134433,0.000073338975,0.000065149165,0.0008684028,0.000028125705,0.00027040634,0.00010118718,0.00011064322,0.00005769341],"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.0000015819322,0.00008608431,0.000054299067,0.00014941592,0.000006386723,8.1484524e-7,0.0001282708,0.000113717986,0.00018747443,0.97359735,0.0007418742,0.024932742],"study_design_scores_gemma":[0.00036253678,0.00007699318,0.008749749,0.0011820424,0.000026460297,0.00000158291,0.000009000174,0.07765565,0.0017669674,0.8655752,0.044356216,0.00023758115],"about_ca_topic_score_codex":0.000012236484,"about_ca_topic_score_gemma":0.000007238321,"teacher_disagreement_score":0.8904955,"about_ca_system_score_codex":0.000035816156,"about_ca_system_score_gemma":0.000107899206,"threshold_uncertainty_score":0.29906765},"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":"W4411502569","doi":"10.1007/s10959-025-01426-9","title":"Central Limit Theorem for Crossings in Randomly Embedded Graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Theoretical Probability","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":"Mathematics; Central limit theorem; Limit (mathematics); Discrete mathematics; Combinatorics; Mathematical analysis; Statistics","score_opus":0.011236595988464323,"score_gpt":0.27572680592847887,"score_spread":0.26449020994001454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411502569","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.21297508,0.00012321037,0.78159696,0.0035836026,0.0005225882,0.00028326508,0.0000013253477,0.000013153595,0.00090081844],"genre_scores_gemma":[0.94454896,0.000003887399,0.055019304,0.00032712592,0.000054514647,0.0000070789574,7.010719e-7,0.000002644066,0.000035773606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984637,0.00022285442,0.0006262383,0.00021115188,0.00023070918,0.0002453528],"domain_scores_gemma":[0.9982078,0.00096951646,0.0001635635,0.00021665548,0.0003551215,0.00008734677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025333015,0.00010539162,0.000272192,0.0001851985,0.00008937518,0.00016250018,0.000514378,0.00007160475,0.000015113866],"category_scores_gemma":[0.0017569953,0.0000800822,0.00023450424,0.00052470365,0.00028832612,0.00030431288,0.00008266908,0.00020351716,5.596088e-7],"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.00052416074,0.00020867477,0.00043910506,0.000036419486,0.000016731376,0.0000022476606,0.00025956726,0.0028362807,0.00027846798,0.9829287,0.00033994816,0.012129676],"study_design_scores_gemma":[0.0018794746,0.00014145045,0.0029090357,0.000046057896,0.000011881357,0.000010221943,0.000009731162,0.0463141,0.0021923531,0.94603753,0.0003751513,0.00007298347],"about_ca_topic_score_codex":6.6751215e-7,"about_ca_topic_score_gemma":0.000001447684,"teacher_disagreement_score":0.7315739,"about_ca_system_score_codex":0.000095983065,"about_ca_system_score_gemma":0.00026970764,"threshold_uncertainty_score":0.32656574},"labels":[],"label_agreement":null},{"id":"W4411858833","doi":"10.1007/978-3-031-76568-1_13","title":"Linear Recurrence Sequences","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","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 Calgary; University of Ottawa; Mount Royal University","funders":"","keywords":"Mathematics; Medicine; Computer science","score_opus":0.0371990957319699,"score_gpt":0.2794696046151688,"score_spread":0.2422705088831989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411858833","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016867532,0.0008361857,0.3607695,0.00026404273,0.00082063174,0.00036224144,0.000013908702,0.00013235156,0.63678426],"genre_scores_gemma":[0.0003975503,0.00028531856,0.2663733,0.00029867183,0.00022997403,0.00003115438,0.000036501937,0.000025106343,0.7323224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979596,0.000024925788,0.0006894639,0.0005680026,0.0005041875,0.00025377778],"domain_scores_gemma":[0.9982631,0.00039925138,0.0003174527,0.0007540064,0.00019141629,0.00007473407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049633544,0.00036257508,0.0004556754,0.00047232903,0.00010259379,0.00015175274,0.0011087379,0.0002793303,0.000059088765],"category_scores_gemma":[0.00013319725,0.0003624538,0.00013580888,0.00016320754,0.000087400076,0.00022293789,0.00037311367,0.00046389672,0.00017583978],"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.0000012293988,0.00002861316,0.0000011616568,0.00022334214,0.000020203308,0.000027250659,0.00039222234,0.00044962956,0.000012120232,0.9662626,0.00400926,0.028572395],"study_design_scores_gemma":[0.00013958955,0.000045317724,0.000002255204,0.0010134375,0.000017792585,0.000020303016,0.000007638566,0.09743483,0.00018664908,0.80575514,0.094960555,0.00041649913],"about_ca_topic_score_codex":0.0000026694236,"about_ca_topic_score_gemma":0.000012434546,"teacher_disagreement_score":0.16050744,"about_ca_system_score_codex":0.00012252234,"about_ca_system_score_gemma":0.000419892,"threshold_uncertainty_score":0.99988276},"labels":[],"label_agreement":null},{"id":"W4412216168","doi":"10.20382/jocg.v15i1a6","title":"Sorting under partial (interval order) information","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Interval (graph theory); Sorting; Order (exchange); Mathematics; Computer science; Combinatorics; Algorithm; Economics","score_opus":0.011488732816971027,"score_gpt":0.21010318980686277,"score_spread":0.19861445698989175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412216168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13180687,0.00003840195,0.8646759,0.001305315,0.0008975859,0.00007621662,0.000007721303,0.000039090875,0.0011529501],"genre_scores_gemma":[0.95806164,0.000005221259,0.040679574,0.00074947625,0.00016077458,4.653769e-7,0.000033454475,0.000005633789,0.0003037364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786276,0.00021142897,0.0005432153,0.0001590347,0.0010170551,0.00020652715],"domain_scores_gemma":[0.9978798,0.00024191508,0.0007765937,0.00013384287,0.0008342662,0.00013355518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006581477,0.00013475154,0.0002121535,0.0016019123,0.0005035426,0.00015217438,0.0007873106,0.000037674057,0.00016398692],"category_scores_gemma":[0.000079806276,0.00015657193,0.00018008021,0.0027092057,0.00003197294,0.0022908768,0.0004143263,0.0003543072,0.000016858925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057551464,0.00008162059,0.00018197639,0.0000064950405,0.000064498556,0.00003649278,0.00025209785,0.9011056,0.000052004765,0.08511397,0.0012384488,0.011809234],"study_design_scores_gemma":[0.0044119633,0.0014067309,0.0102029815,0.000034406774,0.00009415992,0.0013127764,0.002168698,0.6606356,0.00041329302,0.03575651,0.2827966,0.00076632405],"about_ca_topic_score_codex":0.0000060532066,"about_ca_topic_score_gemma":5.153457e-7,"teacher_disagreement_score":0.8262548,"about_ca_system_score_codex":0.0003227801,"about_ca_system_score_gemma":0.0005599878,"threshold_uncertainty_score":0.6384818},"labels":[],"label_agreement":null},{"id":"W4412228248","doi":"","title":"Singhal, Ragini. Deformations of G2-instantons on nearly G2 manifolds. Ann. Global Anal. Geom. 62 (2022), no. 2, 329–366.","year":2023,"lang":"en","type":"article","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Instanton; Mathematics; Pure mathematics; Mathematical physics","score_opus":0.014786631451090496,"score_gpt":0.25983442583556,"score_spread":0.2450477943844695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412228248","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.27953395,0.00015094475,0.61755395,0.004617396,0.0029734103,0.0006238632,0.00017583363,0.0012008669,0.093169786],"genre_scores_gemma":[0.97891307,0.000041747866,0.016738236,0.0010372539,0.00019100202,0.000020152072,0.0001686868,0.0000113484675,0.0028785153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820286,0.000054698383,0.0004174492,0.00038023092,0.00060488883,0.00033985297],"domain_scores_gemma":[0.9987809,0.00011047592,0.00013990798,0.00047469605,0.0003794355,0.000114559414],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038215585,0.00017757015,0.00019110038,0.00033101343,0.0002564729,0.00021761071,0.00057616906,0.000078176374,0.0001072733],"category_scores_gemma":[0.00009358218,0.00016736539,0.000116628544,0.0025942726,0.00004077023,0.00085378287,0.00022797739,0.00011291702,0.0013017133],"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.00007262336,0.00059220335,0.0019104901,0.00010737837,0.0001564655,0.00006619978,0.0009042945,0.07273891,0.0015226911,0.6953046,0.15426038,0.07236381],"study_design_scores_gemma":[0.0010480693,0.00051483914,0.04383831,0.000060820043,0.000027766006,0.000048029342,0.00013784798,0.86739004,0.0020887426,0.014288002,0.06993745,0.00062005676],"about_ca_topic_score_codex":0.00014439542,"about_ca_topic_score_gemma":0.0000902591,"teacher_disagreement_score":0.79465115,"about_ca_system_score_codex":0.00009237588,"about_ca_system_score_gemma":0.00020863868,"threshold_uncertainty_score":0.9994759},"labels":[],"label_agreement":null},{"id":"W4412277222","doi":"","title":"ICLR 2022 Challenge for Computational Geometry &amp; Topology: Design and Results","year":2022,"lang":"en","type":"article","venue":"Research at the University of Copenhagen (University of Copenhagen)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Catastrophic Loss Reduction","keywords":"Topology (electrical circuits); Geometry; Computer science; Geometry and topology; Mathematics; Combinatorics","score_opus":0.0797719562666742,"score_gpt":0.2953853916338412,"score_spread":0.21561343536716698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412277222","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.06878523,0.0035971482,0.90911645,0.0060174414,0.00013237823,0.0013047499,0.00022127912,0.000045629382,0.010779716],"genre_scores_gemma":[0.73053724,0.0001662652,0.049778182,0.000055119348,0.000022338796,8.8339436e-7,0.00015936914,0.000010139409,0.21927047],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99702203,0.0010698299,0.00019114726,0.00051599863,0.00084853586,0.00035246965],"domain_scores_gemma":[0.9969094,0.0017189808,0.00023296554,0.00046071538,0.00053462014,0.00014335221],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003636129,0.00012850463,0.0002624103,0.00037179035,0.0026869818,0.000029704648,0.0015139161,0.00006433794,0.027042072],"category_scores_gemma":[0.00012167912,0.00015618234,0.00011915551,0.0011689856,0.00044412544,0.0004230849,0.0020829202,0.00028284546,0.0013721164],"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.0010901139,0.00017100354,8.246457e-7,0.000045708748,0.000119662516,0.000030662195,0.004227931,0.053914484,0.00095371885,0.007293534,0.9241408,0.008011532],"study_design_scores_gemma":[0.002531604,0.000862224,0.0014216425,0.000011983182,0.0000336228,0.000025478563,0.0037358217,0.064262085,0.00033265975,0.0008107728,0.92574525,0.00022684029],"about_ca_topic_score_codex":0.00016064159,"about_ca_topic_score_gemma":0.00011030915,"teacher_disagreement_score":0.8593382,"about_ca_system_score_codex":0.00022937132,"about_ca_system_score_gemma":0.0004231171,"threshold_uncertainty_score":0.99940544},"labels":[],"label_agreement":null},{"id":"W4412435922","doi":"10.55016/ojs/cdm.v11i2.62225","title":"Contractions of Polygons in Abstract Polytopes, Part I","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polytope; Combinatorics; Mathematics","score_opus":0.02321674580177565,"score_gpt":0.32801789323190933,"score_spread":0.3048011474301337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435922","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.039985035,0.00009566689,0.9458972,0.0062531726,0.0004227128,0.0004444756,0.00022701858,0.000058559388,0.006616108],"genre_scores_gemma":[0.9774429,0.0000101167225,0.021983948,0.00006234492,0.00007211002,0.000037711856,0.00001704342,0.0000052367063,0.0003685828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989325,0.00002019745,0.00042910688,0.00020427142,0.00018436172,0.00022956477],"domain_scores_gemma":[0.9983702,0.00019285317,0.00025993152,0.00082338945,0.00023851138,0.00011515653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041869874,0.00011245231,0.00022482283,0.00017980966,0.00036744002,0.00021630409,0.0006907002,0.000056206092,0.000030498548],"category_scores_gemma":[0.0011175651,0.0001093486,0.00007802786,0.00022782215,0.0000536218,0.0004918098,0.00018197548,0.00010824479,0.00005973221],"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.000006188089,0.00031745262,0.0003133775,0.000027975067,0.000033590182,0.0000065512786,0.0005025595,0.0020486421,0.0043944246,0.98345095,0.0016099401,0.007288328],"study_design_scores_gemma":[0.005110583,0.0004658148,0.3007079,0.0010390577,0.00014194849,0.00012137219,0.0004896758,0.2540094,0.055737715,0.30076766,0.079457186,0.0019517054],"about_ca_topic_score_codex":0.000045563498,"about_ca_topic_score_gemma":0.000085544096,"teacher_disagreement_score":0.93745786,"about_ca_system_score_codex":0.00006315528,"about_ca_system_score_gemma":0.00013448179,"threshold_uncertainty_score":0.44591063},"labels":[],"label_agreement":null},{"id":"W4412453354","doi":"10.1016/j.tcs.2025.115455","title":"Path cover using only short paths","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Ministry of Science and Technology of the People's Republic of China; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Cover (algebra); Path (computing); Mathematics; Computer science; Algorithm; Combinatorics; Programming language; Engineering","score_opus":0.012300384372274155,"score_gpt":0.2775897903059699,"score_spread":0.26528940593369577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412453354","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.06822662,0.000042628813,0.92430836,0.00048080095,0.0011826608,0.00013307476,0.0000011138828,0.00014113077,0.005483637],"genre_scores_gemma":[0.78010595,0.0000021470846,0.21857892,0.0011680768,0.00009686129,0.0000020688697,0.0000010104501,0.0000029836629,0.000042004118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979137,0.000086020795,0.00026760192,0.0006881606,0.00061996735,0.00042454305],"domain_scores_gemma":[0.9987375,0.00018903932,0.00003311349,0.00061026914,0.00027424988,0.00015579743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010946858,0.00015886922,0.0001663199,0.00032495416,0.00051497313,0.0005376348,0.0015905376,0.00004820905,0.0000264301],"category_scores_gemma":[0.000076137,0.00014052607,0.00006514572,0.0023573153,0.0008666553,0.0007225142,0.0009783227,0.00014750355,0.000045000237],"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.000003263843,0.000045167966,0.00011003545,0.0000058285736,0.000003660674,0.000006750061,0.00006950967,0.0044930447,0.0011981857,0.93050945,0.00011111603,0.06344401],"study_design_scores_gemma":[0.00010434009,0.000055856017,0.0015843707,0.000030646646,0.0000046637574,0.00002704962,0.0000015699388,0.87108696,0.003206669,0.12327104,0.00047138822,0.00015545626],"about_ca_topic_score_codex":0.0000020892817,"about_ca_topic_score_gemma":1.9365466e-7,"teacher_disagreement_score":0.8665939,"about_ca_system_score_codex":0.000101307356,"about_ca_system_score_gemma":0.00061007607,"threshold_uncertainty_score":0.57304865},"labels":[],"label_agreement":null},{"id":"W4412582229","doi":"10.55016/ojs/cdm.v12i2.62481","title":"Ball hulls, ball intersections, and 2-center problems for gauges","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Junta de Extremadura","keywords":"Ball (mathematics); Mathematics; Hull; Combinatorics; Center (category theory); Geometry; Engineering; Marine engineering; Crystallography","score_opus":0.021089062618290574,"score_gpt":0.30980261489859967,"score_spread":0.2887135522803091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582229","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.007324416,0.00008178368,0.98458415,0.0059646545,0.0003450576,0.0006744114,0.0001849893,0.000077285156,0.0007632566],"genre_scores_gemma":[0.86808234,0.000024088318,0.13008147,0.00024844968,0.00016915891,0.00022981087,0.00006056651,0.000011532427,0.0010925417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990638,0.00001956555,0.0002600205,0.00028158203,0.00014243365,0.00023258988],"domain_scores_gemma":[0.9987028,0.00013512248,0.00014748421,0.00055526395,0.00032455975,0.00013472298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003477679,0.0001339505,0.00017220847,0.00010353619,0.0008383009,0.00069430633,0.0005050406,0.00005145375,0.000007520893],"category_scores_gemma":[0.00064730813,0.00012226947,0.000072025585,0.00008955289,0.000048449587,0.00044054858,0.00031017122,0.00006542257,0.000028121724],"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.0000100627,0.0002401531,0.00023169816,0.00015156053,0.00009227726,0.0000017606078,0.0014622387,0.00063554826,0.0023750688,0.9757342,0.01000979,0.009055674],"study_design_scores_gemma":[0.0031477383,0.0005332439,0.005278471,0.00042719475,0.00010058121,0.00011273109,0.00021539092,0.58770037,0.004788754,0.25470433,0.1420121,0.0009790806],"about_ca_topic_score_codex":0.0000056513636,"about_ca_topic_score_gemma":0.000032128017,"teacher_disagreement_score":0.86075795,"about_ca_system_score_codex":0.00005214334,"about_ca_system_score_gemma":0.000044093773,"threshold_uncertainty_score":0.66952115},"labels":[],"label_agreement":null},{"id":"W4412617762","doi":"10.55016/ojs/cdm.v12i1.62176","title":"Geometric Algorithms for Minimal Enclosing Disks in Strictly Convex Normed Planes","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Regular polygon; Convex body; Convex analysis; Algorithm; Convex optimization; Geometry","score_opus":0.037614912779776764,"score_gpt":0.3450550316480724,"score_spread":0.30744011886829564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617762","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.03247984,0.000086097214,0.9637418,0.001687176,0.00035807482,0.0007517109,0.00027378788,0.0000612777,0.00056023395],"genre_scores_gemma":[0.82936156,0.000007965561,0.16987245,0.00009370499,0.00016681645,0.00015957528,0.00008354305,0.000009797875,0.00024460012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985236,0.00002725796,0.00043633598,0.0003416184,0.00028203757,0.00038916318],"domain_scores_gemma":[0.9980797,0.0005644661,0.00023671085,0.0006462397,0.00032017002,0.00015270022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056543306,0.00017320477,0.0002942609,0.00044703583,0.0006794442,0.00061880617,0.0008885328,0.000081595834,0.000009150321],"category_scores_gemma":[0.0023045756,0.0001652276,0.00009273312,0.00056753965,0.000046463007,0.00051155087,0.00026865792,0.000098875076,0.00003433363],"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.00006604901,0.0009311855,0.0017449507,0.00033758982,0.00016851118,0.000045544086,0.003069533,0.008740054,0.0041493587,0.8729887,0.005828891,0.10192961],"study_design_scores_gemma":[0.0024758172,0.00032794464,0.019770926,0.00016719456,0.00005180126,0.00003372449,0.00014932241,0.9094206,0.007181992,0.051708363,0.007973232,0.00073908176],"about_ca_topic_score_codex":0.000015451305,"about_ca_topic_score_gemma":0.00001783987,"teacher_disagreement_score":0.90068054,"about_ca_system_score_codex":0.00012632122,"about_ca_system_score_gemma":0.0001321033,"threshold_uncertainty_score":0.6737786},"labels":[],"label_agreement":null},{"id":"W4412647334","doi":"10.55016/ojs/cdm.v3i1.61983","title":"Configurations graphs of neighbourhood geometries","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Neighbourhood (mathematics); Mathematics; Combinatorics; Mathematical analysis","score_opus":0.016637047107502866,"score_gpt":0.2746005900086304,"score_spread":0.25796354290112755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647334","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.034455236,0.000116864125,0.9608358,0.0013841472,0.0001508767,0.00029654682,0.00013573558,0.00009883908,0.0025259492],"genre_scores_gemma":[0.92526,0.000018302444,0.074239105,0.000105797306,0.000036451624,0.000036447247,0.000042104337,0.000005793716,0.0002560192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878395,0.000029265706,0.00043912698,0.00020634026,0.00032698555,0.00021433827],"domain_scores_gemma":[0.9983206,0.00027752132,0.00014867527,0.00045636442,0.0006595598,0.00013727527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022531605,0.0001283766,0.00023503583,0.0003808914,0.0003402425,0.000056517154,0.0004256686,0.00005059206,0.000052333264],"category_scores_gemma":[0.0007556389,0.00012070704,0.00010917614,0.0016597235,0.00007649403,0.0003176359,0.00011779361,0.000073972406,0.00007346476],"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.0000019675047,0.00011519727,0.00005174846,0.0000148478775,0.000031290238,0.0000028433774,0.00088125333,0.0017751955,0.003934614,0.9909646,0.0013643587,0.00086206786],"study_design_scores_gemma":[0.0028637368,0.00096422544,0.0276328,0.00021985704,0.00015051352,0.0004863133,0.00046195375,0.1988039,0.18209276,0.56387055,0.020787155,0.0016662128],"about_ca_topic_score_codex":0.0000055808773,"about_ca_topic_score_gemma":0.0000026068094,"teacher_disagreement_score":0.89080477,"about_ca_system_score_codex":0.000038295355,"about_ca_system_score_gemma":0.00016800164,"threshold_uncertainty_score":0.492229},"labels":[],"label_agreement":null},{"id":"W4412728593","doi":"10.30837/0135-1710.2025.185.070","title":"Conquest Algorithm for Stochastic Filling of Two-Dimensional Discrete Grids with Connected Regions","year":2025,"lang":"en","type":"article","venue":"Avtomatizirovannye sistemy upravleniâ i pribory avtomatiki.","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":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"CONQUEST; Algorithm; Mathematics; Computer science; Combinatorics; History; Ancient history","score_opus":0.010986689944108148,"score_gpt":0.26541439016013524,"score_spread":0.25442770021602706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412728593","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.015111378,0.0004132977,0.9803817,0.0008991998,0.0006671432,0.0012694434,0.00012179688,0.00041203323,0.00072397606],"genre_scores_gemma":[0.4913666,0.0000037510442,0.5062891,0.00047339045,0.0001296842,0.00027648156,0.00031247243,0.000034357126,0.0011141676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675757,0.00024706303,0.0010058022,0.00084215123,0.0006221058,0.00052533596],"domain_scores_gemma":[0.9957986,0.0016538907,0.0005797788,0.0008362018,0.0009561966,0.00017534712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007739448,0.00045756414,0.0006819861,0.00062068575,0.00049909984,0.0001726331,0.000865048,0.00014392502,0.000018348044],"category_scores_gemma":[0.00022430065,0.00041085095,0.00019302468,0.0014396114,0.00021544793,0.0007724386,0.00024803577,0.00021610294,0.000013666689],"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.00020651113,0.00068123743,0.00012824866,0.00090963964,0.0011361755,0.000029757357,0.0011068594,0.15383016,0.00910236,0.7123149,0.00737334,0.11318083],"study_design_scores_gemma":[0.0030915255,0.00042459698,0.0007433751,0.0005904691,0.00015222526,0.00009876409,0.0000825166,0.96418375,0.009008212,0.019590825,0.001413902,0.0006198255],"about_ca_topic_score_codex":0.000021290653,"about_ca_topic_score_gemma":0.000018072484,"teacher_disagreement_score":0.81035364,"about_ca_system_score_codex":0.0001116815,"about_ca_system_score_gemma":0.0005753497,"threshold_uncertainty_score":0.99983436},"labels":[],"label_agreement":null},{"id":"W4412967130","doi":"10.1007/s00025-025-02479-2","title":"Computing Shortest Paths Amid Non-overlapping Weighted Disks","year":2025,"lang":"en","type":"article","venue":"Results in Mathematics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Agencia Estatal de Investigación; Natural Sciences and Engineering Research Council of Canada; Universidad de Alcalá; Ministerio de Ciencia, Innovación y Universidades","keywords":"Algorithm; Dijkstra's algorithm; Shortest path problem; Computer science; Mathematics; Graph; Combinatorics","score_opus":0.015002258646792286,"score_gpt":0.27880816590873914,"score_spread":0.26380590726194686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412967130","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.0604591,0.00004959607,0.9215896,0.0005177614,0.0004104223,0.00021280324,0.0000034214258,0.000101678175,0.016655587],"genre_scores_gemma":[0.78959775,0.000011733733,0.20956694,0.00015177659,0.00005870673,0.0000054223183,0.0000144498335,0.000005301718,0.00058795005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985854,0.000039663923,0.00056295434,0.00032836443,0.00025415426,0.00022946627],"domain_scores_gemma":[0.99877137,0.00053661724,0.00013499813,0.00042388507,0.00009284402,0.000040296236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006551562,0.00013916023,0.00020671179,0.00027917442,0.00012052638,0.00015473091,0.0004943006,0.00006652328,0.0000016795872],"category_scores_gemma":[0.00024574384,0.00013390885,0.000049229875,0.0011584054,0.000021835633,0.00019400129,0.00025037778,0.00015506515,0.000022509863],"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.000025746422,0.0009526826,0.0008716235,0.00043825698,0.00008162022,0.00006693343,0.008398819,0.05292789,0.0032705322,0.718454,0.004875489,0.20963642],"study_design_scores_gemma":[0.00048126982,0.00001830095,0.0030591537,0.00027733576,0.0000045190077,0.000003284986,0.00006802292,0.9402298,0.0011146571,0.054129995,0.00047106537,0.00014262267],"about_ca_topic_score_codex":0.0000073487686,"about_ca_topic_score_gemma":0.000010198805,"teacher_disagreement_score":0.88730186,"about_ca_system_score_codex":0.0000763894,"about_ca_system_score_gemma":0.00009786371,"threshold_uncertainty_score":0.54606444},"labels":[],"label_agreement":null},{"id":"W4413184403","doi":"10.55016/ojs/cdm.v8i1.62120","title":"An improved bound on the number of point-surface incidences in three dimensions","year":2013,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Defense Science and Engineering Graduate; U.S. Department of Defense","keywords":"Mathematics; Combinatorics; Point (geometry); Surface (topology); Geometry","score_opus":0.014971908942121701,"score_gpt":0.29572869700788385,"score_spread":0.28075678806576215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184403","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.52451426,0.000014870101,0.47159073,0.0030240014,0.00006850547,0.00042735142,0.000018121551,0.000027549222,0.00031459494],"genre_scores_gemma":[0.95511234,0.0000022116276,0.04449203,0.00024362301,0.000022991897,0.000058365094,0.000007937592,0.0000049447335,0.000055570843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891037,0.00007710849,0.0003564033,0.00020805393,0.00024136103,0.00020672269],"domain_scores_gemma":[0.99832505,0.00056835084,0.00011812918,0.0005669214,0.00032997577,0.00009156609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053720083,0.00011776364,0.00016857614,0.000065693595,0.00018387528,0.00016680098,0.00053793925,0.000044507997,0.00007346979],"category_scores_gemma":[0.000501317,0.000080716425,0.000050546994,0.0006497627,0.00005195323,0.00041124882,0.0001343852,0.00010516201,0.00017530467],"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.0000030006386,0.0002095324,0.00034694988,0.000010898627,0.000016185664,7.7803406e-7,0.0010637587,0.0070625967,0.011607291,0.97854745,0.00048422272,0.00064731936],"study_design_scores_gemma":[0.00020177524,0.00010243903,0.0044833235,0.00006379207,0.000007714317,0.000006397529,0.00018711778,0.6368134,0.004763692,0.35314947,0.00006219072,0.00015868383],"about_ca_topic_score_codex":0.00007061191,"about_ca_topic_score_gemma":0.000060715724,"teacher_disagreement_score":0.6297508,"about_ca_system_score_codex":0.000053800846,"about_ca_system_score_gemma":0.000086093816,"threshold_uncertainty_score":0.32915205},"labels":[],"label_agreement":null},{"id":"W4413306205","doi":"10.46298/dmtcs.15222","title":"The Price of Upwardness","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.009311488017264506,"score_gpt":0.2696363289331886,"score_spread":0.2603248409159241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413306205","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.004864828,0.000078800185,0.9813295,0.0016643212,0.0006756267,0.0001921424,9.4169775e-7,0.00006716839,0.01112668],"genre_scores_gemma":[0.724263,0.000007589582,0.2754477,0.00016797043,0.000031054245,0.000009216711,5.1403714e-7,0.0000030684364,0.000069880676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808717,0.00007064446,0.0004280109,0.0003874883,0.0006829076,0.00034377322],"domain_scores_gemma":[0.9976253,0.0009077337,0.00013014769,0.000846501,0.00039898462,0.00009135568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019866081,0.00014025695,0.00018499588,0.00017907069,0.0006532493,0.0004563951,0.002545685,0.000034345056,0.0000069212942],"category_scores_gemma":[0.0002986618,0.00009007504,0.00008308195,0.0020809313,0.0016370933,0.00033654162,0.0010208482,0.00011703175,0.000012406576],"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.0000023120856,0.00004150691,0.000005873188,0.00002428582,0.000007832674,6.625411e-7,0.0003442824,0.00043796832,0.00044728687,0.98368657,0.000091591646,0.014909807],"study_design_scores_gemma":[0.00007338392,0.000031712592,0.00013087876,0.00003436265,0.0000041733024,0.0000041415137,0.000017256636,0.53869945,0.0044205543,0.4562158,0.00029716775,0.000071140945],"about_ca_topic_score_codex":6.187437e-7,"about_ca_topic_score_gemma":2.5560772e-7,"teacher_disagreement_score":0.7193982,"about_ca_system_score_codex":0.000029591138,"about_ca_system_score_gemma":0.00024239873,"threshold_uncertainty_score":0.6031938},"labels":[],"label_agreement":null},{"id":"W4413834654","doi":"10.1007/s00453-025-01337-5","title":"A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $$\\mathbb {R}^2$$","year":2025,"lang":"en","type":"article","venue":"Algorithmica","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 Ottawa","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Theory of computation; Combinatorics; Geodesic; Clique; Intersection (aeronautics); Mathematics; Clique problem; Chordal graph; Computer science; Discrete mathematics; Graph; Geometry; Algorithm; 1-planar graph; Geography; Cartography","score_opus":0.008585746217043383,"score_gpt":0.28848036322172566,"score_spread":0.27989461700468227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413834654","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.064641215,0.000058758258,0.9338616,0.00047546643,0.00042944797,0.00025879257,0.0000063345815,0.00004115265,0.00022723222],"genre_scores_gemma":[0.92792666,0.0000016386904,0.07159841,0.00025794996,0.000023398112,0.000078258236,0.00001790953,0.0000033064337,0.00009247432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925464,0.000042792766,0.00024334376,0.0002343951,0.00009764588,0.0001271515],"domain_scores_gemma":[0.9994436,0.00017647425,0.00006690617,0.00018028276,0.00010857246,0.000024146668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023768535,0.000079939295,0.00012716513,0.00037287618,0.000043495795,0.000030007934,0.00022616044,0.000047772915,0.0000023201305],"category_scores_gemma":[0.00004505895,0.00008250311,0.00007673812,0.0008075711,0.000021189164,0.00014844455,0.00003932569,0.000058335885,0.0000019131387],"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.00016755062,0.00061211357,0.000993982,0.00023125521,0.00008082695,0.000004874171,0.00057878246,0.029170342,0.011550562,0.49941146,0.0042413673,0.4529569],"study_design_scores_gemma":[0.0008471964,0.0001324108,0.0029161838,0.00005096499,0.000007727406,0.0000010435253,0.000014153537,0.9075636,0.045178354,0.041264366,0.0019112347,0.00011273594],"about_ca_topic_score_codex":0.000024969011,"about_ca_topic_score_gemma":0.000022999158,"teacher_disagreement_score":0.8783933,"about_ca_system_score_codex":0.00004605807,"about_ca_system_score_gemma":0.00014982701,"threshold_uncertainty_score":0.3364379},"labels":[],"label_agreement":null},{"id":"W4413947799","doi":"10.1016/j.disc.2025.114767","title":"On connections between association schemes and analyses of polyhedral and positive semidefinite lift-and-project relaxations","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","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; University of Saskatchewan","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lift (data mining); Association scheme; Combinatorics; Association (psychology); Discrete mathematics; Computer science; Data mining","score_opus":0.03317771164768675,"score_gpt":0.3412643082010908,"score_spread":0.3080865965534041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413947799","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.52903026,0.00019376176,0.4680871,0.0009671738,0.00004375932,0.0001490009,0.00003909012,0.00003410306,0.001455724],"genre_scores_gemma":[0.96412903,0.00004463985,0.03541834,0.00007741594,0.000016519685,0.000007247759,0.000023913515,0.0000032753146,0.00027960291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933076,0.000049050752,0.00022402313,0.00017076217,0.00014135754,0.0000840193],"domain_scores_gemma":[0.9985526,0.0010354377,0.00016785032,0.000117202166,0.00010015543,0.000026707503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022011211,0.00008716206,0.00016703428,0.00024128126,0.00016127454,0.00009599462,0.00006597681,0.000050891013,0.0000010317767],"category_scores_gemma":[0.00045541744,0.00007915604,0.0000287056,0.00045252944,0.00003287906,0.00017356765,0.000088676155,0.00007004925,7.8659576e-7],"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.000004246194,0.000048178706,0.00558484,0.00009058193,0.00021253416,4.1313342e-7,0.001963786,0.0002241781,0.0013597244,0.98629194,0.00020671835,0.00401286],"study_design_scores_gemma":[0.0013874025,0.00042941704,0.11735008,0.00059058773,0.00051360915,0.000011190058,0.00095460104,0.32855648,0.022020647,0.52733576,0.00027354644,0.0005766458],"about_ca_topic_score_codex":0.000021386708,"about_ca_topic_score_gemma":0.0000041501594,"teacher_disagreement_score":0.45895615,"about_ca_system_score_codex":0.000024894758,"about_ca_system_score_gemma":0.000043893357,"threshold_uncertainty_score":0.32278895},"labels":[],"label_agreement":null},{"id":"W4413965868","doi":"10.70930/tac/5wmf6072","title":"An Elementary Characterization of Stably Precohesive Geometric Morphisms as Particular Precohesive Geometric Morphisms","year":2025,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Morphism; Characterization (materials science); Mathematics; Pure mathematics; Computer science; Physics","score_opus":0.006413132101175257,"score_gpt":0.24476226244203003,"score_spread":0.23834913034085478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413965868","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.39271015,0.00039971614,0.6059663,0.00012175765,0.000057436584,0.00044998317,0.000027228578,0.000038370028,0.00022901392],"genre_scores_gemma":[0.9945013,0.00020022473,0.0042651985,0.00012540504,0.000049107242,0.0002845257,0.00022829286,0.0000074501972,0.00033852324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985302,0.00017473171,0.00048396413,0.0003878375,0.00024554407,0.00017768657],"domain_scores_gemma":[0.99827945,0.00037390908,0.00032315863,0.0005244273,0.0004240708,0.00007497701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007239451,0.00016443101,0.00026344636,0.0010085307,0.00020499284,0.000069031215,0.0004786478,0.000070666465,0.000045483368],"category_scores_gemma":[0.00009084136,0.00016543189,0.000055270066,0.0034311377,0.00015559798,0.0007147065,0.00012782274,0.000079016834,0.000006350538],"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.00005805773,0.00029015675,0.000615811,0.000097364355,0.00008666355,4.4638728e-7,0.00042101007,0.0011190622,0.064503446,0.81678265,0.000030499457,0.11599486],"study_design_scores_gemma":[0.00047242426,0.00031424145,0.022120912,0.000024178193,0.0001095202,0.0000063478815,0.00029868243,0.0022864328,0.65479463,0.31703007,0.0022692985,0.00027323412],"about_ca_topic_score_codex":0.000020702135,"about_ca_topic_score_gemma":0.0000013929715,"teacher_disagreement_score":0.60179114,"about_ca_system_score_codex":0.000027959184,"about_ca_system_score_gemma":0.00014385396,"threshold_uncertainty_score":0.6746116},"labels":[],"label_agreement":null},{"id":"W4414051275","doi":"10.1007/s00454-025-00768-9","title":"The Geodesic Edge Center of a Simple Polygon","year":2025,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Rheinische Friedrich-Wilhelms-Universität Bonn","keywords":"Geodesic; Voronoi diagram; Simple polygon; Polygon (computer graphics); Weighted Voronoi diagram; Geodesic map; Bowyer–Watson algorithm; Power diagram","score_opus":0.008284805618460409,"score_gpt":0.26834868803193457,"score_spread":0.26006388241347417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414051275","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.06431068,0.0007150058,0.9283938,0.0018750541,0.0006457394,0.00021153338,0.00002358382,0.00007984197,0.0037448015],"genre_scores_gemma":[0.98528284,0.000017054399,0.013129808,0.00063332095,0.000074930795,0.000019085439,0.00011111729,0.0000070628193,0.0007247704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826634,0.00010741537,0.00047428292,0.00037105905,0.00049490674,0.00028601766],"domain_scores_gemma":[0.99824977,0.0007836978,0.00017106422,0.00038739445,0.0003406585,0.000067412126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043934112,0.0001694217,0.0001874394,0.00039397317,0.00041403365,0.00018934665,0.00080466457,0.000056230016,0.00001674471],"category_scores_gemma":[0.00013176953,0.00013525285,0.00015110697,0.0018728091,0.000106898515,0.0003165754,0.00032313014,0.0001385581,0.000027040642],"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.000037590915,0.00013268334,0.0033580607,0.00004319555,0.00013191806,0.0000028158606,0.0001491321,0.11972484,0.0002718597,0.7760232,0.0074479277,0.09267675],"study_design_scores_gemma":[0.0012278513,0.00012308868,0.11763789,0.00006032641,0.00002446196,0.000015988066,0.000081119906,0.58792084,0.0016737906,0.24959746,0.041258264,0.00037893295],"about_ca_topic_score_codex":0.000015502279,"about_ca_topic_score_gemma":0.0000051552756,"teacher_disagreement_score":0.92097217,"about_ca_system_score_codex":0.00005272185,"about_ca_system_score_gemma":0.00023682584,"threshold_uncertainty_score":0.55154514},"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":"W4414581248","doi":"10.61091/jcmcc127-03","title":"Computation of independent fixed geodetic number of graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geodetic datum; Vertex (graph theory); Geodesic; Graph; Computation; Set (abstract data type); Maximal independent set","score_opus":0.010870710636366944,"score_gpt":0.2733781605311413,"score_spread":0.2625074498947743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414581248","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.60488313,0.00023287616,0.38621086,0.00009842697,0.0076723117,0.00016546108,9.714726e-7,0.000016841479,0.000719093],"genre_scores_gemma":[0.9658499,0.000021542308,0.033948608,0.000016139227,0.00014755191,8.6829016e-7,0.0000010857639,0.000008231125,0.00000608869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728465,0.00013704544,0.0014737484,0.00019626702,0.00071968744,0.00018859725],"domain_scores_gemma":[0.9961913,0.0007298713,0.0015288962,0.000220623,0.0012420105,0.00008726673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014623007,0.00019839949,0.0006967307,0.00041323068,0.0001264646,0.00010021694,0.0005549223,0.00012641189,0.000002672211],"category_scores_gemma":[0.0003371835,0.00018877868,0.00019633789,0.000905586,0.00007826542,0.00028256534,0.00030120488,0.00025868585,6.7444205e-7],"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.00004213204,0.0005107504,0.00053192326,0.0002984216,0.00012144266,0.0000039801726,0.0006101782,0.0011218255,0.001376215,0.98960555,0.000099973804,0.005677625],"study_design_scores_gemma":[0.0030992322,0.0003530421,0.0010435337,0.00050393894,0.000075964446,0.00004899397,0.00010397284,0.05526868,0.006393189,0.93286765,0.000072546434,0.00016925928],"about_ca_topic_score_codex":0.000008206271,"about_ca_topic_score_gemma":1.8301553e-7,"teacher_disagreement_score":0.36096674,"about_ca_system_score_codex":0.000046294856,"about_ca_system_score_gemma":0.0002771024,"threshold_uncertainty_score":0.7698171},"labels":[],"label_agreement":null},{"id":"W4415113082","doi":"10.7155/jgaa.v29i3.3003","title":"On k-planar Graphs without Short Cycles","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","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 Ottawa; Carleton University","funders":"Hellenic Foundation for Research and Innovation; Austrian Science Fund; Deutsche Forschungsgemeinschaft","keywords":"Upper and lower bounds; Constant (computer programming); Girth (graph theory); Graph; Crossing number (knot theory); Plane (geometry)","score_opus":0.01072175382599901,"score_gpt":0.27643784271796806,"score_spread":0.26571608889196907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415113082","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.013285732,0.00056825776,0.9836309,0.0011477597,0.00013756062,0.00011592385,0.0000030598317,0.000018420282,0.0010923682],"genre_scores_gemma":[0.8732596,0.0004894397,0.124935426,0.0008777279,0.00016390359,0.000037429607,0.0000053955073,0.00000549671,0.00022556454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932164,0.000020482974,0.00025468288,0.00014160197,0.000174075,0.00008754371],"domain_scores_gemma":[0.9994239,0.00009492293,0.00009286715,0.0001526934,0.00016622996,0.00006937261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021240795,0.00007797143,0.0001229229,0.0004060239,0.00018739088,0.00009310677,0.00025333444,0.000032642616,0.0000017073841],"category_scores_gemma":[0.000009526062,0.00006483437,0.000069879585,0.000682842,0.000034879107,0.00017519841,0.0000234117,0.00011593124,0.0000015938506],"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.000005419622,0.00010105942,0.00055233977,0.0000066602333,0.000043671207,0.0000017876664,0.000031559728,0.00061697495,0.00042780003,0.69989896,0.0015702905,0.29674348],"study_design_scores_gemma":[0.000604118,0.00024470285,0.031088052,0.000070750866,0.000052798503,0.000115963216,0.0000493383,0.017923705,0.0016946931,0.90617925,0.041744847,0.00023176384],"about_ca_topic_score_codex":0.000001878851,"about_ca_topic_score_gemma":0.0000013335875,"teacher_disagreement_score":0.8599739,"about_ca_system_score_codex":0.000010089813,"about_ca_system_score_gemma":0.0000539993,"threshold_uncertainty_score":0.2643869},"labels":[],"label_agreement":null},{"id":"W4416019587","doi":"10.48550/arxiv.2511.03234","title":"The structure of $Δ(1, 2, 2)$-free tournaments","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Government of Ontario","keywords":"Tournament; Upper and lower bounds; Transitive relation; Homogeneous; Set (abstract data type); Digraph","score_opus":0.02741895405864358,"score_gpt":0.2756879313285779,"score_spread":0.2482689772699343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416019587","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.82878506,0.0023783979,0.15290402,0.0037975567,0.009660045,0.00072296115,0.00014147676,0.000052934636,0.0015575739],"genre_scores_gemma":[0.98724586,0.00065116375,0.00624126,0.00042279056,0.0005860708,0.00001013821,0.00004057746,0.000011630893,0.0047904816],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9963251,0.00031748644,0.0010759113,0.0009428663,0.00086637336,0.00047226774],"domain_scores_gemma":[0.9952336,0.0005778311,0.00085335324,0.0023983903,0.0007977007,0.00013913287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054629904,0.0004640724,0.00048474944,0.00024152854,0.00074763986,0.00030398907,0.00409362,0.0003300952,0.00009422368],"category_scores_gemma":[0.00049602793,0.0003707757,0.00032841973,0.0009972241,0.00018787022,0.00027725482,0.0043894313,0.0008647164,0.000028457995],"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.00030217116,0.0007493751,0.15648276,0.0011636657,0.0021983061,0.000038129765,0.005640559,0.24801642,0.027245495,0.12402481,0.022749275,0.41138905],"study_design_scores_gemma":[0.0029061541,0.00045952998,0.52586967,0.0013360239,0.00037999765,0.000042896674,0.00021227679,0.12612182,0.111501865,0.14655091,0.08281008,0.0018087475],"about_ca_topic_score_codex":0.000057074656,"about_ca_topic_score_gemma":0.00006745315,"teacher_disagreement_score":0.4095803,"about_ca_system_score_codex":0.00013855482,"about_ca_system_score_gemma":0.0009824682,"threshold_uncertainty_score":0.9998744},"labels":[],"label_agreement":null},{"id":"W4416063433","doi":"10.1007/s00453-025-01355-3","title":"On computing vertex connectivity of 1-planar graphs","year":2025,"lang":"en","type":"article","venue":"Algorithmica","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Neighbourhood (mathematics); Vertex (graph theory); Planar graph; Wheel graph; Feedback vertex set; 1-planar graph; Independent set; Graph","score_opus":0.007721240663744617,"score_gpt":0.2508667515147121,"score_spread":0.2431455108509675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416063433","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.08639447,0.00005223515,0.9086258,0.00054046686,0.0005807063,0.00008153711,0.0000026418638,0.0000629291,0.003659262],"genre_scores_gemma":[0.9639188,0.000001915738,0.03550831,0.00044190994,0.000017213599,0.0000017372088,0.000005248652,0.000002039064,0.00010283587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999292,0.00005275206,0.00015629291,0.00022852143,0.00015479284,0.00011561283],"domain_scores_gemma":[0.99918354,0.000413253,0.00005674896,0.00023022492,0.00008847548,0.00002774041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018878396,0.00007551061,0.00012124392,0.00020044562,0.00009245992,0.000028236123,0.00028788083,0.000034225428,0.0000042879865],"category_scores_gemma":[0.00006959052,0.00007544591,0.000050546623,0.0006632011,0.000023404971,0.00009649282,0.00006151604,0.00007506055,0.000011446991],"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.0000047849953,0.00007244506,0.000078538185,0.000009580109,0.00002283512,0.0000021416126,0.00005730605,0.0013166136,0.00067099626,0.81331885,0.0019634916,0.18248242],"study_design_scores_gemma":[0.0006390987,0.00018058813,0.016396489,0.00006920943,0.00001042278,0.000006153147,0.000011577434,0.59811866,0.02660412,0.35611188,0.0016611641,0.00019059314],"about_ca_topic_score_codex":0.000016499424,"about_ca_topic_score_gemma":0.0000018180798,"teacher_disagreement_score":0.8775243,"about_ca_system_score_codex":0.000019166433,"about_ca_system_score_gemma":0.00006347043,"threshold_uncertainty_score":0.3076595},"labels":[],"label_agreement":null},{"id":"W4416155004","doi":"10.1007/s00373-025-02990-x","title":"On the d-independence number in 1-planar graphs","year":2025,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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; University of Waterloo","funders":"","keywords":"Degree (music); Upper and lower bounds; Vertex (graph theory); Planar graph; Graph; Independent set; 1-planar graph; Plane (geometry)","score_opus":0.008663963256194446,"score_gpt":0.23374193039480787,"score_spread":0.22507796713861342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416155004","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.9157355,0.0005198936,0.054740757,0.0048158406,0.0014420447,0.0002907605,0.0000018653409,0.000106744614,0.022346582],"genre_scores_gemma":[0.9983677,0.00007837309,0.00022386541,0.0009771063,0.0000027665333,0.00001557164,0.0000012600767,0.0000018377331,0.00033146652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926466,0.000054597298,0.00012439443,0.00022348213,0.00019990533,0.00013297428],"domain_scores_gemma":[0.9994176,0.00024466726,0.000029621826,0.00022562353,0.00005304268,0.00002945724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002961541,0.000085421656,0.00008014006,0.00016090788,0.00016045864,0.000105712505,0.00031626047,0.000047871305,0.0000046049868],"category_scores_gemma":[0.000035781086,0.000064380954,0.000030490764,0.0013788944,0.000024915518,0.0001173351,0.00006171688,0.00015740735,0.000008516033],"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.0000025157965,0.00004639435,0.0044029225,0.000004061818,0.0000047680305,0.0000041423086,0.00006263791,0.000047748264,0.0000123558175,0.99015164,0.0017335681,0.00352725],"study_design_scores_gemma":[0.00020978496,0.000026437378,0.021878231,0.000016533797,0.0000018899092,0.000003305815,0.000015759175,0.0045666895,0.00015081424,0.9718881,0.0011677989,0.00007465508],"about_ca_topic_score_codex":0.000021034142,"about_ca_topic_score_gemma":0.0000094087945,"teacher_disagreement_score":0.08263224,"about_ca_system_score_codex":0.000014318869,"about_ca_system_score_gemma":0.000041102954,"threshold_uncertainty_score":0.2625379},"labels":[],"label_agreement":null},{"id":"W4416301408","doi":"10.1017/s089006042510019x","title":"Sampling balanced high-quality data to train an automatic mesh generator","year":2025,"lang":"en","type":"article","venue":"Artificial intelligence for engineering design analysis and manufacturing","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Train; Generator (circuit theory); Feed forward; Artificial neural network; Function (biology); Sampling (signal processing); Feature (linguistics)","score_opus":0.10930031470776796,"score_gpt":0.3472569671947144,"score_spread":0.23795665248694642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416301408","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.08670333,0.000041837466,0.9123223,0.00025608015,0.0002370058,0.00027218097,0.000013854347,0.0001512429,0.0000021745923],"genre_scores_gemma":[0.6023629,0.000004359518,0.39737228,0.00010818424,0.00005903047,0.000028056496,0.000046143083,0.0000049459486,0.0000141346345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983878,0.00005408177,0.00047673393,0.00064639136,0.00016803341,0.00026694298],"domain_scores_gemma":[0.99872094,0.0003731179,0.00006486566,0.000649822,0.000064367065,0.00012688564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001152835,0.00017679685,0.00029792913,0.00058568467,0.00019423313,0.00040771495,0.0006577528,0.00005247492,0.000007112269],"category_scores_gemma":[0.0001704848,0.0001809866,0.000071643946,0.0008318087,0.000010646257,0.00046246612,0.00017833349,0.00007263592,0.0000029257787],"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.0000065549707,0.000026615891,0.0000040530585,0.000026831854,0.00017575183,5.290018e-7,0.000139604,0.71303576,0.016962757,0.041427005,0.000016483327,0.22817805],"study_design_scores_gemma":[0.000021108834,0.00003212705,0.000732356,0.000011402979,0.00008970971,3.3600892e-7,0.000020129884,0.8071211,0.18641202,0.0051879887,0.00019885377,0.00017283196],"about_ca_topic_score_codex":0.0000503019,"about_ca_topic_score_gemma":0.00004361342,"teacher_disagreement_score":0.5156595,"about_ca_system_score_codex":0.000037945174,"about_ca_system_score_gemma":0.00004165383,"threshold_uncertainty_score":0.73804194},"labels":[],"label_agreement":null},{"id":"W4416613396","doi":"10.1016/j.procs.2025.10.318","title":"Computational aspects of disks enclosing many points","year":2025,"lang":"en","type":"article","venue":"Procedia Computer Science","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia, Innovación y Universidades","keywords":"Constant (computer programming); Convex polygon; Geodesic; Regular polygon; Polygon (computer graphics); Set (abstract data type); Time complexity; Position (finance)","score_opus":0.010886475354295324,"score_gpt":0.2656692797546746,"score_spread":0.25478280440037926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416613396","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.0317188,0.00010278401,0.96163434,0.0010212308,0.0011286489,0.0001798837,0.0000014315307,0.000120373166,0.004092488],"genre_scores_gemma":[0.68673575,0.0000024080064,0.3127156,0.00043796704,0.0000653001,0.0000062259637,0.000002296553,0.0000024801132,0.00003198618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979365,0.000034154586,0.000372567,0.0006347942,0.0007075077,0.0003144716],"domain_scores_gemma":[0.9985741,0.00020182163,0.00014725343,0.0003579863,0.00061483384,0.000104005114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006956179,0.00015067327,0.00018380677,0.000659022,0.0003183764,0.00027456405,0.0014177653,0.000036796184,0.000005984814],"category_scores_gemma":[0.000104232386,0.00014956247,0.000060895673,0.0031966362,0.00026818804,0.0010712914,0.00067436486,0.00010937176,0.00001642074],"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.0000035866158,0.000099730496,0.00062533707,0.00004486184,0.000009693046,0.0000029771002,0.00031300777,0.037074015,0.0013541791,0.8672237,0.00035285862,0.092896044],"study_design_scores_gemma":[0.00023615044,0.000053685035,0.01604916,0.000059059166,0.0000038473213,0.000015522539,0.000003211235,0.8333929,0.011558252,0.13819526,0.0002908523,0.00014207799],"about_ca_topic_score_codex":0.0000044427657,"about_ca_topic_score_gemma":7.973281e-7,"teacher_disagreement_score":0.7963189,"about_ca_system_score_codex":0.00007885113,"about_ca_system_score_gemma":0.000927774,"threshold_uncertainty_score":0.60989803},"labels":[],"label_agreement":null},{"id":"W4416944779","doi":"10.3390/math13233837","title":"Bidirectional Algorithms for Polygon Triangulations and (m + 2)-Angulations via Fuss–Catalan Numbers","year":2025,"lang":"en","type":"article","venue":"Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Scalability; Polygon (computer graphics); Bijection, injection and surjection; Regular polygon; Decomposition; Representation (politics); Convex polygon","score_opus":0.021014482608716075,"score_gpt":0.2964100398423746,"score_spread":0.2753955572336585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416944779","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.0044740373,0.00009360145,0.99111307,0.0020768421,0.00035521982,0.00028925095,0.000012933156,0.00009985735,0.0014851714],"genre_scores_gemma":[0.12362476,0.0000056853564,0.8699837,0.0003790947,0.00014673804,0.00010560763,0.00008668026,0.000009068069,0.0056586796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933636,0.000015394533,0.00021978685,0.00018982163,0.00012514154,0.000113506314],"domain_scores_gemma":[0.99918365,0.0004166523,0.0000639572,0.00018758402,0.00010713063,0.000041002786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001995395,0.00008706388,0.00010958787,0.00019367982,0.00025620026,0.00011030508,0.00013577165,0.000044254673,0.000009402932],"category_scores_gemma":[0.000120126395,0.000087287015,0.00005028731,0.00048413203,0.00002198295,0.00018609369,0.000057098034,0.00003934921,0.0000071902377],"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.0000046606333,0.00020248024,0.0001340683,0.00010127068,0.00007914663,5.6681995e-7,0.0012027137,0.003276421,0.0011570716,0.8933909,0.0053056255,0.09514507],"study_design_scores_gemma":[0.00040271372,0.000020551312,0.0017596369,0.000019077457,0.000023005961,0.000012514141,0.00003311395,0.77188545,0.00096418336,0.21662688,0.00813522,0.000117667274],"about_ca_topic_score_codex":0.0000060171096,"about_ca_topic_score_gemma":0.000009699589,"teacher_disagreement_score":0.768609,"about_ca_system_score_codex":0.000029329853,"about_ca_system_score_gemma":0.000064349566,"threshold_uncertainty_score":0.3559461},"labels":[],"label_agreement":null},{"id":"W4417065333","doi":"10.4230/lipics.wads.2025.8","title":"Tight Bounds on the Number of Closest Pairs in Vertical Slabs","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","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 Ottawa; Carleton University; University of Windsor","funders":"","keywords":"Bounded function; Hyperplane; Sequence (biology); Sublinear function; Point (geometry); Set (abstract data type); Upper and lower bounds","score_opus":0.04224242943834912,"score_gpt":0.2983540573565235,"score_spread":0.2561116279181744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417065333","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.96106166,0.00006556766,0.02540355,0.003961826,0.00109823,0.00019738809,0.0000058238143,0.000043687978,0.0081622815],"genre_scores_gemma":[0.99679804,0.000020024974,0.0013802487,0.0007481131,0.00011940276,0.000033407374,0.000016283688,0.0000045053516,0.00087996345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998617,0.00015235148,0.00033363065,0.00042540915,0.00029842262,0.00017319269],"domain_scores_gemma":[0.9987105,0.00042898508,0.00007041158,0.00064432557,0.00010722676,0.00003852687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003990397,0.00016077443,0.0002030431,0.00012132102,0.00006829448,0.00006192126,0.0007843057,0.00014271153,0.000054799395],"category_scores_gemma":[0.00016378156,0.00012481184,0.00010125565,0.00048262207,0.000053709864,0.00007961138,0.0006981546,0.00043123096,0.000107089676],"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.00004874905,0.00043145465,0.4559328,0.00019225544,0.00012010856,0.000031764892,0.0012501656,0.014232728,0.00048457613,0.51090616,0.00672491,0.009644324],"study_design_scores_gemma":[0.00057034264,0.0000884446,0.8564295,0.00050815754,0.00003059623,0.0000070063943,0.000028612822,0.074564524,0.014129378,0.04172717,0.011368722,0.000547511],"about_ca_topic_score_codex":0.000048187518,"about_ca_topic_score_gemma":0.000022529128,"teacher_disagreement_score":0.469179,"about_ca_system_score_codex":0.00006573631,"about_ca_system_score_gemma":0.00030037522,"threshold_uncertainty_score":0.5089679},"labels":[],"label_agreement":null},{"id":"W4417082046","doi":"10.4230/lipics.isaac.2025.46","title":"Realizing Metric Spaces with Convex Obstacles","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","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 Ottawa","funders":"","keywords":"Disjoint sets; Geodesic; Convexity; Metric space; Metric (unit); Regular polygon; Space (punctuation); Distortion (music); Obstacle","score_opus":0.025634833959504676,"score_gpt":0.2641116875135682,"score_spread":0.23847685355406356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417082046","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.55390614,0.00047554015,0.43922743,0.0013448272,0.00022115292,0.00007953641,6.306973e-7,0.000113711554,0.0046310485],"genre_scores_gemma":[0.9857102,0.000024541858,0.011920739,0.00063275924,0.0000529408,0.000009058523,0.000005394897,0.000003592137,0.0016407644],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99922657,0.000039563234,0.00013032046,0.00027903236,0.00016952986,0.00015496816],"domain_scores_gemma":[0.99937767,0.00015335511,0.00005447692,0.00025897357,0.000112407375,0.00004313619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015994001,0.000092681585,0.00010886713,0.0002816205,0.00014902114,0.00011562659,0.0003048817,0.00003158236,0.000008733628],"category_scores_gemma":[0.0000624243,0.00007778874,0.000028416738,0.0016808528,0.000026087759,0.00033397434,0.00010155438,0.0000728797,0.000042228854],"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.00003325981,0.00017827384,0.5019482,0.00008693866,0.00017383692,0.000049900536,0.00061949436,0.01018137,0.005850077,0.40328723,0.0067854496,0.070806],"study_design_scores_gemma":[0.0008511212,0.00016910749,0.8762132,0.00008983015,0.000032998352,0.000015207679,0.00017995674,0.03108788,0.023395197,0.0038231427,0.06373784,0.0004045166],"about_ca_topic_score_codex":0.00003538952,"about_ca_topic_score_gemma":0.000016615422,"teacher_disagreement_score":0.4318041,"about_ca_system_score_codex":0.000029234965,"about_ca_system_score_gemma":0.00010773338,"threshold_uncertainty_score":0.3172133},"labels":[],"label_agreement":null},{"id":"W46362923","doi":"","title":"Reconstructing points on a circle from labeled distances","year":2009,"lang":"en","type":"article","venue":"","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":"McGill University; University of New Brunswick","funders":"","keywords":"Unit circle; Embedding; Geodesic; Circumference; Mathematics; Great circle; Combinatorics; Set (abstract data type); Constraint (computer-aided design); Polynomial; Geometry; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.012265507687528956,"score_gpt":0.23729564244109835,"score_spread":0.2250301347535694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46362923","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.3888282,0.000038153994,0.5956679,0.0025570786,0.0003259889,0.000050546874,0.0000014696195,0.00013626604,0.012394421],"genre_scores_gemma":[0.8741413,0.0000019176684,0.12431732,0.0012702312,0.00009235271,9.926357e-7,0.00000471235,0.0000011258558,0.00017007161],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999409,0.000024656156,0.0001119276,0.00021936827,0.00013813617,0.00009689881],"domain_scores_gemma":[0.9996392,0.000091356465,0.00003800013,0.00015887617,0.00003368161,0.00003887211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008769718,0.000052755302,0.0000625298,0.00004821236,0.00008658721,0.000104040046,0.00019205085,0.00001854428,0.000045619356],"category_scores_gemma":[0.000033234475,0.000051191335,0.000023381024,0.00023275764,0.00000615624,0.00025794707,0.00001729952,0.000044662924,0.000076416414],"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.000006339194,0.000047722657,0.00020126365,6.8576264e-7,0.000005923066,0.000003900948,0.00016294952,0.0007644495,0.0023135212,0.14655177,0.000612722,0.84932876],"study_design_scores_gemma":[0.0012438591,0.00042185563,0.054479577,0.000059742844,0.000006290716,0.000017948954,0.00008140091,0.37565976,0.058331493,0.5034403,0.0056819106,0.00057584624],"about_ca_topic_score_codex":0.000007435976,"about_ca_topic_score_gemma":0.000004042665,"teacher_disagreement_score":0.8487529,"about_ca_system_score_codex":0.0000153432,"about_ca_system_score_gemma":0.000020786982,"threshold_uncertainty_score":0.20875221},"labels":[],"label_agreement":null},{"id":"W46586926","doi":"","title":"Obstruction Sets for Outer-Bananas-Surface Graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Surface (topology); Geometry; Combinatorics","score_opus":0.016359707072415897,"score_gpt":0.25557876359767573,"score_spread":0.23921905652525982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46586926","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.7514677,0.00012132386,0.24067533,0.0011571799,0.005784145,0.00029726882,0.00000421542,0.00018754732,0.00030531434],"genre_scores_gemma":[0.9458192,0.000006909191,0.053847395,0.00017555735,0.000014303374,0.000017610233,0.00002082938,0.000008152182,0.0000900194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902743,0.000023149854,0.00019059838,0.00032808524,0.0002199457,0.00021076886],"domain_scores_gemma":[0.9993249,0.000061192644,0.00008011255,0.0002936928,0.00015971149,0.00008037023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018185793,0.00012035626,0.00012171096,0.000084800035,0.00020585481,0.00011955296,0.00034850507,0.000060966086,0.0000027945994],"category_scores_gemma":[0.000034660785,0.00012796528,0.000082058155,0.0004929974,0.000019700037,0.00047589547,0.00006327484,0.000068813366,0.000027919505],"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.000004588601,0.000056119927,0.000074619835,0.000008297705,0.000013934776,0.0000025312481,0.00017041138,0.009231292,0.00067187374,0.981802,0.00071828294,0.0072460705],"study_design_scores_gemma":[0.0010626107,0.00013398362,0.001648144,0.000009312072,0.000006355585,0.000015074764,0.000011541484,0.006806023,0.008147521,0.9793099,0.0026769005,0.00017259954],"about_ca_topic_score_codex":0.000015861113,"about_ca_topic_score_gemma":0.0000035263463,"teacher_disagreement_score":0.19435155,"about_ca_system_score_codex":0.000077860255,"about_ca_system_score_gemma":0.000086663276,"threshold_uncertainty_score":0.5218273},"labels":[],"label_agreement":null},{"id":"W571512295","doi":"10.1016/j.tcs.2015.06.010","title":"Improved parameterized and exact algorithms for cut problems on trees","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","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 Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Parameterized complexity; Algorithm; Mathematics; Computer science","score_opus":0.03578921010753701,"score_gpt":0.2855609249262834,"score_spread":0.24977171481874638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W571512295","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.035693787,0.000025716983,0.9616813,0.0010752274,0.0006180552,0.00038701322,0.0000025427248,0.00012605479,0.00039030853],"genre_scores_gemma":[0.6790429,0.000001743629,0.3203383,0.00043805043,0.00012914099,0.000026381065,0.0000020511154,0.000004607322,0.000016874958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819547,0.0000703225,0.00022157142,0.0006803572,0.00045153144,0.0003807239],"domain_scores_gemma":[0.99856025,0.00036672663,0.00006329592,0.00039454518,0.00026923983,0.00034593022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014937588,0.00016328106,0.00017964504,0.0001850425,0.00025749646,0.00053439266,0.0008500497,0.00004224563,0.0000022290315],"category_scores_gemma":[0.0001822844,0.00012918492,0.000043868742,0.000653449,0.0007414943,0.00054017984,0.00036669796,0.000090392634,0.000009148178],"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.000026996357,0.00006457581,0.0000041735098,0.0000053841277,0.0000036888284,0.0000012603518,0.00036963087,0.0017968394,0.0016152939,0.84228534,0.000057891564,0.15376894],"study_design_scores_gemma":[0.0006191986,0.00095718773,0.00012977458,0.000011626419,0.0000030093374,0.000018852576,0.000003915379,0.85756326,0.0041407878,0.13595788,0.00042745308,0.00016704403],"about_ca_topic_score_codex":0.0000019136162,"about_ca_topic_score_gemma":6.0368205e-7,"teacher_disagreement_score":0.8557664,"about_ca_system_score_codex":0.000043592678,"about_ca_system_score_gemma":0.00014898699,"threshold_uncertainty_score":0.5268008},"labels":[],"label_agreement":null},{"id":"W607955037","doi":"","title":"SPAA '09 : proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures : August 11-13, 2009, Calgary, Alberta, Canada","year":2009,"lang":"en","type":"book","venue":"Association for Computing Machinery eBooks","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":"Parallelism (grammar); Computer science; History; Library science; Parallel computing","score_opus":0.00513833367918461,"score_gpt":0.20338700832823697,"score_spread":0.19824867464905235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W607955037","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15519801,0.0008815158,0.030756451,0.020614965,0.009812102,0.011763093,0.00080789434,0.00066126016,0.7695047],"genre_scores_gemma":[0.23909247,0.000012135706,0.0071431953,0.002860569,0.0016729684,0.00006351948,0.00023996376,0.00010982298,0.74880534],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732846,0.00006139952,0.0007151129,0.0006677888,0.0007968586,0.0004303606],"domain_scores_gemma":[0.9973132,0.00097166403,0.0010515531,0.0002231434,0.00034316065,0.00009729038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068059616,0.00041612645,0.0005224006,0.000290683,0.0003628493,0.00014805242,0.00070566876,0.0002748011,0.0000010494338],"category_scores_gemma":[0.00018979183,0.00036634578,0.00017063579,0.00017234302,0.000031855638,0.00006826402,0.00026654155,0.0005050469,6.006998e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013478556,0.00038148148,0.011335764,0.000842347,0.0005933454,0.000014537612,0.009234147,0.15420868,0.000079216356,0.16294754,0.5069074,0.15332079],"study_design_scores_gemma":[0.0039037568,0.000696319,0.067715466,0.0013760763,0.00019976968,0.000051395407,0.000044367956,0.49925497,0.00040517823,0.03933123,0.38476002,0.0022614584],"about_ca_topic_score_codex":0.042734724,"about_ca_topic_score_gemma":0.19047886,"teacher_disagreement_score":0.34504628,"about_ca_system_score_codex":0.0007535479,"about_ca_system_score_gemma":0.0008623356,"threshold_uncertainty_score":0.9998788},"labels":[],"label_agreement":null},{"id":"W60875001","doi":"10.1023/a:1015648719133","title":"Finding Specified Sections of Arrangements: 2D Results","year":2002,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","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":"Simon Fraser University; McGill University; Queen's University; Carleton University","funders":"McGill University","keywords":"Computer science; Class (philosophy); Motion (physics); Line (geometry); Mathematics; Combinatorics; Geometry; Artificial intelligence","score_opus":0.08735776650559834,"score_gpt":0.2715975922062917,"score_spread":0.18423982570069336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W60875001","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.024567358,0.00025106783,0.97338945,0.0005841168,0.00016505351,0.000037497117,0.0000016514002,0.00000893088,0.0009948518],"genre_scores_gemma":[0.5317371,0.00014766293,0.46762285,0.0000224085,0.00017849542,6.12537e-7,3.622635e-7,0.0000035380185,0.00028698726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897045,0.000032354757,0.00050806685,0.00010127629,0.00029293614,0.00009489364],"domain_scores_gemma":[0.9991777,0.00023222358,0.00026070568,0.00010165125,0.0001568651,0.00007084158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053147954,0.00006857863,0.00018044453,0.00015294396,0.00007180875,0.000054428816,0.00013718502,0.00003128607,0.000013303641],"category_scores_gemma":[0.00006825645,0.000054836255,0.00006708788,0.0002118016,0.000021121503,0.00025022076,0.000030282634,0.000114800976,0.0000049537985],"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.000040484236,0.0008001585,0.000004575445,0.00015980635,0.00015162877,0.00003214307,0.0063740793,0.818932,0.0006594027,0.08433262,0.0016824389,0.08683063],"study_design_scores_gemma":[0.00037782156,0.00010747588,0.0000069397074,0.00008680818,0.000011429784,0.000084944215,0.00004394749,0.93675053,0.000771261,0.061435338,0.0002681011,0.000055381446],"about_ca_topic_score_codex":4.577952e-7,"about_ca_topic_score_gemma":4.1402934e-8,"teacher_disagreement_score":0.5071697,"about_ca_system_score_codex":0.000012000511,"about_ca_system_score_gemma":0.00000911741,"threshold_uncertainty_score":0.22361577},"labels":[],"label_agreement":null},{"id":"W610176538","doi":"","title":"On k-enclosing objects in a coloured point set","year":2013,"lang":"en","type":"article","venue":"RECERCAT (Consorci de Serveis Universitaris de Catalunya)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University","funders":"European Social Fund; Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Combinatorics; Point (geometry); Set (abstract data type); Object (grammar); Mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.011089866832774782,"score_gpt":0.2188658944858277,"score_spread":0.20777602765305292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W610176538","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.9451644,0.00013136285,0.04421071,0.0030387118,0.00022833626,0.00042260264,0.000009954545,0.0001651125,0.006628812],"genre_scores_gemma":[0.98458064,0.00003322799,0.013452291,0.0009963154,0.000040885272,0.000012241707,0.000052045296,0.00001305535,0.0008192806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831575,0.00021919624,0.00022632378,0.0004935244,0.0002565678,0.00048864516],"domain_scores_gemma":[0.9987679,0.00030767426,0.00009916409,0.00044330792,0.00015665137,0.00022527097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042124005,0.00020543746,0.00020925495,0.0006833553,0.00019405257,0.00019176517,0.00067738246,0.00015719299,0.00017629607],"category_scores_gemma":[0.00012548099,0.00023741275,0.00009540156,0.0013635685,0.000041563602,0.0009884489,0.00022019872,0.00029812238,0.00026563296],"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.00040622873,0.0017694149,0.03586003,0.00035487645,0.00045857995,0.0011997535,0.03780575,0.27728933,0.03686954,0.39444646,0.11894789,0.09459215],"study_design_scores_gemma":[0.005210369,0.0010255756,0.15720394,0.00040465198,0.00007514731,0.00041447178,0.0034094932,0.71483415,0.031739272,0.07520039,0.008359358,0.002123177],"about_ca_topic_score_codex":0.0009516649,"about_ca_topic_score_gemma":0.00020655479,"teacher_disagreement_score":0.43754482,"about_ca_system_score_codex":0.00089510885,"about_ca_system_score_gemma":0.00038127962,"threshold_uncertainty_score":0.96814114},"labels":[],"label_agreement":null},{"id":"W61962611","doi":"","title":"The Upper Forcing Geodetic Number of a Graph","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Geodetic datum; Forcing (mathematics); Graph; Combinatorics; Geodesy; Geology; Mathematical analysis","score_opus":0.012217817210371512,"score_gpt":0.23500609841401046,"score_spread":0.22278828120363894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61962611","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.95418274,0.00064579555,0.031096594,0.0014683059,0.0029432955,0.00017571545,7.756856e-7,0.00009040563,0.0093963845],"genre_scores_gemma":[0.99684274,0.00003489809,0.0024409585,0.00008407606,0.000007998911,0.0000083161185,6.96778e-7,0.000003900463,0.0005763882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992524,0.000046278125,0.00017144387,0.00014950246,0.0002301486,0.00015023128],"domain_scores_gemma":[0.9992874,0.00020123887,0.00006966512,0.00029900158,0.000104413906,0.00003824345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019988958,0.00006839573,0.000077191726,0.00003982916,0.00019780571,0.00006978182,0.00039052384,0.000027164884,0.000027949234],"category_scores_gemma":[0.000046352274,0.00005293326,0.000058363028,0.0004630064,0.000031953743,0.0001952631,0.0000918586,0.000064585,0.000073489704],"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":[9.932414e-7,0.000036491067,0.001198583,0.000003164331,0.0000095145715,9.848101e-7,0.00021537623,0.00016449147,0.0001041081,0.9845858,0.0020043817,0.011676097],"study_design_scores_gemma":[0.00038407784,0.000043244647,0.004229636,0.00001155445,0.0000054722705,0.000017436088,0.000014903163,0.077956,0.0018359838,0.91022193,0.005160742,0.00011901884],"about_ca_topic_score_codex":0.000006832107,"about_ca_topic_score_gemma":0.0000010677329,"teacher_disagreement_score":0.07779151,"about_ca_system_score_codex":0.000013166017,"about_ca_system_score_gemma":0.000012845367,"threshold_uncertainty_score":0.21585557},"labels":[],"label_agreement":null},{"id":"W62907451","doi":"","title":"Minimum Sets Forcing Monochromatic Triangles.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Forcing (mathematics); Mathematics; Mathematical analysis; Optics; Physics","score_opus":0.011488348016456039,"score_gpt":0.23527003978978508,"score_spread":0.22378169177332904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62907451","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.9025397,0.00031139917,0.08728528,0.000701549,0.0026240589,0.00023320371,0.0000013044208,0.00025918463,0.00604437],"genre_scores_gemma":[0.98696303,0.0000018806239,0.012372626,0.00012452592,0.000025090178,0.000015456977,0.00001530345,0.000007584472,0.00047448906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989443,0.000054684824,0.00025279794,0.0002704497,0.0002617844,0.00021602798],"domain_scores_gemma":[0.99933034,0.00013048874,0.00009059817,0.0003122333,0.00008035564,0.00005596868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023155395,0.000118372496,0.00013675718,0.00012931318,0.00015300795,0.00015422827,0.00037567408,0.00004997252,0.000011597065],"category_scores_gemma":[0.000033726756,0.00012221886,0.000062817206,0.00053327816,0.000015618763,0.00041521055,0.00009976132,0.000068898415,0.000098174736],"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.0000027282788,0.00009273988,0.00021542406,0.00001126558,0.000008651956,0.000012250765,0.00009600081,0.0012597688,0.0012773651,0.98150563,0.007953649,0.0075645256],"study_design_scores_gemma":[0.00093116437,0.000069900365,0.0057093776,0.00001562448,0.0000066735647,0.000017246397,0.0000067413257,0.12544578,0.004704761,0.86117303,0.0017148836,0.00020478967],"about_ca_topic_score_codex":0.000028905511,"about_ca_topic_score_gemma":0.0000041401017,"teacher_disagreement_score":0.12418602,"about_ca_system_score_codex":0.000055083823,"about_ca_system_score_gemma":0.00006715924,"threshold_uncertainty_score":0.498394},"labels":[],"label_agreement":null},{"id":"W64555105","doi":"","title":"On the Face Lattice of a Poset Polyhedron.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polyhedron; Partially ordered set; Lattice (music); Mathematics; Face (sociological concept); Combinatorics; Pure mathematics; Physics; Linguistics; Philosophy","score_opus":0.01596850881010932,"score_gpt":0.24533619197354686,"score_spread":0.22936768316343753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64555105","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.97160476,0.00009651339,0.018755728,0.0036740692,0.0010285312,0.00013047777,0.0000014353204,0.000051218973,0.0046572858],"genre_scores_gemma":[0.9982889,0.0000083272425,0.0007322098,0.00053515413,0.0000070153455,0.0000054693064,0.0000023591685,0.0000035499427,0.00041701432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924386,0.00007196681,0.00013684537,0.00016451452,0.00025887165,0.00012395355],"domain_scores_gemma":[0.9991073,0.0003538837,0.00006928129,0.00035531085,0.00007720571,0.000037039583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025820188,0.00007425726,0.000080053316,0.000059365364,0.00009767039,0.00004295871,0.0004722508,0.000028592971,0.000024220151],"category_scores_gemma":[0.00009139592,0.000055643475,0.00003995566,0.0005265073,0.000022923798,0.0001473173,0.00008893197,0.0000796628,0.000071011185],"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.000005347797,0.00007047255,0.00011715582,0.0000016271933,0.000008252116,0.0000027873944,0.000198151,0.00047988893,0.00029942405,0.9940507,0.0022891522,0.002477062],"study_design_scores_gemma":[0.0004409789,0.00022961696,0.0061069718,0.000015815727,0.0000055639653,0.00001664465,0.000034561916,0.027907765,0.0052812374,0.9553588,0.0044639027,0.00013815355],"about_ca_topic_score_codex":0.00001015365,"about_ca_topic_score_gemma":0.0000010640653,"teacher_disagreement_score":0.038691893,"about_ca_system_score_codex":0.000018093762,"about_ca_system_score_gemma":0.0000413336,"threshold_uncertainty_score":0.2269075},"labels":[],"label_agreement":null},{"id":"W6888428011","doi":"10.20382/jocg.v16i1a7","title":"Simplification of polyline bundles of graphs and trees","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bundle; Line segment; Vertex (graph theory); Generalization; Path (computing); Set (abstract data type); Hausdorff distance","score_opus":0.014307294734958093,"score_gpt":0.22466723407896474,"score_spread":0.21035993934400665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888428011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69783914,0.00013618376,0.3011677,0.00042446412,0.0001507237,0.000050438197,0.000010929214,0.00002082642,0.00019958177],"genre_scores_gemma":[0.97869325,0.000110702276,0.020942314,0.00002538174,0.000033950233,7.428078e-8,0.000015612244,0.000004343394,0.00017435882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99871475,0.00007844554,0.0004430582,0.00015085458,0.00050123397,0.00011168021],"domain_scores_gemma":[0.9978475,0.0004832883,0.0006541171,0.000118536285,0.0008084326,0.00008814877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041368656,0.00009921918,0.00025383953,0.002339223,0.00007389941,0.000024228784,0.00038175704,0.000052541225,0.0000078829125],"category_scores_gemma":[0.00008649618,0.00010367533,0.00012618575,0.003277733,0.00008692795,0.0005512287,0.000113604525,0.00009563308,0.0000019480658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000128824,0.00025182532,0.008008954,0.00010159648,0.00024597105,0.000038834005,0.00056586537,0.5544515,0.009077857,0.38583282,0.00092753506,0.040368397],"study_design_scores_gemma":[0.0036050766,0.0014166862,0.6272811,0.00019497887,0.00014896835,0.00022355634,0.0008637196,0.22455454,0.010437554,0.12416325,0.006586742,0.0005238345],"about_ca_topic_score_codex":0.000008763039,"about_ca_topic_score_gemma":0.0000020395921,"teacher_disagreement_score":0.6192722,"about_ca_system_score_codex":0.000030115738,"about_ca_system_score_gemma":0.00017319154,"threshold_uncertainty_score":0.42277572},"labels":[],"label_agreement":null},{"id":"W6888461022","doi":"10.20382/jocg.v12i2a5","title":"The Stretch Factor of Hexagon-Delaunay Triangulations","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Delaunay triangulation; Equilateral triangle; Upper and lower bounds; Voronoi diagram; Polygon (computer graphics); Square (algebra); Triangulation; Pitteway triangulation","score_opus":0.011484366665485916,"score_gpt":0.21031590607306858,"score_spread":0.19883153940758266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888461022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51468635,0.0003009054,0.48169833,0.0016100835,0.0009578296,0.00012418164,0.00003451179,0.000020762036,0.00056703365],"genre_scores_gemma":[0.98628134,0.000017937537,0.012917199,0.0000784486,0.000100573016,3.823603e-7,0.000011382513,0.0000059712315,0.0005867873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788934,0.00028634194,0.00049719034,0.00016628217,0.0009927765,0.00016809488],"domain_scores_gemma":[0.9971079,0.0010203916,0.0007884322,0.00019284635,0.00078582607,0.000104572035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005613242,0.000116792304,0.00021345384,0.001043442,0.0006757814,0.000073378535,0.001046142,0.000032400945,0.00014220591],"category_scores_gemma":[0.00010201949,0.0001072368,0.00024325223,0.0026705822,0.00006864188,0.0005427917,0.00030767595,0.00028515322,0.0000025883178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010592534,0.00018039177,0.0007248529,0.000007712643,0.00017301633,0.000041214356,0.00040818565,0.8027123,0.00029153665,0.15801203,0.0016153479,0.035727467],"study_design_scores_gemma":[0.0067162756,0.0023990104,0.08325923,0.00004788205,0.00016692847,0.00079527934,0.0027550147,0.4572484,0.0015415484,0.07786022,0.3662834,0.00092682894],"about_ca_topic_score_codex":0.000005845799,"about_ca_topic_score_gemma":0.0000016340379,"teacher_disagreement_score":0.47159496,"about_ca_system_score_codex":0.00020524775,"about_ca_system_score_gemma":0.0005839046,"threshold_uncertainty_score":0.51976323},"labels":[],"label_agreement":null},{"id":"W6888484399","doi":"10.20382/jocg.v15i2a4","title":"On the geometric thickness of 2-degenerate graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Geometric graph theory; Vertex (graph theory); Spatial network; Geometric shape; Geometric modeling; Geometric networks; Graph; Geometric data analysis; Plane (geometry); Geometric design","score_opus":0.010248179830771975,"score_gpt":0.21364375133575592,"score_spread":0.20339557150498394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888484399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25295758,0.00020339963,0.74067754,0.0020138829,0.00069074647,0.000097624026,0.0000053753474,0.000017379178,0.0033364347],"genre_scores_gemma":[0.9847063,0.000042772535,0.0135635,0.00064014667,0.00005277043,2.5335746e-7,0.000004444232,0.000004933298,0.0009848739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981244,0.00023789678,0.0004889634,0.00021654047,0.0007561728,0.0001759812],"domain_scores_gemma":[0.9959887,0.0017369224,0.0006007399,0.00024905225,0.0013425394,0.00008202378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008250113,0.0001612082,0.00029304405,0.0039183,0.00023679838,0.00008484461,0.0011516305,0.00007905804,0.000035411944],"category_scores_gemma":[0.0002841843,0.00013100801,0.00026479654,0.008449479,0.000094775925,0.0004750495,0.00017561967,0.0003013306,0.0000070050714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005157443,0.00012208533,0.00021551934,0.000014980107,0.00013039567,0.000019923737,0.00004377384,0.34520766,0.00019283615,0.6450694,0.0026863643,0.0062454455],"study_design_scores_gemma":[0.0064746724,0.0018870331,0.062508665,0.0005693902,0.00033339116,0.00029082663,0.00057881244,0.1571746,0.015448098,0.7001492,0.053492628,0.0010926758],"about_ca_topic_score_codex":0.000004901476,"about_ca_topic_score_gemma":8.705906e-7,"teacher_disagreement_score":0.7317487,"about_ca_system_score_codex":0.00011239758,"about_ca_system_score_gemma":0.0005038,"threshold_uncertainty_score":0.5342352},"labels":[],"label_agreement":null},{"id":"W6888493691","doi":"10.20382/jocg.v16i1a4","title":"Geometric hitting set for line-constrained disks and related problems","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Point (geometry); Plane (geometry); Quadratic equation; Running time; Hitting time; Computational geometry; Square (algebra)","score_opus":0.024080537216046093,"score_gpt":0.24109867560120543,"score_spread":0.21701813838515935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888493691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25696453,0.0001401518,0.74027437,0.0013457347,0.00054012,0.00020360333,0.00002002617,0.0000927071,0.00041874667],"genre_scores_gemma":[0.95747143,0.00006287787,0.04099575,0.00008288234,0.00015638678,7.1970237e-7,0.000055995763,0.000012437666,0.0011614922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998304,0.00009190842,0.00051614066,0.00029674024,0.0005199522,0.00027124092],"domain_scores_gemma":[0.9971519,0.0011449459,0.0005493304,0.00012094835,0.0008421472,0.0001907235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009380893,0.00017043587,0.0002940597,0.0036529708,0.00028590477,0.00014416236,0.00047364915,0.00009895141,0.000011680523],"category_scores_gemma":[0.00031526922,0.00018030805,0.00018824471,0.006123957,0.0000646923,0.0008905422,0.0001745727,0.0002183905,0.000009524003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041717158,0.00007912398,0.00068635267,0.00008485479,0.0002312608,0.00009793532,0.0005817079,0.8993479,0.00031704587,0.042684544,0.0013089117,0.054538663],"study_design_scores_gemma":[0.0052868314,0.0011166338,0.02116246,0.00014850033,0.0001264632,0.00074180163,0.00042286306,0.8731908,0.00038820543,0.071155496,0.025605228,0.00065470114],"about_ca_topic_score_codex":0.0000024034202,"about_ca_topic_score_gemma":5.672652e-7,"teacher_disagreement_score":0.7005069,"about_ca_system_score_codex":0.00009825595,"about_ca_system_score_gemma":0.00027323692,"threshold_uncertainty_score":0.73527485},"labels":[],"label_agreement":null},{"id":"W6888536549","doi":"10.20382/jocg.v13i1a15","title":"Orthogonal point location and rectangle stabbing queries in 3-d","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rectangle; Disjoint sets; Data structure; Point (geometry); Pointer (user interface); Point location; Upper and lower bounds","score_opus":0.007822135440358806,"score_gpt":0.19238386639733573,"score_spread":0.18456173095697692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888536549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46215716,0.0002746181,0.5356395,0.00096184073,0.00033286898,0.000076991804,0.0000050107797,0.000018353116,0.00053362147],"genre_scores_gemma":[0.9700776,0.000023696663,0.029441554,0.00019280596,0.000060170652,4.6118822e-7,0.000011370612,0.000005323198,0.00018704441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984626,0.00022485244,0.00034771423,0.00020741815,0.0006050312,0.00015237533],"domain_scores_gemma":[0.9987621,0.00030776416,0.0003500943,0.00009225366,0.00039466514,0.000093135626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006898119,0.00010901115,0.00018923149,0.0017987589,0.0002720581,0.0000734371,0.0003745037,0.000029833122,0.00003826501],"category_scores_gemma":[0.00006927506,0.00013049567,0.00006643641,0.0027370949,0.000038890954,0.0009771528,0.00028488704,0.00028665442,0.0000013670974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090239846,0.0001299343,0.0027234624,0.0000151017375,0.000034746776,0.00015976046,0.0005778259,0.8341995,0.00018376512,0.1487687,0.00027095256,0.012846043],"study_design_scores_gemma":[0.008588046,0.002702861,0.25895816,0.00017066966,0.00008747877,0.003452787,0.005538653,0.5257769,0.0005082075,0.09297171,0.0998031,0.0014413744],"about_ca_topic_score_codex":0.000010672764,"about_ca_topic_score_gemma":0.0000067005453,"teacher_disagreement_score":0.50792044,"about_ca_system_score_codex":0.00030284998,"about_ca_system_score_gemma":0.0004220723,"threshold_uncertainty_score":0.53214586},"labels":[],"label_agreement":null},{"id":"W6888537253","doi":"10.20382/jocg.v7i2","title":"Journal of Computational Geometry, Vol. 7 No. 2 (2016): Special Issue of Selected Papers from SoCG 2015","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Special section; Key (lock)","score_opus":0.012001306892397479,"score_gpt":0.2206147639986438,"score_spread":0.20861345710624632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888537253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26642382,0.0006048075,0.7210189,0.0010744566,0.006964465,0.00021505446,0.00009270132,0.000039196493,0.003566603],"genre_scores_gemma":[0.73694205,0.00010005304,0.2505764,0.00042359286,0.009789833,3.0396984e-7,0.00014482507,0.000041240422,0.0019816887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99515957,0.00039536715,0.0014152011,0.00035540652,0.00232436,0.0003500969],"domain_scores_gemma":[0.9803743,0.0010059559,0.0025445474,0.00023266063,0.015299729,0.00054284703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00118562,0.00034169352,0.0008194654,0.0031374977,0.00016642705,0.00014592288,0.0014448469,0.00020169513,0.00040424106],"category_scores_gemma":[0.0011360401,0.00035366236,0.0004307918,0.0042307507,0.00017930227,0.0016279749,0.00026464585,0.0005631789,0.000058056863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005841308,0.00056477793,0.0015813947,0.000030940653,0.00066795613,0.0002004113,0.00064397417,0.8515722,0.00040836475,0.0035605915,0.127738,0.012447235],"study_design_scores_gemma":[0.022351244,0.006239471,0.075058594,0.00055241835,0.000733724,0.0012303458,0.0017018594,0.16256218,0.0026154907,0.05438918,0.6705116,0.0020539223],"about_ca_topic_score_codex":0.000030596104,"about_ca_topic_score_gemma":0.000003894354,"teacher_disagreement_score":0.68901,"about_ca_system_score_codex":0.00046362038,"about_ca_system_score_gemma":0.0028223135,"threshold_uncertainty_score":0.9998915},"labels":[],"label_agreement":null},{"id":"W6902403641","doi":"10.6084/m9.figshare.c.3306165","title":"Half a century (1954–2009) of dissection data of sea urchins from the North American Pacific coast (Mexico–Canada)","year":2016,"lang":"en","type":"other","venue":"Figshare","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Intertidal zone; Gonad; Marine invertebrates; Pacific ocean; Invertebrate","score_opus":0.03050628900777876,"score_gpt":0.24903682472438565,"score_spread":0.21853053571660688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6902403641","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015229009,0.0008759807,0.0050304015,0.00041297317,0.0006129218,0.00039596303,0.97494936,0.000087016866,0.017483098],"genre_scores_gemma":[0.14946504,0.00015807575,0.0036356791,0.00037962638,0.001997207,0.00008231153,0.814353,0.00023246986,0.02969663],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986244,0.00008569966,0.00023004056,0.00041438092,0.00049914856,0.000146339],"domain_scores_gemma":[0.9979795,0.00022790904,0.00053177006,0.0011070481,0.000093465394,0.000060296978],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000041153693,0.00017268998,0.00023648891,0.00009185126,0.00005548627,0.00003508201,0.0013974758,0.000048009235,0.0078244675],"category_scores_gemma":[0.00016210717,0.000121079465,0.000048246897,0.00043809626,0.000020342313,0.000112718924,0.0004466164,0.000116060735,0.00006202055],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033166407,0.000022862494,0.00031061893,0.000034033645,0.000043870394,0.0000026578552,0.000043636777,0.00004059569,0.000006746464,0.000023189388,0.96117324,0.038295235],"study_design_scores_gemma":[0.00010491797,0.00002754753,0.011593039,0.00057122606,0.000009703243,0.0000031321438,0.000019962039,0.0024988998,0.000066684996,0.000012497367,0.98492193,0.000170466],"about_ca_topic_score_codex":0.026575783,"about_ca_topic_score_gemma":0.30503356,"teacher_disagreement_score":0.27845776,"about_ca_system_score_codex":0.000030151083,"about_ca_system_score_gemma":0.00049296865,"threshold_uncertainty_score":0.9930825},"labels":[],"label_agreement":null},{"id":"W6903538174","doi":"10.1184/r1/6610865.v1","title":"Three-dimensional strong convexity and visibility","year":2018,"lang":"en","type":"article","venue":"Figshare","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Information Technology Research Centre","keywords":"Convexity; Intersection (aeronautics); Convex set; Regular polygon; Convex analysis; Convex hull; Boundary (topology); Visibility","score_opus":0.048583220075904446,"score_gpt":0.27906685955255744,"score_spread":0.230483639476653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903538174","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.3177205,0.0019221345,0.5760045,0.004299259,0.002352428,0.0021028551,0.07856815,0.0017270119,0.015303148],"genre_scores_gemma":[0.9846256,8.658619e-8,0.01099896,0.0003814243,0.00026144975,0.000014960559,0.0036575173,0.0000031757695,0.00005685817],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994129,0.000015350877,0.00008215059,0.00024170746,0.00014672095,0.00010115326],"domain_scores_gemma":[0.99948865,0.00007571039,0.000032030595,0.00018096519,0.00016253653,0.000060121987],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006310183,0.000059432874,0.000053739554,0.00003171454,0.00012761654,0.000077256314,0.00015569021,0.000029733492,0.011220196],"category_scores_gemma":[0.00016052609,0.000055922887,0.000017422717,0.0001497829,0.000010752758,0.00026633253,0.00020794298,0.00004751385,0.00058010605],"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.000023583618,0.00014893728,0.0010338118,0.000101571226,0.000037134963,0.000015063219,0.0003106229,0.000435749,0.0005733932,0.018000772,0.7103617,0.26895764],"study_design_scores_gemma":[0.00033919892,0.00016867653,0.11689823,0.00012003615,0.0000021476021,0.000023707209,0.0000018155471,0.82828677,0.0032116747,0.009995257,0.040710848,0.00024164161],"about_ca_topic_score_codex":0.0000037239315,"about_ca_topic_score_gemma":0.000026187805,"teacher_disagreement_score":0.827851,"about_ca_system_score_codex":0.000011358743,"about_ca_system_score_gemma":0.000055380664,"threshold_uncertainty_score":0.9896837},"labels":[],"label_agreement":null},{"id":"W6907382603","doi":"10.20382/jocg.v3i1","title":"Journal of Computational Geometry, Vol. 3 No. 1 (2012)","year":2012,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Key (lock); Feature (linguistics); Field (mathematics); Set (abstract data type)","score_opus":0.013373719029095756,"score_gpt":0.22047722181624024,"score_spread":0.20710350278714448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6907382603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16062255,0.0008809034,0.8320045,0.00044721048,0.004620863,0.00011279539,0.000015064462,0.000029423907,0.0012667065],"genre_scores_gemma":[0.8063114,0.00006724034,0.1897019,0.0003875736,0.0023632862,1.968948e-7,0.000023735438,0.000021742291,0.0011228961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958223,0.00033335737,0.0011983904,0.00026062768,0.0018825834,0.00050272193],"domain_scores_gemma":[0.9880841,0.0010455489,0.0020408481,0.00023271526,0.008008576,0.000588217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017398067,0.00032754012,0.00062878284,0.0038205218,0.00028774852,0.00018013763,0.0013759339,0.00017083375,0.00028283717],"category_scores_gemma":[0.00067625544,0.00033302474,0.0005397716,0.0034754851,0.00012964834,0.0041941735,0.0002803762,0.0006116933,0.0000939979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026328114,0.0009427984,0.004884882,0.000064793414,0.0006131329,0.00015967988,0.00046571935,0.89048994,0.00023234007,0.043962386,0.037977967,0.0199431],"study_design_scores_gemma":[0.01252428,0.0035209635,0.16731976,0.00043240224,0.0005980562,0.0053522317,0.00073622935,0.11862575,0.0011873204,0.044181816,0.6433223,0.0021989003],"about_ca_topic_score_codex":0.000004050053,"about_ca_topic_score_gemma":5.627932e-7,"teacher_disagreement_score":0.7718642,"about_ca_system_score_codex":0.00039585878,"about_ca_system_score_gemma":0.00090835313,"threshold_uncertainty_score":0.9999122},"labels":[],"label_agreement":null},{"id":"W6907494475","doi":"10.20382/jocg.v16i2a1","title":"Discrete Fréchet distance oracles","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Oracle; Sublinear function; Path (computing); Constant (computer programming); Focus (optics); Construct (python library); Graph; Computational geometry","score_opus":0.006357200739715545,"score_gpt":0.22265187343626697,"score_spread":0.21629467269655142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6907494475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04193411,0.0003165764,0.9500809,0.0017464949,0.0007241145,0.000071100185,0.000006967132,0.000039934792,0.005079826],"genre_scores_gemma":[0.9138658,0.000041358482,0.08270416,0.00042299376,0.00012415028,1.6853856e-7,0.000011181909,0.000005499771,0.002824695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849254,0.0001227525,0.00040960943,0.00024278139,0.00054197956,0.00019033342],"domain_scores_gemma":[0.9980435,0.00041421765,0.0003994236,0.00018900508,0.00083138695,0.00012247862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036075327,0.00015509695,0.0002629738,0.0016367211,0.0002177192,0.00014980313,0.0008822336,0.00007036962,0.000024713845],"category_scores_gemma":[0.00010291558,0.00016084364,0.00020159243,0.003087605,0.000066191446,0.001104801,0.0001932913,0.000234236,0.0000110248975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008281732,0.00012910721,0.0014110239,0.00002972374,0.00016844666,0.00012160997,0.000103834434,0.38562676,0.00017005457,0.58474654,0.004083956,0.023326132],"study_design_scores_gemma":[0.0043657855,0.00052853354,0.062467553,0.00033363665,0.00016430073,0.00024886033,0.0004029113,0.19620766,0.0016834842,0.1768181,0.5559076,0.0008715618],"about_ca_topic_score_codex":0.000003871687,"about_ca_topic_score_gemma":0.0000027080698,"teacher_disagreement_score":0.8719317,"about_ca_system_score_codex":0.00018923366,"about_ca_system_score_gemma":0.0004738659,"threshold_uncertainty_score":0.6559013},"labels":[],"label_agreement":null},{"id":"W6910364688","doi":"10.4230/lipics.socg.2025.18","title":"Finding a Shortest Curve That Separates Few Objects from Many","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Disjoint sets; Polygon (computer graphics); Graph; Line segment; Polygonal chain; Monotone polygon; Set (abstract data type); Shortest path problem","score_opus":0.021849879915498065,"score_gpt":0.2837568478144151,"score_spread":0.26190696789891704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910364688","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.21576357,0.00019649614,0.77264017,0.0005250613,0.0019992895,0.0008112993,0.00024296147,0.00027891705,0.0075422516],"genre_scores_gemma":[0.95526165,0.000032439173,0.04083235,0.0017639899,0.00015588543,0.00010518539,0.0007479154,0.000016566202,0.0010840475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978269,0.000044755143,0.0007558733,0.00037245717,0.00044324703,0.000556819],"domain_scores_gemma":[0.99829656,0.00039091642,0.0002860043,0.0006407867,0.00024353093,0.0001421886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042898307,0.00035007304,0.00037375046,0.00044930656,0.00047179044,0.0008633077,0.0010561235,0.00017722957,0.00002962686],"category_scores_gemma":[0.00009614007,0.0003362578,0.00021158742,0.0007684108,0.000053353087,0.0019347433,0.00048811047,0.00028527388,0.00015143858],"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.00047265587,0.002198422,0.10240615,0.001740284,0.002360789,0.00006646538,0.06784237,0.03057584,0.0019462894,0.4434309,0.12955543,0.2174044],"study_design_scores_gemma":[0.0033371614,0.00021851646,0.014672107,0.0004344146,0.000082584535,0.000029649325,0.0009280223,0.86836106,0.013379658,0.021550156,0.07597295,0.001033746],"about_ca_topic_score_codex":0.00002890219,"about_ca_topic_score_gemma":0.00003991782,"teacher_disagreement_score":0.8377852,"about_ca_system_score_codex":0.00014565652,"about_ca_system_score_gemma":0.00019492119,"threshold_uncertainty_score":0.9999089},"labels":[],"label_agreement":null},{"id":"W6910424147","doi":"10.4224/8914055","title":"Probing View Plan Solution Space","year":2005,"lang":"en","type":"article","venue":"NPARC","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Plan (archaeology); Set (abstract data type); Object (grammar); Space (punctuation); Topology (electrical circuits)","score_opus":0.02352849159124586,"score_gpt":0.24476430020922105,"score_spread":0.22123580861797518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910424147","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.0097718,0.00009277737,0.96474403,0.007338604,0.0001923913,0.00008837811,4.2353537e-7,0.000114917435,0.017656693],"genre_scores_gemma":[0.79798496,0.000008441051,0.20061356,0.00038356258,0.00023105285,0.0000073398396,0.0000044096714,0.0000024198273,0.0007642824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994553,0.00002516294,0.00009079894,0.0001602276,0.00014699479,0.00012153584],"domain_scores_gemma":[0.9997285,0.000023193406,0.000031680047,0.00013863276,0.000037389058,0.00004062467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015676516,0.000052335363,0.00005039197,0.000056924742,0.00009716046,0.00006729087,0.00017677904,0.000021561998,0.000048856],"category_scores_gemma":[0.000012224407,0.000051254643,0.000022221517,0.00022018304,0.0000073288643,0.00034621332,0.000058577043,0.000048957532,0.00018098221],"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.0000024934761,0.000049126666,0.000027685823,0.000010625855,0.000006047702,0.0000019246966,0.00053994777,0.0071107624,0.044596437,0.31715688,0.010717833,0.61978024],"study_design_scores_gemma":[0.00025409213,0.000049473114,0.00069091475,0.00002178388,0.0000034259335,0.000031421747,0.000005102176,0.7041325,0.01999746,0.018092547,0.2565376,0.00018369581],"about_ca_topic_score_codex":0.0000010473121,"about_ca_topic_score_gemma":0.0000044987937,"teacher_disagreement_score":0.78821313,"about_ca_system_score_codex":0.000033012628,"about_ca_system_score_gemma":0.00004008355,"threshold_uncertainty_score":0.23262206},"labels":[],"label_agreement":null},{"id":"W6910514991","doi":"10.4230/lipics.gd.2024.27","title":"On k-Planar Graphs Without Short Cycles","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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 Ottawa; Carleton University","funders":"Austrian Science Fund","keywords":"Upper and lower bounds; Constant (computer programming); Graph; Crossing number (knot theory); Plane (geometry); Enhanced Data Rates for GSM Evolution","score_opus":0.01657954039253932,"score_gpt":0.2767311172570973,"score_spread":0.260151576864558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910514991","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.13363867,0.00015946239,0.85285866,0.0006989647,0.0026245876,0.00077022915,0.00020805173,0.00065028126,0.008391075],"genre_scores_gemma":[0.9654618,0.000033857268,0.031792026,0.0014100552,0.00020622114,0.00009488468,0.0004492619,0.000030040614,0.00052184355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979121,0.000028594382,0.0006711895,0.0003416685,0.000570563,0.00047584713],"domain_scores_gemma":[0.9988518,0.00021036323,0.00008508096,0.0005257364,0.00015466445,0.0001723829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047452908,0.00031273204,0.0002644955,0.0005386944,0.00029339865,0.00087533897,0.0007603589,0.00013694455,0.000020705435],"category_scores_gemma":[0.000045916255,0.00027111822,0.00022460237,0.0006259859,0.000053424865,0.0015748189,0.00013443278,0.00030512857,0.0003127693],"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.0000688099,0.00025737917,0.0010033508,0.0005509314,0.00026167225,0.000022275226,0.0047549275,0.0037966126,0.00020396335,0.8341288,0.030446313,0.12450495],"study_design_scores_gemma":[0.0010095728,0.00054252177,0.0012838829,0.00034361225,0.00004555444,0.00015765805,0.00018169692,0.77889735,0.0024361042,0.043986276,0.17026274,0.00085302326],"about_ca_topic_score_codex":0.0000040531527,"about_ca_topic_score_gemma":0.000007011763,"teacher_disagreement_score":0.83182317,"about_ca_system_score_codex":0.00008367802,"about_ca_system_score_gemma":0.00010086189,"threshold_uncertainty_score":0.9999741},"labels":[],"label_agreement":null},{"id":"W6910539861","doi":"10.48550/arxiv.1310.7696","title":"Delaunay stability via perturbations","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Canadian Association of Emergency Physicians","funders":"","keywords":"Delaunay triangulation; Pitteway triangulation; Bowyer–Watson algorithm; Constrained Delaunay triangulation; Minimum-weight triangulation; Stability (learning theory); Chew's second algorithm; Perturbation (astronomy); Surface triangulation","score_opus":0.07831803102655872,"score_gpt":0.18125669296300312,"score_spread":0.1029386619364444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910539861","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.26261166,0.00004553345,0.7346076,0.00019687315,0.00057951035,0.00023408032,0.000007795088,0.00017538742,0.0015416085],"genre_scores_gemma":[0.9903835,0.0000311475,0.0077346256,0.0001365943,0.00010311211,0.0000026832965,0.000060378963,0.000008364612,0.0015395837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984004,0.00015143323,0.00019351603,0.00091258227,0.000108173066,0.0002339],"domain_scores_gemma":[0.99818283,0.00015163563,0.0001650269,0.0009720736,0.0003696221,0.00015877887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002094221,0.00022568244,0.00019872667,0.00021671032,0.00020949007,0.00017087246,0.0010904459,0.00020054443,0.00017628049],"category_scores_gemma":[0.000047348112,0.00026047812,0.00016639214,0.0006090451,0.00006062914,0.000561786,0.001184496,0.00036575925,0.00027386352],"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.0000069691732,0.00017665549,0.00095264224,0.000051013678,0.00007344231,0.000028069597,0.00035263295,0.5895135,0.0002601267,0.40280142,0.0012214315,0.004562117],"study_design_scores_gemma":[0.00014272888,0.000023645556,0.0026521205,0.00001145639,0.000020940155,0.0000027474186,0.000012411262,0.847284,0.0002554965,0.1484242,0.0008972303,0.00027301963],"about_ca_topic_score_codex":0.00012021396,"about_ca_topic_score_gemma":0.000030125419,"teacher_disagreement_score":0.7277719,"about_ca_system_score_codex":0.00020267515,"about_ca_system_score_gemma":0.00024604218,"threshold_uncertainty_score":0.99998474},"labels":[],"label_agreement":null},{"id":"W6917338802","doi":"10.57717/cgt.v3i1.24","title":"StreamTable: An Area Proportional Visualization for Tables with Flowing Streams","year":2022,"lang":"en","type":"article","venue":"Computing in Geometry and Topology","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 Saskatchewan","funders":"","keywords":"Row; Permutation (music); Rectangle; Row and column spaces; Adjacency list; Quadratic equation; Intersection (aeronautics); Visualization","score_opus":0.017738838599784548,"score_gpt":0.2760043336792384,"score_spread":0.25826549507945384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6917338802","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.51606476,0.000102500824,0.4832203,0.000134326,0.00022313728,0.00015024055,0.0000065940358,0.000044544988,0.000053613487],"genre_scores_gemma":[0.96942806,0.0000029312137,0.029954437,0.00018149031,0.00011397833,0.000036955662,0.00021178165,0.000007849234,0.00006253516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987783,0.000105876396,0.00024411357,0.0004482339,0.00016571574,0.0002577559],"domain_scores_gemma":[0.9993985,0.00021945676,0.00007856992,0.00016208125,0.00008338186,0.000057984562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053412135,0.000118780044,0.00016644393,0.00032287187,0.0005377426,0.00007619478,0.00023713922,0.000038989157,0.000032072174],"category_scores_gemma":[0.000048934704,0.00012149768,0.000020477115,0.00096127193,0.00004206027,0.0003000428,0.00021586577,0.0001169035,2.9669164e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006714576,0.00038211158,0.033456683,0.00004986536,0.000028459232,0.000021858776,0.00080292614,0.63649136,0.00028441867,0.2255036,0.00012246447,0.10278912],"study_design_scores_gemma":[0.00071686145,0.0007131593,0.008201345,0.000010844147,0.000006252323,0.00015053798,0.00024566162,0.98242414,0.00026489818,0.0057408414,0.0013308881,0.00019455937],"about_ca_topic_score_codex":0.00003323844,"about_ca_topic_score_gemma":0.000022042557,"teacher_disagreement_score":0.4533633,"about_ca_system_score_codex":0.000054031007,"about_ca_system_score_gemma":0.000106307525,"threshold_uncertainty_score":0.49545315},"labels":[],"label_agreement":null},{"id":"W6930393647","doi":"10.5281/zenodo.12086247","title":"Gläser laudel experteninterviews und qualitative inhaltsanalyse pdf","year":2024,"lang":"de","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Qualitative analysis; Gloom; Limiting","score_opus":0.07564156514038191,"score_gpt":0.33854314118658674,"score_spread":0.26290157604620484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930393647","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013901327,0.010728158,0.3058765,0.0024131543,0.0016017925,0.0009741532,0.0003829441,0.0010810816,0.67680323],"genre_scores_gemma":[0.01909003,0.0012295675,0.007896277,0.0011964361,0.0029646233,6.002177e-7,0.008511967,0.008459383,0.9506511],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99432623,0.0018195258,0.0007746781,0.0014598296,0.0009937879,0.00062596326],"domain_scores_gemma":[0.99713063,0.00008426067,0.0003891559,0.0010133173,0.001008053,0.0003745606],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019538691,0.0005177441,0.0005046914,0.0011622725,0.0014160987,0.0035745907,0.0025241198,0.00026015937,0.13332224],"category_scores_gemma":[0.00059757323,0.00053175463,0.00028181067,0.0021240192,0.0002545609,0.0004605062,0.0028867403,0.0007221309,0.4751115],"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.000028284494,0.00019591326,3.803694e-8,0.00026115426,0.0005044976,0.00006025373,0.014503813,0.00019954995,0.0003631584,0.01880403,0.8812843,0.08379502],"study_design_scores_gemma":[0.00040844607,0.0003109136,0.000005716243,0.0003325525,0.00013390195,0.000076216966,0.0008373284,0.010183036,0.00013027982,0.0020406977,0.9849883,0.0005526169],"about_ca_topic_score_codex":0.00004020597,"about_ca_topic_score_gemma":0.0000029993112,"teacher_disagreement_score":0.34178928,"about_ca_system_score_codex":0.00033098267,"about_ca_system_score_gemma":0.000024268595,"threshold_uncertainty_score":0.99988395},"labels":[],"label_agreement":null},{"id":"W6930542625","doi":"10.5281/zenodo.14191746","title":"Guardian Blood Balance CANADA: Natural Support for Healthy Blood Sugar Levels","year":2024,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Blood sugar; Balance (ability); Ginseng; Sugar; Insulin; Artificial Sweetener; Blood pressure","score_opus":0.025227930412122884,"score_gpt":0.25237840708509107,"score_spread":0.2271504766729682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930542625","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007099094,0.0005946254,0.009431766,0.002275855,0.0017778013,0.0008936683,0.98326236,0.00051400857,0.0011788992],"genre_scores_gemma":[0.0018966153,0.00011502845,0.0016744353,0.0010458293,0.0007998027,4.131106e-7,0.99269325,0.00055965205,0.0012149997],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99704367,0.00022537829,0.00045299917,0.0009323732,0.0007581687,0.0005873895],"domain_scores_gemma":[0.99782073,0.00008074783,0.00019293276,0.00082523987,0.0008065879,0.00027375986],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006921783,0.00030615798,0.00030312873,0.00039096858,0.0016355155,0.0014542699,0.0023978148,0.00013543137,0.0014554306],"category_scores_gemma":[0.0004759271,0.0003312181,0.000109239416,0.0009394662,0.000058973605,0.00031026007,0.001463801,0.00055477076,0.003062606],"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.000015593589,0.000087011096,5.459533e-8,0.0002859877,0.00011839346,0.000060794915,0.000061000384,0.000105665735,0.000105616906,0.0012767747,0.9920431,0.0058400496],"study_design_scores_gemma":[0.00050218526,0.00034068717,0.000026478767,0.00004485486,0.00007178759,0.00029456872,0.00001221865,0.00087600073,0.00012578245,0.00020480543,0.99715227,0.00034833347],"about_ca_topic_score_codex":0.0018338325,"about_ca_topic_score_gemma":0.0007074717,"teacher_disagreement_score":0.00943084,"about_ca_system_score_codex":0.00023525211,"about_ca_system_score_gemma":0.0002099792,"threshold_uncertainty_score":0.999914},"labels":[],"label_agreement":null},{"id":"W6930857670","doi":"10.5281/zenodo.15262625","title":"Perilampus minasgerais Yoo and Darling 2025, sp. nov.","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Royal Ontario Museum","funders":"","keywords":"Iridescence; Simple eye in invertebrates; Holotype; Dorsum; Pedicel; Groove (engineering); Scape","score_opus":0.024862829927118017,"score_gpt":0.2531491733713367,"score_spread":0.22828634344421866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930857670","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.037692726,0.00048347272,0.8305565,0.003689158,0.00041580744,0.00034337284,0.000021514319,0.0007950483,0.12600239],"genre_scores_gemma":[0.98618186,0.00007888807,0.00897829,0.0005650724,0.00013572174,5.3152146e-8,0.00027592172,0.0002095114,0.0035746717],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890435,0.00013334774,0.00016831554,0.00038017693,0.00021184477,0.00020197812],"domain_scores_gemma":[0.99918044,0.000036416597,0.000046893692,0.00030104545,0.00035060316,0.00008462425],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00044434197,0.00009519287,0.000092527174,0.00027729067,0.0015255896,0.0010883411,0.0006887686,0.000038458973,0.0007433999],"category_scores_gemma":[0.00027529395,0.00010444388,0.000027265696,0.00081434124,0.00006386128,0.0003639151,0.0011008889,0.0001313163,0.00066317234],"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.000027138793,0.00011535732,0.000012234613,0.00007932333,0.000046953952,0.000014382946,0.0014429733,0.00053940905,0.010249866,0.16595301,0.16501887,0.6565005],"study_design_scores_gemma":[0.000319618,0.0000683596,0.0012525945,0.000025251491,0.0000059389504,0.000047950012,0.00006709082,0.027534364,0.0011850159,0.0017498161,0.9676129,0.00013105325],"about_ca_topic_score_codex":0.0000045004645,"about_ca_topic_score_gemma":1.7288649e-7,"teacher_disagreement_score":0.9484891,"about_ca_system_score_codex":0.000055287757,"about_ca_system_score_gemma":0.0000078674275,"threshold_uncertainty_score":0.9999486},"labels":[],"label_agreement":null},{"id":"W6931271639","doi":"10.5281/zenodo.581705","title":"feelpp/feelpp: v0.103.2","year":2017,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Royal Canadian Military Institute","funders":"Horizon 2020 Framework Programme","keywords":"Finite element method; Natural language; Set (abstract data type); Element (criminal law); Identification (biology)","score_opus":0.03605261400483122,"score_gpt":0.2551897030975709,"score_spread":0.21913708909273966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931271639","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008405341,0.00032320851,0.18357779,0.00066659553,0.0004844018,0.0003320015,0.00010853752,0.001609116,0.81288993],"genre_scores_gemma":[0.0039559836,0.00035002147,0.00756242,0.00031534626,0.0013880263,1.16496224e-7,0.0029635206,0.005444745,0.97801983],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997882,0.00024815282,0.00020665526,0.00071275106,0.0005767242,0.0003736831],"domain_scores_gemma":[0.99787027,0.00001996802,0.00029617958,0.0012278728,0.00038629197,0.00019940408],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00052821694,0.0002449418,0.00022407115,0.00055789546,0.0020438584,0.0020813309,0.0031960087,0.00016901971,0.01201005],"category_scores_gemma":[0.00039243625,0.00026611192,0.000086247834,0.0004232058,0.000114245486,0.00032993162,0.002063818,0.00031169696,0.017413829],"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.0000037080665,0.0000445267,1.14647385e-7,0.000033813085,0.000033641052,0.000013138051,0.00009768661,0.000035164954,0.0001281021,0.011981915,0.78898805,0.19864012],"study_design_scores_gemma":[0.00029172518,0.0000940671,0.000041472354,0.00008013309,0.000009841935,0.000080154525,0.000006577084,0.0015526797,0.000083931984,0.0004392201,0.9970347,0.00028544862],"about_ca_topic_score_codex":0.00002711389,"about_ca_topic_score_gemma":0.0000012471141,"teacher_disagreement_score":0.20804669,"about_ca_system_score_codex":0.00010481483,"about_ca_system_score_gemma":0.0000132628165,"threshold_uncertainty_score":0.9999791},"labels":[],"label_agreement":null},{"id":"W6931382045","doi":"10.5281/zenodo.3777114","title":"Comparing policies for open data from publicly accessible international sources","year":2015,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Open data; Stewardship (theology); Scalability; Big data; Data source; Open source","score_opus":0.2852428100655305,"score_gpt":0.3517304868997658,"score_spread":0.06648767683423534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931382045","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.019037863,0.00011562329,0.90579224,0.0052249413,0.00057235203,0.0005413681,0.00042240933,0.0006322454,0.06766096],"genre_scores_gemma":[0.95232224,0.000015296595,0.03225093,0.0005611715,0.0006474697,2.1594506e-7,0.012614729,0.0003314123,0.0012565554],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985244,0.00013570445,0.0002219123,0.0005220041,0.00038020645,0.00021575125],"domain_scores_gemma":[0.9981868,0.000050742758,0.000118882104,0.00072453433,0.0007502438,0.00016878283],"candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010286528,0.0000969002,0.000115644754,0.00020889928,0.0010337085,0.0059146904,0.0076368256,0.00003224779,0.0005807411],"category_scores_gemma":[0.00076016487,0.00010183338,0.000021590076,0.00049834204,0.00004556194,0.002490577,0.010424237,0.00009621277,0.0008811465],"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.00008022452,0.00021823472,0.00013827554,0.000013283081,0.000096239644,0.0000027251058,0.001990967,0.0032862208,0.00067402096,0.07068052,0.78467965,0.13813962],"study_design_scores_gemma":[0.00062776415,0.000059610233,0.00090049213,0.000009164881,0.0000043406167,0.0000129204645,0.00015808827,0.13414992,0.0003101854,0.0031664914,0.86048096,0.00012004657],"about_ca_topic_score_codex":0.00015160919,"about_ca_topic_score_gemma":0.00000431902,"teacher_disagreement_score":0.93328434,"about_ca_system_score_codex":0.00008486534,"about_ca_system_score_gemma":0.000017594002,"threshold_uncertainty_score":0.99989676},"labels":[],"label_agreement":null},{"id":"W6931390822","doi":"10.5281/zenodo.4298267","title":"Fig. 62 in The 'red-tailed' Lasioglossum (Dialictus) (Hymenoptera: Halictidae) of the western Nearctic","year":2020,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","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 Manitoba","funders":"","keywords":"Nearctic ecozone; Scale (ratio); Dorsum; Taxonomy (biology)","score_opus":0.028132020125089034,"score_gpt":0.23741727270124313,"score_spread":0.2092852525761541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931390822","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.0003994074,0.00041037786,0.03816818,0.012318866,0.0007177282,0.0016403475,0.00021165612,0.0008013195,0.9453321],"genre_scores_gemma":[0.7723368,0.00046903148,0.0031745003,0.0060877223,0.002430554,0.0000012785476,0.0021494727,0.007347878,0.2060028],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99764836,0.000696232,0.00029958965,0.00045330264,0.00064817455,0.0002543492],"domain_scores_gemma":[0.9987125,0.000041772448,0.00023818892,0.000777039,0.0001556967,0.00007483554],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00052325486,0.00018860678,0.00019848246,0.00026530755,0.0005775153,0.00066005293,0.003008674,0.00009931704,0.0022278125],"category_scores_gemma":[0.00026111965,0.00013926691,0.00008512037,0.0013537721,0.000108588676,0.00015774123,0.0014605739,0.00036569982,0.0014114509],"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.000013811856,0.00013341867,0.000026245272,0.00011938025,0.000053011478,0.000012655961,0.0027006164,0.00023990765,0.00025513733,0.013039025,0.9547557,0.02865105],"study_design_scores_gemma":[0.00028177566,0.00009481089,0.0009970209,0.00007453625,0.000010727227,0.000035194123,0.000030458452,0.001013839,0.00006733385,0.00020311546,0.9970486,0.0001425791],"about_ca_topic_score_codex":0.000044605127,"about_ca_topic_score_gemma":0.0000049101864,"teacher_disagreement_score":0.7719374,"about_ca_system_score_codex":0.00006214747,"about_ca_system_score_gemma":0.00001382975,"threshold_uncertainty_score":0.99936604},"labels":[],"label_agreement":null},{"id":"W6931575610","doi":"10.5281/zenodo.8413124","title":"F I G U R E 1 in The nutritional importance of invertebrates to female Cebus capucinus imitator in a highly seasonal tropical dry forest","year":2019,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Alberta Children's Hospital; University of Calgary","funders":"","keywords":"Invertebrate; Energy density; Dry weight; Tropics; Linear regression; Population density; Functional response","score_opus":0.024436588828298574,"score_gpt":0.24004813164662733,"score_spread":0.21561154281832876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931575610","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.08831776,0.0018492482,0.14178003,0.017420357,0.0013425282,0.00640766,0.001589202,0.0011780619,0.74011517],"genre_scores_gemma":[0.887633,0.00020972732,0.017959304,0.0036949324,0.0013314828,0.0000027072272,0.003205216,0.0040206993,0.081942886],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814796,0.0003144159,0.00030140285,0.0004525755,0.0005273193,0.00025629593],"domain_scores_gemma":[0.99909717,0.000063660715,0.0001344658,0.00043314736,0.0001891699,0.00008235942],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00040267056,0.00015503554,0.0002026653,0.000581878,0.00016707463,0.00026229312,0.0014522417,0.00009455097,0.0016109708],"category_scores_gemma":[0.00024563426,0.00014276932,0.00005038898,0.0011990259,0.00005853358,0.00019444908,0.00054680463,0.00024368415,0.0014558933],"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.000040325383,0.0003126978,0.00042961445,0.0001465614,0.000022232809,0.00004317096,0.0010048876,0.00087952625,0.00019834342,0.060669236,0.92940813,0.0068452773],"study_design_scores_gemma":[0.00069789327,0.0002163088,0.013860046,0.00012887517,0.0000041411513,0.0000370659,0.00008273054,0.0063990676,0.000048872313,0.0006887909,0.9776143,0.00022190556],"about_ca_topic_score_codex":0.00003925652,"about_ca_topic_score_gemma":0.000031423355,"teacher_disagreement_score":0.7993153,"about_ca_system_score_codex":0.000103029066,"about_ca_system_score_gemma":0.000023368782,"threshold_uncertainty_score":0.9993216},"labels":[],"label_agreement":null},{"id":"W6931963002","doi":"10.5281/zenodo.8318023","title":"Thalidomide: The journey from curse to boon","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Thalidomide; Curse; Medical prescription; Legislation; Life expectancy; Nephew and niece; Alternative medicine; Tragedy (event)","score_opus":0.06272824968771057,"score_gpt":0.2763830902544981,"score_spread":0.21365484056678752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931963002","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.10370964,0.00012521431,0.78937805,0.035111733,0.0011219459,0.0009759184,0.0001799585,0.0035179465,0.06587959],"genre_scores_gemma":[0.99099416,0.000051693973,0.0029377318,0.0014805562,0.0005573622,1.3429865e-7,0.0009447263,0.00047717377,0.0025564728],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985638,0.00026855423,0.00016919457,0.00033946603,0.0004066677,0.00025230815],"domain_scores_gemma":[0.99892884,0.000070854905,0.000053649164,0.0004842228,0.00031748562,0.0001449686],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007809078,0.000089228786,0.000076714045,0.00022502903,0.0018633977,0.0012623435,0.0015720655,0.000028548895,0.0014194929],"category_scores_gemma":[0.00046410266,0.00007578704,0.000039682396,0.0016024162,0.000038710514,0.00032260315,0.0014339957,0.0001467044,0.02163867],"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.000019146943,0.000046589346,0.000002086575,0.000005931432,0.000027719394,0.000015457932,0.0034014147,0.005299353,0.0056358045,0.038439736,0.66010296,0.28700382],"study_design_scores_gemma":[0.00020199236,0.00007285572,0.0017437914,0.000009484567,0.0000035599094,0.000022439339,0.00013226159,0.01633314,0.0009891049,0.002897292,0.977485,0.00010908122],"about_ca_topic_score_codex":0.000017450884,"about_ca_topic_score_gemma":4.1692124e-7,"teacher_disagreement_score":0.8872845,"about_ca_system_score_codex":0.000055361877,"about_ca_system_score_gemma":0.000005185574,"threshold_uncertainty_score":0.99977446},"labels":[],"label_agreement":null},{"id":"W6945050253","doi":"10.20382/jocg.v16i1a8","title":"Reconfiguration of colorings in triangulations of the sphere","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Triangulation; Vertex (graph theory); Sequence (biology); Characterization (materials science); Generalization; Point set triangulation","score_opus":0.009465094711338476,"score_gpt":0.20897086399816722,"score_spread":0.19950576928682875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945050253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55992913,0.0002855542,0.4360454,0.0009969276,0.00067518296,0.00011475222,0.000008015487,0.000011854632,0.0019331578],"genre_scores_gemma":[0.9874038,0.000016490187,0.012054786,0.000024105686,0.00005523198,1.2624994e-7,0.000003189079,0.0000037923671,0.00043847438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998698,0.000120685385,0.00050031114,0.00013092312,0.0004614874,0.000088616165],"domain_scores_gemma":[0.9984434,0.0004700673,0.00040819257,0.00011598349,0.0005206594,0.000041679086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042510766,0.00008367775,0.00019824888,0.0011518276,0.00005056254,0.00003918556,0.00046466818,0.000055340155,0.00003422945],"category_scores_gemma":[0.000093321614,0.00007358708,0.00018522453,0.003478948,0.000051853254,0.0007238419,0.00007182328,0.00017094836,0.0000017680622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043042695,0.00009632208,0.0011807214,0.00006475114,0.00007699291,0.000023541746,0.00043385988,0.752705,0.0016348284,0.22798052,0.00033512653,0.015425328],"study_design_scores_gemma":[0.0042768517,0.000979923,0.30733255,0.0012583758,0.00018946255,0.00037893854,0.00092778984,0.52050096,0.016540688,0.10242795,0.04455298,0.00063354085],"about_ca_topic_score_codex":0.0000115972225,"about_ca_topic_score_gemma":0.0000084799085,"teacher_disagreement_score":0.42747468,"about_ca_system_score_codex":0.000120763456,"about_ca_system_score_gemma":0.000549902,"threshold_uncertainty_score":0.30007938},"labels":[],"label_agreement":null},{"id":"W6961332955","doi":"10.14288/1.0355459","title":"Quebec","year":2017,"lang":"en","type":"other","venue":"Open Collections","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tourism; Period (music); Terrace (agriculture); Table (database)","score_opus":0.02334406421130701,"score_gpt":0.287756746115459,"score_spread":0.26441268190415196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6961332955","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.4992485e-9,0.00009577392,0.23877797,0.0001612095,0.0010529961,0.00026534122,0.000012452476,0.000110634806,0.75952363],"genre_scores_gemma":[0.0000031553986,0.000034373003,0.02339242,0.000094661096,0.00031368944,0.00008174775,0.000023417988,0.000046962352,0.97600955],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934924,0.000032703872,0.0000755907,0.00030779836,0.00012644636,0.00010821799],"domain_scores_gemma":[0.9990957,0.000021799995,0.00013970093,0.0006488835,0.000041714346,0.000052215182],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008173584,0.000110324014,0.00013809057,0.00013665516,0.0015700696,0.004540258,0.0014880551,0.00009850213,0.001566757],"category_scores_gemma":[0.000029397948,0.000114257695,0.000043985405,0.00040665525,0.000019060311,0.00024201498,0.00047364726,0.00008845551,0.00013750127],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.49212e-7,0.000021627342,1.17335944e-7,0.0000025156623,0.000021133863,0.0000024009455,0.0000072241123,0.000026692156,9.738259e-7,0.0046072043,0.9835483,0.011761357],"study_design_scores_gemma":[0.00013566957,0.000014113206,0.000008148518,0.000036207908,0.0000056847507,0.000008365082,9.0965744e-7,0.0012631117,0.000013520966,0.0012107767,0.9971638,0.00013970601],"about_ca_topic_score_codex":0.094950885,"about_ca_topic_score_gemma":0.16719162,"teacher_disagreement_score":0.21648596,"about_ca_system_score_codex":0.000051362906,"about_ca_system_score_gemma":0.00045751836,"threshold_uncertainty_score":0.99972975},"labels":[],"label_agreement":null},{"id":"W6962973369","doi":"10.20382/jocg.v9i2","title":"Journal of Computational Geometry, Vol. 9 No. 2 (2018): Special Issue of Selected Papers from SoCG 2017","year":2018,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Special section; Key (lock); Field (mathematics)","score_opus":0.010448174499178491,"score_gpt":0.21760109500716734,"score_spread":0.20715292050798886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6962973369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3421851,0.00023264863,0.64541847,0.00062166894,0.0068927165,0.00017767589,0.000083312974,0.000032223597,0.004356191],"genre_scores_gemma":[0.79456633,0.00007816826,0.190956,0.0003788421,0.0125702415,1.9537461e-7,0.00008121312,0.000029682875,0.0013393105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956055,0.0003255906,0.0013766483,0.00038387853,0.0019407541,0.00036760006],"domain_scores_gemma":[0.9825064,0.0010505152,0.002673718,0.00026288957,0.01314979,0.00035671832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008882539,0.00034115626,0.00077645096,0.0031581724,0.0003096438,0.00015395103,0.0015755569,0.0002045176,0.0008725884],"category_scores_gemma":[0.00083563186,0.00035642085,0.00045806734,0.0040949853,0.00032009822,0.0014964369,0.00026801514,0.0005207468,0.000077993034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015503914,0.0014258537,0.004402475,0.00009567902,0.002083964,0.00044016296,0.0015971169,0.7049705,0.0033333057,0.011768688,0.22506687,0.043264985],"study_design_scores_gemma":[0.015876273,0.007834465,0.19509381,0.0005891966,0.00073744624,0.0012944626,0.0008797243,0.13755138,0.0061837984,0.040751737,0.5911723,0.0020354313],"about_ca_topic_score_codex":0.00002346252,"about_ca_topic_score_gemma":0.00000610992,"teacher_disagreement_score":0.5674191,"about_ca_system_score_codex":0.00033472892,"about_ca_system_score_gemma":0.0015631245,"threshold_uncertainty_score":0.9998888},"labels":[],"label_agreement":null},{"id":"W6963147319","doi":"10.20382/jocg.v15i2a7","title":"Worst-case deterministic fully-dynamic biconnectivity in changeable planar embeddings","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Commission","keywords":"Embedding; Vertex (graph theory); Planar; Enhanced Data Rates for GSM Evolution; Planar straight-line graph; Planar graph; Book embedding","score_opus":0.010769732400275622,"score_gpt":0.2355317721607354,"score_spread":0.22476203976045978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6963147319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.345726,0.00035447147,0.6520153,0.0005697451,0.00075971684,0.00008462483,0.00000978556,0.000049905626,0.00043041675],"genre_scores_gemma":[0.9720786,0.000028770042,0.027200012,0.00011200359,0.00014582645,3.747602e-7,0.000009426879,0.000011186604,0.00041377745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828696,0.00013156004,0.00042898412,0.00035164936,0.00053051306,0.0002703203],"domain_scores_gemma":[0.99825215,0.0008529983,0.00023524414,0.00014819973,0.00033906425,0.00017231854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006797772,0.00019418042,0.00029926194,0.0035550823,0.00015182103,0.00026796068,0.00050983345,0.00009642019,0.000031584546],"category_scores_gemma":[0.000096497206,0.00020988035,0.00018500608,0.0037390643,0.00004844943,0.0014591321,0.000117313095,0.0003830652,0.000025565867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015661235,0.00040126007,0.00049311225,0.00021198922,0.00027977384,0.03978298,0.0013033386,0.7064244,0.00069284136,0.1641858,0.0010494957,0.08501835],"study_design_scores_gemma":[0.0011702387,0.00046576236,0.003353957,0.0002549069,0.000057870533,0.0103027625,0.0002672828,0.93806213,0.00010523946,0.03276512,0.012750063,0.00044465225],"about_ca_topic_score_codex":0.000015558482,"about_ca_topic_score_gemma":0.00002727246,"teacher_disagreement_score":0.6263526,"about_ca_system_score_codex":0.0003926038,"about_ca_system_score_gemma":0.0004576745,"threshold_uncertainty_score":0.8558672},"labels":[],"label_agreement":null},{"id":"W6963357116","doi":"10.20382/jocg.v14i1a3","title":"SPQR-tree-like embedding representation for level planarity","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Planarity testing; Embedding; Book embedding; Representation (politics); Planar; Graph; Graph embedding; Planar graph","score_opus":0.05386085989245618,"score_gpt":0.2875350460733845,"score_spread":0.2336741861809283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6963357116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10255129,0.000035848094,0.8943242,0.0012695167,0.001034741,0.00015824672,0.000027040805,0.0000880527,0.00051109405],"genre_scores_gemma":[0.8089715,0.000039082057,0.1872385,0.00033068276,0.0005074171,0.0000010914863,0.00014598088,0.000017677989,0.0027480493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813575,0.00011270979,0.00045245793,0.00030591112,0.0007286538,0.00026451208],"domain_scores_gemma":[0.99712056,0.0009594889,0.00051811663,0.00017470993,0.0010582554,0.0001688527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006828578,0.00016195905,0.000277257,0.0023188544,0.0003022343,0.00014839818,0.0006927062,0.000088774505,0.000014787048],"category_scores_gemma":[0.00019298345,0.00018158827,0.00026679065,0.0036281059,0.000039782055,0.0012707561,0.00016267007,0.00018631964,0.000025011737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110877685,0.00008902397,0.0007844014,0.000031446514,0.00014889214,0.00011315728,0.00026802893,0.90798694,0.0003997743,0.048599653,0.01566143,0.025806373],"study_design_scores_gemma":[0.003248345,0.00049870403,0.03931489,0.00006989133,0.00008217325,0.00024246897,0.0004751489,0.84316486,0.00077187875,0.04209683,0.0695328,0.0005019856],"about_ca_topic_score_codex":0.000006986701,"about_ca_topic_score_gemma":0.000003933214,"teacher_disagreement_score":0.70708567,"about_ca_system_score_codex":0.00017329222,"about_ca_system_score_gemma":0.00033775275,"threshold_uncertainty_score":0.7404955},"labels":[],"label_agreement":null},{"id":"W6963620429","doi":"10.20382/jocg.v6i1","title":"Journal of Computational Geometry, Vol. 6 No. 1 (2015)","year":2015,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Key (lock); Feature (linguistics); Field (mathematics); Set (abstract data type)","score_opus":0.019324206576099366,"score_gpt":0.23472078616059794,"score_spread":0.21539657958449857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6963620429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120313846,0.00051354326,0.8725591,0.0009124515,0.0041176453,0.00011964335,0.000015864136,0.000034166107,0.0014137794],"genre_scores_gemma":[0.7434773,0.000045611057,0.2528664,0.00046864725,0.0017753504,2.1069982e-7,0.000032014224,0.000024959176,0.0013095565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954053,0.00035093114,0.0012402637,0.00032732775,0.0023032373,0.00037294996],"domain_scores_gemma":[0.98136467,0.00080869644,0.00205105,0.00024522914,0.014866701,0.00066364865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018550113,0.00032306145,0.0006601626,0.00395199,0.00020671448,0.00024321073,0.0016004057,0.000166656,0.00009659535],"category_scores_gemma":[0.001184031,0.0003296192,0.00046948978,0.0037897704,0.00014138632,0.0024179548,0.0003044092,0.000591757,0.00008070102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024506098,0.00037453318,0.0010351787,0.000026014775,0.00030997925,0.00031255974,0.00027931144,0.927548,0.000057450536,0.016364546,0.04591032,0.0075370506],"study_design_scores_gemma":[0.01745777,0.00583454,0.029583227,0.0003844759,0.0004291945,0.004940624,0.0010932708,0.33907866,0.00066606764,0.114990525,0.48369527,0.0018463602],"about_ca_topic_score_codex":0.000007960198,"about_ca_topic_score_gemma":0.0000011870732,"teacher_disagreement_score":0.6231634,"about_ca_system_score_codex":0.0005237719,"about_ca_system_score_gemma":0.002172585,"threshold_uncertainty_score":0.9999156},"labels":[],"label_agreement":null},{"id":"W6966806635","doi":"10.48550/arxiv.math/0411356","title":"Characterization and enumeration of toroidal K_{3,3}-subdivision-free graphs","year":2004,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Université du Québec à Montréal","funders":"","keywords":"Toroid; Enumeration; Characterization (materials science); Chordal graph; Vertex (graph theory); Planar graph; 1-planar graph; Indifference graph","score_opus":0.03467841106422214,"score_gpt":0.1700949148038863,"score_spread":0.13541650373966416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966806635","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.45834234,0.000038688897,0.5410044,0.000057588863,0.0002805754,0.0001287482,0.000016557884,0.000045714078,0.00008539135],"genre_scores_gemma":[0.99693245,0.00017087297,0.0024075364,0.000058307105,0.00005735649,8.114991e-7,0.00015548847,0.000007391776,0.00020976235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988288,0.0000790409,0.0002146097,0.000619309,0.00012124286,0.00013699205],"domain_scores_gemma":[0.99876493,0.000049042006,0.0002787139,0.00059679575,0.00022629321,0.00008420333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017537505,0.00018423966,0.00020605863,0.00031354692,0.000116035844,0.00009320251,0.00062234973,0.00017098198,0.0000106914795],"category_scores_gemma":[0.000039159528,0.00022298195,0.0000872765,0.0004930712,0.000053953125,0.0005425553,0.0008951814,0.00017966484,0.000005225043],"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.000025170235,0.00011207742,0.0010595587,0.00011347647,0.000052733096,0.000021610595,0.00038907325,0.18425551,0.0059642564,0.80271894,0.000038504135,0.005249065],"study_design_scores_gemma":[0.0010203714,0.00013984772,0.03051451,0.00013548075,0.00005937817,0.000008423397,0.000017578948,0.6977928,0.005707747,0.2638148,0.00028438086,0.00050464517],"about_ca_topic_score_codex":0.00004810463,"about_ca_topic_score_gemma":0.00001683529,"teacher_disagreement_score":0.53890413,"about_ca_system_score_codex":0.00007976347,"about_ca_system_score_gemma":0.00018861104,"threshold_uncertainty_score":0.909294},"labels":[],"label_agreement":null},{"id":"W6976972367","doi":"10.60692/kpyx2-aq790","title":"Epidemiology of potential drug-drug interactions in elderly population admitted to critical care units of Peshawar, Pakistan","year":2018,"lang":"en","type":"article","venue":"Greater South Information System","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":"Alberta Health Services","funders":"","keywords":"Epidemiology; Population; Pharmacotherapy; Population study; Adverse effect; Cross-sectional study; Health care; Population ageing; Drug","score_opus":0.0490185881735549,"score_gpt":0.3112038404769909,"score_spread":0.262185252303436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976972367","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.5790828,0.0000044268804,0.41978943,0.000106642234,0.00057339086,0.00017068375,0.00003346418,0.000039729635,0.00019946626],"genre_scores_gemma":[0.9917224,3.017763e-8,0.008000003,0.00008769187,0.00008303108,0.000019735235,0.000055377357,0.0000035596388,0.000028159286],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99819255,0.00023468834,0.0010034835,0.00016999275,0.00022080303,0.00017846184],"domain_scores_gemma":[0.9982324,0.00006839521,0.00030511396,0.00028856582,0.0010233641,0.000082154984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004980148,0.00011531949,0.0002551301,0.00068322907,0.00008549584,0.000022652073,0.0002484233,0.000038779344,0.000009716163],"category_scores_gemma":[0.00017696984,0.00011127154,0.000048681206,0.0009532226,0.000031724536,0.0008917592,0.00009021674,0.00007489867,0.000056031375],"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.00019723653,0.000018489392,0.60141325,0.0010532414,0.00004157341,0.0000031220843,0.30441064,0.027603019,0.000037977097,0.054486334,0.00025201362,0.010483107],"study_design_scores_gemma":[0.0009382343,0.00022607777,0.81794024,0.0004053209,0.000022531241,0.000044209773,0.02094679,0.15609393,0.0027404982,0.00010790971,0.00020530191,0.00032894305],"about_ca_topic_score_codex":0.000145565,"about_ca_topic_score_gemma":0.000023295845,"teacher_disagreement_score":0.41263965,"about_ca_system_score_codex":0.000096411735,"about_ca_system_score_gemma":0.00007046057,"threshold_uncertainty_score":0.45375216},"labels":[],"label_agreement":null},{"id":"W6980406164","doi":"","title":"CAPA newsletter May 1983","year":2005,"lang":"en","type":"other","venue":"TSpace (University of Toronto)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.01105922480340849,"score_gpt":0.2224424504233165,"score_spread":0.21138322561990802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6980406164","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048477377,0.0009501931,0.18879832,0.0023682255,0.00033302556,0.00011059921,0.000007834395,0.00014708172,0.80723625],"genre_scores_gemma":[0.0037802663,0.00018681292,0.071753256,0.00018033016,0.00030853265,1.2249298e-7,0.000019160354,0.00003465168,0.9237369],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920714,0.00003933939,0.000056926438,0.0003040531,0.00024155097,0.00015096136],"domain_scores_gemma":[0.9993221,0.00001817314,0.00016075085,0.00038647745,0.00003938116,0.00007308588],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006277134,0.0001423827,0.0001962416,0.0000918356,0.00006044793,0.000019217838,0.00063637836,0.00014699492,0.042697053],"category_scores_gemma":[0.0000030770605,0.0001821305,0.00009715953,0.000083344356,0.000042373227,0.00028934205,0.0001859107,0.00007580947,0.00022465119],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004558317,0.000038869668,0.000010072438,0.00002483207,0.00005690673,0.000013064957,0.0010868835,0.00011733468,0.00008285384,0.006040383,0.7817488,0.21077545],"study_design_scores_gemma":[0.0002826402,0.000035355566,0.0029307327,0.00003534134,0.000019395693,0.0000038762005,0.00009971673,0.0022668221,0.00001583696,0.000013072406,0.9940755,0.00022176157],"about_ca_topic_score_codex":0.03757063,"about_ca_topic_score_gemma":0.03616471,"teacher_disagreement_score":0.21232665,"about_ca_system_score_codex":0.000112995695,"about_ca_system_score_gemma":0.00006928121,"threshold_uncertainty_score":0.9814228},"labels":[],"label_agreement":null},{"id":"W6980854860","doi":"","title":"Daniel Coussirat au service du protestantisme canadien francophone","year":2012,"lang":"fr","type":"book-chapter","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Service (business); Context (archaeology); French; Government (linguistics); Field (mathematics)","score_opus":0.023519285027958383,"score_gpt":0.2102642986939926,"score_spread":0.18674501366603422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6980854860","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.0063855257,0.002957872,0.59160715,0.03363046,0.0019150294,0.0010400743,0.00014257443,0.00026368487,0.36205763],"genre_scores_gemma":[0.61093843,0.0010730693,0.12122503,0.0013359769,0.0007408471,0.00012361522,0.001016432,0.00017340294,0.26337317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937206,0.002399213,0.0009154486,0.0011835912,0.00092548097,0.00085565116],"domain_scores_gemma":[0.98962855,0.0016657843,0.00084321795,0.0021852585,0.004999516,0.0006776556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0052472344,0.0006984548,0.0005954987,0.00034692374,0.0012379747,0.000611606,0.0019636326,0.00050408655,0.0006761183],"category_scores_gemma":[0.0006692212,0.00080637424,0.0002538595,0.0008884039,0.00034587365,0.00088455476,0.001012761,0.00072846725,0.0007099621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009005516,0.00029002584,0.0005126145,0.00017200943,0.000090513044,0.00002769626,0.009446778,0.00029106045,0.0013340893,0.83936226,0.0008869887,0.14757696],"study_design_scores_gemma":[0.0011665266,0.0000035307264,0.005985231,0.0025610195,0.00011097966,0.0003473646,0.000072455274,0.14109032,0.011095862,0.008022728,0.82793516,0.0016088472],"about_ca_topic_score_codex":0.012490563,"about_ca_topic_score_gemma":0.045786142,"teacher_disagreement_score":0.83133954,"about_ca_system_score_codex":0.00042194358,"about_ca_system_score_gemma":0.0016507239,"threshold_uncertainty_score":0.9994387},"labels":[],"label_agreement":null},{"id":"W6988162851","doi":"","title":"An Ω lower bound for computing the sum of even-ranked elements","year":2009,"lang":"en","type":"article","venue":"Common Library Network (Der Gemeinsame Bibliotheksverbund)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Sequence (biology); Upper and lower bounds; Algebraic number; Computational complexity theory; Order (exchange); Time complexity","score_opus":0.019465029551650748,"score_gpt":0.27730028538502294,"score_spread":0.2578352558333722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6988162851","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.109469704,0.0025646512,0.8758357,0.00503688,0.0017575631,0.001215333,0.000020974696,0.00048171866,0.0036174874],"genre_scores_gemma":[0.92182744,0.00009031702,0.07067668,0.0056921807,0.0011734081,0.00001531456,0.000102258375,0.000031593776,0.0003908112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974064,0.0002628854,0.00072653167,0.00055404834,0.0004654421,0.0005846466],"domain_scores_gemma":[0.99779147,0.0005108525,0.00038120316,0.0010439276,0.000114089424,0.00015847138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070499483,0.00030243056,0.00036318993,0.00075522263,0.00055860775,0.00071886735,0.0019266338,0.00011086293,0.000101028934],"category_scores_gemma":[0.000018135941,0.00024975304,0.00020454626,0.005024786,0.00008341477,0.0026554132,0.00025848657,0.00020156053,0.000009719659],"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.00035742132,0.0016137951,0.006195484,0.0000842124,0.00029971008,0.0000119055685,0.0008127412,0.23531416,0.0006424016,0.3743874,0.22536962,0.15491113],"study_design_scores_gemma":[0.0013677529,0.0014672823,0.020177865,0.00010602685,0.000038370585,0.000012480983,0.000021597032,0.7720671,0.00087666,0.11152624,0.09177621,0.0005623787],"about_ca_topic_score_codex":0.0000049051273,"about_ca_topic_score_gemma":0.000004436776,"teacher_disagreement_score":0.8123577,"about_ca_system_score_codex":0.000018552544,"about_ca_system_score_gemma":0.00013649226,"threshold_uncertainty_score":0.99999547},"labels":[],"label_agreement":null},{"id":"W6998684580","doi":"","title":"Analyzing Tree Attachments in 2-Crossing-Critical Graphs with a V8 Minor","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","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":"Blackberry (Canada)","funders":"","keywords":"Subdivision; Pairwise comparison; Graph; Treewidth; 1-planar graph; Indifference graph; Tree (set theory)","score_opus":0.013631375753761131,"score_gpt":0.24405384195745541,"score_spread":0.23042246620369428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6998684580","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.9942637,0.00007248386,0.0043530804,0.00056697766,0.00033583373,0.00015244423,0.000007701304,0.00008517828,0.00016257657],"genre_scores_gemma":[0.69297063,0.000042586897,0.0435681,0.000022879543,0.000052262396,0.0000019806655,0.00066131837,0.000033972847,0.26264626],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9986697,0.00006209619,0.00014108671,0.00049142435,0.00036413665,0.00027159502],"domain_scores_gemma":[0.99924284,0.00008989311,0.00013246592,0.00026951276,0.00017845626,0.00008681446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016799632,0.0001937961,0.00029845658,0.0008383878,0.0002484255,0.00012491127,0.000524018,0.00014880791,0.000014808317],"category_scores_gemma":[0.000019267223,0.00021803126,0.0001024961,0.0011924049,0.00008141403,0.00046903966,0.000083331564,0.00019484115,0.00003443115],"study_design_candidate":"observational","study_design_consensus":null,"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.001474548,0.0015714038,0.03722311,0.0026901173,0.0009344645,0.0025098321,0.58949804,0.013332951,0.014107951,0.037401482,0.006311005,0.29294512],"study_design_scores_gemma":[0.008218213,0.0024103117,0.70757616,0.0035576955,0.0006067513,0.00005125317,0.13286358,0.120541915,0.0069215596,0.012185545,0.0011981664,0.0038688518],"about_ca_topic_score_codex":0.005696179,"about_ca_topic_score_gemma":0.05783092,"teacher_disagreement_score":0.67035306,"about_ca_system_score_codex":0.00006935986,"about_ca_system_score_gemma":0.0001815779,"threshold_uncertainty_score":0.9593612},"labels":[],"label_agreement":null},{"id":"W6999637960","doi":"","title":"3-D automatic mesh adaptation for turbulent flows","year":2005,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Turbulence; Mesh generation; Flow (mathematics); Computational fluid dynamics; Adaptation (eye); Adaptive mesh refinement","score_opus":0.021355169605046603,"score_gpt":0.25207670597449655,"score_spread":0.23072153636944995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999637960","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.92301327,0.0016396283,0.0069856527,0.00043364044,0.010901782,0.0062102163,0.00096602115,0.0027280133,0.047121804],"genre_scores_gemma":[0.81618655,0.00018398612,0.16610053,0.0007645001,0.00044268163,0.0010491944,0.0043031075,0.00018952542,0.010779902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539894,0.00024686195,0.0011341504,0.0014033571,0.0011176111,0.00069909595],"domain_scores_gemma":[0.9967443,0.00043388203,0.00074160687,0.0008889299,0.00087566255,0.00031563634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001011761,0.00075060746,0.0006530437,0.0007252631,0.0012243141,0.00034147207,0.0012940012,0.0006107893,0.00013654031],"category_scores_gemma":[0.0004856774,0.00083361124,0.0004895627,0.0009595875,0.000017516068,0.0017404291,0.00011420032,0.00066070154,0.00032096816],"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.000038614195,0.00018358206,2.2503856e-7,0.00025180212,0.00011187102,0.000012118914,0.00002981453,0.005920665,0.004398993,0.25123945,0.00004184521,0.73777103],"study_design_scores_gemma":[0.0016557623,0.00037291367,0.00035130838,0.00049359957,0.00026573066,0.00009162202,0.0001666543,0.71937203,0.03587991,0.08516304,0.15404883,0.0021385897],"about_ca_topic_score_codex":0.000028987428,"about_ca_topic_score_gemma":0.00048194278,"teacher_disagreement_score":0.7356324,"about_ca_system_score_codex":0.0006741851,"about_ca_system_score_gemma":0.00019764682,"threshold_uncertainty_score":0.99941146},"labels":[],"label_agreement":null},{"id":"W7010110854","doi":"","title":"Graph embedding algorithms","year":2003,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","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 Manitoba","funders":"","keywords":"Planar graph; Book embedding; Intersection graph; Time complexity; Graph embedding; Graph; Outerplanar graph; Surface (topology); Embedding","score_opus":0.014086498294533373,"score_gpt":0.22378020387740938,"score_spread":0.209693705582876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7010110854","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.09511761,0.0007444719,0.8890411,0.00032472404,0.0020313666,0.00025196868,0.000010117399,0.00013737394,0.012341245],"genre_scores_gemma":[0.1209882,0.0016423401,0.82717115,0.00022080689,0.00041903288,0.0000025125373,0.0015440101,0.000085945394,0.047926016],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988835,0.000065872446,0.0001007472,0.00038981243,0.00038092144,0.00017916884],"domain_scores_gemma":[0.9991016,0.000045076675,0.00023475192,0.000310487,0.00023484255,0.00007325436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015869756,0.00017144559,0.00022648541,0.00042171142,0.00025161146,0.000050834034,0.0006274827,0.00017232992,0.000010648588],"category_scores_gemma":[0.000010226653,0.0002412479,0.00015279689,0.00063501537,0.000023274182,0.0003973753,0.00006247433,0.0001790376,0.00005474993],"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.0002876972,0.0012193993,0.0027235332,0.0015333518,0.001204086,0.0006360877,0.009316236,0.04099675,0.0119451815,0.3160539,0.21308382,0.40099993],"study_design_scores_gemma":[0.006152534,0.0011786758,0.17373368,0.0012629774,0.0005717924,0.0001298461,0.05514217,0.26793388,0.016622337,0.036756497,0.4346524,0.00586323],"about_ca_topic_score_codex":0.00012424077,"about_ca_topic_score_gemma":0.009158315,"teacher_disagreement_score":0.3951367,"about_ca_system_score_codex":0.00006219835,"about_ca_system_score_gemma":0.000111656176,"threshold_uncertainty_score":0.9837803},"labels":[],"label_agreement":null},{"id":"W7017312375","doi":"","title":"Automatic 3-D triangulations of complex geometries from a coarse hexahedral mesh","year":2007,"lang":"en","type":"article","venue":"Acceda (Universidad de Las Palmas de Gran Canaria)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hexahedron; Tetrahedron; Cube (algebra); Boundary (topology); Mesh generation; Generator (circuit theory); Domain (mathematical analysis); Topology (electrical circuits); Polygon mesh","score_opus":0.02685225815756277,"score_gpt":0.2827181628531751,"score_spread":0.2558659046956123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017312375","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.4633542,0.00006466944,0.5341562,0.00075596693,0.00014445852,0.0001423775,0.00002658578,0.00010499495,0.00125052],"genre_scores_gemma":[0.88484746,0.0000051932975,0.11436042,0.00035368864,0.00009810254,0.0000025286424,0.00008065333,0.000010611029,0.00024135823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983761,0.00009448792,0.00034511348,0.00034148523,0.00042340232,0.00041941344],"domain_scores_gemma":[0.99827003,0.00062036695,0.00022437413,0.0004539132,0.0001985126,0.00023282503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056376815,0.00017525625,0.00028141754,0.0007611983,0.0002623715,0.00010700632,0.00071996375,0.00012199202,0.00024296256],"category_scores_gemma":[0.00014115169,0.00021103647,0.00014222438,0.00205343,0.00009271581,0.0006239544,0.00014467372,0.00014157618,0.000014815064],"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.00022803909,0.0004768812,0.020735277,0.000099600424,0.0006860166,0.00045136618,0.012083055,0.0290471,0.035264254,0.6121699,0.022481311,0.2662772],"study_design_scores_gemma":[0.0026001239,0.00019512701,0.30939648,0.000041209056,0.00010856924,0.000053035383,0.0009959613,0.6453442,0.0043935385,0.028157927,0.008186888,0.0005269614],"about_ca_topic_score_codex":0.0017785055,"about_ca_topic_score_gemma":0.0015303233,"teacher_disagreement_score":0.61629707,"about_ca_system_score_codex":0.00024177435,"about_ca_system_score_gemma":0.0003934878,"threshold_uncertainty_score":0.86058176},"labels":[],"label_agreement":null},{"id":"W7023143945","doi":"","title":"Packing Unit Disks","year":2008,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Nucleofection; Intersection (aeronautics); Set (abstract data type); Frame (networking); Filter (signal processing)","score_opus":0.017922406085236445,"score_gpt":0.21476489639795399,"score_spread":0.19684249031271756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023143945","genre_codex":"empirical","genre_gemma":"other","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.9867372,0.00019072588,0.010041407,0.00043266054,0.0007135218,0.0001590499,0.000009889847,0.00011682333,0.0015987124],"genre_scores_gemma":[0.229518,0.00036881687,0.024553463,0.000034039964,0.00011369293,4.3030082e-7,0.0008950585,0.00002071705,0.7444958],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99893326,0.000052268024,0.00010970871,0.0003639019,0.00035120972,0.00018965986],"domain_scores_gemma":[0.9990889,0.00004039094,0.00021744093,0.00033477662,0.00023770862,0.00008078077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000858713,0.00017426936,0.00024098875,0.00035866434,0.00028949493,0.00003560392,0.0006908695,0.00017507366,0.000060005917],"category_scores_gemma":[0.000010108555,0.00021510682,0.00013740949,0.00046284354,0.00003467183,0.00044182182,0.00009647899,0.00017980707,0.00007792181],"study_design_candidate":"qualitative","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.00029824642,0.0006103312,0.0018739225,0.00091222994,0.0006347085,0.00063464115,0.647633,0.009706202,0.016439132,0.050221663,0.024793148,0.24624275],"study_design_scores_gemma":[0.010316963,0.00229497,0.32288978,0.0026492085,0.0009355486,0.00028455647,0.24197263,0.19456628,0.07641434,0.018448787,0.11980871,0.009418223],"about_ca_topic_score_codex":0.0036088128,"about_ca_topic_score_gemma":0.006696955,"teacher_disagreement_score":0.7572192,"about_ca_system_score_codex":0.000037122893,"about_ca_system_score_gemma":0.00015429984,"threshold_uncertainty_score":0.87718016},"labels":[],"label_agreement":null},{"id":"W7023979121","doi":"","title":"Proceedings of the twenty-first annual Symposium on Parallelism in Algorithms and Architectures Calgary, AB, Canada — August 11 - 13, 2009","year":2009,"lang":"en","type":"other","venue":"","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":"Parallelism (grammar); Task parallelism; Algorithm design; Parallel algorithm","score_opus":0.004961585800491723,"score_gpt":0.20025991000647897,"score_spread":0.19529832420598725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023979121","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020652575,0.0021715628,0.017763754,0.016099794,0.0030424842,0.0030399752,0.00021394213,0.0003906779,0.93662524],"genre_scores_gemma":[0.05228054,0.00024352383,0.024891999,0.004726596,0.0010804827,0.000058668422,0.00004261533,0.00018000967,0.91649556],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865496,0.00001752126,0.00023852635,0.00042159582,0.00045276195,0.00021461774],"domain_scores_gemma":[0.9994839,0.00004208976,0.00016597315,0.00017849806,0.000056940942,0.00007262856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109779096,0.00022991557,0.00023683865,0.00024971287,0.0000615399,0.000056361678,0.0005469511,0.00011971044,0.00004173727],"category_scores_gemma":[0.000013973556,0.00016303558,0.00004010094,0.00039823903,0.000038278155,0.0000471036,0.00013429314,0.00018444432,0.0000010114746],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070498345,0.00008704166,0.0003608165,0.00006621811,0.000020694068,0.000007033617,0.0003163567,0.0029368082,0.000018845349,0.011202183,0.9715393,0.013437647],"study_design_scores_gemma":[0.0011250451,0.00027302798,0.037513163,0.0005075387,0.000022202305,0.00006074828,0.000052398915,0.026685163,0.00058282336,0.0015479071,0.93075436,0.00087561685],"about_ca_topic_score_codex":0.18981855,"about_ca_topic_score_gemma":0.4713807,"teacher_disagreement_score":0.28156215,"about_ca_system_score_codex":0.000054861517,"about_ca_system_score_gemma":0.00025421276,"threshold_uncertainty_score":0.81557655},"labels":[],"label_agreement":null},{"id":"W7024985293","doi":"","title":"Thirty-Third Annual Report of the Selectmen, Assessors and Overseers of the Poor of the Town of South Scituate, for the Year Ending January 1, 1883, With the Reports of the Treasurer, Surveyors of Highways, Town Clerk, and School Committee","year":2017,"lang":"en","type":"other","venue":"State Library's electronic repository (State Library of Massachusetts)","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":"Annual report; Year-ending; Duration (music); Period (music); Quarter (Canadian coin)","score_opus":0.007453530821027577,"score_gpt":0.20406612266942278,"score_spread":0.19661259184839522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024985293","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.91117924,0.0079956595,0.0019930096,0.0068053217,0.002559961,0.008634806,0.002133449,0.00021516193,0.058483362],"genre_scores_gemma":[0.94003236,0.0003122362,0.0006951054,0.00008610782,0.00008798299,0.000035561152,0.000027820026,0.00012664251,0.058596175],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99515563,0.0010275667,0.0014146324,0.0006890458,0.0012324536,0.00048066248],"domain_scores_gemma":[0.9901097,0.00082306255,0.0062416885,0.0025394473,0.00020842568,0.000077688695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013726621,0.0005046742,0.0009446542,0.00021990418,0.0004009951,0.00010467775,0.0025271447,0.00020577366,0.000015123813],"category_scores_gemma":[0.00014652665,0.00023371224,0.0004735578,0.0009772312,0.0014893608,0.0010484223,0.0010160594,0.00064281945,4.9760622e-8],"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.002008689,0.00082737766,0.25021854,0.0028109949,0.0064210463,0.0000445236,0.0100223515,0.00854805,0.020223213,0.009068559,0.68657947,0.0032272073],"study_design_scores_gemma":[0.004040419,0.0019779652,0.385081,0.0033365716,0.0014080998,0.0007074389,0.0011799416,0.002526254,0.5097005,0.009333308,0.07921586,0.0014926895],"about_ca_topic_score_codex":0.00023569513,"about_ca_topic_score_gemma":0.000044273766,"teacher_disagreement_score":0.6073636,"about_ca_system_score_codex":0.000030137762,"about_ca_system_score_gemma":0.002208077,"threshold_uncertainty_score":0.9530509},"labels":[],"label_agreement":null},{"id":"W7025217775","doi":"","title":"Translations and Translators of English-language Literature in Catalan Literary Publications and Series between 1868 and 1910","year":2012,"lang":"en","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Catalan; TRACE (psycholinguistics); Series (stratigraphy); Quarter (Canadian coin); Period (music)","score_opus":0.014655996739678542,"score_gpt":0.23867952546565468,"score_spread":0.22402352872597614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025217775","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.9519978,0.009745379,0.024008043,0.008359989,0.0003985263,0.0004912491,0.00012700807,0.0001994806,0.004672483],"genre_scores_gemma":[0.98843145,0.0001824275,0.010779943,0.00003949701,0.000271296,0.000047749738,0.0001808977,0.000011078905,0.00005563839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984879,0.00017211388,0.0004059634,0.00037247184,0.00026510094,0.0002964333],"domain_scores_gemma":[0.9988968,0.00020921211,0.00012845971,0.00025195893,0.00023726355,0.0002763302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004390935,0.00020462327,0.0002470142,0.00046656732,0.00023741488,0.00025160878,0.00021019728,0.00019537275,0.000002158362],"category_scores_gemma":[0.00020196439,0.00020198316,0.000044589055,0.0009307861,0.00002714566,0.0020283575,0.00009599165,0.00026305256,2.5296814e-7],"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.000020393934,0.00014647255,0.02016321,0.00011388389,0.000040116418,0.000004897168,0.05644371,0.00001786471,0.0010738833,0.9099497,0.000028933619,0.011996932],"study_design_scores_gemma":[0.0021622982,0.00015075115,0.45828548,0.00031447003,0.00008849277,0.00081358163,0.0010350359,0.0024064507,0.0034338539,0.0034680893,0.52691793,0.0009235709],"about_ca_topic_score_codex":7.9207626e-7,"about_ca_topic_score_gemma":0.000037958947,"teacher_disagreement_score":0.9064816,"about_ca_system_score_codex":0.000042166095,"about_ca_system_score_gemma":0.000116308904,"threshold_uncertainty_score":0.8236634},"labels":[],"label_agreement":null},{"id":"W7027988037","doi":"","title":"[Email correspondence between Al Daniels and members]","year":2009,"lang":"en","type":"article","venue":"The Portal to Texas History (University of North Texas)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Feature (linguistics); Face (sociological concept); Table (database); Sequence (biology)","score_opus":0.020907179352974647,"score_gpt":0.21324387205667675,"score_spread":0.1923366927037021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027988037","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.89401156,0.00017104992,0.097837575,0.002507457,0.00021845203,0.0001836146,0.000008575584,0.000074356365,0.004987392],"genre_scores_gemma":[0.98686457,0.000011205138,0.005150682,0.00079895457,0.0000392235,6.4715934e-8,0.000008718832,0.0000031483135,0.007123461],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990478,0.000059965383,0.00012229443,0.00029792608,0.00031015548,0.00016182619],"domain_scores_gemma":[0.999215,0.000090475856,0.00012281984,0.00033793043,0.00009281707,0.00014093601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024143461,0.000111965564,0.00016127643,0.00016725306,0.00017764815,0.000014163826,0.00069657876,0.000032102096,0.000113018956],"category_scores_gemma":[0.000020487634,0.000116523435,0.000057282625,0.0003534842,0.00010059831,0.00040229212,0.00016909339,0.00011157199,0.00006668952],"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.000300626,0.0004480927,0.2277277,0.000053210584,0.00021348205,0.00042301696,0.010103467,0.009783212,0.00042252117,0.06491679,0.3190799,0.366528],"study_design_scores_gemma":[0.00019673487,0.00019031366,0.88827264,0.000008680375,0.000021696977,0.000015726759,0.000016261647,0.0019878899,0.000019839486,0.00036768886,0.10873806,0.00016447478],"about_ca_topic_score_codex":0.000109739034,"about_ca_topic_score_gemma":0.0002820151,"teacher_disagreement_score":0.66054493,"about_ca_system_score_codex":0.00008349525,"about_ca_system_score_gemma":0.000119160715,"threshold_uncertainty_score":0.4751688},"labels":[],"label_agreement":null},{"id":"W7028103740","doi":"","title":"Discours métalinguistique et pratiques d'écriture féministes","year":2000,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Determinism; The Symbolic; On Language; Field (mathematics); Discourse analysis; Natural language","score_opus":0.0027389400921005898,"score_gpt":0.16959968270038137,"score_spread":0.16686074260828077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028103740","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007435108,0.00097367406,0.0048264647,0.0065540154,0.00035310065,0.00016983188,0.00025719948,0.00004458771,0.9867468],"genre_scores_gemma":[0.06824404,0.0008547861,0.025954476,0.0045230235,0.0004332212,0.000018568595,0.00011168022,0.000120545454,0.8997397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979682,0.00009301722,0.00023517454,0.00035839534,0.0011381875,0.00020704666],"domain_scores_gemma":[0.99921,0.00015080321,0.00019369597,0.00027063675,4.785922e-7,0.00017438726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000097219245,0.00024929116,0.00025767452,0.000052875588,0.000087932734,0.00007711916,0.00042123062,0.000059367794,0.00012291753],"category_scores_gemma":[0.0000033652104,0.00023768508,0.000032215597,0.0001000396,0.000046268924,0.0002248341,0.00014438016,0.00016588107,5.408071e-9],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.000036963753,0.00003616568,0.00017987027,0.00017492237,0.00010074286,0.000109663044,0.00013205998,0.00020362601,0.0004048289,0.80950975,0.17840144,0.010709983],"study_design_scores_gemma":[0.00015813923,0.000053585918,0.0009628771,0.00021721602,0.000013468013,0.000011201855,0.00012312034,0.0023628105,0.0071400707,0.0029808471,0.9856142,0.00036245567],"about_ca_topic_score_codex":0.0015812722,"about_ca_topic_score_gemma":0.03413464,"teacher_disagreement_score":0.80721277,"about_ca_system_score_codex":0.0000034466284,"about_ca_system_score_gemma":0.0023743012,"threshold_uncertainty_score":0.9834899},"labels":[],"label_agreement":null},{"id":"W7028530069","doi":"","title":"ERIC ED540500: Conceptual Evolution and Policy Developments in Lifelong Learning","year":2011,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Lifelong learning; Treasure; Commission; Action (physics); Adult education; Higher education; Thematic analysis","score_opus":0.00847490317090393,"score_gpt":0.1899838550983928,"score_spread":0.18150895192748887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028530069","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012398881,0.00041657436,0.0002687945,0.000056479777,0.00020240103,0.0002284335,0.0000059562544,0.00011912358,0.99857825],"genre_scores_gemma":[0.009944747,0.0001850981,0.0121969525,0.00014322335,0.00013044412,0.000012033487,0.00005986576,0.000033448323,0.9772942],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986996,0.000092681286,0.00045586991,0.00022760616,0.00029496584,0.00022925444],"domain_scores_gemma":[0.99920976,0.00006352772,0.0003793242,0.00016177431,0.00009968402,0.000085919586],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022536342,0.00021975412,0.00025447397,0.00030158175,0.000064647866,0.00005698125,0.0002875919,0.0002220819,0.009523116],"category_scores_gemma":[0.00013541682,0.00023894731,0.00004302762,0.00004077182,0.00008111657,0.0000010813502,0.00017019472,0.00021387961,0.001525019],"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.0000112249045,0.00002164502,0.000026182155,0.00008720193,0.000017608307,0.0000040583486,0.00052992493,0.000853461,3.7203847e-7,0.0023915952,0.98804194,0.008014806],"study_design_scores_gemma":[0.0003804227,0.000073121395,0.00045462887,0.00014230603,0.0000052435357,0.000037537447,0.00004660723,0.00039733778,0.0000048013735,0.000063220636,0.99815977,0.00023497881],"about_ca_topic_score_codex":0.0026735386,"about_ca_topic_score_gemma":0.00046820805,"teacher_disagreement_score":0.02128406,"about_ca_system_score_codex":0.00008478413,"about_ca_system_score_gemma":0.00012562067,"threshold_uncertainty_score":0.99925244},"labels":[],"label_agreement":null},{"id":"W7028587918","doi":"","title":"Exhaustive exploration strategies for NPCS in game maps","year":2016,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","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":"McGill University","funders":"","keywords":"Polygon (computer graphics); Set (abstract data type); Field (mathematics); Visibility; Terrain; Motion planning; Visibility polygon; Problem statement","score_opus":0.028941986732151443,"score_gpt":0.2690867076721563,"score_spread":0.24014472094000486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028587918","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.8304095,0.0011585591,0.021474505,0.00049174356,0.014261724,0.007162814,0.002783692,0.0015848489,0.12067258],"genre_scores_gemma":[0.97794914,0.00015614877,0.011094653,0.00021538,0.00018917702,0.0008637995,0.002073835,0.00009631902,0.007361564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623984,0.00020021296,0.0009071694,0.0012942253,0.0007318252,0.0006267176],"domain_scores_gemma":[0.9974649,0.0003845859,0.00056906644,0.0006320256,0.0007618135,0.00018762713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008765268,0.00061995344,0.0005563549,0.00087982765,0.0005634531,0.00035573926,0.0009767553,0.00057162985,0.000033616172],"category_scores_gemma":[0.00032117803,0.00061588467,0.0002542822,0.000957046,0.00003231712,0.0044074557,0.000120382945,0.0005591609,0.00016402888],"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.00014757957,0.00013558618,0.0000027669973,0.00017946812,0.000057455298,0.000018065002,0.00005455076,0.0012722866,0.016585724,0.75940186,0.000026639187,0.22211802],"study_design_scores_gemma":[0.0019131693,0.00037898176,0.0005848434,0.0005535645,0.000057389745,0.000013003471,0.00050169026,0.0019324396,0.059599213,0.8914789,0.041587308,0.0013995236],"about_ca_topic_score_codex":0.000043164982,"about_ca_topic_score_gemma":0.0006791036,"teacher_disagreement_score":0.2207185,"about_ca_system_score_codex":0.0005566107,"about_ca_system_score_gemma":0.00026132292,"threshold_uncertainty_score":0.99962926},"labels":[],"label_agreement":null},{"id":"W7028929379","doi":"","title":"Improved Targeting Technique and Parsimonious Optimization as Synergistic Combination for Nitrate Hot Spots Identification and Best Management Practices Implementation in a watershed of the Midwestern USA","year":2023,"lang":"en","type":"other","venue":"Qucosa (Saxon State and University Library Dresden)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Technische Universität Dresden; Purdue University","keywords":"Watershed; Agriculture; Nitrate; Water quality; Drainage; Tile drainage; Drainage basin; Eutrophication; Fertilizer; Hydrology (agriculture)","score_opus":0.013557948525757847,"score_gpt":0.24714230252404032,"score_spread":0.23358435399828248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028929379","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.18483964,0.00056324096,0.7998088,0.0020720914,0.0007434067,0.0068336516,0.0003435743,0.0003540009,0.004441622],"genre_scores_gemma":[0.70885634,0.008131307,0.0622525,0.00018831668,0.000120021105,0.00011222793,0.0011821014,0.00028052277,0.21887667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990325,0.00012455364,0.00021474627,0.0003679777,0.0001331863,0.00012705286],"domain_scores_gemma":[0.9991484,0.0000864815,0.00055173994,0.0001398543,0.000035111527,0.00003839395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020325485,0.00014281906,0.00014524262,0.00041432827,0.00013433093,0.0001558316,0.00018051318,0.000077101846,0.000009622889],"category_scores_gemma":[0.000013108799,0.00014109825,0.000023783748,0.0003886459,0.000046842044,0.0010597957,0.00021471077,0.00007203625,9.948774e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003290112,0.0031128817,0.046524756,0.017335325,0.002625577,0.00044482932,0.025242418,0.039128575,0.028059257,0.21849224,0.08075882,0.5349852],"study_design_scores_gemma":[0.020564223,0.0025520653,0.06915994,0.0031351997,0.0013100805,0.00005520962,0.014311309,0.6894844,0.04232002,0.026686428,0.12592259,0.004498523],"about_ca_topic_score_codex":0.00028561446,"about_ca_topic_score_gemma":0.0003003754,"teacher_disagreement_score":0.7375563,"about_ca_system_score_codex":0.000024140143,"about_ca_system_score_gemma":0.000042541964,"threshold_uncertainty_score":0.575382},"labels":[],"label_agreement":null},{"id":"W7034899143","doi":"","title":"Unmet needs for community services among the elderly : impact on health services utilization","year":2004,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","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":"McGill University Health Centre; Library and Archives Canada","funders":"","keywords":"Health services; Population; Community service; Community health; Social Welfare; Activities of daily living; Human services; Medical services","score_opus":0.0264813694979978,"score_gpt":0.29683413747905424,"score_spread":0.27035276798105645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034899143","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.9904965,0.00045152314,0.00028080144,0.0001469583,0.0016932082,0.0018713967,0.0007624217,0.000414499,0.0038826717],"genre_scores_gemma":[0.99061215,0.00015012035,0.0014116861,0.0012325092,0.00010178695,0.00022750939,0.005343944,0.00009570669,0.00082461553],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955598,0.0009830169,0.0009424757,0.0007776174,0.0010037652,0.0007333054],"domain_scores_gemma":[0.9956934,0.0007191072,0.0011203161,0.001350931,0.0007906167,0.00032566686],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002084613,0.00080329075,0.00066313,0.0007647193,0.0042749937,0.0005979727,0.0024098547,0.00049982936,0.000021974685],"category_scores_gemma":[0.000083789404,0.0006572985,0.00042127504,0.002111416,0.000039924136,0.0016966247,0.00020163099,0.0014002525,0.000053503194],"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.0003238031,0.00074286084,0.000051071445,0.0025151153,0.00040044085,0.000004453966,0.0007363304,0.029978475,0.0009820546,0.2618067,0.000017487346,0.7024412],"study_design_scores_gemma":[0.009102796,0.013783439,0.090532914,0.008967599,0.0007095033,0.00010099593,0.0105893,0.054207854,0.064925954,0.6663624,0.07331357,0.0074036894],"about_ca_topic_score_codex":0.0028401448,"about_ca_topic_score_gemma":0.008686227,"teacher_disagreement_score":0.69503754,"about_ca_system_score_codex":0.00089802797,"about_ca_system_score_gemma":0.00029519576,"threshold_uncertainty_score":0.99958783},"labels":[],"label_agreement":null},{"id":"W7040124845","doi":"","title":"BTS 097","year":2014,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Group (periodic table); Key (lock); Point (geometry)","score_opus":0.005290521405011758,"score_gpt":0.1805236775228918,"score_spread":0.17523315611788004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7040124845","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036277415,0.0002174455,0.0009653215,0.00019251727,0.0006198283,0.00022568437,0.000019812365,0.0002702929,0.99748546],"genre_scores_gemma":[0.00041995608,0.00006427318,0.014811252,0.0005000201,0.00027685007,0.000009656691,0.00010693897,0.00004913145,0.9837619],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985626,0.000071514245,0.00046413424,0.00023141182,0.00045365945,0.00021672148],"domain_scores_gemma":[0.9987295,0.00009624407,0.00046591336,0.00045638008,0.00014998486,0.000101980164],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023649876,0.0002481558,0.00029107687,0.00013137452,0.000058491347,0.00010047917,0.0006201705,0.00025239246,0.117056146],"category_scores_gemma":[0.00007971508,0.00025143157,0.00012246185,0.000015578456,0.00004691211,2.8753158e-7,0.0001500423,0.00015842248,0.0201754],"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.0000055160385,0.00002053525,2.5685034e-7,0.00013587382,0.000024006198,0.000003646799,0.00004051262,0.001267122,2.9409847e-7,0.0012323813,0.9876626,0.009607261],"study_design_scores_gemma":[0.00025854187,0.00008055951,0.0000070385436,0.00009114754,0.000012405623,0.000039342816,0.000003653866,0.0011015587,0.000012612811,0.00008358323,0.99804795,0.0002615919],"about_ca_topic_score_codex":0.0005184083,"about_ca_topic_score_gemma":0.00020477946,"teacher_disagreement_score":0.09688075,"about_ca_system_score_codex":0.000026606891,"about_ca_system_score_gemma":0.00004049013,"threshold_uncertainty_score":0.9999938},"labels":[],"label_agreement":null},{"id":"W7067295854","doi":"","title":"McAfee Help = = 1-8OO-385-4895 McAfee antivirus helpline phone number, mcafee issue support remotely by third party","year":2016,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Phone; Smart phone; Phone call; Service (business)","score_opus":0.012621145698572853,"score_gpt":0.26745845947342795,"score_spread":0.2548373137748551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7067295854","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032132154,0.000033846136,0.20311514,0.0013106106,0.0023844442,0.0012786656,0.00021439705,0.00094699796,0.7903946],"genre_scores_gemma":[0.0017825608,0.000995217,0.015884709,0.00083212106,0.0013003366,0.00017625354,0.00033155273,0.00037732942,0.97831994],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98995316,0.000911823,0.0013996116,0.0049476884,0.00156494,0.0012227879],"domain_scores_gemma":[0.9908504,0.0006065928,0.0011885146,0.0063543017,0.0003715317,0.0006286968],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003587546,0.0011900548,0.0012704937,0.0005587209,0.00036942036,0.0004816425,0.004106155,0.0010253573,0.57899725],"category_scores_gemma":[0.0009547592,0.0012000639,0.0005313486,0.0008391293,0.00027945964,0.0007558277,0.0034950294,0.00090699125,0.907105],"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.00006842891,0.00047283716,0.0003189647,0.00016906972,0.00029380398,0.00007568488,0.00027912864,0.000116743766,0.004684886,0.0016178464,0.9074113,0.084491305],"study_design_scores_gemma":[0.0012417436,0.000004520231,0.00035170073,0.0002635312,0.000089669426,0.00014067488,0.000011942978,0.0009812354,0.017433943,0.003125376,0.97505116,0.0013044884],"about_ca_topic_score_codex":0.00036316714,"about_ca_topic_score_gemma":0.00011034667,"teacher_disagreement_score":0.32810777,"about_ca_system_score_codex":0.00036724255,"about_ca_system_score_gemma":0.0006483141,"threshold_uncertainty_score":0.99904495},"labels":[],"label_agreement":null},{"id":"W7095500426","doi":"","title":"and Jewish General Hospital","year":2015,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Curriculum; Emerging technologies; Computer literacy; Judaism; Information technology; Literacy","score_opus":0.017657908460023037,"score_gpt":0.23498089719771204,"score_spread":0.217322988737689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095500426","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.18504822,0.00018634202,0.804492,0.0016737597,0.00037386548,0.000037778686,1.9604178e-7,0.00007168323,0.008116136],"genre_scores_gemma":[0.8584175,0.0000023172554,0.13912927,0.00039778612,0.00012187532,0.0000021343412,0.0000019461438,0.0000013087257,0.0019258619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996577,0.000010245889,0.00004977869,0.000117453426,0.00010239884,0.00006244482],"domain_scores_gemma":[0.9997637,0.000009806806,0.000010831821,0.000080839454,0.000055783068,0.000079027726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009056964,0.000033860524,0.000031925294,0.000031367068,0.000025266696,0.00008673862,0.00009552721,0.000012835905,0.0000036453234],"category_scores_gemma":[0.000016130822,0.000029591058,0.000008058319,0.00011830848,0.000008021606,0.0002780615,0.00007959591,0.000018467977,0.000024815414],"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.0000011466129,0.000044237968,0.0016040085,0.0000016540681,0.000006569098,0.000006127905,0.0004647198,0.0012518014,0.00019189343,0.7525936,0.032357424,0.21147683],"study_design_scores_gemma":[0.0008792477,0.00037102195,0.021168105,0.0000026741582,0.000003414766,0.000052511146,0.000030615447,0.7593235,0.0031470093,0.13920979,0.07546666,0.00034544792],"about_ca_topic_score_codex":0.000004803471,"about_ca_topic_score_gemma":0.0000013418584,"teacher_disagreement_score":0.7580717,"about_ca_system_score_codex":0.0000071727663,"about_ca_system_score_gemma":0.000031262938,"threshold_uncertainty_score":0.120668836},"labels":[],"label_agreement":null},{"id":"W7095623273","doi":"","title":"www.elsevier.com/locate/dam Fire containment in grids of dimension three and higher","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Conjecture; Vertex (graph theory); Lattice (music); Outbreak; Dimension (graph theory); Integer (computer science); Square (algebra)","score_opus":0.015269383701335213,"score_gpt":0.24679493409013115,"score_spread":0.23152555038879594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095623273","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.62311566,0.00053134875,0.37068954,0.0010058983,0.0003164855,0.00017389943,4.5764577e-7,0.000033626577,0.004133104],"genre_scores_gemma":[0.9872175,0.000016272648,0.011563237,0.0002756315,0.000030476323,0.0000026076004,0.0000030283318,0.0000025648408,0.0008886889],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992136,0.00001810293,0.00023309232,0.0002018237,0.0001988476,0.00013457137],"domain_scores_gemma":[0.9995971,0.000090587644,0.000050586485,0.00015572041,0.000055182092,0.000050840456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044595785,0.00007679127,0.0001130714,0.000092529626,0.00003639324,0.00002258336,0.00013200822,0.000037886035,0.000030260171],"category_scores_gemma":[0.0000090353205,0.000065028966,0.000020255648,0.00032337816,0.000022021703,0.00019839642,0.00012237535,0.000050211824,0.000009254092],"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.000024685081,0.00015347842,0.009537886,0.000026028167,0.00001168648,0.000014524807,0.00019911381,0.0019704276,0.0045046527,0.088654324,0.00045910553,0.8944441],"study_design_scores_gemma":[0.0015032943,0.00042204701,0.75022763,0.000069658185,0.000008158467,0.000017865268,0.000043096767,0.20307069,0.019224118,0.011756068,0.013293021,0.000364378],"about_ca_topic_score_codex":0.000028528713,"about_ca_topic_score_gemma":0.00010117057,"teacher_disagreement_score":0.8940797,"about_ca_system_score_codex":0.000029938668,"about_ca_system_score_gemma":0.000022635031,"threshold_uncertainty_score":0.26518044},"labels":[],"label_agreement":null},{"id":"W7098101160","doi":"","title":"[GM91] S. K. Ghosh and D. M. Mount. An output-sensitive algorithm for computing visibility graphs.","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Voronoi diagram; Visibility; Regular polygon; Computational geometry; Algebraic number; Robot; Time complexity","score_opus":0.017794180175355934,"score_gpt":0.29140407010059793,"score_spread":0.273609889925242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098101160","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.13316275,0.000037402202,0.8655513,0.0001502294,0.00028825706,0.0002480834,0.000003975673,0.00013236325,0.0004256386],"genre_scores_gemma":[0.53060484,0.0000014260041,0.46864682,0.00051518,0.00010814228,0.000001491294,0.0000152010325,0.000003990051,0.000102944694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987346,0.000040702806,0.00025382923,0.00049862923,0.00020451657,0.0002677155],"domain_scores_gemma":[0.998952,0.00031861177,0.00006876867,0.00023014536,0.00028609583,0.00014440293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012572599,0.00012812292,0.00013851636,0.00015773924,0.00025123885,0.00016282625,0.00017797736,0.000056915986,0.00000208241],"category_scores_gemma":[0.000039904535,0.00012247264,0.00005057677,0.0003640838,0.000041227006,0.00051136315,0.00011349963,0.00007012045,0.0000034550112],"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.0000068417935,0.00006991872,0.00015567997,0.0000064517553,0.000012029925,0.000003512714,0.00043650053,0.00036354913,0.00041029198,0.06393811,0.0001641394,0.934433],"study_design_scores_gemma":[0.0004148446,0.00018217448,0.029039178,0.000004540743,0.000005079549,0.000021168993,0.00009083825,0.95177126,0.005000659,0.01214844,0.0011241167,0.00019769858],"about_ca_topic_score_codex":0.000048738304,"about_ca_topic_score_gemma":0.00003021359,"teacher_disagreement_score":0.95140773,"about_ca_system_score_codex":0.00004327337,"about_ca_system_score_gemma":0.00003707856,"threshold_uncertainty_score":0.49942893},"labels":[],"label_agreement":null},{"id":"W7099456712","doi":"","title":"Data sources Data are from the Canadian Cancer Registry, the National Cancer Incidence Reporting System, the Canadian Mortality Data Base, and life tables.","year":2016,"lang":"en","type":"article","venue":"","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":"Cancer incidence; Cancer; Incidence (geometry); Data source; Epidemiology; MEDLINE; Cancer registry","score_opus":0.23138319386235395,"score_gpt":0.35212932197898045,"score_spread":0.1207461281166265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099456712","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.10527991,0.013609677,0.10986351,0.66836995,0.004538656,0.0021764815,0.09275739,0.000252027,0.0031524012],"genre_scores_gemma":[0.99020535,0.0000881683,0.0009959554,0.006114041,0.0010349483,0.000032912772,0.001183796,0.000008747256,0.0003361039],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996966,0.00021525055,0.00057357695,0.0010274033,0.00085489196,0.00036290058],"domain_scores_gemma":[0.993156,0.0007258589,0.00076873344,0.0046412186,0.0003651727,0.00034301393],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.004269801,0.00016813277,0.00015705387,0.000055313296,0.0020073305,0.0010542648,0.007417421,0.00006586639,0.000082848],"category_scores_gemma":[0.0031329612,0.00007680816,0.000014283891,0.00047497088,0.00019738023,0.001464446,0.0024145928,0.0001797309,0.000006902853],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004161967,0.0000114150625,0.30251262,0.0000301487,0.0002898609,0.00003393568,0.00044826855,0.0029612598,0.000036652786,0.0139844,0.6587344,0.020952873],"study_design_scores_gemma":[0.00013817883,0.0000027794147,0.37926227,0.00015949656,0.000053842265,0.000030310233,0.00026381807,0.41826713,0.000018193858,0.00052169664,0.20102286,0.00025939406],"about_ca_topic_score_codex":0.991663,"about_ca_topic_score_gemma":0.99975926,"teacher_disagreement_score":0.8849254,"about_ca_system_score_codex":0.00038540864,"about_ca_system_score_gemma":0.009503003,"threshold_uncertainty_score":0.9999827},"labels":[],"label_agreement":null},{"id":"W7099757190","doi":"","title":"On Removing Extrinsic Degeneracies in Computational Geometry","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computational geometry; Computational complexity theory; Transformation (genetics); Calculus (dental); Computation; Perturbation (astronomy)","score_opus":0.014461552831473313,"score_gpt":0.26112698815836916,"score_spread":0.24666543532689583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099757190","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.30448943,0.000045580917,0.68982875,0.0003601197,0.00022701426,0.000056268447,2.796862e-7,0.000068820904,0.004923739],"genre_scores_gemma":[0.88247347,0.0000015398136,0.11605511,0.0009442353,0.000069497335,0.0000017854464,0.000007647793,0.0000037429693,0.0004429574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998859,0.000029071309,0.00025520028,0.00028860162,0.00034825766,0.00021987388],"domain_scores_gemma":[0.9991777,0.00046580166,0.000047293655,0.00016736634,0.00007726579,0.00006458768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065974286,0.000096385105,0.00009010847,0.00063496525,0.00008821947,0.000083520164,0.00026035588,0.000040801944,0.00003531332],"category_scores_gemma":[0.0000850922,0.000094217176,0.000035001503,0.0012084846,0.000014740302,0.00032390037,0.00008081723,0.00010160363,0.00008304878],"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.0000073911515,0.000067647015,0.0006938509,0.0000029326266,0.0000029554858,0.000020530302,0.00008499885,0.19150567,0.0003395138,0.72033304,0.00032963342,0.086611845],"study_design_scores_gemma":[0.0009944965,0.00016543438,0.21962361,0.000031000585,0.000002004,0.000062224266,0.00005387253,0.6207364,0.0083281975,0.1469095,0.002618266,0.00047498444],"about_ca_topic_score_codex":0.000010605228,"about_ca_topic_score_gemma":0.000039440387,"teacher_disagreement_score":0.57798404,"about_ca_system_score_codex":0.000073719355,"about_ca_system_score_gemma":0.00005461608,"threshold_uncertainty_score":0.38420647},"labels":[],"label_agreement":null},{"id":"W7100312495","doi":"","title":"Compass Routing Suppose that","year":2008,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Compass; Visitor pattern; Intersection (aeronautics); Routing (electronic design automation); Line segment; Position (finance); Line (geometry); Real line","score_opus":0.04627960410660525,"score_gpt":0.2475316087735578,"score_spread":0.20125200466695253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100312495","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.0847415,0.000021876373,0.901191,0.0008148899,0.00023503251,0.00003938323,2.1966343e-7,0.00014209749,0.012813991],"genre_scores_gemma":[0.93328774,0.00000345149,0.06419286,0.0005432533,0.00006153864,0.0000019516863,0.0000034644647,0.0000018124975,0.001903913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945474,0.000021865542,0.000081099664,0.0001550642,0.0001724563,0.000114796945],"domain_scores_gemma":[0.99968076,0.00005378647,0.00002413349,0.00015405404,0.000041433195,0.00004585092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090565954,0.000051822855,0.00005493774,0.000054160097,0.00016946958,0.000043791264,0.00023304169,0.00001653831,0.000047644306],"category_scores_gemma":[0.000010068401,0.000046284247,0.000028445327,0.00022691033,0.000012539346,0.000328531,0.00008552154,0.00003889538,0.00014109358],"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.000005455456,0.00017008111,0.013371773,0.0000067845062,0.000024552184,0.00008261404,0.0019274827,0.012068716,0.0025278262,0.86366355,0.04107682,0.065074354],"study_design_scores_gemma":[0.00054681645,0.000073311676,0.07848057,0.0000057356647,0.0000024077522,0.0003550139,0.000031624764,0.85740787,0.03039878,0.005045843,0.02731695,0.00033507086],"about_ca_topic_score_codex":0.000009706146,"about_ca_topic_score_gemma":0.0000024921026,"teacher_disagreement_score":0.8586177,"about_ca_system_score_codex":0.000012561863,"about_ca_system_score_gemma":0.000038037128,"threshold_uncertainty_score":0.18874167},"labels":[],"label_agreement":null},{"id":"W7100688083","doi":"","title":"On the Existence of a Point Subset with 4 or 5 Interior Points","year":2007,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Convex hull; Integer (computer science); Boundary (topology); Point (geometry); Interior point method; Set (abstract data type); Regular polygon; Planar","score_opus":0.025988897171377087,"score_gpt":0.26031899552609916,"score_spread":0.23433009835472207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100688083","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.25112844,0.0000041190497,0.7425448,0.0013636296,0.00006876159,0.0000854395,4.3897435e-7,0.000023806584,0.0047806087],"genre_scores_gemma":[0.94939697,7.119047e-7,0.048651747,0.0011816871,0.000017756569,0.0000025919373,7.314313e-7,0.0000019861588,0.0007458283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993974,0.000022073807,0.00013422774,0.00014017042,0.00020631369,0.000099832294],"domain_scores_gemma":[0.99929273,0.00030254273,0.0000549005,0.00023210359,0.000086532884,0.000031174102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046440348,0.00005745489,0.00006251757,0.00006453746,0.000046189303,0.000032440916,0.00030204174,0.000013188342,0.000087654866],"category_scores_gemma":[0.00005859376,0.000027293989,0.000019995765,0.00039197,0.000030263269,0.00012500843,0.000057668643,0.000043893884,0.000022626731],"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.00019068805,0.0000740067,0.00012780834,0.00000836623,0.0000151835675,0.000017596489,0.0007782308,0.00020546564,0.0018427502,0.9707476,0.0014213055,0.024571003],"study_design_scores_gemma":[0.0030150188,0.0073700957,0.057839576,0.00042209253,0.000025572808,0.0005643243,0.0012673729,0.18041214,0.6410512,0.099322945,0.007576048,0.001133659],"about_ca_topic_score_codex":0.0000079235615,"about_ca_topic_score_gemma":0.00005795615,"teacher_disagreement_score":0.8714247,"about_ca_system_score_codex":0.000012573607,"about_ca_system_score_gemma":0.000042041138,"threshold_uncertainty_score":0.11130166},"labels":[],"label_agreement":null},{"id":"W7101016880","doi":"","title":"k-d range search with binary patricia tries","year":2004,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Trie; Set (abstract data type); Range (aeronautics); Data set; Ternary search tree; Binary search algorithm; Binary search tree; Range query (database)","score_opus":0.015999233210768342,"score_gpt":0.23822623347757588,"score_spread":0.22222700026680753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101016880","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.17643379,0.000070820875,0.8186816,0.0016778586,0.00006855663,0.00007574227,3.5764867e-7,0.000100893674,0.002890402],"genre_scores_gemma":[0.90505326,0.000006525085,0.093837164,0.00032067357,0.0000693175,0.0000047766916,0.000002891208,0.0000025463162,0.0007028691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993994,0.000017285196,0.00007218581,0.00016705501,0.00022578938,0.00011826648],"domain_scores_gemma":[0.99968445,0.00003065369,0.000013312327,0.00014686846,0.000079351536,0.000045381403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011658608,0.00005621508,0.0000537538,0.00011043238,0.000099742196,0.000082075014,0.00019459499,0.000017618868,0.000018637731],"category_scores_gemma":[0.000005182225,0.000041111092,0.000017677849,0.0006674745,0.000016841019,0.00033398613,0.000056299672,0.000045677807,0.00005188429],"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.000049058046,0.00025253804,0.0013661386,0.000018495135,0.000026183978,0.00006256959,0.0013307309,0.21172863,0.0011605792,0.70613766,0.0013141823,0.07655323],"study_design_scores_gemma":[0.022914289,0.008025581,0.2523179,0.00016394592,0.00006208527,0.00050255307,0.00080697547,0.31950217,0.19287397,0.12948802,0.069873944,0.003468562],"about_ca_topic_score_codex":0.000027216844,"about_ca_topic_score_gemma":0.000010939553,"teacher_disagreement_score":0.72861946,"about_ca_system_score_codex":0.00002326643,"about_ca_system_score_gemma":0.00012630183,"threshold_uncertainty_score":0.16764617},"labels":[],"label_agreement":null},{"id":"W7104289419","doi":"10.20382/jocg.v16i1a16","title":"Dynamic unit-disk range reporting","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Amortized analysis; Data structure; Set (abstract data type); Range (aeronautics); Point (geometry); Range query (database); Constant (computer programming); Space (punctuation)","score_opus":0.014139266720189333,"score_gpt":0.25532853712106013,"score_spread":0.2411892704008708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104289419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19798425,0.00023522635,0.79553473,0.0012791817,0.00077237503,0.00007739645,0.0000027837823,0.00004462585,0.0040694354],"genre_scores_gemma":[0.88955677,0.000034126908,0.1071622,0.00037206008,0.00006766928,1.6836202e-7,0.000010728821,0.000006197719,0.0027900818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791324,0.00013931957,0.0008984558,0.00025907226,0.0005804811,0.00020940308],"domain_scores_gemma":[0.99652845,0.0004437108,0.0015166795,0.0002059194,0.0011797352,0.00012547895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008512512,0.00016215534,0.00032460282,0.0025029609,0.00025126128,0.00013551673,0.0007773469,0.00008442218,0.000024440658],"category_scores_gemma":[0.00036854978,0.00017498067,0.00024984154,0.0038218875,0.000051761224,0.00096433976,0.00020798779,0.0002911613,0.000009063779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009836434,0.00023229148,0.0053664227,0.000057706555,0.00031216457,0.00048160533,0.00018546305,0.7483095,0.00038514443,0.18578875,0.0021361606,0.05664642],"study_design_scores_gemma":[0.005318656,0.00055415113,0.1928468,0.00038905453,0.00023261116,0.0008799454,0.00057046395,0.54686576,0.0006022294,0.09463806,0.15619057,0.00091167085],"about_ca_topic_score_codex":0.0000053244526,"about_ca_topic_score_gemma":0.0000030213646,"teacher_disagreement_score":0.69157255,"about_ca_system_score_codex":0.00020851672,"about_ca_system_score_gemma":0.0006800717,"threshold_uncertainty_score":0.71355045},"labels":[],"label_agreement":null},{"id":"W7106804950","doi":"10.4230/lipics.gd.2025.34","title":"Layered Polyline Drawings of Planar Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Embedding; Planar; Book embedding; Planar graph; Planar straight-line graph; Graph; Vertex (graph theory); Outerplanar graph","score_opus":0.00862720144262005,"score_gpt":0.2555538395783557,"score_spread":0.24692663813573565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106804950","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.078226954,0.0001019067,0.9139765,0.0008214704,0.0010680694,0.0005769485,0.00015646085,0.00014209945,0.004929598],"genre_scores_gemma":[0.91159356,0.000023998207,0.0855373,0.0016294261,0.00006488505,0.000047658166,0.0003350622,0.000012136424,0.0007559484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980985,0.000025852944,0.00092353066,0.00021638384,0.00036597822,0.0003697324],"domain_scores_gemma":[0.9985339,0.00016640416,0.00032433105,0.00052693154,0.00035347234,0.00009495932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043192974,0.00022938402,0.00032996605,0.00057908305,0.00022221253,0.00018184051,0.00087721186,0.00012958702,0.00001033407],"category_scores_gemma":[0.00008753609,0.00021783047,0.00020347502,0.0009060653,0.0000647767,0.0010166367,0.0002145218,0.00017796838,0.000022800357],"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.00016531654,0.00056395895,0.0043159053,0.00093326153,0.00037906802,0.0000037818827,0.0056675696,0.003073848,0.0014452972,0.90529114,0.022068404,0.05609247],"study_design_scores_gemma":[0.009832056,0.00081657834,0.010133619,0.00061526144,0.000115685376,0.00006672939,0.0008931234,0.610821,0.03838949,0.09002932,0.23687802,0.0014091212],"about_ca_topic_score_codex":0.000014304536,"about_ca_topic_score_gemma":0.0000083939085,"teacher_disagreement_score":0.83336663,"about_ca_system_score_codex":0.00004810534,"about_ca_system_score_gemma":0.00014514531,"threshold_uncertainty_score":0.8882869},"labels":[],"label_agreement":null},{"id":"W7109951950","doi":"10.4230/lipics.socg.2025.63","title":"The Maximum Clique Problem in a Disk Graph Made Easy","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clique graph; Block graph; Unit disk graph; Split graph; Clique problem; Perfect graph; Circle graph; Independent set; Time complexity","score_opus":0.0075087614687796905,"score_gpt":0.25114617129617944,"score_spread":0.24363740982739976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109951950","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.03028687,0.00017382384,0.9533611,0.0029268023,0.0012309364,0.0014741023,0.00005683343,0.00017128237,0.010318227],"genre_scores_gemma":[0.88119346,0.00022354447,0.109160416,0.0044996743,0.00019393033,0.0008100202,0.00032633217,0.000034839813,0.003557805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978042,0.000065079796,0.000946402,0.00026194955,0.00035751742,0.00056481856],"domain_scores_gemma":[0.9985446,0.00030286243,0.00023577255,0.0006057436,0.00021789156,0.00009316495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009151494,0.00025731558,0.00024604285,0.00041272247,0.0004967588,0.0006407628,0.0011896518,0.00013568024,0.000003623641],"category_scores_gemma":[0.000095157804,0.00019813277,0.00017299602,0.0011371671,0.00008059118,0.0011474488,0.0004199174,0.00033744914,0.00003866513],"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.00015622807,0.00046334782,0.0065119616,0.0005189173,0.00017597803,0.0000063021052,0.0052202702,0.007885953,0.00011968593,0.7831103,0.010181801,0.18564922],"study_design_scores_gemma":[0.0042911773,0.0002707391,0.0102170715,0.00033781875,0.000028535269,0.000040414372,0.0006722788,0.3876466,0.001512453,0.20169869,0.39249212,0.00079214555],"about_ca_topic_score_codex":0.0000164761,"about_ca_topic_score_gemma":0.000072418006,"teacher_disagreement_score":0.85090655,"about_ca_system_score_codex":0.000114671886,"about_ca_system_score_gemma":0.00018589624,"threshold_uncertainty_score":0.807962},"labels":[],"label_agreement":null},{"id":"W7109965980","doi":"10.4230/lipics.socg.2025.27","title":"Computing Oriented Spanners and Their Dilation","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Dilation (metric space); Metric space; Graph; Bounded function; Euclidean space; Spanner; Euclidean geometry","score_opus":0.0074592806182025954,"score_gpt":0.24557980452111358,"score_spread":0.238120523902911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109965980","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.1370184,0.000065357526,0.85854286,0.00060899684,0.000885319,0.00046563437,0.000036103018,0.00015871602,0.0022186427],"genre_scores_gemma":[0.951282,0.000014273051,0.046764854,0.001254517,0.000091486974,0.000021455115,0.0002645243,0.0000095005435,0.0002973632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855864,0.00003175911,0.00061852275,0.00024460568,0.0001996539,0.0003467997],"domain_scores_gemma":[0.9988687,0.00020642762,0.0002142271,0.00034216163,0.0002753193,0.000093164075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045230903,0.0002302814,0.00023576968,0.00036015303,0.00042743926,0.00036215622,0.00040115564,0.000107275904,0.0000032171647],"category_scores_gemma":[0.00008761143,0.00020217462,0.000093969604,0.00064320996,0.00005417906,0.0011178401,0.0003467328,0.00017622593,0.000013006459],"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.00010955887,0.00035318919,0.008794191,0.00073866354,0.0003288251,0.00000224836,0.019948868,0.013885782,0.0005438416,0.53716516,0.008536484,0.40959316],"study_design_scores_gemma":[0.0014612823,0.000088304216,0.0036298484,0.00010250949,0.000012039434,0.000015716705,0.00055979105,0.92897093,0.0016155033,0.0035349322,0.059730373,0.00027875285],"about_ca_topic_score_codex":0.000005124906,"about_ca_topic_score_gemma":0.000005024456,"teacher_disagreement_score":0.91508514,"about_ca_system_score_codex":0.00007018711,"about_ca_system_score_gemma":0.000084370404,"threshold_uncertainty_score":0.8244442},"labels":[],"label_agreement":null},{"id":"W7110004160","doi":"10.4230/lipics.mfcs.2025.27","title":"Cops and Robbers for Graphs on Surfaces with Crossings","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Vertex (graph theory); Graph; 1-planar graph; Combinatorial game theory; Class (philosophy); Finite set; Pathwidth","score_opus":0.008104777419133605,"score_gpt":0.2520444242275468,"score_spread":0.2439396468084132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110004160","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.2813464,0.000058090653,0.7134987,0.001073124,0.0005814528,0.0010068633,0.00009396912,0.00013254612,0.0022088333],"genre_scores_gemma":[0.8828149,0.000019293455,0.11283545,0.0026269157,0.000045539742,0.00015522545,0.00021902632,0.000016916301,0.0012667291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986142,0.0000158038,0.00046825703,0.0002684181,0.00026045844,0.00037288078],"domain_scores_gemma":[0.9988184,0.00027000936,0.00019345374,0.00032994905,0.00029072384,0.000097487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036674115,0.00024323992,0.0002506976,0.0003152434,0.00054392056,0.00073842786,0.0004244802,0.00009790473,0.0000022468316],"category_scores_gemma":[0.00005222336,0.00020107755,0.000091105016,0.0004782751,0.00010543367,0.0010544845,0.00012876351,0.00013721592,0.0000062199206],"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.000986669,0.0006434023,0.008702062,0.0016095348,0.0005876529,0.0000040709224,0.013059686,0.024831666,0.0003059423,0.7891168,0.034815904,0.12533662],"study_design_scores_gemma":[0.009410827,0.0015941213,0.0060278433,0.00050398364,0.00008282676,0.00004382532,0.0007427181,0.721648,0.0059390054,0.026062114,0.22690953,0.0010352246],"about_ca_topic_score_codex":0.000006519346,"about_ca_topic_score_gemma":0.000016863838,"teacher_disagreement_score":0.76305467,"about_ca_system_score_codex":0.000050682153,"about_ca_system_score_gemma":0.00011977295,"threshold_uncertainty_score":0.8199704},"labels":[],"label_agreement":null},{"id":"W7110055507","doi":"10.4230/lipics.isaac.2025.46","title":"Realizing Metric Spaces with Convex Obstacles","year":2025,"lang":"en","type":"article","venue":"Leibniz-Zentrum für Informatik (Schloss Dagstuhl)","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 Ottawa","funders":"","keywords":"Disjoint sets; Geodesic; Metric space; Multiplicative function; Metric (unit); Regular polygon; Finite set; Distortion (music); Boundary (topology); Euclidean space","score_opus":0.007228901466821838,"score_gpt":0.2571630820249401,"score_spread":0.24993418055811825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110055507","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.09386055,0.0010332528,0.83780134,0.003486213,0.0010048134,0.0007438279,0.000021659042,0.00069334934,0.06135498],"genre_scores_gemma":[0.97028685,0.000101172525,0.02561824,0.0019834526,0.00010535096,0.00005615664,0.00008361448,0.000014269133,0.0017508938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975491,0.00007282307,0.00066486135,0.00038193434,0.00073288754,0.0005983524],"domain_scores_gemma":[0.99815845,0.00029191867,0.0003167441,0.0007464693,0.00031699325,0.00016941514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005063118,0.00035224904,0.00038459274,0.00096295314,0.000524969,0.0009748522,0.0011101377,0.00012506364,0.00003438234],"category_scores_gemma":[0.00014685337,0.0002959067,0.000104505314,0.0034051246,0.00009737436,0.002617735,0.00046514082,0.00028902802,0.00014595526],"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.0001125707,0.00020748202,0.005875666,0.00038165762,0.00035267623,0.000031415886,0.0033807529,0.017578159,0.00024203271,0.8249117,0.01695397,0.12997194],"study_design_scores_gemma":[0.00613863,0.0008107977,0.055012472,0.0006944698,0.00017494259,0.00021922436,0.0030783887,0.31018594,0.020287722,0.019311216,0.5816735,0.0024127222],"about_ca_topic_score_codex":0.0000732104,"about_ca_topic_score_gemma":0.00003579344,"teacher_disagreement_score":0.8764263,"about_ca_system_score_codex":0.00013982836,"about_ca_system_score_gemma":0.00038267777,"threshold_uncertainty_score":0.9999493},"labels":[],"label_agreement":null},{"id":"W7110121538","doi":"10.4230/lipics.wads.2025.8","title":"Tight Bounds on the Number of Closest Pairs in Vertical Slabs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; Fonds De La Recherche Scientifique - FNRS; Institute for Information and Communications Technology Promotion; National Science Foundation","keywords":"Hyperplane; Sequence (biology); Set (abstract data type); Point (geometry); Upper and lower bounds","score_opus":0.012313831353453888,"score_gpt":0.27683690768450436,"score_spread":0.2645230763310505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110121538","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.6681765,0.00002972081,0.29986304,0.003472924,0.00130914,0.00084440754,0.00005626767,0.00009014655,0.026157886],"genre_scores_gemma":[0.9909994,0.000009277183,0.0064171785,0.0019813555,0.00004932808,0.00006405843,0.000060563245,0.0000077276245,0.00041112732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826634,0.000054187654,0.00076920993,0.00018623025,0.0003826333,0.00034140173],"domain_scores_gemma":[0.99863905,0.0004638731,0.00012002296,0.0005256725,0.00019162375,0.00005978862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006124166,0.00019242897,0.00024310633,0.00023637584,0.00018046229,0.00019305405,0.00079629006,0.000111964175,0.000029146513],"category_scores_gemma":[0.00017139346,0.00014338573,0.0001358621,0.000789772,0.00008780044,0.0005972474,0.00024412268,0.00025578393,0.00008095678],"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.000100833975,0.0003616668,0.012447831,0.0002278044,0.00009043174,0.0000026493708,0.002958773,0.0011609729,0.00009062249,0.95913863,0.010324113,0.01309566],"study_design_scores_gemma":[0.0057356465,0.00045879468,0.034044188,0.00065858045,0.000051135237,0.00003945734,0.0008504196,0.7213789,0.016906857,0.046612214,0.17235363,0.00091014436],"about_ca_topic_score_codex":0.0000092297805,"about_ca_topic_score_gemma":0.000013581459,"teacher_disagreement_score":0.9125264,"about_ca_system_score_codex":0.000088988614,"about_ca_system_score_gemma":0.00014569421,"threshold_uncertainty_score":0.58471},"labels":[],"label_agreement":null},{"id":"W7110328884","doi":"10.4230/lipics.esa.2025.67","title":"Compact Representation of Semilinear and Terrain-Like Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds De La Recherche Scientifique - FNRS; McGill University","keywords":"Bipartite graph; Bounded function; Indifference graph; Complete bipartite graph; 1-planar graph; Intersection graph; Chordal graph; Simple (philosophy); Intersection (aeronautics)","score_opus":0.013114473344465449,"score_gpt":0.28407635634429196,"score_spread":0.2709618829998265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110328884","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.30676407,0.00012333329,0.68744564,0.000528787,0.0008391159,0.0006818676,0.000088145396,0.00010507526,0.0034239714],"genre_scores_gemma":[0.96821374,0.000037236805,0.030219894,0.000823666,0.00003148965,0.000020407118,0.00024013921,0.00000785319,0.00040555006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985059,0.000035654954,0.00071917195,0.00020780881,0.00028151038,0.0002499817],"domain_scores_gemma":[0.998764,0.00019617604,0.00026242906,0.00041656097,0.00028062286,0.00008020787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003465115,0.00018032554,0.00028106858,0.000424592,0.00018865483,0.00017306287,0.00042345605,0.00009258644,0.0000052529463],"category_scores_gemma":[0.000080354475,0.00017145408,0.00012328058,0.0007117752,0.000079260426,0.0009888654,0.00018589386,0.00013478934,0.0000060558878],"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.00044423473,0.0014133204,0.08595471,0.0033456301,0.0011535892,0.000007767478,0.043579366,0.016801825,0.0054093413,0.583107,0.061742097,0.1970411],"study_design_scores_gemma":[0.0050769686,0.00047564466,0.027535025,0.0002976202,0.000074580414,0.000049949158,0.0011803878,0.8822955,0.015718957,0.021410381,0.04523228,0.0006527371],"about_ca_topic_score_codex":0.000018237595,"about_ca_topic_score_gemma":0.000007817755,"teacher_disagreement_score":0.86549366,"about_ca_system_score_codex":0.00003323079,"about_ca_system_score_gemma":0.00007595315,"threshold_uncertainty_score":0.69916946},"labels":[],"label_agreement":null},{"id":"W7110338092","doi":"10.4230/lipics.esa.2025.75","title":"An Improved Bound for Plane Covering Paths","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Agence Nationale de la Recherche; National Science Foundation","keywords":"Path (computing); Plane (geometry); Upper and lower bounds; Point (geometry); Set (abstract data type); Simple (philosophy)","score_opus":0.009719720804736804,"score_gpt":0.2711440292397116,"score_spread":0.2614243084349748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110338092","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.06541774,0.000045085442,0.9299866,0.00027720278,0.0015639644,0.0010946344,0.00026657927,0.00019409359,0.0011541153],"genre_scores_gemma":[0.8252386,0.00001802355,0.1690694,0.0028005692,0.00029415544,0.0003530272,0.0013752043,0.0000262483,0.0008247883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982255,0.000021955988,0.0007267783,0.0002945507,0.00023977658,0.00049144006],"domain_scores_gemma":[0.9985209,0.00020380785,0.00023139514,0.00058780384,0.0003228998,0.00013319132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053439883,0.00025995678,0.00028074373,0.00030816387,0.00046866995,0.0007452057,0.0008723746,0.00014195082,0.000006027271],"category_scores_gemma":[0.000090526584,0.0002561463,0.00015636814,0.00039175304,0.00003856695,0.00189955,0.00019738295,0.00016016171,0.00001665706],"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.00081757363,0.0017062942,0.0026752048,0.0032969567,0.00077124767,0.0000069671837,0.0153001305,0.022772888,0.009646013,0.4841325,0.032472514,0.4264017],"study_design_scores_gemma":[0.0025771067,0.00039172164,0.0005083938,0.000067692425,0.000024383278,0.000013247439,0.00020239592,0.86926335,0.005251375,0.006269711,0.11504727,0.00038333333],"about_ca_topic_score_codex":0.000008730635,"about_ca_topic_score_gemma":0.000016189762,"teacher_disagreement_score":0.8464905,"about_ca_system_score_codex":0.000108870525,"about_ca_system_score_gemma":0.00018477201,"threshold_uncertainty_score":0.9999891},"labels":[],"label_agreement":null},{"id":"W7110402696","doi":"10.4230/lipics.socg.2025.20","title":"Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Ottawa; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Trafikverket; Vetenskapsrådet; National Science Foundation","keywords":"Boundary (topology); Simple polygon; Polygon (computer graphics); Visibility polygon; Piecewise linear function; Merge (version control); Time complexity; Simple (philosophy); Piecewise","score_opus":0.009852901843521469,"score_gpt":0.2450447533529187,"score_spread":0.23519185150939723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110402696","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.018483344,0.00016263839,0.9666638,0.0019013447,0.0017422953,0.0023877574,0.00020108264,0.00030532439,0.008152441],"genre_scores_gemma":[0.45233607,0.00021262927,0.4712635,0.0068769073,0.0006129719,0.0015909389,0.0035220475,0.00012350608,0.0634614],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801564,0.000028293465,0.0009071481,0.00032284606,0.00024952882,0.00047651542],"domain_scores_gemma":[0.99859244,0.00024310665,0.00027832272,0.0004123842,0.0003427486,0.00013098694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062466797,0.0002850395,0.00036762582,0.00038711698,0.0003918891,0.0004942486,0.00053806906,0.00018999208,0.000012487549],"category_scores_gemma":[0.000109384964,0.0002745321,0.00016962859,0.00045480652,0.00007344106,0.0012131926,0.00026928712,0.00018424653,0.00007144253],"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.00031782806,0.0010995885,0.0010948502,0.002431248,0.0014127909,0.0000073968795,0.011633312,0.010389506,0.0019187912,0.047255527,0.54794765,0.3744915],"study_design_scores_gemma":[0.0037177226,0.00026702948,0.0005279425,0.00014001936,0.000038599275,0.000044401128,0.000077551354,0.7077219,0.00079453544,0.0032710058,0.28298977,0.00040952838],"about_ca_topic_score_codex":0.0000029998816,"about_ca_topic_score_gemma":0.0000027859928,"teacher_disagreement_score":0.6973324,"about_ca_system_score_codex":0.00007498708,"about_ca_system_score_gemma":0.00014564523,"threshold_uncertainty_score":0.9999707},"labels":[],"label_agreement":null},{"id":"W7115592553","doi":"10.23977/acss.2025.090406","title":"A Study on the Recursive Decomposition and Optimization Strategies of N-Face Solids Based on CAD/CAE Integration","year":2025,"lang":"","type":"article","venue":"Advances in Computer Signals and Systems","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Robustness (evolution); Decomposition; Convergence (economics); Recursion (computer science); Computational complexity theory; Polygon mesh; Fidelity","score_opus":0.01985727885680522,"score_gpt":0.3128591231518051,"score_spread":0.29300184429499987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115592553","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.049565766,0.0034044213,0.9430571,0.00064224633,0.0014420827,0.0014581005,0.000010209767,0.000021676227,0.00039836456],"genre_scores_gemma":[0.99299467,0.00035655787,0.0061506876,0.0002489539,0.00012684501,0.00008256212,0.000012855361,0.000008102273,0.000018775008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968487,0.00096981606,0.0008091663,0.0007089397,0.0004385468,0.00022484706],"domain_scores_gemma":[0.9974785,0.0013813718,0.00040644407,0.00036893922,0.0003116328,0.0000531544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011224299,0.00032755334,0.0004579526,0.0005120291,0.00032917477,0.0006455759,0.0003185605,0.00010524769,0.0000020639723],"category_scores_gemma":[0.000037806516,0.00025544854,0.00005393148,0.0009807044,0.000108583095,0.000820924,0.00011106184,0.00023503003,8.165083e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086199965,0.00034993046,0.00018432707,0.000104184095,0.000028142891,0.0000048832835,0.0018863237,0.91288924,0.0000697495,0.048745614,0.000036176938,0.03561523],"study_design_scores_gemma":[0.00089405297,0.0019835082,0.0011542185,0.0014434265,0.000024254092,0.000004425603,0.0018715349,0.9901314,0.00040343415,0.0018335738,0.00005217058,0.00020401942],"about_ca_topic_score_codex":0.00003409408,"about_ca_topic_score_gemma":0.000024637253,"teacher_disagreement_score":0.9434289,"about_ca_system_score_codex":0.0000714935,"about_ca_system_score_gemma":0.00015661718,"threshold_uncertainty_score":0.99998975},"labels":[],"label_agreement":null},{"id":"W7125895319","doi":"10.1145/3757377.3794980","title":"10.1145/3757377.3794980","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Computational geometry; Computational model; Term (time)","score_opus":0.005659340215562753,"score_gpt":0.17770921910154439,"score_spread":0.17204987888598164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125895319","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009363555,0.00004309285,0.006098415,0.00094326976,0.000010088152,0.00011433013,0.000002279155,0.00019156562,0.9916606],"genre_scores_gemma":[0.00096697384,1.665258e-7,0.0070689805,0.00022802076,0.00013521222,0.000009170177,0.000009355614,0.000005015266,0.9915771],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992615,0.00003005853,0.000120503406,0.00023374213,0.00019335223,0.00016087454],"domain_scores_gemma":[0.9995264,0.00004079412,0.000016913424,0.00025983,0.000051649375,0.00010441826],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012842128,0.00008126481,0.00007732791,0.00008783925,0.000087422784,0.000102243,0.00036168552,0.000027476812,0.89927274],"category_scores_gemma":[0.00001538169,0.00008279901,0.000034963698,0.00047389997,0.000008106143,0.00023695805,0.000058812624,0.000043355456,0.9505761],"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.0000062303257,0.000024748304,5.2823268e-8,0.0000010937729,0.000003963059,0.0000025466938,0.000017779133,0.00550665,0.00008687067,0.00014474514,0.07613087,0.9180744],"study_design_scores_gemma":[0.00009854351,0.000077285906,0.00007258793,0.000003440106,0.0000018928152,0.000009838476,8.872193e-8,0.032558776,0.00023825823,0.00012078371,0.96671015,0.00010837089],"about_ca_topic_score_codex":0.0000038009134,"about_ca_topic_score_gemma":5.663004e-8,"teacher_disagreement_score":0.91796607,"about_ca_system_score_codex":0.0000194393,"about_ca_system_score_gemma":0.000036578134,"threshold_uncertainty_score":0.33764455},"labels":[],"label_agreement":null},{"id":"W7125968936","doi":"10.1145/3757374.3795008","title":"10.1145/3757374.3795008","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Key (lock); Term (time); Focus (optics)","score_opus":0.005780894906592108,"score_gpt":0.17672525348700446,"score_spread":0.17094435858041235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125968936","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009630385,0.00004694148,0.005559912,0.0009827892,0.000010447177,0.00012057025,0.0000022675113,0.00019266363,0.9921214],"genre_scores_gemma":[0.0008514946,2.0416539e-7,0.0069780406,0.00022629672,0.00013109809,0.000009459693,0.0000094561165,0.000004992418,0.991789],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926865,0.000028948187,0.00011801174,0.00023239737,0.0001933075,0.00015869393],"domain_scores_gemma":[0.999532,0.000039995117,0.000016501112,0.00025779064,0.000050428498,0.000103329076],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011367912,0.00008127015,0.00007761072,0.00008696209,0.00008979254,0.00009827103,0.0003563661,0.000027257853,0.89407676],"category_scores_gemma":[0.000014266488,0.000082344406,0.000034733363,0.00045968036,0.000008371935,0.00023580692,0.00005962849,0.000042361607,0.94915766],"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.00000658255,0.000024941563,5.1341704e-8,0.0000010955968,0.0000037894342,0.0000026605824,0.000018048566,0.0053987917,0.00009305499,0.00010661748,0.0946891,0.8996553],"study_design_scores_gemma":[0.000101596306,0.0000759601,0.00006295144,0.0000033888055,0.0000018056667,0.000010867846,8.6305235e-8,0.030775653,0.00025209773,0.000107910324,0.96849984,0.000107871616],"about_ca_topic_score_codex":0.0000034096229,"about_ca_topic_score_gemma":5.416836e-8,"teacher_disagreement_score":0.8995474,"about_ca_system_score_codex":0.00001963096,"about_ca_system_score_gemma":0.000034878947,"threshold_uncertainty_score":0.33579075},"labels":[],"label_agreement":null},{"id":"W7127190243","doi":"10.20382/jocg.v16i2a5","title":"A quadtree, a Steiner spanner, and approximate nearest neighbours in hyperbolic space","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Euclidean geometry; Euclidean space; Point (geometry); Hyperbolic geometry; Simple (philosophy); Spanner; Hyperbolic tree; Space (punctuation)","score_opus":0.006018767731506937,"score_gpt":0.20835488728107207,"score_spread":0.20233611954956512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127190243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42909566,0.00046240218,0.5658929,0.0021403225,0.00031915418,0.00009794136,0.0000029805972,0.000022824246,0.001965858],"genre_scores_gemma":[0.961431,0.00007631,0.03694767,0.00030084056,0.00007740577,2.8883673e-7,0.0000050701615,0.000006047735,0.0011553544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858874,0.00013819285,0.00037336323,0.00026866264,0.00041225844,0.00021877787],"domain_scores_gemma":[0.9986259,0.00037295828,0.00028602555,0.00014560111,0.00043932404,0.00013022572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004036827,0.00016482222,0.00030309157,0.0027183236,0.00012512498,0.00014797483,0.0004954641,0.00008132227,0.000009253445],"category_scores_gemma":[0.00009340836,0.00017473471,0.000105458486,0.0032979236,0.00006607289,0.0008691658,0.00021081584,0.00026683643,0.0000031827688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012832088,0.00024863434,0.007939573,0.000055460172,0.000112618494,0.0002480234,0.00034086825,0.6315539,0.00024617236,0.33621302,0.0009293077,0.021984126],"study_design_scores_gemma":[0.0072546815,0.0005805773,0.19355199,0.000392848,0.00010008104,0.00043551828,0.0007893186,0.6911762,0.0004225075,0.052078757,0.05244731,0.0007702545],"about_ca_topic_score_codex":0.00002407935,"about_ca_topic_score_gemma":0.000014862094,"teacher_disagreement_score":0.53233534,"about_ca_system_score_codex":0.00014976175,"about_ca_system_score_gemma":0.00040183656,"threshold_uncertainty_score":0.7125475},"labels":[],"label_agreement":null},{"id":"W7162089947","doi":"10.82308/54166","title":"Parallel implementation of hierarchical tetrahedral - octahedral (HTO) subdivision for 3-D finite element mesh refinement","year":2006,"lang":"en","type":"dissertation","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Subdivision; Tetrahedron; Supercomputer; Finite element method; Mesh generation; Parallel algorithm; Data structure; Interface (matter)","score_opus":0.016645666355719825,"score_gpt":0.31414473987029984,"score_spread":0.29749907351458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7162089947","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.03458418,0.00017643197,0.9590524,0.0004369045,0.0013463319,0.0015679442,0.000109004686,0.00012535373,0.0026014396],"genre_scores_gemma":[0.5553284,0.00008386295,0.40015712,0.00036484006,0.00069132773,0.0007595046,0.027276216,0.00006992049,0.015268749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966647,0.000085750755,0.0011638249,0.0007564969,0.0008962699,0.00043294262],"domain_scores_gemma":[0.99813324,0.0002620939,0.00058377616,0.00043949607,0.00047891168,0.00010250183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051806297,0.000385662,0.0004504136,0.0005330595,0.00020942037,0.0001500121,0.00063076254,0.0002039487,0.00018632459],"category_scores_gemma":[0.000036803354,0.0003811877,0.00030961784,0.0005026517,0.000019621531,0.0003527845,0.00009007143,0.00018209414,0.000010824328],"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.00031381223,0.00069350546,0.0004487565,0.0007133699,0.00025620562,0.0000058614073,0.0013509366,0.012430161,0.0034755145,0.59346896,0.040955763,0.34588718],"study_design_scores_gemma":[0.014662495,0.005773135,0.09002244,0.00046226796,0.0005341,0.000014214352,0.0015504216,0.55401516,0.13556951,0.10629752,0.08688761,0.0042110845],"about_ca_topic_score_codex":0.00022347335,"about_ca_topic_score_gemma":0.0010435639,"teacher_disagreement_score":0.5588953,"about_ca_system_score_codex":0.00011599849,"about_ca_system_score_gemma":0.0003934166,"threshold_uncertainty_score":0.999864},"labels":[],"label_agreement":null},{"id":"W74690725","doi":"10.1007/978-3-642-25011-8_22","title":"Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Venn diagram; Stereographic projection; Simple (philosophy); Projection (relational algebra); Diagram; Regular polygon; Point (geometry); Computer science; Geometry; Mathematics; Combinatorics; Algorithm; Statistics","score_opus":0.02557290778734683,"score_gpt":0.24529499863670667,"score_spread":0.21972209084935984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W74690725","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.00035236264,0.0013342692,0.9916318,0.0003059268,0.002243459,0.0004210435,0.000009139158,0.00021072391,0.0034912403],"genre_scores_gemma":[0.32087395,0.0001430322,0.6707989,0.005095223,0.0017115811,0.00002565055,0.00008702741,0.000075312884,0.0011893627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953632,0.000069412126,0.0007307754,0.0017856737,0.0011803431,0.0008706356],"domain_scores_gemma":[0.99702287,0.00056449155,0.00041499225,0.0012633102,0.00043697978,0.00029738588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012333797,0.000631752,0.0005834075,0.0015859845,0.00044650814,0.0008252022,0.002826512,0.0003709694,0.000074252814],"category_scores_gemma":[0.00018451278,0.00061596814,0.000188477,0.0016148655,0.00033001325,0.0009544726,0.0012877389,0.00076594343,0.00012905277],"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.000004376849,0.00006288908,0.00008598792,0.000043079053,0.000030925585,0.000090455964,0.000644097,0.13136391,0.0005093739,0.082112364,0.0001650461,0.7848875],"study_design_scores_gemma":[0.0002779118,0.00023025059,0.0001016795,0.00009282865,0.000014723121,0.000088488094,1.1618612e-7,0.770645,0.0024915605,0.21499455,0.010211256,0.00085162104],"about_ca_topic_score_codex":0.000099012235,"about_ca_topic_score_gemma":0.000103452876,"teacher_disagreement_score":0.78403586,"about_ca_system_score_codex":0.00031639324,"about_ca_system_score_gemma":0.0007018845,"threshold_uncertainty_score":0.99962914},"labels":[],"label_agreement":null},{"id":"W75458656","doi":"10.1007/978-3-319-14974-5_4","title":"Three Paths to Point Placement","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Windsor","funders":"","keywords":"Vertex (graph theory); Computer science; Graph; Combinatorics; Uniqueness; Point (geometry); Algorithm; Upper and lower bounds; Line segment; Mathematics; Theoretical computer science; Artificial intelligence; Geometry","score_opus":0.03093253618498641,"score_gpt":0.26538787984099416,"score_spread":0.23445534365600773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75458656","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.000052244886,0.000358265,0.9907961,0.0019316159,0.0024869945,0.0005150484,0.000005446584,0.00013656,0.0037177203],"genre_scores_gemma":[0.04191567,0.0000106335065,0.95209914,0.003932994,0.0011359617,0.000026059992,0.000017505357,0.000035609883,0.0008264441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611443,0.000019907122,0.0004712005,0.0014132696,0.0014466702,0.00053454284],"domain_scores_gemma":[0.99763936,0.00021923106,0.00017251297,0.0011147668,0.00050333486,0.00035078503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012715422,0.00043435054,0.000381987,0.0010025195,0.00019101576,0.0004976541,0.002341312,0.00018405178,0.000037551035],"category_scores_gemma":[0.00011511994,0.00040902305,0.000091515896,0.0008562107,0.00015075532,0.00048032837,0.0016089587,0.000425798,0.00023695375],"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.000006580214,0.00002393435,0.000006832971,0.000010515382,0.000006775945,0.00004068987,0.0004424647,0.35670257,0.00007989834,0.044220876,0.00068243605,0.5977764],"study_design_scores_gemma":[0.00029661745,0.00040551406,0.000077995704,0.00016955123,0.000005473969,0.0000568171,1.2880965e-7,0.59017706,0.00066148594,0.39235535,0.015087227,0.0007067776],"about_ca_topic_score_codex":0.000013592986,"about_ca_topic_score_gemma":0.00013560374,"teacher_disagreement_score":0.5970696,"about_ca_system_score_codex":0.0005070605,"about_ca_system_score_gemma":0.00089768955,"threshold_uncertainty_score":0.99983615},"labels":[],"label_agreement":null},{"id":"W761232304","doi":"10.1007/s00454-016-9795-1","title":"Star Unfolding from a Geodesic Curve","year":2016,"lang":"en","type":"article","venue":"Discrete & 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","keywords":"Geodesic; Polyhedron; Vertex (graph theory); Star (game theory); Mathematics; Geodesic map; Combinatorics; Regular polygon; Conjecture; Surface (topology); Path (computing); Geometry; Mathematical analysis; Computer science","score_opus":0.015167514554242366,"score_gpt":0.24942401827510005,"score_spread":0.23425650372085768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W761232304","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.24213894,0.0002598081,0.7545662,0.0015585553,0.00053136336,0.00013563347,0.00007768372,0.00022246195,0.0005093454],"genre_scores_gemma":[0.8912043,0.000012094766,0.10730868,0.00061726273,0.00031073013,0.000020598512,0.00015495432,0.000018467386,0.000352925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737215,0.00013096069,0.00047488304,0.0007626382,0.00084258517,0.0004167741],"domain_scores_gemma":[0.9978331,0.001032767,0.00019791588,0.00043299282,0.00028966495,0.00021360216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036151352,0.00027594718,0.00025655853,0.00048595495,0.00026306222,0.00024709778,0.0007849409,0.00009030143,0.000261164],"category_scores_gemma":[0.00016726169,0.00021635187,0.00016000132,0.0012482925,0.00007273858,0.0011749959,0.00031432233,0.00012128843,0.00048397022],"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.000086230444,0.00028053691,0.0105802985,0.000032027896,0.0003788491,0.00007938722,0.0007240212,0.11113151,0.009395415,0.57028484,0.0065096314,0.29051727],"study_design_scores_gemma":[0.0027923512,0.00024568755,0.17248638,0.00018782938,0.00004120897,0.00004522361,0.000056265126,0.37998438,0.0038736875,0.42207155,0.01681526,0.0014001857],"about_ca_topic_score_codex":0.0000423062,"about_ca_topic_score_gemma":0.0000049120663,"teacher_disagreement_score":0.6490654,"about_ca_system_score_codex":0.00013146384,"about_ca_system_score_gemma":0.0001927224,"threshold_uncertainty_score":0.8822573},"labels":[],"label_agreement":null},{"id":"W76416230","doi":"10.1007/978-1-4613-0251-3_7","title":"Exact parallel algorithms for the location depth and the maximum feasible subsystem problems","year":2004,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","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":"McGill University","funders":"","keywords":"Hyperplane; Parallelizable manifold; Mathematics; Enumeration; Generalization; Dimension (graph theory); Point location; Algorithm; Point (geometry); Parametric statistics; Set (abstract data type); Space (punctuation); Combinatorics; Mathematical optimization; Computer science; Geometry; Mathematical analysis; Statistics","score_opus":0.03167241883879291,"score_gpt":0.25444933486981247,"score_spread":0.22277691603101957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W76416230","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":[5.2533267e-7,0.006629331,0.9760784,0.0044490215,0.00015061276,0.0036199072,0.000020438007,0.00008760888,0.0089641865],"genre_scores_gemma":[0.07681076,0.037054405,0.558872,0.0050912895,0.0040310356,0.01800731,0.0027340895,0.00035357472,0.29704556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985764,0.00003157941,0.00041849632,0.00054139853,0.00026602315,0.00016610207],"domain_scores_gemma":[0.99818283,0.00040046446,0.00035428535,0.00045190958,0.00052632473,0.00008417525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004831628,0.00026499736,0.00024249108,0.000120797304,0.00078667863,0.000374571,0.0004127358,0.00018054266,0.000020960035],"category_scores_gemma":[0.0000257577,0.000178478,0.00007405181,0.00020904223,0.00012514254,0.00027835008,0.00011191962,0.00016785153,0.000014731167],"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.000005411457,0.000011913459,4.374725e-7,0.0000603206,0.00003747535,6.258842e-8,0.00016540084,0.2621792,0.0000015616947,0.7199528,0.00020828853,0.01737709],"study_design_scores_gemma":[0.0012211928,0.000035928482,0.000012378274,0.00004638617,0.00007920079,0.000020465512,0.000016692698,0.90317833,0.000008254416,0.03359735,0.061549395,0.00023441715],"about_ca_topic_score_codex":0.00001011451,"about_ca_topic_score_gemma":0.00001791028,"teacher_disagreement_score":0.6863555,"about_ca_system_score_codex":0.00006246447,"about_ca_system_score_gemma":0.00021601473,"threshold_uncertainty_score":0.7278122},"labels":[],"label_agreement":null},{"id":"W83950205","doi":"","title":"Local optimization of triangular surface meshes for general quadrics in lp norm.","year":2001,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Polygon mesh; Norm (philosophy); Mathematics; Computer science; Mathematical optimization; Geometry","score_opus":0.019359481079573613,"score_gpt":0.26040539250164413,"score_spread":0.24104591142207052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83950205","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.06477751,0.000079643214,0.93386906,0.00042360355,0.00015019842,0.00017759379,0.000001205609,0.000029382802,0.0004917969],"genre_scores_gemma":[0.45671144,0.000021154587,0.54231924,0.00012243053,0.000037430964,0.0000062043146,0.00001981865,0.0000036798845,0.000758592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992495,0.000035004607,0.00024426152,0.00018807573,0.00015711485,0.0001260461],"domain_scores_gemma":[0.9995313,0.000095909774,0.00006016895,0.00014445504,0.00013458473,0.000033539636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029524203,0.00006965568,0.000114784656,0.00010822453,0.000034337132,0.00003069021,0.00019530523,0.000043991724,0.000024883951],"category_scores_gemma":[0.000036678008,0.00006657878,0.000043617994,0.0006342855,0.000014184534,0.00029141296,0.00003824518,0.00002844613,0.0000022453796],"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.000013289126,0.000049654667,0.00021868492,0.0000053313574,0.0000035038208,9.717028e-7,0.00008484706,0.9544205,0.00036230634,0.03544382,0.00029013853,0.009106941],"study_design_scores_gemma":[0.0005487806,0.000066944645,0.0005778327,0.000003443203,0.0000021323276,0.000003797025,0.000015576663,0.990294,0.0055555804,0.0017378296,0.0011126976,0.00008139299],"about_ca_topic_score_codex":0.000053386248,"about_ca_topic_score_gemma":0.00004070554,"teacher_disagreement_score":0.39193395,"about_ca_system_score_codex":0.000030773648,"about_ca_system_score_gemma":0.00006727773,"threshold_uncertainty_score":0.27150038},"labels":[],"label_agreement":null},{"id":"W89916023","doi":"","title":"A Decomposition for Simple Polygons.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Simple (philosophy); Decomposition; Epistemology; Biology","score_opus":0.012916939508668727,"score_gpt":0.2740918101099415,"score_spread":0.26117487060127276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W89916023","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.21321444,0.0001514607,0.7811908,0.00044975468,0.0021434703,0.00031228815,0.0000029405342,0.00014418048,0.0023906564],"genre_scores_gemma":[0.9638422,0.0000024315227,0.035668086,0.00028961417,0.000008649299,0.000040813324,0.00001790404,0.0000055669543,0.0001247239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992928,0.000049351507,0.0001379748,0.00022102731,0.00013070174,0.0001681409],"domain_scores_gemma":[0.9994255,0.00013955984,0.00004721104,0.000213191,0.0001105969,0.00006394272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023097446,0.000080091035,0.0000830401,0.000080304424,0.00017479919,0.000093460156,0.00020236096,0.00003651474,0.000010490609],"category_scores_gemma":[0.00007541064,0.000086142674,0.000054692715,0.00031831927,0.000009201894,0.0002806242,0.000027738372,0.000040309103,0.000026717176],"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.0000025854945,0.000055919165,0.00008238861,0.0000037996717,0.000006584789,7.2396153e-7,0.000048561476,0.00023222422,0.0010000382,0.9916867,0.0032372081,0.0036432906],"study_design_scores_gemma":[0.0006384802,0.000109413384,0.00055189483,0.000002896134,0.000004202846,0.00001080758,0.000004889727,0.016025046,0.014510633,0.94184047,0.026171306,0.00012993642],"about_ca_topic_score_codex":0.0000024824737,"about_ca_topic_score_gemma":9.940558e-7,"teacher_disagreement_score":0.75062776,"about_ca_system_score_codex":0.000034635723,"about_ca_system_score_gemma":0.00006828928,"threshold_uncertainty_score":0.35127962},"labels":[],"label_agreement":null},{"id":"W90251077","doi":"","title":"A Krasnoselskii Theorem for Permissible Paths Whose Edges Are Parallel to Three Given Vectors in the Plane.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Plane (geometry); Combinatorics; Geometry","score_opus":0.0259025502453598,"score_gpt":0.2625284734240885,"score_spread":0.23662592317872871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W90251077","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.88298273,0.00034453135,0.104611844,0.007414066,0.0020220361,0.0010982197,0.000008850946,0.0001223553,0.0013953707],"genre_scores_gemma":[0.9954645,0.000013620194,0.0034005118,0.0007347759,0.0000490612,0.00014882952,0.000014963931,0.000009582156,0.00016413014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874264,0.000092938135,0.00021249581,0.00036222415,0.00028969924,0.0002999811],"domain_scores_gemma":[0.99890816,0.0004109509,0.00007658682,0.0004137164,0.00010366402,0.00008691109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005466572,0.00015454399,0.0001635532,0.00015227795,0.00020393118,0.00017877317,0.00084506714,0.000060283357,0.0000084779385],"category_scores_gemma":[0.00013352404,0.000120920915,0.00006676483,0.00075875485,0.00001967081,0.0002557473,0.0001090768,0.000112434835,0.000036570047],"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.00005082867,0.00025946443,0.007356754,0.000014780999,0.000016010194,0.000035514186,0.0024802552,0.0036191999,0.00013653138,0.9560633,0.011874775,0.01809259],"study_design_scores_gemma":[0.0013119807,0.00038311968,0.09496596,0.00004860705,0.000008814953,0.0000314819,0.000201408,0.017927168,0.00035501644,0.84977436,0.034645963,0.0003461113],"about_ca_topic_score_codex":0.000019819625,"about_ca_topic_score_gemma":0.00007328578,"teacher_disagreement_score":0.112481795,"about_ca_system_score_codex":0.000046068868,"about_ca_system_score_gemma":0.000072602816,"threshold_uncertainty_score":0.49310118},"labels":[],"label_agreement":null},{"id":"W94935907","doi":"","title":"The spanning ratio of the Delaunay triangulation is greater than pi/2.","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"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; Combinatorics; Euclidean minimum spanning tree; Mathematics; Spanning tree; Position (finance); Discrete mathematics; Kruskal's algorithm","score_opus":0.02840429613742914,"score_gpt":0.2476286008519265,"score_spread":0.21922430471449736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94935907","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.19009225,0.00019588822,0.7615309,0.039509147,0.0013578341,0.00064127694,0.00004969514,0.00007553307,0.0065475204],"genre_scores_gemma":[0.9936664,0.000004252138,0.002400626,0.0028131772,0.00011958523,0.000007746037,0.00002593906,0.000006212057,0.00095607166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982126,0.00012695737,0.0003868525,0.00035620833,0.00059480284,0.00032261945],"domain_scores_gemma":[0.9983522,0.00027138644,0.00021042812,0.00044547138,0.0005260264,0.00019446579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040565315,0.0001811328,0.00015543484,0.00036870432,0.0007201697,0.0003185546,0.0008616376,0.00008178378,0.00005022716],"category_scores_gemma":[0.00013268061,0.0001274968,0.00011971399,0.001324982,0.000081263235,0.00028484836,0.000046811372,0.00018849211,0.000040472747],"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.000018266259,0.00003172806,0.0013767532,0.0000051621246,0.000046213518,0.000004062308,0.00075662066,0.13900836,0.00020830533,0.7544357,0.004353373,0.09975545],"study_design_scores_gemma":[0.0005147282,0.00017205275,0.35751435,0.000055653054,0.000014803809,0.000021666723,0.000045941964,0.5189375,0.0013802794,0.11723175,0.0038053556,0.00030590166],"about_ca_topic_score_codex":0.00049129716,"about_ca_topic_score_gemma":0.0007069857,"teacher_disagreement_score":0.80357414,"about_ca_system_score_codex":0.00014259103,"about_ca_system_score_gemma":0.0010873979,"threshold_uncertainty_score":0.5539036},"labels":[],"label_agreement":null},{"id":"W94982151","doi":"10.1007/978-3-642-35261-4_35","title":"Robust Nonparametric Data Approximation of Point Sets via Data Reduction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba","funders":"","keywords":"Cardinality (data modeling); Subsequence; Combinatorics; Simple (philosophy); Polygonal chain; Sequence (biology); Mathematics; Monotonic function; Algorithm; Nonparametric statistics; Piecewise; Piecewise linear function; Data point; Plane (geometry); Discrete mathematics; Computer science; Geometry; Regular polygon; Bounded function; Mathematical analysis","score_opus":0.07646406454023247,"score_gpt":0.2827545805741936,"score_spread":0.20629051603396115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94982151","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.00007145355,0.001157601,0.9949112,0.00042491942,0.0023814384,0.00043890544,0.00005277954,0.00008492368,0.00047676277],"genre_scores_gemma":[0.12725025,0.00008491877,0.87093526,0.00015374427,0.0007223928,0.0000036548236,0.0007585395,0.000022915601,0.00006833499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568814,0.000062745166,0.00073456496,0.0018118301,0.0012587435,0.00044398755],"domain_scores_gemma":[0.9940127,0.00035467595,0.0006181764,0.0044942847,0.00037587574,0.00014425501],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024487067,0.0003889055,0.00044791744,0.0014805838,0.00018648962,0.00028562834,0.006693687,0.00025631074,0.000023321605],"category_scores_gemma":[0.00022253909,0.0003808548,0.00005367248,0.0017363888,0.0003267111,0.0032060544,0.004866185,0.0005039027,0.00003240455],"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.0000045926026,0.000058727244,0.0000075484727,0.000053156986,0.000013098797,0.0000031966501,0.00017947603,0.1278508,0.00029319277,0.0040764795,0.00010576157,0.867354],"study_design_scores_gemma":[0.00016311044,0.000070520335,0.000109485816,0.000116630414,0.000018914921,0.00012524893,1.4140028e-7,0.96080494,0.0012451095,0.03627683,0.00068390946,0.00038517528],"about_ca_topic_score_codex":0.000027148919,"about_ca_topic_score_gemma":0.000016205122,"teacher_disagreement_score":0.8669688,"about_ca_system_score_codex":0.00017957766,"about_ca_system_score_gemma":0.00051374425,"threshold_uncertainty_score":0.99986434},"labels":[],"label_agreement":null},{"id":"W953581814","doi":"10.1007/978-3-540-87921-3_18","title":"A Mesh-Geometry Based Approach for Mixed-Dimensional Analysis","year":2008,"lang":"en","type":"book-chapter","venue":"","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Polygon mesh; Degrees of freedom (physics and chemistry); Finite element method; Constraint (computer-aided design); Shell (structure); Geometry; Computer science; Mesh generation; Volume (thermodynamics); Finite volume method; Mathematics; Algorithm; Applied mathematics; Structural engineering; Mechanical engineering; Engineering; Mechanics; Physics","score_opus":0.026608362685492687,"score_gpt":0.2351392507813689,"score_spread":0.20853088809587622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W953581814","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.000008405695,0.00033650693,0.87657934,0.00015795042,0.00024524517,0.0003447157,0.00004567273,0.000146613,0.12213557],"genre_scores_gemma":[0.0034304517,0.000016342941,0.6464335,0.00092606,0.0002678827,0.0000525081,0.0014740722,0.000026478421,0.3473727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976663,0.00002171884,0.00044318306,0.0009108458,0.0007005994,0.00025738234],"domain_scores_gemma":[0.99826086,0.0003141086,0.00022436937,0.0006382228,0.00041031057,0.00015215739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030197637,0.0003669524,0.0005257175,0.0014957354,0.00023057485,0.00010311356,0.00060913584,0.00028478142,0.00020606587],"category_scores_gemma":[0.000027245165,0.00034412803,0.0007356653,0.00061546534,0.000047002784,0.0001805387,0.00015203684,0.00017795323,0.000045120516],"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.00002790218,0.00014489896,0.0000062761374,0.000059961054,0.0014250557,0.000012640197,0.000027925125,0.28524143,0.000024788376,0.60332173,0.08405819,0.025649175],"study_design_scores_gemma":[0.00035004242,0.00008031205,0.000036297508,0.0000067451797,0.00026363932,0.000012028118,5.000658e-7,0.8711408,0.0001318635,0.003312985,0.12420004,0.00046476914],"about_ca_topic_score_codex":0.0000039684937,"about_ca_topic_score_gemma":0.0000040246387,"teacher_disagreement_score":0.6000088,"about_ca_system_score_codex":0.00007530814,"about_ca_system_score_gemma":0.00030384577,"threshold_uncertainty_score":0.99990106},"labels":[],"label_agreement":null},{"id":"W957594358","doi":"10.1007/978-1-4419-7572-0_19","title":"Voronoi Diagrams and Their Uses","year":2011,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","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 New Brunswick","funders":"","keywords":"Voronoi diagram; Computer science; Statistical physics; Mathematics; Geometry; Physics","score_opus":0.08066693021765776,"score_gpt":0.37867023155465174,"score_spread":0.298003301336994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W957594358","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004292319,0.00043783773,0.036428295,0.018474257,0.0046364935,0.004495081,0.00012988644,0.00024412677,0.9308617],"genre_scores_gemma":[0.4154067,0.015622347,0.05105689,0.00040651037,0.00058925076,0.0019131745,0.0003469691,0.00010768567,0.5145505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98587704,0.00035669626,0.0015183698,0.0031837677,0.0073141116,0.001750017],"domain_scores_gemma":[0.99394786,0.00027188213,0.00011748605,0.0018303727,0.0033681004,0.00046431253],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts","open_science"],"category_scores_codex":[0.014827216,0.0007286241,0.0005067203,0.0133367,0.0033653614,0.006633124,0.010257944,0.0002160725,0.0009509448],"category_scores_gemma":[0.0008399888,0.0007128491,0.00013530496,0.0052975565,0.007452758,0.012515482,0.009788183,0.0015580407,0.00033624898],"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.00006952584,0.00026181864,0.000110954774,0.00004742708,0.00009121761,0.00014136526,0.0013128353,0.027622566,0.0003152939,0.94820523,0.00075475016,0.02106702],"study_design_scores_gemma":[0.0021076277,0.00066180975,0.011324383,0.0013038189,0.000021803007,0.00017362631,0.0040424378,0.24744976,0.0016567587,0.28399438,0.4448171,0.002446507],"about_ca_topic_score_codex":0.00056304893,"about_ca_topic_score_gemma":0.0050798096,"teacher_disagreement_score":0.66421086,"about_ca_system_score_codex":0.002949672,"about_ca_system_score_gemma":0.00090433564,"threshold_uncertainty_score":0.99996233},"labels":[],"label_agreement":null},{"id":"W973397369","doi":"10.1007/978-3-319-19315-1_13","title":"A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Manitoba","funders":"","keywords":"Computer science; Computer graphics (images); Algorithm; Computer vision; Artificial intelligence","score_opus":0.027697843386117978,"score_gpt":0.2585706656298561,"score_spread":0.23087282224373812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W973397369","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.000032814958,0.00026992348,0.99578166,0.00045472407,0.0010923675,0.0006118957,0.00001112031,0.00013937354,0.0016061143],"genre_scores_gemma":[0.010969779,0.000008822117,0.9870081,0.00043418075,0.00074611214,0.000043373537,0.000060582006,0.000029971974,0.0006990981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967084,0.00002741692,0.0004369218,0.00121344,0.0011220488,0.0004917736],"domain_scores_gemma":[0.997787,0.00037828737,0.00030888355,0.00057286205,0.00079131045,0.00016164362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011456686,0.00043972666,0.0004316028,0.00079665356,0.00035606284,0.0006594825,0.0011415046,0.00018823092,0.000008404287],"category_scores_gemma":[0.000081330785,0.0003891669,0.00009986095,0.0006757983,0.00021512914,0.0009888556,0.00041026447,0.00036003656,0.000018101597],"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.000009096871,0.00001632173,0.0000069098287,0.000025541294,0.000016537198,0.000015050675,0.00038683004,0.1382783,0.00004860715,0.036750197,0.00012605623,0.82432055],"study_design_scores_gemma":[0.0003775805,0.00028095426,0.000017354932,0.00017534537,0.0000101431815,0.000105595376,3.9137527e-7,0.90159297,0.00049241714,0.08903812,0.0074079833,0.0005011387],"about_ca_topic_score_codex":0.0000028495215,"about_ca_topic_score_gemma":0.000026685098,"teacher_disagreement_score":0.8238194,"about_ca_system_score_codex":0.0003073035,"about_ca_system_score_gemma":0.0009642912,"threshold_uncertainty_score":0.999856},"labels":[],"label_agreement":null}]}